summaryrefslogtreecommitdiffstats
path: root/doc/man/man3/tqdict.3qt
diff options
context:
space:
mode:
Diffstat (limited to 'doc/man/man3/tqdict.3qt')
-rw-r--r--doc/man/man3/tqdict.3qt24
1 files changed, 12 insertions, 12 deletions
diff --git a/doc/man/man3/tqdict.3qt b/doc/man/man3/tqdict.3qt
index 5bd827e94..987e871d2 100644
--- a/doc/man/man3/tqdict.3qt
+++ b/doc/man/man3/tqdict.3qt
@@ -16,7 +16,7 @@ Inherits TQPtrCollection.
.SS "Public Members"
.in +1c
.ti -1c
-.BI "\fBTQDict\fR ( int size = 17, bool caseSensitive = TRUE )"
+.BI "\fBTQDict\fR ( int size = 17, bool caseSensitive = true )"
.br
.ti -1c
.BI "\fBTQDict\fR ( const TQDict<type> & dict )"
@@ -95,9 +95,9 @@ If you want to use non-Unicode, plain 8-bit \fCchar*\fR keys, use the TQAsciiDic
.PP
The size() of the dictionary is very important. In order to get good performance, you should use a suitably large prime number. Suitable means equal to or larger than the maximum expected number of dictionary items. Size is set in the constructor but may be changed with resize().
.PP
-Items are inserted with insert(); 0 pointers cannot be inserted. Items are removed with remove(). All the items in a dictionary can be removed with clear(). The number of items in the dictionary is returned by count(). If the dictionary contains no items isEmpty() returns TRUE. You can change an item's value with replace(). Items are looked up with operator[](), or with find() which return a pointer to the value or 0 if the given key does not exist. You can take an item out of the dictionary with take().
+Items are inserted with insert(); 0 pointers cannot be inserted. Items are removed with remove(). All the items in a dictionary can be removed with clear(). The number of items in the dictionary is returned by count(). If the dictionary contains no items isEmpty() returns true. You can change an item's value with replace(). Items are looked up with operator[](), or with find() which return a pointer to the value or 0 if the given key does not exist. You can take an item out of the dictionary with take().
.PP
-Calling setAutoDelete(TRUE) for a dictionary tells it to delete items that are removed. The default behaviour is not to delete items when they are removed.
+Calling setAutoDelete(true) for a dictionary tells it to delete items that are removed. The default behaviour is not to delete items when they are removed.
.PP
When an item is inserted, the key is converted (hashed) to an integer index into an internal hash array. This makes lookup very fast.
.PP
@@ -159,7 +159,7 @@ Example #2:
.br
styleList.sort();
.br
- TQDict<int> letterDict( 17, FALSE );
+ TQDict<int> letterDict( 17, false );
.br
for ( TQStringList::Iterator it = styleList.begin(); it != styleList.end(); ++it ) {
.br
@@ -202,22 +202,22 @@ We first obtain the list of available styles, then sort them so that the menu it
.PP
See also TQDictIterator, TQAsciiDict, TQIntDict, TQPtrDict, Collection Classes, and Non-GUI Classes.
.SH MEMBER FUNCTION DOCUMENTATION
-.SH "TQDict::TQDict ( int size = 17, bool caseSensitive = TRUE )"
+.SH "TQDict::TQDict ( int size = 17, bool caseSensitive = true )"
Constructs a dictionary optimized for less than \fIsize\fR entries.
.PP
We recommend setting \fIsize\fR to a suitably large prime number (e.g. a prime that's slightly larger than the expected number of entries). This makes the hash distribution better which will lead to faster lookup.
.PP
-If \fIcaseSensitive\fR is TRUE (the default), keys which differ only by case are considered different.
+If \fIcaseSensitive\fR is true (the default), keys which differ only by case are considered different.
.SH "TQDict::TQDict ( const TQDict<type> & dict )"
Constructs a copy of \fIdict\fR.
.PP
Each item in \fIdict\fR is inserted into this dictionary. Only the pointers are copied (shallow copy).
.SH "TQDict::~TQDict ()"
-Removes all items from the dictionary and destroys it. If setAutoDelete() is TRUE, each value is deleted. All iterators that access this dictionary will be reset.
+Removes all items from the dictionary and destroys it. If setAutoDelete() is true, each value is deleted. All iterators that access this dictionary will be reset.
.PP
See also setAutoDelete().
.SH "bool TQPtrCollection::autoDelete () const"
-Returns the setting of the auto-delete option. The default is FALSE.
+Returns the setting of the auto-delete option. The default is false.
.PP
See also setAutoDelete().
.SH "void TQDict::clear ()\fC [virtual]\fR"
@@ -255,7 +255,7 @@ See also replace().
.PP
Example: themes/themes.cpp.
.SH "bool TQDict::isEmpty () const"
-Returns TRUE if the dictionary is empty, i.e. count() == 0; otherwise returns FALSE.
+Returns true if the dictionary is empty, i.e. count() == 0; otherwise returns false.
.PP
See also count().
.SH "TQDict<type> & TQDict::operator= ( const TQDict<type> & dict )"
@@ -277,7 +277,7 @@ The default implementation sets \fIitem\fR to 0.
.PP
See also write().
.SH "bool TQDict::remove ( const TQString & key )"
-Removes the item with \fIkey\fR from the dictionary. Returns TRUE if successful, i.e. if the item is in the dictionary; otherwise returns FALSE.
+Removes the item with \fIkey\fR from the dictionary. Returns true if successful, i.e. if the item is in the dictionary; otherwise returns false.
.PP
If there are two or more items with equal keys, then the last item that was inserted will be removed.
.PP
@@ -315,11 +315,11 @@ See also insert().
.SH "void TQDict::resize ( uint newsize )"
Changes the size of the hash table to \fInewsize\fR. The contents of the dictionary are preserved, but all iterators on the dictionary become invalid.
.SH "void TQPtrCollection::setAutoDelete ( bool enable )"
-Sets the collection to auto-delete its contents if \fIenable\fR is TRUE and to never delete them if \fIenable\fR is FALSE.
+Sets the collection to auto-delete its contents if \fIenable\fR is true and to never delete them if \fIenable\fR is false.
.PP
If auto-deleting is turned on, all the items in a collection are deleted when the collection itself is deleted. This is convenient if the collection has the only pointer to the items.
.PP
-The default setting is FALSE, for safety. If you turn it on, be careful about copying the collection - you might find yourself with two collections deleting the same items.
+The default setting is false, for safety. If you turn it on, be careful about copying the collection - you might find yourself with two collections deleting the same items.
.PP
Note that the auto-delete setting may also affect other functions in subclasses. For example, a subclass that has a remove() function will remove the item from its data structure, and if auto-delete is enabled, will also delete the item.
.PP