IndexedMemPool.h File Reference

#include <assert.h>
#include <errno.h>
#include <stdint.h>
#include <type_traits>
#include <boost/noncopyable.hpp>
#include <folly/Portability.h>
#include <folly/concurrency/CacheLocality.h>
#include <folly/portability/SysMman.h>
#include <folly/portability/Unistd.h>
#include <folly/synchronization/AtomicStruct.h>

Go to the source code of this file.

Classes
struct	folly::detail::IndexedMemPoolRecycler< Pool >
struct	folly::IndexedMemPoolTraits< T, EagerRecycleWhenTrivial, EagerRecycleWhenNotTrivial >
struct	folly::IndexedMemPool< T, NumLocalLists_, LocalListLimit_, Atom, Traits >
struct	folly::IndexedMemPool< T, NumLocalLists_, LocalListLimit_, Atom, Traits >::Slot
struct	folly::IndexedMemPool< T, NumLocalLists_, LocalListLimit_, Atom, Traits >::TaggedPtr
struct	folly::IndexedMemPool< T, NumLocalLists_, LocalListLimit_, Atom, Traits >::LocalList
struct	folly::detail::IndexedMemPoolRecycler< Pool >

Namespaces
	folly
	—— Concurrent Priority Queue Implementation ——
	folly::detail

Typedefs
template<typename T >
using	folly::IndexedMemPoolTraitsLazyRecycle = IndexedMemPoolTraits< T, false, false >
template<typename T >
using	folly::IndexedMemPoolTraitsEagerRecycle = IndexedMemPoolTraits< T, true, true >