#include <eckit/container/DenseMap.h>
template<typename K, typename V>
DenseMap class
Public types
- using key_type = K
- key type
- using value_type = V
- value type
-
using item_type = std::
pair<K, V> - (key, value) item type
- using iterator = store_t::iterator
- using const_iterator = store_t::const_iterator
Constructors, destructors, conversion operators
Public functions
- void insert(const K& k, const V& v)
- void replace(const K& k, const V& v)
- @TODO shoudl we implement this?
- void clear()
- auto sorted() const -> bool
- auto size() const -> size_t
- auto empty() const -> bool
- void sort()
- auto begin() -> iterator
- auto begin() const -> const_iterator
- auto cbegin() const -> const_iterator
- auto end() -> iterator
- auto end() const -> const_iterator
- auto cend() const -> const_iterator
- auto contains(const K& k) const -> bool
-
auto get(const K& k) const -> const value_
type& -
auto get(const K& k) -> value_
type& -
auto at(const size_t i) const -> const value_
type& -
auto at(const size_t i) -> value_
type& -
auto operator[](const K& k) const -> const value_
type& -
auto operator[](const K& k) -> value_
type& -
auto operator[](const size_t& i) const -> const value_
type& -
auto operator[](const size_t& i) -> value_
type& - auto find(const K& k) -> iterator
- auto find(const K& k) const -> const_iterator
-
void print(std::
ostream& s) const
Friends
-
auto operator<<(std::
ostream& s, const DenseMap& m) -> std:: ostream&