does stl provide for a hastable along with its standard hash map ?? whats the difference between the 2 ...read some place that hash map's just the concept bu hash table is its implementation ...could i find the implementation of the hash map somewhere ??? kindly reply ASAP :WAVE:
C++98 STL (i.e., the current C++ standard implemented by ISO compliant compilers) doesn't have any hashed container officially, although many compilers have added vendor specific hashed containers as a non-standard extension. The problem is that these containers aren't standard so each compiler implements them differently (or doesn't implement them at all). This babel is going to be resolved soon because TR1 (a list of library extensions for standard C++) adds unordered containers which are roughly the same thing, only better. There are unordered_map, unordered_multimap, unordered_set and unordered_multiset. There's no hashed list but I believe that the set containers or maps could work for you.