Quote Originally Posted by ct View Post
I am confused though if I should go through the trouble of filtering out the hash multimap.
Should I use the multimap that is already there in the STL or go for hash_map.

The array size will be around 100,000 and i might need to find about 10 items in that array...would the lookups be huge for a map ?
I don't know how well the STL multi_map performs... The thing is that a map orders its elements so it is way slower when inserting items, especially with as much items as you plan to add. As for the lookup, hash-based structures are said to be faster but a map-based, being sorted, uses binary search which can actually turn out to be faster if the number of lookups is relatively small...