9#ifndef mrpt_map_as_vector_H
10#define mrpt_map_as_vector_H
103 return m_vec[i].second;
A STL-like container which looks and behaves (almost exactly) like a std::map<> but is implemented as...
vec_t m_vec
The actual container.
vec_t::size_type size_type
std::reverse_iterator< const_iterator > const_reverse_iterator
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,...
const_reverse_iterator rend() const
vec_t::const_iterator const_iterator
void swap(map_as_vector< KEY, VALUE > &o)
Efficient swap with another object.
const_iterator begin() const
map_as_vector()
< Default constructor - does nothing */
reverse_iterator rbegin()
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)
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 ...
std::pair< KEY, VALUE > value_type
const vec_t & getVector() const
Return a read-only reference to the internal vector.
void clear()
Clear the contents of this container.
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...
size_type max_size() const
Maximum size due to system limits.
const_reverse_iterator rbegin() const
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,...
const_iterator end() const
void insert(const value_type &keyvalpair)
Insert pair<key,val>, as in std::map.
map_as_vector(const map_as_vector< KEY, VALUE > &o)
Copy constructor.
std::reverse_iterator< iterator > reverse_iterator
This is the global namespace for all Mobile Robot Programming Toolkit (MRPT) libraries.
Helper types for STL containers with Eigen memory allocators.