apollo::cyber::base::AtomicHashMap< K, V, TableSize, type > 模板类 参考

A implementation of lock-free fixed size hash map 更多...

#include <atomic_hash_map.h>

apollo::cyber::base::AtomicHashMap< K, V, TableSize, type > 的协作图:

Public 成员函数
	AtomicHashMap ()
	AtomicHashMap (const AtomicHashMap &other)=delete
AtomicHashMap &	operator= (const AtomicHashMap &other)=delete
bool	Has (K key)
bool	Get (K key, V **value)
bool	Get (K key, V *value)
void	Set (K key)
void	Set (K key, const V &value)
void	Set (K key, V &&value)

详细描述

template<typename K, typename V, std::size_t TableSize = 128, typename std::enable_if< std::is_integral< K >::value &&(TableSize &(TableSize - 1))==0, int >::type = 0>
class apollo::cyber::base::AtomicHashMap< K, V, TableSize, type >

A implementation of lock-free fixed size hash map

模板参数

K	Type of key, must be integral
V	Type of value
128	Size of hash table
0	Type traits, use for checking types of key & value

在文件 atomic_hash_map.h 第 40 行定义.

构造及析构函数说明

AtomicHashMap() [1/2]

template<typename K , typename V , std::size_t TableSize = 128, typename std::enable_if< std::is_integral< K >::value &&(TableSize &(TableSize - 1))==0, int >::type = 0>

apollo::cyber::base::AtomicHashMap< K, V, TableSize, type >::AtomicHashMap ( )

inline

在文件 atomic_hash_map.h 第 42 行定义.

: capacity_(TableSize), mode_num_(capacity_ - 1) {}

AtomicHashMap() [2/2]

template<typename K , typename V , std::size_t TableSize = 128, typename std::enable_if< std::is_integral< K >::value &&(TableSize &(TableSize - 1))==0, int >::type = 0>

apollo::cyber::base::AtomicHashMap< K, V, TableSize, type >::AtomicHashMap ( const AtomicHashMap< K, V, TableSize, type > &  other )

delete

成员函数说明

Get() [1/2]

template<typename K , typename V , std::size_t TableSize = 128, typename std::enable_if< std::is_integral< K >::value &&(TableSize &(TableSize - 1))==0, int >::type = 0>

bool apollo::cyber::base::AtomicHashMap< K, V, TableSize, type >::Get ( K  key, V **  value  )

inline

在文件 atomic_hash_map.h 第 51 行定义.

                             {
    uint64_t index = key & mode_num_;
    return table_[index].Get(key, value);
  }

Get() [2/2]

template<typename K , typename V , std::size_t TableSize = 128, typename std::enable_if< std::is_integral< K >::value &&(TableSize &(TableSize - 1))==0, int >::type = 0>

bool apollo::cyber::base::AtomicHashMap< K, V, TableSize, type >::Get ( K  key, V *  value  )

inline

在文件 atomic_hash_map.h 第 56 行定义.

                            {
    uint64_t index = key & mode_num_;
    V *val = nullptr;
    bool res = table_[index].Get(key, &val);
    if (res) {
      *value = *val;
    }
    return res;
  }

Has()

template<typename K , typename V , std::size_t TableSize = 128, typename std::enable_if< std::is_integral< K >::value &&(TableSize &(TableSize - 1))==0, int >::type = 0>

bool apollo::cyber::base::AtomicHashMap< K, V, TableSize, type >::Has ( K  key )

inline

在文件 atomic_hash_map.h 第 46 行定义.

                  {
    uint64_t index = key & mode_num_;
    return table_[index].Has(key);
  }

operator=()

template<typename K , typename V , std::size_t TableSize = 128, typename std::enable_if< std::is_integral< K >::value &&(TableSize &(TableSize - 1))==0, int >::type = 0>

AtomicHashMap & apollo::cyber::base::AtomicHashMap< K, V, TableSize, type >::operator= ( const AtomicHashMap< K, V, TableSize, type > &  other )

delete

Set() [1/3]

template<typename K , typename V , std::size_t TableSize = 128, typename std::enable_if< std::is_integral< K >::value &&(TableSize &(TableSize - 1))==0, int >::type = 0>

void apollo::cyber::base::AtomicHashMap< K, V, TableSize, type >::Set ( K  key )

inline

在文件 atomic_hash_map.h 第 66 行定义.

                  {
    uint64_t index = key & mode_num_;
    table_[index].Insert(key);
  }

Set() [2/3]

template<typename K , typename V , std::size_t TableSize = 128, typename std::enable_if< std::is_integral< K >::value &&(TableSize &(TableSize - 1))==0, int >::type = 0>

void apollo::cyber::base::AtomicHashMap< K, V, TableSize, type >::Set ( K  key, const V &  value  )

inline

在文件 atomic_hash_map.h 第 71 行定义.

                                  {
    uint64_t index = key & mode_num_;
    table_[index].Insert(key, value);
  }

Set() [3/3]

template<typename K , typename V , std::size_t TableSize = 128, typename std::enable_if< std::is_integral< K >::value &&(TableSize &(TableSize - 1))==0, int >::type = 0>

void apollo::cyber::base::AtomicHashMap< K, V, TableSize, type >::Set ( K  key, V &&  value  )

inline

在文件 atomic_hash_map.h 第 76 行定义.

                             {
    uint64_t index = key & mode_num_;
    table_[index].Insert(key, std::forward<V>(value));
  }

---

该类的文档由以下文件生成:

• cyber/base/atomic_hash_map.h