hash maps are the best solution for a large number of elements.
i don't know how tMaps handle collisions...
you can also use binary trees to mantain O(log n) for search.
i don't know how tMaps handle collisions...
you can also use binary trees to mantain O(log n) for search.