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

Discussion in 'C++' started by carl, Nov 29, 2009.

  1. carl

    carl Guest

    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?
    carl, Nov 29, 2009
    #1
    1. Advertising

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. Sabyasachi Basu

    Non-intrusive object serialization

    Sabyasachi Basu, Mar 7, 2004, in forum: C++
    Replies:
    1
    Views:
    613
    Claudio Puviani
    Mar 7, 2004
  2. Marcin Kalicinski

    Intrusive list

    Marcin Kalicinski, May 17, 2004, in forum: C++
    Replies:
    9
    Views:
    3,250
    Peter Koch Larsen
    May 18, 2004
  3. Charles Hartman

    intrusive posts

    Charles Hartman, Mar 24, 2005, in forum: Python
    Replies:
    0
    Views:
    302
    Charles Hartman
    Mar 24, 2005
  4. Pradeep

    Intrusive pointer problem

    Pradeep, Oct 5, 2005, in forum: C++
    Replies:
    6
    Views:
    540
    Maxim Yegorushkin
    Oct 5, 2005
  5. sschnug
    Replies:
    1
    Views:
    1,696
    Michael DOUBEZ
    Feb 3, 2009
Loading...

Share This Page