The Q3IntDict class is a template class that provides a dictionary based on long keys. 更多...
| 头： | #include <Q3IntDict> |
| 继承： | Q3PtrCollection |
| Q3IntDict (int size = 17) | |
| Q3IntDict (const Q3IntDict<type> & dict ) | |
| ~Q3IntDict () | |
| type * | find (long key ) const |
| void | insert (long key , const type * item ) |
| bool | isEmpty () const |
| bool | remove (long key ) |
| void | replace (long key , const type * item ) |
| void | resize (uint newsize ) |
| uint | size () const |
| void | statistics () const |
| type * | take (long key ) |
| Q3IntDict<type> & | operator= (const Q3IntDict<type> & dict ) |
| type * | operator[] (long key ) const |
| virtual void | clear () |
| virtual uint | count () const |
| virtual QDataStream & | read (QDataStream & s , Q3PtrCollection::Item & item ) |
| virtual QDataStream & | write (QDataStream & s , Q3PtrCollection::Item item ) const |
The Q3IntDict class is a template class that provides a dictionary based on long keys.
Q3IntDict is implemented as a template class. Define a template instance Q3IntDict <X> to create a dictionary that operates on pointers to X (X*).
A dictionary is a collection of key-value pairs. The key is an
long
used for insertion, removal and lookup. The value is a pointer. Dictionaries provide very fast insertion and lookup.
范例：
Q3IntDict<QLineEdit> fields; // long int keys, QLineEdit* values for ( int i = 0; i < 3; i++ ) fields.insert( i, new QLineEdit( this ) ); fields[0]->setText( "Homer" ); fields[1]->setText( "Simpson" ); fields[2]->setText( "45" ); Q3IntDictIterator<QLineEdit> it( fields ); for ( ; it.current(); ++it ) cout << it.currentKey() << ": " << it.current()->text() << endl; for ( int i = 0; i < 3; i++ ) cout << fields[i]->text() << " "; // Prints "Homer Simpson 45" cout << endl; fields.remove( 1 ); // Does not delete the line edit for ( int i = 0; i < 3; i++ ) if ( fields[i] ) cout << fields[i]->text() << " "; // Prints "Homer 45"
见 Q3Dict for full details, including the choice of dictionary size, and how deletions are handled.
另请参阅 Q3IntDictIterator , Q3Dict , Q3AsciiDict ，和 Q3PtrDict .
Constructs a dictionary using an internal hash array of size size .
设置 size to a suitably large prime number (equal to or greater than the expected number of entries) makes the hash distribution better which leads to faster lookup.
构造副本为 dict .
Each item in dict is inserted into this dictionary. Only the pointers are copied (shallow copy).
Removes all items from the dictionary and destroys it.
All iterators that access this dictionary will be reset.
另请参阅 setAutoDelete ().
[虚拟]
void
Q3IntDict::
clear
()
重实现自 Q3PtrCollection::clear ().
Removes all items from the dictionary.
The removed items are deleted if auto-deletion is enabled.
All dictionary iterators that access this dictionary will be reset.
另请参阅 remove (), take ()，和 setAutoDelete ().
[虚拟]
uint
Q3IntDict::
count
() const
重实现自 Q3PtrCollection::count ().
Returns the number of items in the dictionary.
另请参阅 isEmpty ().
Returns the item associated with key , or 0 if the key does not exist in the dictionary.
If there are two or more items with equal keys, then the most recently inserted item will be found.
Equivalent to operator[].
另请参阅 operator[] ().
Insert item item into the dictionary using key key .
Multiple items can have the same key, in which case only the last item will be accessible using operator[] ().
item 不可以为 0。
另请参阅 replace ().
Returns TRUE if the dictionary is empty; otherwise returns FALSE.
另请参阅 count ().
[virtual protected]
QDataStream
& Q3IntDict::
read
(
QDataStream
&
s
,
Q3PtrCollection::Item
&
item
)
Reads a dictionary item from the stream s 并返回流引用。
The default implementation sets item 为 0。
另请参阅 write ().
Removes the item associated with key from the dictionary. Returns TRUE if successful, i.e. if the key is in the dictionary; otherwise returns FALSE.
If there are two or more items with equal keys, then the most recently inserted item will be removed.
The removed item is deleted if auto-deletion is enabled.
All dictionary iterators that refer to the removed item will be set to point to the next item in the dictionary's traversal order.
另请参阅 take (), clear ()，和 setAutoDelete ().
If the dictionary has key key , this key's item is replaced with item . If the dictionary doesn't contain key key , item is inserted into the dictionary using key key .
item 不可以为 0。
Equivalent to:
Q3IntDict<char> dict; // ... if ( dict.find(key) ) dict.remove( key ); dict.insert( key, item );
If there are two or more items with equal keys, then the most recently inserted item will be replaced.
另请参阅 insert ().
Changes the size of the hashtable to newsize . The contents of the dictionary are preserved, but all iterators on the dictionary become invalid.
Returns the size of the internal hash array (as specified in the constructor).
另请参阅 count ().
Debugging-only function that prints out the dictionary distribution using qDebug ().
Takes the item associated with key out of the dictionary without deleting it (even if auto-deletion is enabled).
If there are two or more items with equal keys, then the most recently inserted item will be taken.
Returns a pointer to the item taken out, or 0 if the key does not exist in the dictionary.
All dictionary iterators that refer to the taken item will be set to point to the next item in the dictionary's traversing order.
另请参阅 remove (), clear ()，和 setAutoDelete ().
[virtual protected]
QDataStream
& Q3IntDict::
write
(
QDataStream
&
s
,
Q3PtrCollection::Item
item
) const
Writes a dictionary item 到流 s 并返回流引用。
另请参阅 read ().
赋值 dict to this dictionary and returns a reference to this dictionary.
This dictionary is first cleared and then each item in dict is inserted into this dictionary. Only the pointers are copied (shallow copy), unless newItem () has been reimplemented.
Returns the item associated with key , or 0 if the key does not exist in the dictionary.
If there are two or more items with equal keys, then the most recently inserted item will be found.
Equivalent to the find () 函数。
另请参阅 find ().