整體結(jié)構(gòu)

cyber atomic hash map是用一個(gè)數(shù)組存儲(chǔ)桶（bucket），桶是一個(gè)鏈表的形式存儲(chǔ)值，每一個(gè)結(jié)點(diǎn)是個(gè)entry，哈希沖突的解決方法是鏈地址法。

整體結(jié)構(gòu) --- entry

entry為bucket鏈表的結(jié)點(diǎn)單位，代碼：

struct Entry {Entry() {}explicit Entry(K key) : key(key) {value_ptr.store(new V(), std::memory_order_release);}Entry(K key, const V &value) : key(key) {value_ptr.store(new V(value), std::memory_order_release);}Entry(K key, V &&value) : key(key) {value_ptr.store(new V(std::forward<V>(value)), std::memory_order_release);}~Entry() { delete value_ptr.load(std::memory_order_acquire); }K key = 0;std::atomic<V *> value_ptr = {nullptr};std::atomic<Entry *> next = {nullptr}; };

存入每一個(gè)鍵值對(duì)的key，value，和同哈希值的next，需要注意的是value_ptr也就是指向value的指針，以及next指針都是原子的（atomic），也就是針對(duì)該指針的操作不需要考慮同步互斥問(wèn)題。

整體結(jié)構(gòu) --- bucket

bucket串接的是一系列具有相同哈希值的鍵值對(duì)，且按照key升序串接，且具有一個(gè)頭節(jié)點(diǎn)head_：

class Bucket {public:...Entry *head_; };

bucket接口：

bool Has(K key)

bool Has(K key) {Entry *m_target = head_->next.load(std::memory_order_acquire);while (Entry *target = m_target) {if (target->key < key) {m_target = target->next.load(std::memory_order_acquire);continue;} else {return target->key == key;}}return false; }

由于每個(gè)buffer是個(gè)升序鏈表，所以可以如上尋找

bool Find(K key, Entry **prev_ptr, Entry **target_ptr)

bool Find(K key, Entry **prev_ptr, Entry **target_ptr) {Entry *prev = head_;Entry *m_target = head_->next.load(std::memory_order_acquire);while (Entry *target = m_target) {if (target->key == key) {*prev_ptr = prev;*target_ptr = target;return true;} else if (target->key > key) {*prev_ptr = prev;*target_ptr = target;return false;} else {prev = target;m_target = target->next.load(std::memory_order_acquire);}}*prev_ptr = prev;*target_ptr = nullptr;return false; }

void Insert(K key, const V &value)

void Insert(K key, const V &value) {Entry *prev = nullptr;Entry *target = nullptr;Entry *new_entry = nullptr;V *new_value = nullptr;while (true) {if (Find(key, &prev, &target)) {// key exists, update valueif (!new_value) {new_value = new V(value);}auto old_val_ptr = target->value_ptr.load(std::memory_order_acquire);if (target->value_ptr.compare_exchange_strong(old_val_ptr, new_value, std::memory_order_acq_rel,std::memory_order_relaxed)) {delete old_val_ptr;if (new_entry) {delete new_entry;new_entry = nullptr;}return;}continue;} else {if (!new_entry) {new_entry = new Entry(key, value);}new_entry->next.store(target, std::memory_order_release);if (prev->next.compare_exchange_strong(target, new_entry,std::memory_order_acq_rel,std::memory_order_relaxed)) {// Insert successif (new_value) {delete new_value;new_value = nullptr;}return;}// another entry has been inserted, retry}} }

void Insert(K key, V &&value)

void Insert(K key, V &&value) {Entry *prev = nullptr;Entry *target = nullptr;Entry *new_entry = nullptr;V *new_value = nullptr;while (true) {if (Find(key, &prev, &target)) {// key exists, update valueif (!new_value) {new_value = new V(std::forward<V>(value));}auto old_val_ptr = target->value_ptr.load(std::memory_order_acquire);if (target->value_ptr.compare_exchange_strong(old_val_ptr, new_value, std::memory_order_acq_rel,std::memory_order_relaxed)) {delete old_val_ptr;if (new_entry) {delete new_entry;new_entry = nullptr;}return;}continue;} else {if (!new_entry) {new_entry = new Entry(key, value);}new_entry->next.store(target, std::memory_order_release);if (prev->next.compare_exchange_strong(target, new_entry,std::memory_order_acq_rel,std::memory_order_relaxed)) {// Insert successif (new_value) {delete new_value;new_value = nullptr;}return;}// another entry has been inserted, retry}} }

void Insert(K key)

void Insert(K key) {Entry *prev = nullptr;Entry *target = nullptr;Entry *new_entry = nullptr;V *new_value = nullptr;while (true) {if (Find(key, &prev, &target)) {// key exists, update valueif (!new_value) {new_value = new V();}auto old_val_ptr = target->value_ptr.load(std::memory_order_acquire);if (target->value_ptr.compare_exchange_strong(old_val_ptr, new_value, std::memory_order_acq_rel,std::memory_order_relaxed)) {delete old_val_ptr;if (new_entry) {delete new_entry;new_entry = nullptr;}return;}continue;} else {if (!new_entry) {new_entry = new Entry(key);}new_entry->next.store(target, std::memory_order_release);if (prev->next.compare_exchange_strong(target, new_entry,std::memory_order_acq_rel,std::memory_order_relaxed)) {// Insert successif (new_value) {delete new_value;new_value = nullptr;}return;}// another entry has been inserted, retry}} }

bool Get(K key, V **value)

bool Get(K key, V **value) {Entry *prev = nullptr;Entry *target = nullptr;if (Find(key, &prev, &target)) {*value = target->value_ptr.load(std::memory_order_acquire);return true;}return false; }

接口

bool Has(K key) {uint64_t index = key & mode_num_;return table_[index].Has(key);}bool Get(K key, V **value) {uint64_t index = key & mode_num_;return table_[index].Get(key, value);}bool Get(K key, V *value) {uint64_t index = key & mode_num_;V *val = nullptr;bool res = table_[index].Get(key, &val);if (res) {*value = *val;}return res;}void Set(K key) {uint64_t index = key & mode_num_;table_[index].Insert(key);}void Set(K key, const V &value) {uint64_t index = key & mode_num_;table_[index].Insert(key, value);}void Set(K key, V &&value) {uint64_t index = key & mode_num_;table_[index].Insert(key, std::forward<V>(value));}

總結(jié)

以上是生活随笔為你收集整理的cyber atomic hash map的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。