rbtree_best_fit.hpp File Reference

Describes a best-fit algorithm based in an intrusive red-black tree used to allocate objects in shared memory. More...

#include <boost/interprocess/detail/config_begin.hpp>
#include <boost/interprocess/detail/workaround.hpp>
#include <boost/intrusive/pointer_traits.hpp>
#include <boost/interprocess/interprocess_fwd.hpp>
#include <boost/interprocess/mem_algo/detail/mem_algo_common.hpp>
#include <boost/interprocess/containers/allocation_type.hpp>
#include <boost/container/detail/multiallocation_chain.hpp>
#include <boost/interprocess/offset_ptr.hpp>
#include <boost/interprocess/exceptions.hpp>
#include <boost/interprocess/detail/utilities.hpp>
#include <boost/interprocess/detail/min_max.hpp>
#include <boost/interprocess/detail/math_functions.hpp>
#include <boost/interprocess/detail/type_traits.hpp>
#include <boost/interprocess/sync/scoped_lock.hpp>
#include <boost/type_traits/alignment_of.hpp>
#include <boost/type_traits/type_with_alignment.hpp>
#include <boost/type_traits/make_unsigned.hpp>
#include <boost/assert.hpp>
#include <boost/static_assert.hpp>
#include <algorithm>
#include <utility>
#include <climits>
#include <cstring>
#include <iterator>
#include <new>
#include <boost/intrusive/set.hpp>
#include <boost/interprocess/detail/config_end.hpp>

Include dependency graph for rbtree_best_fit.hpp:

This graph shows which files directly or indirectly include this file:

Classes
class	boost::interprocess::rbtree_best_fit< MutexFamily, VoidPointer, MemAlignment >
	This class implements an algorithm that stores the free nodes in a red-black tree to have logarithmic search/insert times. More...

Namespaces
	boost
	Duration formatting facet for input.
	boost::interprocess

Detailed Description

Describes a best-fit algorithm based in an intrusive red-black tree used to allocate objects in shared memory.

This class is intended as a base class for single segment and multi-segment implementations.