The dictionary class maintains a fast-access hash table of entities indexed
by a character string. It is typically used to map strings to pointers;
however, overloading the createData and deleteData members allows any type
of data to be indexed by strings.
length -> size
first |
[R] |
Position of first filled slot, or >= total [Integer]
|
last |
[R] |
Position of last filled slot, or -1 [Integer]
|
length |
[R] |
Total number of entries in the table [Integer]
|
Construct an empty dictionary.
Return key at position pos.
Return mark flag of entry at position pos.
Return position of next filled slot after pos in the hash table,
or a value greater than or equal to total if no filled slot was found.
Return position of previous filled slot before pos in the hash
table, or a -1 if no filled slot was found.
Iterate over the keys in this dictionary.
Returns a new array populated with the keys from this dictionary.
Returns true if the given key is present.
Returns true if this dictionary contains no key-value pairs.