Boost::unordered or boost::intrusive::hashtable

[carl]

I am looking for a hash-table implementation and have therefore looked at
boost. But it seems that its possible to choose some different versions. So
far I have found:

http://www.boost.org/doc/libs/1_35_0/doc/html/boost/intrusive/hashtable.html
http://www.boost.org/doc/libs/1_41_0/doc/html/unordered.html
http://www.boost.org/doc/libs/1_41_0/boost/multi_index_container.hpp

Which of the above version are best for supporting integer keys and values
which ar std::vectors and are there any examples showing how to use the
container?