Detailed Description
template<class KEY, class VALUE, class _LessPred = std::less<KEY>, class _Alloc = mrpt::aligned_allocator_cpp11<std::pair<const KEY, VALUE>>>
struct mrpt::containers::map_traits_map_as_vector::map< KEY, VALUE, _LessPred, _Alloc >
Definition at line 42 of file traits_map.h.
#include <mrpt/containers/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. More... | |
| size_type | max_size () const |
| Maximum size due to system limits. More... | |
| const vec_t & | getVector () const |
| Return a read-only reference to the internal vector. More... | |
| void | clear () |
| Clear the contents of this container. More... | |
| void | swap (map_as_vector< KEY, VALUE > &o) |
| Efficient swap with another object. More... | |
| 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. More... | |
| 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) More... | |
| void | insert (const value_type &keyvalpair) |
| Insert pair<key,val>, as in std::map. More... | |
| 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) More... | |
| 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) More... | |
Iterators stuff and other types | |
| using | key_type = KEY |
| using | value_type = std::pair< KEY, VALUE > |
| using | vec_t = typename mrpt::aligned_std_vector< std::pair< KEY, VALUE >> |
| using | size_type = typename vec_t::size_type |
| using | iterator = typename vec_t::iterator |
| using | const_iterator = typename vec_t::const_iterator |
| using | reverse_iterator = std::reverse_iterator< iterator > |
| using | const_reverse_iterator = std::reverse_iterator< const_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
◆ const_iterator
|
inherited |
Definition at line 67 of file map_as_vector.h.
◆ const_reverse_iterator
|
inherited |
Definition at line 69 of file map_as_vector.h.
◆ iterator
|
inherited |
Definition at line 66 of file map_as_vector.h.
◆ key_type
|
inherited |
Definition at line 62 of file map_as_vector.h.
◆ reverse_iterator
|
inherited |
Definition at line 68 of file map_as_vector.h.
◆ size_type
|
inherited |
Definition at line 65 of file map_as_vector.h.
◆ value_type
|
inherited |
Definition at line 63 of file map_as_vector.h.
◆ vec_t
|
inherited |
Definition at line 64 of file map_as_vector.h.
Member Function Documentation
◆ begin() [1/2]
|
inlineinherited |
Definition at line 71 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ begin() [2/2]
|
inlineinherited |
Definition at line 73 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ clear()
|
inlineinherited |
Clear the contents of this container.
Definition at line 112 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ count()
|
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 102 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ empty()
|
inlineinherited |
Definition at line 98 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ end() [1/2]
|
inlineinherited |
Definition at line 72 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ end() [2/2]
|
inlineinherited |
Definition at line 74 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ find() [1/2]
|
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 140 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ find() [2/2]
|
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 150 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ getVector()
|
inlineinherited |
Return a read-only reference to the internal vector.
Definition at line 110 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ insert() [1/2]
|
inlineinherited |
Insert pair<key,val>, as in std::map (guess_point is actually ignored in this class)
Definition at line 126 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::operator[]().
◆ insert() [2/2]
|
inlineinherited |
Insert pair<key,val>, as in std::map.
Definition at line 132 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::operator[]().
◆ max_size()
|
inlineinherited |
Maximum size due to system limits.
Definition at line 108 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ operator[]()
|
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 117 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ rbegin() [1/2]
|
inlineinherited |
Definition at line 75 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::end().
◆ rbegin() [2/2]
|
inlineinherited |
Definition at line 76 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::end().
◆ rend() [1/2]
|
inlineinherited |
Definition at line 80 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::begin().
◆ rend() [2/2]
|
inlineinherited |
Definition at line 81 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::begin().
◆ size()
|
inlineinherited |
Definition at line 97 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.
◆ swap()
|
inlineinherited |
Efficient swap with another object.
Definition at line 114 of file map_as_vector.h.
References mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >::m_vec.