more serious hash table

first question: does boost or other already have a hash table implementation?

if not, then second question: it should presumably be a class template HashTable<T>, then the constructor will have to feed it a hash function, including mapping T objects into unsigned int, right?

does boost or other already have a hash table implementation?

STL, it's magik. And it comes standard with every[?] implementation of C++.
http://www.sgi.com/tech/stl/hash_map.html
EDIT:
also there's http://www.sgi.com/tech/stl/hash_set.html if you don't need a map.

Originally Posted by bernt

STL, it's magik. And it comes standard with every[?] implementation of C++.
hash_map<Key, Data, HashFcn, EqualKey, Alloc>

Not standard..

Not standard..

It's a shame hashing didn't get in.

so... where does that leave us? i have no desire to re-invent the wheel but would like to have a nice hash_map and hash_set

those linked to look very nicely done

If you're using Visual Studio or g++, hash_set and hash_map are included. If you're using something else that doesn't have hash_set for reasons unknown, you could try downloading the headers you need from here.
The implementation is entirely in headers because of templating, so it compiles in with your program and there's no linking involved. Simple enough.

cool, thanks! as long as there's a good and at least fairly widely accepted implementation out there, the best way to learn is probably just to study that.

If you are using a sufficiently recent compiler, its standard library may come with the TR1 extensions, and thus you would have access to std::tr1::unordered_map and std::tr1::unordered_set.

visual studio 2010?
any way to look at source code?

any way to look at source code?

Open the header file? It's under <Visual studio install dir>\VC\include.

Or I guess right-click the #include directive and select "open document".