#include <boost/iterator/iterator_facade.hpp>
#include <boost/noncopyable.hpp>
#include <boost/type_traits/is_convertible.hpp>
#include <atomic>
#include <functional>
#include <stdexcept>
#include <folly/AtomicHashArray.h>
#include <folly/CPortability.h>
#include <folly/Likely.h>
#include <folly/ThreadCachedInt.h>
#include <folly/container/Foreach.h>
#include <folly/hash/Hash.h>
#include <folly/AtomicHashMap-inl.h>
Go to the source code of this file.
|
struct | folly::AtomicHashMapFullError |
|
class | folly::AtomicHashMap< KeyT, ValueT, HashFcn, EqualFcn, Allocator, ProbeFcn, KeyConvertFcn > |
|
struct | folly::AtomicHashMap< KeyT, ValueT, HashFcn, EqualFcn, Allocator, ProbeFcn, KeyConvertFcn >::ahm_iterator< ContT, IterVal, SubIt > |
|
struct | folly::AtomicHashMap< KeyT, ValueT, HashFcn, EqualFcn, Allocator, ProbeFcn, KeyConvertFcn >::SimpleRetT |
|
|
| folly |
| —— Concurrent Priority Queue Implementation ——
|
|
|
template<class KeyT , class ValueT , class HashFcn = std::hash<KeyT>, class EqualFcn = std::equal_to<KeyT>, class Allocator = std::allocator<char>> |
using | folly::QuadraticProbingAtomicHashMap = AtomicHashMap< KeyT, ValueT, HashFcn, EqualFcn, Allocator, AtomicHashArrayQuadraticProbeFcn > |
|
#define FOLLY_ATOMICHASHMAP_H_ |