#include <boundedhashmap.hpp>
|
typedef std::pair< Key, Value > | entry |
|
typedef std::list< entry > | list |
|
typedef hashmap< Key, typename list::iterator > | map |
|
|
| BoundedHashMap (size_t capacity) |
|
void | set (const Key &key, const Value &value) |
|
Option< Value > | get (const Key &key) const |
|
Value & | at (const Key &key) |
|
const Value & | at (const Key &key) const |
|
bool | contains (const Key &key) const |
|
size_t | erase (const Key &key) |
|
std::list< Key > | keys () const |
|
std::list< Value > | values () const |
|
size_t | size () const |
|
bool | empty () const |
|
void | clear () |
|
list::iterator | begin () |
|
list::iterator | end () |
|
list::const_iterator | begin () const |
|
list::const_iterator | end () const |
|
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
const Value& BoundedHashMap< Key, Value >::at |
( |
const Key & |
key | ) |
const |
|
inline |
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
template<typename Key, typename Value>
void BoundedHashMap< Key, Value >::set |
( |
const Key & |
key, |
|
|
const Value & |
value |
|
) |
| |
|
inline |
template<typename Key, typename Value>
template<typename Key, typename Value>
The documentation for this class was generated from the following file: