![]() |
RTBKit
0.9
Open-source framework to create real-time ad bidding systems.
|
Public Types | |
|
typedef PendingPersistenceT < Key, Value > | Persistence |
|
typedef boost::function< bool(Key &key, Value &value, Date &timeout)> | AcceptEntry |
| typedef TimeoutMap< Key, Value > | Timeouts |
| typedef Timeouts::const_iterator | const_iterator |
Public Member Functions | |
| void | initFromStore (std::shared_ptr< Persistence > persistence, AcceptEntry acceptEntry, Date timeout) |
| void | initFromStore (std::shared_ptr< Persistence > persistence, Date timeout) |
| size_t | size () const |
| template<typename Callback > | |
| void | expire (const Callback &callback, Date now=Date::now()) |
| void | expire (Date now=Date::now()) |
| bool | count (const Key &key) const |
| Value | get (const Key &key) const |
| Value | pop (const Key &key) |
| template<typename IsPrefix > | |
| Key | completePrefix (const Key &key, IsPrefix isPrefix) |
| bool | erase (const Key &key) |
| void | insert (const Key &key, const Value &value, Date timeout) |
| void | update (const Key &key, const Value &value) |
| void | update (const Key &key, const Value &&value) |
| const_iterator | begin () const |
| const_iterator | end () const |
| const_iterator | lower_bound (const Key &key) const |
| const_iterator | find (const Key &key) const |
Public Attributes | |
| std::shared_ptr< Persistence > | persistence |
| Timeouts | timeouts |
Definition at line 245 of file pending_list.h.
| Key Datacratic::PendingList< Key, Value >::completePrefix | ( | const Key & | key, |
| IsPrefix | isPrefix | ||
| ) | [inline] |
key is a partial key. Returns the first key result that is in the map for which isPrefix(result, key) is true if it exists, or Key() if none exists.
Useful, for example, for isPrefixPair();
Definition at line 355 of file pending_list.h.
1.7.6.1