meshkit::detail::Map< K, V > Class Template Reference

#include <storage.hpp>

Collaboration diagram for meshkit::detail::Map< K, V >:

Classes
class	Iterator

Public Types
using	ConstIterator = Iterator< true >
using	MutableIterator = Iterator< false >

Public Member Functions
void	clear ()
void	reserve (std::size_t n)
bool	isEmpty () const
std::ptrdiff_t	size () const
bool	contains (const K &k) const
MutableIterator	insert (const K &k, const V &v)
bool	remove (const K &k)
V &	operator[] (const K &k)
V	value (const K &k, const V &fallback=V{}) const
MutableIterator	find (const K &k)
MutableIterator	begin ()
MutableIterator	end ()
ConstIterator	constFind (const K &k) const
ConstIterator	constEnd () const
ConstIterator	cbegin () const
ConstIterator	cend () const
ConstIterator	begin () const
ConstIterator	end () const

Member Typedef Documentation

ConstIterator

template<class K , class V >

using meshkit::detail::Map< K, V >::ConstIterator = Iterator<true>

MutableIterator

template<class K , class V >

using meshkit::detail::Map< K, V >::MutableIterator = Iterator<false>

Member Function Documentation

begin() [1/2]

template<class K , class V >

MutableIterator meshkit::detail::Map< K, V >::begin ( )

inline

begin() [2/2]

template<class K , class V >

ConstIterator meshkit::detail::Map< K, V >::begin ( ) const

inline

Here is the call graph for this function:

cbegin()

template<class K , class V >

ConstIterator meshkit::detail::Map< K, V >::cbegin ( ) const

inline

Here is the caller graph for this function:

cend()

template<class K , class V >

ConstIterator meshkit::detail::Map< K, V >::cend ( ) const

inline

Here is the caller graph for this function:

clear()

template<class K , class V >

void meshkit::detail::Map< K, V >::clear ( )

inline

constEnd()

template<class K , class V >

ConstIterator meshkit::detail::Map< K, V >::constEnd ( ) const

inline

Here is the caller graph for this function:

constFind()

template<class K , class V >

ConstIterator meshkit::detail::Map< K, V >::constFind ( const K &  k ) const

inline

Here is the caller graph for this function:

contains()

template<class K , class V >

bool meshkit::detail::Map< K, V >::contains ( const K &  k ) const

inline

end() [1/2]

template<class K , class V >

MutableIterator meshkit::detail::Map< K, V >::end ( )

inline

Here is the caller graph for this function:

end() [2/2]

template<class K , class V >

ConstIterator meshkit::detail::Map< K, V >::end ( ) const

inline

Here is the call graph for this function:

find()

template<class K , class V >

MutableIterator meshkit::detail::Map< K, V >::find ( const K &  k )

inline

Here is the caller graph for this function:

insert()

template<class K , class V >

MutableIterator meshkit::detail::Map< K, V >::insert ( const K &  k, const V &  v  )

inline

Here is the caller graph for this function:

isEmpty()

template<class K , class V >

bool meshkit::detail::Map< K, V >::isEmpty ( ) const

inline

operator[]()

template<class K , class V >

V & meshkit::detail::Map< K, V >::operator[] ( const K &  k )

inline

remove()

template<class K , class V >

bool meshkit::detail::Map< K, V >::remove ( const K &  k )

inline

reserve()

template<class K , class V >

void meshkit::detail::Map< K, V >::reserve ( std::size_t  n )

inline

Here is the caller graph for this function:

size()

template<class K , class V >

std::ptrdiff_t meshkit::detail::Map< K, V >::size ( ) const

inline

value()

template<class K , class V >

V meshkit::detail::Map< K, V >::value ( const K &  k, const V &  fallback = V{}  ) const

inline

Here is the caller graph for this function:

---

The documentation for this class was generated from the following file:

• /home/runner/work/openswmm.gui/openswmm.gui/libraries/meshkit/include/meshkit/detail/storage.hpp