#include <subscription_map.hpp>
|
template<typename K , typename V > |
std::pair< handle, bool > | insert_or_assign (string_view topic_filter, K &&key, V &&value) |
|
template<typename K , typename V > |
std::pair< handle, bool > | insert_or_assign (handle const &h, K &&key, V &&value) |
|
std::size_t | erase (handle const &h, Key const &key) |
|
std::size_t | erase (string_view topic_filter, Key const &key) |
|
template<typename Output > |
void | find (string_view topic, Output &&callback) const |
|
template<typename Output > |
void | modify (string_view topic, Output &&callback) |
|
template<typename Output > |
void | dump (Output &out) |
|
std::size_t | internal_size () const |
|
std::size_t | size () const |
|
optional< handle > | lookup (string_view topic_filter) |
|
std::string | handle_to_topic_filter (handle const &h) const |
|
◆ container_t
template<typename Key , typename Value , class Hash = std::hash<Key>, class Pred = std::equal_to<Key>, class Cont = std::unordered_map<Key, Value, Hash, Pred, std::allocator< std::pair<const Key, Value> > >>
◆ handle
template<typename Key , typename Value , class Hash = std::hash<Key>, class Pred = std::equal_to<Key>, class Cont = std::unordered_map<Key, Value, Hash, Pred, std::allocator< std::pair<const Key, Value> > >>
◆ dump()
template<typename Key , typename Value , class Hash = std::hash<Key>, class Pred = std::equal_to<Key>, class Cont = std::unordered_map<Key, Value, Hash, Pred, std::allocator< std::pair<const Key, Value> > >>
template<typename Output >
◆ erase() [1/2]
template<typename Key , typename Value , class Hash = std::hash<Key>, class Pred = std::equal_to<Key>, class Cont = std::unordered_map<Key, Value, Hash, Pred, std::allocator< std::pair<const Key, Value> > >>
◆ erase() [2/2]
template<typename Key , typename Value , class Hash = std::hash<Key>, class Pred = std::equal_to<Key>, class Cont = std::unordered_map<Key, Value, Hash, Pred, std::allocator< std::pair<const Key, Value> > >>
◆ find()
template<typename Key , typename Value , class Hash = std::hash<Key>, class Pred = std::equal_to<Key>, class Cont = std::unordered_map<Key, Value, Hash, Pred, std::allocator< std::pair<const Key, Value> > >>
template<typename Output >
◆ insert_or_assign() [1/2]
template<typename Key , typename Value , class Hash = std::hash<Key>, class Pred = std::equal_to<Key>, class Cont = std::unordered_map<Key, Value, Hash, Pred, std::allocator< std::pair<const Key, Value> > >>
template<typename K , typename V >
◆ insert_or_assign() [2/2]
template<typename Key , typename Value , class Hash = std::hash<Key>, class Pred = std::equal_to<Key>, class Cont = std::unordered_map<Key, Value, Hash, Pred, std::allocator< std::pair<const Key, Value> > >>
template<typename K , typename V >
◆ modify()
template<typename Key , typename Value , class Hash = std::hash<Key>, class Pred = std::equal_to<Key>, class Cont = std::unordered_map<Key, Value, Hash, Pred, std::allocator< std::pair<const Key, Value> > >>
template<typename Output >
The documentation for this class was generated from the following file: