Public Types
typedef bucket_data::iterator	bucket_iterator

Public Member Functions
Value	at (Key const &key, Value const &default_value)

void	insert (Key const &key, Value const &value)

void	erase (Key const &key)

Public Attributes
bucket_data	data

boost::shared_mutex	_mutex

Private Types
typedef std::pair< Key, Value >	bucket_value

typedef std::vector< bucket_value >	bucket_data

Private Member Functions
bucket_iterator	find_entry_for (Key const &key)

Member Typedef Documentation

◆ bucket_data

template<typename Key , typename Value , typename Hash = std::hash<Key>>

typedef std::vector<bucket_value> LockedLookupTable< Key, Value, Hash >::bucket_type::bucket_data

private

◆ bucket_iterator

template<typename Key , typename Value , typename Hash = std::hash<Key>>

typedef bucket_data::iterator LockedLookupTable< Key, Value, Hash >::bucket_type::bucket_iterator

◆ bucket_value

template<typename Key , typename Value , typename Hash = std::hash<Key>>

typedef std::pair<Key, Value> LockedLookupTable< Key, Value, Hash >::bucket_type::bucket_value

private

Member Function Documentation

◆ at()

template<typename Key , typename Value , typename Hash = std::hash<Key>>

Value LockedLookupTable< Key, Value, Hash >::bucket_type::at	(	Key const &	key,
		Value const &	default_value
	)

inline

        {
            boost::shared_lock<boost::shared_mutex> lock(_mutex);
            bucket_iterator const found_entry = find_entry_for(key);
            return (found_entry == data.end()) ? default_value : found_entry->second;
        }

References LockedLookupTable< Key, Value, Hash >::bucket_type::_mutex, LockedLookupTable< Key, Value, Hash >::bucket_type::data, and LockedLookupTable< Key, Value, Hash >::bucket_type::find_entry_for().

Referenced by LockedLookupTable< Key, Value, Hash >::at().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ erase()

template<typename Key , typename Value , typename Hash = std::hash<Key>>

void LockedLookupTable< Key, Value, Hash >::bucket_type::erase ( Key const & key )

inline

        {
            boost::unique_lock<boost::shared_mutex> lock(_mutex);
            bucket_iterator const found_entry = find_entry_for(key);
            if (found_entry != data.end())
                data.erase(found_entry);
        }

References LockedLookupTable< Key, Value, Hash >::bucket_type::_mutex, LockedLookupTable< Key, Value, Hash >::bucket_type::data, and LockedLookupTable< Key, Value, Hash >::bucket_type::find_entry_for().

Referenced by LockedLookupTable< Key, Value, Hash >::erase().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ find_entry_for()

template<typename Key , typename Value , typename Hash = std::hash<Key>>

bucket_iterator LockedLookupTable< Key, Value, Hash >::bucket_type::find_entry_for ( Key const & key )

inlineprivate

        {
            return std::find_if(data.begin(), data.end(),
                [&](bucket_value const &item)
                {
                    return item.first == key;
                });
        }

References LockedLookupTable< Key, Value, Hash >::bucket_type::data.

Referenced by LockedLookupTable< Key, Value, Hash >::bucket_type::at(), LockedLookupTable< Key, Value, Hash >::bucket_type::erase(), and LockedLookupTable< Key, Value, Hash >::bucket_type::insert().

Here is the caller graph for this function:

◆ insert()

template<typename Key , typename Value , typename Hash = std::hash<Key>>

void LockedLookupTable< Key, Value, Hash >::bucket_type::insert	(	Key const &	key,
		Value const &	value
	)

inline

        {
            boost::unique_lock<boost::shared_mutex> lock(_mutex);
            bucket_iterator found_entry = find_entry_for(key);
 
            if (found_entry != data.end())
                data.erase(found_entry);
 
            data.push_back(bucket_value(key, value));
        }