BitShares-Core  6.1.0
BitShares blockchain implementation and command-line interface software
Public Member Functions | List of all members
graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred > Class Template Reference

#include <node_impl.hxx>

Inheritance diagram for graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >:

Public Member Functions

fc::mutexget_mutex () const
 Iterations require a lock. This exposes the mutex. Use with care (i.e. lock_guard) More...
 
std::unordered_set< Key, Hash, Pred >::const_iterator find (Key key)
 
std::pair< typename std::unordered_set< Key, Hash, Pred >::iterator, bool > emplace (Key key)
 
std::pair< typename std::unordered_set< Key, Hash, Pred >::iterator, bool > insert (const Key &val)
 
size_t size () const
 
bool empty () const noexcept
 
void clear () noexcept
 
std::unordered_set< Key, Hash, Pred >::iterator erase (typename std::unordered_set< Key, Hash, Pred >::const_iterator itr)
 
size_t erase (const Key &key)
 
void swap (typename std::unordered_set< Key, Hash, Pred > &other) noexcept
 
std::unordered_set< Key, Hash, Pred >::iterator begin () noexcept
 
std::unordered_set< Key, Hash, Pred >::const_iterator begin () const noexcept
 
std::unordered_set< Key, Hash, Pred >::local_iterator begin (size_t n)
 
std::unordered_set< Key, Hash, Pred >::const_local_iterator begin (size_t n) const
 
std::unordered_set< Key, Hash, Pred >::iterator end () noexcept
 
std::unordered_set< Key, Hash, Pred >::const_iterator end () const noexcept
 
std::unordered_set< Key, Hash, Pred >::local_iterator end (size_t n)
 
std::unordered_set< Key, Hash, Pred >::const_local_iterator end (size_t n) const
 

Detailed Description

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
class graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >

Definition at line 66 of file node_impl.hxx.

Member Function Documentation

◆ begin() [1/4]

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::unordered_set<Key, Hash, Pred>::iterator graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::begin ( )
inlinenoexcept

Iteration

Definition at line 130 of file node_impl.hxx.

◆ begin() [2/4]

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::unordered_set<Key, Hash, Pred>::const_iterator graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::begin ( ) const
inlinenoexcept

Definition at line 135 of file node_impl.hxx.

◆ begin() [3/4]

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::unordered_set<Key, Hash, Pred>::local_iterator graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::begin ( size_t  n)
inline

Definition at line 140 of file node_impl.hxx.

◆ begin() [4/4]

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::unordered_set<Key, Hash, Pred>::const_local_iterator graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::begin ( size_t  n) const
inline

Definition at line 145 of file node_impl.hxx.

◆ clear()

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
void graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::clear ( )
inlinenoexcept

Removal

Definition at line 103 of file node_impl.hxx.

◆ emplace()

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::pair< typename std::unordered_set<Key, Hash, Pred>::iterator, bool> graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::emplace ( Key  key)
inline

Insertion

Definition at line 77 of file node_impl.hxx.

◆ empty()

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
bool graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::empty ( ) const
inlinenoexcept

Definition at line 95 of file node_impl.hxx.

◆ end() [1/4]

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::unordered_set<Key, Hash, Pred>::iterator graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::end ( )
inlinenoexcept

Definition at line 150 of file node_impl.hxx.

◆ end() [2/4]

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::unordered_set<Key, Hash, Pred>::const_iterator graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::end ( ) const
inlinenoexcept

Definition at line 155 of file node_impl.hxx.

◆ end() [3/4]

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::unordered_set<Key, Hash, Pred>::local_iterator graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::end ( size_t  n)
inline

Definition at line 160 of file node_impl.hxx.

◆ end() [4/4]

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::unordered_set<Key, Hash, Pred>::const_local_iterator graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::end ( size_t  n) const
inline

Definition at line 165 of file node_impl.hxx.

◆ erase() [1/2]

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::unordered_set<Key, Hash, Pred>::iterator graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::erase ( typename std::unordered_set< Key, Hash, Pred >::const_iterator  itr)
inline

Definition at line 108 of file node_impl.hxx.

◆ erase() [2/2]

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
size_t graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::erase ( const Key &  key)
inline

Definition at line 114 of file node_impl.hxx.

◆ find()

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::unordered_set<Key, Hash, Pred>::const_iterator graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::find ( Key  key)
inline

Search

Definition at line 172 of file node_impl.hxx.

◆ get_mutex()

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
fc::mutex& graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::get_mutex ( ) const
inline

Iterations require a lock. This exposes the mutex. Use with care (i.e. lock_guard)

Definition at line 73 of file node_impl.hxx.

◆ insert()

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
std::pair< typename std::unordered_set<Key, Hash, Pred>::iterator, bool> graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::insert ( const Key &  val)
inline

Definition at line 82 of file node_impl.hxx.

◆ size()

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
size_t graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::size ( ) const
inline

Size

Definition at line 90 of file node_impl.hxx.

◆ swap()

template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>>
void graphene::net::detail::concurrent_unordered_set< Key, Hash, Pred >::swap ( typename std::unordered_set< Key, Hash, Pred > &  other)
inlinenoexcept

Swap

Definition at line 122 of file node_impl.hxx.


The documentation for this class was generated from the following file: