hash map in c++ stl makes use of rb trees since insertion and deletion take
place in O(logn) feel its effficient....and more over u can just use single
line to use hash map for any data type............

On Tue, Jul 6, 2010 at 3:28 PM, Prashanth <[email protected]> wrote:

> Hi all!
>
> I need some good hash implementations. I am able to find couple of
> them but I don't know their quality/performance. Please let me know
> something which you have used and tested.
>
> Thank you,
>
> Regards,
> Prashanth
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected]<algogeeks%[email protected]>
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>


-- 
yezhu malai vaasa venkataramana Govinda Govinda

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to