C ++ Boost has a Bimap container, which is a bi-directional map: http://www.boost.org/doc/libs/1_43_0/libs/bimap/doc/html/index.html
Does anyone know the performance of Boost :: bimap? I mean, what is the time complexity of accessing an item on a map? Is it as fast as unordered_map access (which is O (1))?
Thanks!
AFAIK, each individual container in this library has a different complexity compared to the implementation (for example, for stl containers). For more information needed to make a selection, read: http://www.boost.org/doc/libs/1_43_0/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html