Dash Core Source Documentation (0.16.0.1)
Find detailed information regarding the Dash Core source code.
Map like container that keeps the N most recently added items.
More...
#include <cachemultimap.h>
template<typename K, typename V, typename Size = uint32_t>
class CacheMultiMap< K, V, Size >
Map like container that keeps the N most recently added items.
Definition at line 21 of file cachemultimap.h.
◆ it_map_cit
template<typename K, typename V, typename Size = uint32_t>
◆ it_map_it
template<typename K, typename V, typename Size = uint32_t>
◆ it_map_t
template<typename K, typename V, typename Size = uint32_t>
◆ item_t
template<typename K, typename V, typename Size = uint32_t>
◆ list_cit
template<typename K, typename V, typename Size = uint32_t>
◆ list_it
template<typename K, typename V, typename Size = uint32_t>
◆ list_t
template<typename K, typename V, typename Size = uint32_t>
◆ map_cit
template<typename K, typename V, typename Size = uint32_t>
◆ map_it
template<typename K, typename V, typename Size = uint32_t>
◆ map_t
template<typename K, typename V, typename Size = uint32_t>
◆ size_type
template<typename K, typename V, typename Size = uint32_t>
◆ CacheMultiMap() [1/2]
template<typename K, typename V, typename Size = uint32_t>
◆ CacheMultiMap() [2/2]
template<typename K, typename V, typename Size = uint32_t>
◆ Clear()
template<typename K, typename V, typename Size = uint32_t>
◆ Erase() [1/2]
template<typename K, typename V, typename Size = uint32_t>
◆ Erase() [2/2]
template<typename K, typename V, typename Size = uint32_t>
void CacheMultiMap< K, V, Size >::Erase |
( |
const K & |
key, |
|
|
const V & |
value |
|
) |
| |
|
inline |
◆ Get()
template<typename K, typename V, typename Size = uint32_t>
bool CacheMultiMap< K, V, Size >::Get |
( |
const K & |
key, |
|
|
V & |
value |
|
) |
| const |
|
inline |
◆ GetAll()
template<typename K, typename V, typename Size = uint32_t>
bool CacheMultiMap< K, V, Size >::GetAll |
( |
const K & |
key, |
|
|
std::vector< V > & |
vecValues |
|
) |
| |
|
inline |
◆ GetItemList()
template<typename K, typename V, typename Size = uint32_t>
◆ GetKeys()
template<typename K, typename V, typename Size = uint32_t>
void CacheMultiMap< K, V, Size >::GetKeys |
( |
std::vector< K > & |
vecKeys | ) |
|
|
inline |
◆ GetMaxSize()
template<typename K, typename V, typename Size = uint32_t>
◆ GetSize()
template<typename K, typename V, typename Size = uint32_t>
◆ HasKey()
template<typename K, typename V, typename Size = uint32_t>
◆ Insert()
template<typename K, typename V, typename Size = uint32_t>
bool CacheMultiMap< K, V, Size >::Insert |
( |
const K & |
key, |
|
|
const V & |
value |
|
) |
| |
|
inline |
◆ operator=()
template<typename K, typename V, typename Size = uint32_t>
◆ PruneLast()
template<typename K, typename V, typename Size = uint32_t>
◆ RebuildIndex()
template<typename K, typename V, typename Size = uint32_t>
◆ SerializationOp()
template<typename K, typename V, typename Size = uint32_t>
template<typename Stream , typename Operation >
void CacheMultiMap< K, V, Size >::SerializationOp |
( |
Stream & |
s, |
|
|
Operation |
ser_action |
|
) |
| |
|
inline |
◆ SetMaxSize()
template<typename K, typename V, typename Size = uint32_t>
◆ ADD_SERIALIZE_METHODS
template<typename K, typename V, typename Size = uint32_t>
◆ listItems
template<typename K, typename V, typename Size = uint32_t>
Definition at line 49 of file cachemultimap.h.
Referenced by CacheMultiMap< uint256, vote_time_pair_t >::Clear(), CacheMultiMap< uint256, vote_time_pair_t >::Erase(), CacheMultiMap< uint256, vote_time_pair_t >::GetItemList(), CacheMultiMap< uint256, vote_time_pair_t >::GetSize(), CacheMultiMap< uint256, vote_time_pair_t >::Insert(), CacheMultiMap< uint256, vote_time_pair_t >::operator=(), CacheMultiMap< uint256, vote_time_pair_t >::PruneLast(), CacheMultiMap< uint256, vote_time_pair_t >::RebuildIndex(), and CacheMultiMap< uint256, vote_time_pair_t >::SerializationOp().
◆ mapIndex
template<typename K, typename V, typename Size = uint32_t>
Definition at line 51 of file cachemultimap.h.
Referenced by CacheMultiMap< uint256, vote_time_pair_t >::Clear(), CacheMultiMap< uint256, vote_time_pair_t >::Erase(), CacheMultiMap< uint256, vote_time_pair_t >::Get(), CacheMultiMap< uint256, vote_time_pair_t >::GetAll(), CacheMultiMap< uint256, vote_time_pair_t >::GetKeys(), CacheMultiMap< uint256, vote_time_pair_t >::HasKey(), CacheMultiMap< uint256, vote_time_pair_t >::Insert(), CacheMultiMap< uint256, vote_time_pair_t >::PruneLast(), and CacheMultiMap< uint256, vote_time_pair_t >::RebuildIndex().
◆ nMaxSize
template<typename K, typename V, typename Size = uint32_t>
The documentation for this class was generated from the following file: