Hi All...
I dont know whether this is the right place to post a datastructure problem
or not (if not please some one redirect)

I am using hashmaps in vc++. i have one particular use of the map for which
the performance is very slow.

Say i have 100 items in the map. The required operation is to update all the
keys in the map (KEYS and not the mapped data).
This operation is taking around 35 seconds for 300 such updates with .net
platform (which is actually very slow for my app).

Can somebody point me towards a better data structure or even the way hash
map/tables are implemented in .net.

Thanks in advance,
Ubhay.