cds::intrusive::michael_set::traits Struct Reference

MichaelHashSet traits. More...

#include <cds/intrusive/details/michael_set_base.h>

Public Types
typedef opt::none	hash
	Hash function. More...
typedef cds::atomicity::item_counter	item_counter
	Item counter. More...
typedef CDS_DEFAULT_ALLOCATOR	allocator
	Bucket table allocator. More...

Detailed Description

MichaelHashSet traits.

Member Typedef Documentation

typedef CDS_DEFAULT_ALLOCATOR cds::intrusive::michael_set::traits::allocator

Bucket table allocator.

Allocator for bucket table. Default is CDS_DEFAULT_ALLOCATOR The allocator uses only in constructor for allocating bucket table and in destructor for destroying bucket table

typedef opt::none cds::intrusive::michael_set::traits::hash

Hash function.

Hash function converts the key fields of struct T stored in the hash-set into value of type size_t called hash value that is an index of hash table.

This is mandatory type and has no predefined one.

typedef cds::atomicity::item_counter cds::intrusive::michael_set::traits::item_counter

Item counter.

The item counting is an important part of MichaelHashSet algorithm: the empty() member function depends on correct item counting. You may use atomicity::empty_item_counter if don't need empty() and size() member functions.

Default is atomicity::item_counter; to avoid false sharing you may use atomicity::cache_friendly_item_counter

---

The documentation for this struct was generated from the following file:

• cds/intrusive/details/michael_set_base.h