MecaCell::ordered_hash_map< K, V > Struct Template Reference

#include <ordered_hash_map.hpp>

Public Types
using	const_iterator = typename decltype(vec)::const_iterator
using	iterator = typename decltype(vec)::iterator

Public Member Functions
V &	operator[] (const K &k)
bool	count (const K &k)
size_t	size () const
V &	at (const K &k)
void	erase (const K &k)
const_iterator	begin () const
const_iterator	end () const
iterator	begin ()
iterator	end ()

Public Attributes
std::unordered_map< K, size_t >	um
std::vector< std::pair< K, V > >	vec

Detailed Description

template<typename K, typename V>
struct MecaCell::ordered_hash_map< K, V >

Definition at line 6 of file ordered_hash_map.hpp.

Member Typedef Documentation

const_iterator

template<typename K , typename V >

using MecaCell::ordered_hash_map< K, V >::const_iterator = typename decltype(vec)::const_iterator

Definition at line 33 of file ordered_hash_map.hpp.

iterator

template<typename K , typename V >

using MecaCell::ordered_hash_map< K, V >::iterator = typename decltype(vec)::iterator

Definition at line 34 of file ordered_hash_map.hpp.

Member Function Documentation

at()

template<typename K , typename V >

V & MecaCell::ordered_hash_map< K, V >::at ( const K &  k )

inline

Definition at line 21 of file ordered_hash_map.hpp.

begin() [1/2]

template<typename K , typename V >

iterator MecaCell::ordered_hash_map< K, V >::begin ( )

inline

Definition at line 37 of file ordered_hash_map.hpp.

begin() [2/2]

template<typename K , typename V >

const_iterator MecaCell::ordered_hash_map< K, V >::begin ( ) const

inline

Definition at line 35 of file ordered_hash_map.hpp.

count()

template<typename K , typename V >

bool MecaCell::ordered_hash_map< K, V >::count ( const K &  k )

inline

Definition at line 19 of file ordered_hash_map.hpp.

end() [1/2]

template<typename K , typename V >

iterator MecaCell::ordered_hash_map< K, V >::end ( )

inline

Definition at line 38 of file ordered_hash_map.hpp.

end() [2/2]

template<typename K , typename V >

const_iterator MecaCell::ordered_hash_map< K, V >::end ( ) const

inline

Definition at line 36 of file ordered_hash_map.hpp.

erase()

template<typename K , typename V >

void MecaCell::ordered_hash_map< K, V >::erase ( const K &  k )

inline

Definition at line 22 of file ordered_hash_map.hpp.

operator[]()

template<typename K , typename V >

V & MecaCell::ordered_hash_map< K, V >::operator[] ( const K &  k )

inline

Definition at line 11 of file ordered_hash_map.hpp.

size()

template<typename K , typename V >

size_t MecaCell::ordered_hash_map< K, V >::size ( ) const

inline

Definition at line 20 of file ordered_hash_map.hpp.

Member Data Documentation

um

template<typename K , typename V >

std::unordered_map<K, size_t> MecaCell::ordered_hash_map< K, V >::um

Definition at line 8 of file ordered_hash_map.hpp.

vec

template<typename K , typename V >

std::vector<std::pair<K, V> > MecaCell::ordered_hash_map< K, V >::vec

Definition at line 9 of file ordered_hash_map.hpp.

---

The documentation for this struct was generated from the following file:

• external/MecaCell/mecacell/utilities/ordered_hash_map.hpp