BronsonAVLTreeMap traits More...

#include <cds/container/details/bronson_avltree_base.h>

Public Types
typedef opt::none	compare
	Key comparison functor. More...

typedef opt::none	less
	Specifies binary predicate used for key compare. More...

typedef CDS_DEFAULT_ALLOCATOR	node_allocator
	Allocator for internal node.

typedef CDS_DEFAULT_ALLOCATOR	allocator
	Allocator for node's value (not used in `BronsonAVLTreeMap<RCU, Key, T*, Traits>` specialisation)

typedef opt::v::delete_disposer	disposer
	Disposer (only for pointer-oriented tree specialization) More...

typedef cds::sync::injecting_monitor< cds::sync::spin >	sync_monitor
	Synchronization monitor type for node-level locking

typedef atomicity::empty_item_counter	item_counter
	Item counter. More...

typedef opt::v::relaxed_ordering	memory_model
	C++ memory ordering model. More...

typedef empty_stat	stat
	Internal statistics. More...

typedef cds::backoff::empty	back_off
	Back-off strategy.

typedef cds::opt::v::rcu_throw_deadlock	rcu_check_deadlock
	RCU deadlock checking policy. More...

Static Public Attributes
static bool const	relaxed_insert = false
	Enable relaxed insertion. More...

Detailed Description

BronsonAVLTreeMap traits

Note that there are two main specialization of Bronson et al AVL-tree:

pointer-oriented - the tree node stores an user-provided pointer to value
data-oriented - the tree node contains a copy of values

Depends on tree specialization, different traits member can be used.

Member Typedef Documentation

typedef opt::none cds::container::bronson_avltree::traits::compare

Key comparison functor.

No default functor is provided. If the option is not specified, the less is used.

See cds::opt::compare option description for functor interface.

You should provide compare or less functor.

typedef opt::v::delete_disposer cds::container::bronson_avltree::traits::disposer

Disposer (only for pointer-oriented tree specialization)

The functor used for dispose removed values. The user-provided disposer is used only for pointer-oriented tree specialization like BronsonAVLTreeMap<GC, Key, T*, Traits>. When the node becomes the routing node without value, the disposer will be called to signal that the memory for the value can be safely freed. Default is cds::container::opt::v::delete_disposer<> which calls delete operator.

typedef atomicity::empty_item_counter cds::container::bronson_avltree::traits::item_counter

Item counter.

The type for item counter, by default it is disabled (atomicity::empty_item_counter). To enable it use atomicity::item_counter or atomicity::cache_friendly_item_counter.

typedef opt::none cds::container::bronson_avltree::traits::less

Specifies binary predicate used for key compare.

See cds::opt::less option description for predicate interface.

You should provide compare or less functor.

typedef opt::v::relaxed_ordering cds::container::bronson_avltree::traits::memory_model

C++ memory ordering model.

List of available memory ordering see opt::memory_model

typedef cds::opt::v::rcu_throw_deadlock cds::container::bronson_avltree::traits::rcu_check_deadlock

RCU deadlock checking policy.