bimap.hpp File Reference

#include "paal/data_structures/bimap_traits.hpp"
#include "paal/utils/irange.hpp"
#include <boost/multi_index_container.hpp>
#include <boost/multi_index/random_access_index.hpp>
#include <boost/multi_index/hashed_index.hpp>
#include <boost/functional/hash.hpp>
#include <unordered_map>

Go to the source code of this file.

Classes
class	paal::data_structures::bimap_mic< T, Idx >
	the same as Bimap, but implemented using boost::multi_index_container. Unfortunately slower More...
class	paal::data_structures::bimap< T, Idx >
	implements both sides mapping from the collection to (0,size(collection)) interval. More...
class	paal::data_structures::eraseable_bimap< T, Idx >
	this maps support erasing elements, Alert inefficient!! More...
class	paal::data_structures::bimap_of_consecutive< T, Idx >
	in this bimap we know that elements forms permutation this allows optimization More...
struct	paal::data_structures::bimap_traits< bimap< ValT, IdxT > >
	traits specialization for Bimap More...
struct	paal::data_structures::bimap_traits< eraseable_bimap< ValT, IdxT > >
	traits specialization for eraseable_bimap More...
struct	paal::data_structures::bimap_traits< bimap_of_consecutive< ValT, IdxT > >
	traits specialization for bimap_of_consecutive More...
struct	paal::data_structures::bimap_traits< bimap_mic< ValT, IdxT > >
	traits specialization for bimap_mic More...

Namespaces
	paal
	global namespace of project.
	paal::data_structures
	Data Structure namespace.

Functions
template<typename T , typename Idx = int>
void	paal::data_structures::rank (std::vector< T > const &m_id_to_t, std::vector< Idx > &m_t_to_id, int INVALID_IDX=0)
	computes rank i.e. index of element in range More...

Detailed Description

Author

Piotr Wygocki, Piotr Smulewicz

Version

1.1

Date

2013-09-12

Definition in file bimap.hpp.