Definition at line 34 of file traits_map.h.
#include <mrpt/utils/traits_map.h>
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) | |
Private Attributes | |
vec_t | m_vec |
The actual container. | |
Iterators stuff and other types | |
typedef KEY | key_type |
typedef std::pair< KEY, VALUE > | value_type |
typedef 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 |
|
inherited |
Definition at line 57 of file map_as_vector.h.
|
inherited |
Definition at line 59 of file map_as_vector.h.
|
inherited |
Definition at line 56 of file map_as_vector.h.
|
inherited |
Definition at line 52 of file map_as_vector.h.
|
inherited |
Definition at line 58 of file map_as_vector.h.
|
inherited |
Definition at line 55 of file map_as_vector.h.
|
inherited |
Definition at line 53 of file map_as_vector.h.
|
inherited |
Definition at line 54 of file map_as_vector.h.
|
inlineinherited |
Definition at line 61 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
Referenced by mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::rend().
|
inlineinherited |
Definition at line 63 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
|
inlineinherited |
Clear the contents of this container.
Definition at line 94 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
Referenced by mrpt::math::MatrixBlockSparseCols< Scalar, NROWS, NCOLS, INFO, HAS_REMAP, INDEX_REMAP_MAP_IMPL >::clearAll().
|
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 85 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
|
inlineinherited |
Definition at line 82 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
|
inlineinherited |
Definition at line 62 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
Referenced by mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::rbegin().
|
inlineinherited |
Definition at line 64 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
|
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 112 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
|
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 114 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
|
inlineinherited |
Return a read-only reference to the internal vector.
Definition at line 91 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
|
inlineinherited |
Insert pair<key,val>, as in std::map (guess_point is actually ignored in this class)
Definition at line 107 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::operator[]().
|
inlineinherited |
Insert pair<key,val>, as in std::map.
Definition at line 109 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::operator[]().
|
inlineinherited |
Maximum size due to system limits.
Definition at line 88 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
|
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 100 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
Referenced by mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::insert().
|
inlineinherited |
Definition at line 65 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::end().
|
inlineinherited |
Definition at line 66 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::end().
|
inlineinherited |
Definition at line 67 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::begin().
|
inlineinherited |
Definition at line 68 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::begin().
|
inlineinherited |
Definition at line 81 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
|
inlineinherited |
Efficient swap with another object.
Definition at line 97 of file map_as_vector.h.
References mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
|
privateinherited |
The actual container.
Definition at line 71 of file map_as_vector.h.
Referenced by mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::begin(), mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::clear(), mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::count(), mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::empty(), mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::end(), mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::find(), mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::getVector(), mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::max_size(), mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::operator[](), mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::size(), and mrpt::utils::map_as_vector< KEY, VALUE, VECTOR_T >::swap().
Page generated by Doxygen 1.9.6 for MRPT 1.4.0 SVN: at Thu Mar 23 03:22:58 UTC 2023 |