• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 556
  • Last Modified:

stl,map-find,going slow.

i am using stl hash_map  to store 2 strings,first the map is empty,then i need to chek if the first string is on the map,if i find i need to take the second one and process,else i need to do some processing and find the second string and insert into map,
my problem is the find going slow when data is increzed ,it is realy going so so slow,
any other way to do the same thinks?any other methods to improve the speed,
any other altarnative to maps?to increze speed?i just want to do the same thinks
thanks







 
0
hirosh
Asked:
hirosh
1 Solution
 
mtmikeCommented:
Hash maps are usually the fastest way to do associative lookups unless you're using an unsuitable hash function. Try using a normal map instead of a hash_map and see if performance improves. If it does, the hash function is likely to be the problem.
0

Featured Post

Restore individual SQL databases with ease

Veeam Explorer for Microsoft SQL Server delivers an easy-to-use, wizard-driven interface for restoring your databases from a backup. No expert SQL background required. Web interface provides a complete view of all available SQL databases to simplify the recovery of lost database

Tackle projects and never again get stuck behind a technical roadblock.
Join Now