![]() |
Feathercoin
0.5.0
P2P Digital Currency
|
STL-like set container that only keeps the most recent N elements. More...
#include <mruset.h>
Public Types | |
typedef T | key_type |
typedef T | value_type |
typedef std::set< T >::iterator | iterator |
typedef std::set< T > ::const_iterator | const_iterator |
typedef std::set< T >::size_type | size_type |
Public Member Functions | |
mruset (size_type nMaxSizeIn=0) | |
iterator | begin () const |
iterator | end () const |
size_type | size () const |
bool | empty () const |
iterator | find (const key_type &k) const |
size_type | count (const key_type &k) const |
bool friend | operator== (const mruset< T > &a, const mruset< T > &b) |
bool friend | operator== (const mruset< T > &a, const std::set< T > &b) |
bool friend | operator< (const mruset< T > &a, const mruset< T > &b) |
std::pair< iterator, bool > | insert (const key_type &x) |
size_type | max_size () const |
size_type | max_size (size_type s) |
Protected Attributes | |
std::set< T > | set |
std::deque< T > | queue |
size_type | nMaxSize |
STL-like set container that only keeps the most recent N elements.
typedef std::set<T>::const_iterator mruset< T >::const_iterator |
typedef T mruset< T >::value_type |
|
inline |
|
protected |