ScummVM API documentation
Std::map< Key, Val, CompFunc > Class Template Reference

Public Types

using iterator = typename Common::Array< KeyValue >::iterator
 
using const_iterator = typename Common::Array< KeyValue >::const_iterator
 

Public Member Functions

void clear ()
 
iterator begin ()
 
iterator end ()
 
const_iterator begin () const
 
const_iterator end () const
 
const_iterator lower_bound (const Key &theKey) const
 
iterator lower_bound (const Key &theKey)
 
iterator find (const Key &theKey)
 
const_iterator find (const Key &theKey) const
 
Val & operator[] (const Key &theKey)
 
iterator erase (iterator it)
 
iterator erase (const Key &theKey)
 
size_t size () const
 
size_t count (const Key &theKey)
 

Member Function Documentation

◆ clear()

template<class Key, class Val, class CompFunc = Common::Less<Key>>
void Std::map< Key, Val, CompFunc >::clear ( )
inline

Clears the map

◆ begin() [1/2]

template<class Key, class Val, class CompFunc = Common::Less<Key>>
iterator Std::map< Key, Val, CompFunc >::begin ( )
inline

Gets the iterator start

◆ end() [1/2]

template<class Key, class Val, class CompFunc = Common::Less<Key>>
iterator Std::map< Key, Val, CompFunc >::end ( )
inline

Get the iterator end

◆ begin() [2/2]

template<class Key, class Val, class CompFunc = Common::Less<Key>>
const_iterator Std::map< Key, Val, CompFunc >::begin ( ) const
inline

Get the const iterator start

◆ end() [2/2]

template<class Key, class Val, class CompFunc = Common::Less<Key>>
const_iterator Std::map< Key, Val, CompFunc >::end ( ) const
inline

Get the const iterator end

◆ lower_bound()

template<class Key, class Val, class CompFunc = Common::Less<Key>>
const_iterator Std::map< Key, Val, CompFunc >::lower_bound ( const Key &  theKey) const
inline

Returns an iterator for the first element of the map that is not less than the given key

◆ find()

template<class Key, class Val, class CompFunc = Common::Less<Key>>
iterator Std::map< Key, Val, CompFunc >::find ( const Key &  theKey)
inline

Find the entry with the given key

◆ operator[]()

template<class Key, class Val, class CompFunc = Common::Less<Key>>
Val& Std::map< Key, Val, CompFunc >::operator[] ( const Key &  theKey)
inline

Square brackets operator accesses items by key, creating if necessary

◆ erase()

template<class Key, class Val, class CompFunc = Common::Less<Key>>
iterator Std::map< Key, Val, CompFunc >::erase ( iterator  it)
inline

Erases an entry in the map

◆ size()

template<class Key, class Val, class CompFunc = Common::Less<Key>>
size_t Std::map< Key, Val, CompFunc >::size ( ) const
inline

Returns the size of the map

◆ count()

template<class Key, class Val, class CompFunc = Common::Less<Key>>
size_t Std::map< Key, Val, CompFunc >::count ( const Key &  theKey)
inline

Returns the number of elements with a matching key


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