| ClearTrie | Clears all entries from a Map. |
| CreateTrie | Creates a hash map. A hash map is a container that can map strings (called
"keys") to arbitrary values (cells, arrays, or strings). Keys in a hash map
are unique. That is, there is at most one entry in the map for a given key.
Insertion, deletion, and lookup in a hash map are all considered to be fast
operations, amortized to O(1), or constant time.
The word "Trie" in this API is historical. As of SourceMod 1.6, tries have
been internally replaced with hash tables, which have O(1) insertion time
instead of O(n). |
| CreateTrieSnapshot | Creates a snapshot of all keys in the map. If the map is changed after this
call, the changes are not reflected in the snapshot. Keys are not sorted. |
| GetTrieArray | Retrieves an array in a Map. |
| GetTrieSize | Retrieves the number of elements in a map. |
| GetTrieSnapshotKey | Retrieves the key string of a given key in a map snapshot. |
| GetTrieString | Retrieves a string in a Map. |
| GetTrieValue | Retrieves a value in a Map. |
| RemoveFromTrie | Removes a key entry from a Map. |
| SetTrieArray | Sets an array value in a Map, either inserting a new entry or replacing an old one. |
| SetTrieString | Sets a string value in a Map, either inserting a new entry or replacing an old one. |
| SetTrieValue | Sets a value in a hash map, either inserting a new entry or replacing an old one. |
| TrieSnapshotKeyBufferSize | Returns the buffer size required to store a given key. That is, it returns
the length of the key plus one. |
| TrieSnapshotLength | Returns the number of keys in a map snapshot. Note that this may be
different from the size of the map, since the map can change after the
snapshot of its keys was taken. |