diff options
Diffstat (limited to 'qtools')
| -rw-r--r-- | qtools/qdict.doc | 2 | ||||
| -rw-r--r-- | qtools/qgdict.cpp | 2 | ||||
| -rw-r--r-- | qtools/qintdict.doc | 2 | ||||
| -rw-r--r-- | qtools/qptrdict.doc | 2 | ||||
| -rw-r--r-- | qtools/qstring.cpp | 2 | ||||
| -rw-r--r-- | qtools/qvaluelist.doc | 2 |
6 files changed, 6 insertions, 6 deletions
diff --git a/qtools/qdict.doc b/qtools/qdict.doc index d2e26c0..a414d3f 100644 --- a/qtools/qdict.doc +++ b/qtools/qdict.doc @@ -171,7 +171,7 @@ Setting \e size to a suitably large \link primes.html prime number\endlink (equal to or greater than the expected number of entries) - makes the hash distribution better and hence the loopup faster. + makes the hash distribution better and hence the lookup faster. Setting \e caseSensitive to TRUE will treat "abc" and "Abc" as different keys. Setting it to FALSE will make the dictionary ignore case. diff --git a/qtools/qgdict.cpp b/qtools/qgdict.cpp index 4fe1a26..c8d8fbd 100644 --- a/qtools/qgdict.cpp +++ b/qtools/qgdict.cpp @@ -1101,7 +1101,7 @@ QDataStream& QGDict::write( QDataStream &s ) const QGDictIterator::QGDictIterator( const QGDict &d ) { dict = (QGDict *)&d; // get reference to dict - toFirst(); // set to first noe + toFirst(); // set to first node if ( !dict->iterators ) { dict->iterators = new QGDItList; // create iterator list CHECK_PTR( dict->iterators ); diff --git a/qtools/qintdict.doc b/qtools/qintdict.doc index e027fb2..90625da 100644 --- a/qtools/qintdict.doc +++ b/qtools/qintdict.doc @@ -166,7 +166,7 @@ Setting \e size to a suitably large \link primes.html prime number\endlink (equal to or greater than the expected number of entries) makes the hash - distribution better and hence the loopup faster. + distribution better and hence the lookup faster. */ /*! diff --git a/qtools/qptrdict.doc b/qtools/qptrdict.doc index bff6a15..633536c 100644 --- a/qtools/qptrdict.doc +++ b/qtools/qptrdict.doc @@ -172,7 +172,7 @@ Setting \e size to a suitably large \link primes.html prime number\endlink (equal to or greater than the expected number of entries) makes the hash - distribution better and hence the loopup faster. + distribution better and hence the lookup faster. */ /*! diff --git a/qtools/qstring.cpp b/qtools/qstring.cpp index 30bb05b..fe478bd 100644 --- a/qtools/qstring.cpp +++ b/qtools/qstring.cpp @@ -10768,7 +10768,7 @@ otherwise. These functions are: isNull() (returns TRUE if the character is U+0000), isPrint() (TRUE if the character is any sort of printable -character, including whitespace), isPunct() (any sort of punctation), +character, including whitespace), isPunct() (any sort of punctuation), isMark() (Unicode Marks), isLetter (letters), isNumber() (any sort of numeric characters), isLetterOrNumber(), and isDigit() (decimal digits). All of these are wrappers around category(), which returns the diff --git a/qtools/qvaluelist.doc b/qtools/qvaluelist.doc index 918d08e..f7a0dde 100644 --- a/qtools/qvaluelist.doc +++ b/qtools/qvaluelist.doc @@ -199,7 +199,7 @@ \fn QValueList::~QValueList() Destroys the list. References to the values in the list and all iterators of this list become invalidated. Since QValueList is highly tuned for performance - you wont see warnings if you use invalid iterators, + you won't see warnings if you use invalid iterators, because it is impossible for an iterator to check whether it is valid or not. */ |