|
WPILibC++
2020.3.2
|
This class implements a map that also provides access to all stored values in a deterministic order. More...
#include <MapVector.h>
Public Member Functions | |
| VectorType | takeVector () |
| Clear the MapVector and return the underlying vector. | |
| size_type | size () const |
| void | reserve (size_type NumEntries) |
Grow the MapVector so that it can contain at least NumEntries items before resizing again. | |
| 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 |
| bool | empty () const |
| std::pair< KeyT, ValueT > & | front () |
| const std::pair< KeyT, ValueT > & | front () const |
| std::pair< KeyT, ValueT > & | back () |
| const std::pair< KeyT, ValueT > & | back () const |
| void | clear () |
| void | swap (MapVector &RHS) |
| ValueT & | operator[] (const KeyT &Key) |
| ValueT | lookup (const KeyT &Key) const |
| std::pair< iterator, bool > | insert (const std::pair< KeyT, ValueT > &KV) |
| std::pair< iterator, bool > | insert (std::pair< KeyT, ValueT > &&KV) |
| size_type | count (const KeyT &Key) const |
| iterator | find (const KeyT &Key) |
| const_iterator | find (const KeyT &Key) const |
| void | pop_back () |
| Remove the last element from the vector. | |
| VectorType::iterator | erase (typename VectorType::iterator Iterator) |
| Remove the element given by Iterator. More... | |
| size_type | erase (const KeyT &Key) |
| Remove all elements with the key value Key. More... | |
| template<class Predicate > | |
| void | remove_if (Predicate Pred) |
| Remove the elements that match the predicate. More... | |
| template<class Function > | |
| void | remove_if (Function Pred) |
This class implements a map that also provides access to all stored values in a deterministic order.
The values are kept in a std::vector and the mapping is done with DenseMap from Keys to indexes in that vector.
|
inline |
Remove all elements with the key value Key.
Returns the number of elements removed.
|
inline |
Remove the element given by Iterator.
Returns an iterator to the element following the one which was removed, which may be end().
| void wpi::MapVector< KeyT, ValueT, MapType, VectorType >::remove_if | ( | Predicate | Pred | ) |
Remove the elements that match the predicate.
Erase all elements that match Pred in a single pass. Takes linear time.