On May 29, 2:46 am, Vinodh <[EMAIL PROTECTED]> wrote: > I am reading about hashing techniques. > The map data structure available in C++ STL uses hashing techniques?
It's been more than a few years since I looked at the standard, but I believe the actual algorithm is left unspecified. There are restrictions on the speed of its methods. count(), for example, is expected to run in logarithmic time. As others have pointed out, map is usually implemented with a red-black tree, but I don't recall anything in the standard preventing someone from replacing it with another algorithm as long as they meet the time requirements. Actually I'm not even sure whether red-black trees were used in the original STL or whether their use started with Dinkumware. Easiest way to find out implementation details is to just read the header file on your implementation. --- Geoff --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
