Creates a hash map. A hash map is a container that can map integers (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). The IntMap must be freed via delete or CloseHandle().
native IntMap IntMap()