mrpt::utils::map_traits_map_as_vector::map< KEY, VALUE, _LessPred, _Alloc > Struct Template Reference

Detailed Description

template<class KEY, class VALUE, class _LessPred = std::less<KEY>, class _Alloc = Eigen::aligned_allocator<std::pair<const KEY, VALUE> >>
struct mrpt::utils::map_traits_map_as_vector::map< KEY, VALUE, _LessPred, _Alloc >

Definition at line 54 of file traits_map.h.

#include <mrpt/utils/traits_map.h>

Inheritance diagram for mrpt::utils::map_traits_map_as_vector::map< KEY, VALUE, _LessPred, _Alloc >:

Public Member Functions
Constructors, read/write access and other operations
size_t	size () const
bool	empty () const
size_type	count (const key_type i) const
	Count how many entries have a given key value - unlike std::map<K,V>, recall that this class will say an element i<N-1 exists just due to an insertion of element at N.
size_type	max_size () const
	Maximum size due to system limits.
const vec_t &	getVector () const
	Return a read-only reference to the internal vector.
void	clear ()
	Clear the contents of this container.
void	swap (map_as_vector< KEY, VALUE > &o)
	Efficient swap with another object.
VALUE &	operator[] (const size_t i)
	Write/read via [i] operator, that creates all elements up to (and including) the i'th if they didn't exist already.
void	insert (const iterator &guess_point, const value_type &keyvalpair)
	Insert pair<key,val>, as in std::map (guess_point is actually ignored in this class)
void	insert (const value_type &keyvalpair)
	Insert pair<key,val>, as in std::map.
