in this bimap we know that elements forms permutation this allows optimization More...
#include <bimap.hpp>
Public Member Functions | |
template<typename Iter > | |
bimap_of_consecutive (Iter b, Iter e) | |
constructor More... | |
Idx | get_idx (const T &t) const |
gets index of element t More... | |
const T & | get_val (Idx i) const |
gets value for index i More... | |
std::size_t | size () const |
number of elements More... | |
in this bimap we know that elements forms permutation this allows optimization
T | |
Idx |
|
inline |
|
inline |
|
inline |
|
inline |