C++ hash table implementation with collision handling

Question

What is a good C++ library for hash tables / hash maps similar to what java offers. I have worked with Google Sparsehash, but it has no support for collisions.

anon · Accepted Answer · 2010-05-10 11:30:03Z

6

Use std::unordered_map (or unordered_multimap), which despite its name is a hash table - it will be part of the next C++ standard, and is available in most current C++ implementations. Do not use the classes with hash in their names that your implementation may provide - they are not and will not be standard.

answered May 10, 2010 at 11:30

anon

Sign up to request clarification or add additional context in comments.

Comments

Andreas Brinck · Accepted Answer · 2010-05-10 11:29:47Z

2

http://www.sgi.com/tech/stl/hash_multimap.html

or

std::tr1::unordered_multimap

answered May 10, 2010 at 11:29

Andreas Brinck

52.9k15 gold badges87 silver badges114 bronze badges

Comments

user319799 · Accepted Answer · 2010-05-10 14:43:55Z

1

In addition to those mentioned in other answers, you could try MCT's closed_hash_map or linked_hash_map. It is internally similar to Google SparseHash, but doesn't restrict values used and has some other functional advantages.

I'm not sure I understand what you mean by "no support for collisions", though. Both Google SparseHash and similarly implemented MCT of course handle collisions fine, though differently than Java's HashMap.

answered May 10, 2010 at 14:43

user319799

Collectives™ on Stack Overflow

C++ hash table implementation with collision handling

3 Answers 3

Comments

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

3 Answers 3

Comments

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related