iterator	find (const size_t i)
	Constant-time find, returning an iterator to the <key,val> pair or to end() if not found (that is, if it's above the maximum index in the vector)
const_iterator	find (const size_t i) const
	Constant-time find, returning an iterator to the <key,val> pair or to end() if not found (that is, if it's above the maximum index in the vector)

Iterators stuff and other types
typedef KEY	key_type
typedef std::pair< KEY, VALUE >	value_type
typedef mrpt::aligned_containers < value_type >::vector_t	vec_t
typedef vec_t::size_type	size_type
typedef vec_t::iterator	iterator
typedef vec_t::const_iterator	const_iterator
typedef std::reverse_iterator < iterator >	reverse_iterator
typedef std::reverse_iterator < const_iterator >	const_reverse_iterator
iterator	begin ()
const_iterator	begin () const
iterator	end ()
const_iterator	end () const
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
reverse_iterator	rend ()
const_reverse_iterator	rend () const

Member Typedef Documentation

template<typename KEY, typename VALUE>

typedef vec_t::const_iterator mrpt::utils::map_as_vector< KEY, VALUE >::const_iterator

inherited

Definition at line 69 of file map_as_vector.h.

template<typename KEY, typename VALUE>

typedef std::reverse_iterator<const_iterator> mrpt::utils::map_as_vector< KEY, VALUE >::const_reverse_iterator

inherited

Definition at line 71 of file map_as_vector.h.

template<typename KEY, typename VALUE>

typedef vec_t::iterator mrpt::utils::map_as_vector< KEY, VALUE >::iterator

inherited

Definition at line 68 of file map_as_vector.h.

template<typename KEY, typename VALUE>

typedef KEY mrpt::utils::map_as_vector< KEY, VALUE >::key_type

inherited

Definition at line 64 of file map_as_vector.h.

template<typename KEY, typename VALUE>

typedef std::reverse_iterator<iterator> mrpt::utils::map_as_vector< KEY, VALUE >::reverse_iterator

inherited

Definition at line 70 of file map_as_vector.h.

template<typename KEY, typename VALUE>

typedef vec_t::size_type mrpt::utils::map_as_vector< KEY, VALUE >::size_type

inherited

Definition at line 67 of file map_as_vector.h.

template<typename KEY, typename VALUE>

typedef std::pair<KEY,VALUE> mrpt::utils::map_as_vector< KEY, VALUE >::value_type

inherited

Definition at line 65 of file map_as_vector.h.

template<typename KEY, typename VALUE>

typedef mrpt::aligned_containers<value_type>::vector_t mrpt::utils::map_as_vector< KEY, VALUE >::vec_t

inherited

Definition at line 66 of file map_as_vector.h.

Member Function Documentation

template<typename KEY, typename VALUE>

iterator mrpt::utils::map_as_vector< KEY, VALUE >::begin ( )

inlineinherited

Definition at line 73 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

Referenced by mrpt::utils::map_as_vector< KEY, VALUE >::rend().

template<typename KEY, typename VALUE>

const_iterator mrpt::utils::map_as_vector< KEY, VALUE >::begin ( ) const

inlineinherited

Definition at line 75 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

template<typename KEY, typename VALUE>

void mrpt::utils::map_as_vector< KEY, VALUE >::clear ( void  )

inlineinherited

Clear the contents of this container.

Definition at line 106 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

template<typename KEY, typename VALUE>

size_type mrpt::utils::map_as_vector< KEY, VALUE >::count ( const key_type  i ) const

inlineinherited

Count how many entries have a given key value - unlike std::map<K,V>, recall that this class will say an element i<N-1 exists just due to an insertion of element at N.

Definition at line 97 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

template<typename KEY, typename VALUE>

bool mrpt::utils::map_as_vector< KEY, VALUE >::empty ( ) const

inlineinherited

Definition at line 94 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

template<typename KEY, typename VALUE>

iterator mrpt::utils::map_as_vector< KEY, VALUE >::end ( )

inlineinherited

Definition at line 74 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

Referenced by mrpt::utils::map_as_vector< KEY, VALUE >::rbegin().

template<typename KEY, typename VALUE>

const_iterator mrpt::utils::map_as_vector< KEY, VALUE >::end ( ) const

inlineinherited

Definition at line 76 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

template<typename KEY, typename VALUE>

iterator mrpt::utils::map_as_vector< KEY, VALUE >::find ( const size_t  i )

inlineinherited

Constant-time find, returning an iterator to the <key,val> pair or to end() if not found (that is, if it's above the maximum index in the vector)

Definition at line 124 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

template<typename KEY, typename VALUE>

const_iterator mrpt::utils::map_as_vector< KEY, VALUE >::find ( const size_t  i ) const

inlineinherited

Constant-time find, returning an iterator to the <key,val> pair or to end() if not found (that is, if it's above the maximum index in the vector)

Definition at line 126 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

template<typename KEY, typename VALUE>

const vec_t& mrpt::utils::map_as_vector< KEY, VALUE >::getVector ( ) const

inlineinherited

Return a read-only reference to the internal vector.

Definition at line 103 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

template<typename KEY, typename VALUE>

void mrpt::utils::map_as_vector< KEY, VALUE >::insert ( const iterator &  guess_point, const value_type &  keyvalpair  )

inlineinherited

Insert pair<key,val>, as in std::map (guess_point is actually ignored in this class)

Definition at line 119 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::operator[]().

template<typename KEY, typename VALUE>

void mrpt::utils::map_as_vector< KEY, VALUE >::insert ( const value_type &  keyvalpair )

inlineinherited

Insert pair<key,val>, as in std::map.

Definition at line 121 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::operator[]().

template<typename KEY, typename VALUE>

size_type mrpt::utils::map_as_vector< KEY, VALUE >::max_size ( ) const

inlineinherited

Maximum size due to system limits.

Definition at line 100 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

template<typename KEY, typename VALUE>

VALUE& mrpt::utils::map_as_vector< KEY, VALUE >::operator[] ( const size_t  i )

inlineinherited

Write/read via [i] operator, that creates all elements up to (and including) the i'th if they didn't exist already.

Definition at line 112 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

Referenced by mrpt::utils::map_as_vector< KEY, VALUE >::insert().

template<typename KEY, typename VALUE>

reverse_iterator mrpt::utils::map_as_vector< KEY, VALUE >::rbegin ( )

inlineinherited

Definition at line 77 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::end().

template<typename KEY, typename VALUE>

const_reverse_iterator mrpt::utils::map_as_vector< KEY, VALUE >::rbegin ( ) const

inlineinherited

Definition at line 78 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::end().

template<typename KEY, typename VALUE>

reverse_iterator mrpt::utils::map_as_vector< KEY, VALUE >::rend ( )

inlineinherited

Definition at line 79 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::begin().

template<typename KEY, typename VALUE>

const_reverse_iterator mrpt::utils::map_as_vector< KEY, VALUE >::rend ( ) const

inlineinherited

Definition at line 80 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::begin().

template<typename KEY, typename VALUE>

size_t mrpt::utils::map_as_vector< KEY, VALUE >::size ( ) const

inlineinherited

Definition at line 93 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.

template<typename KEY, typename VALUE>

void mrpt::utils::map_as_vector< KEY, VALUE >::swap ( map_as_vector< KEY, VALUE > &  o )

inlineinherited

Efficient swap with another object.

Definition at line 109 of file map_as_vector.h.

References mrpt::utils::map_as_vector< KEY, VALUE >::m_vec.