Here is a list of all documented struct and union fields with links to the struct/union documentation for each field:

- s -

• safe_cut() : cds::algo::byte_splitter< BitString, BitStringSize, UInt > , cds::algo::number_splitter< Int > , cds::algo::split_bitstring< BitString, BitStringSize, UInt >
• scan() : cds::gc::DHP , cds::gc::HP
• scan_count : cds::gc::dhp::stat , cds::gc::hp::stat
• scan_type : cds::gc::HP
• scoped_lock : cds::sync::injecting_monitor< Lock > , cds::sync::pool_monitor< LockPool, BackOff, Stat > , cds::urcu::gc< general_buffered< Buffer, Lock, Backoff > > , cds::urcu::gc< general_instant< Lock, Backoff > > , cds::urcu::gc< general_threaded< Buffer, Lock, DisposerThread, Backoff > > , cds::urcu::gc< signal_buffered< Buffer, Lock, Backoff > > , cds::urcu::general_buffered< Buffer, Lock, Backoff > , cds::urcu::general_instant< Lock, Backoff > , cds::urcu::general_threaded< Buffer, Lock, DisposerThread, Backoff > , cds::urcu::signal_buffered< Buffer, Lock, Backoff >
• SegmentedQueue() : cds::container::SegmentedQueue< GC, T, Traits > , cds::intrusive::SegmentedQueue< GC, T, Traits >
• select_cell_policy : cds::sync::lock_array< Lock, SelectPolicy, Alloc >
• set_memory_allocator() : cds::gc::DHP , cds::gc::HP
• signal_no() : cds::urcu::gc< signal_buffered< Buffer, Lock, Backoff > > , cds::urcu::signal_buffered< Buffer, Lock, Backoff >
• single_bucket_size_threshold() : cds::intrusive::striped_set::single_bucket_size_threshold< 0 >
• single_consumer : cds::container::vyukov_queue::traits
• single_mutex_multi_condvar() : cds::algo::flat_combining::wait_strategy::single_mutex_multi_condvar< Milliseconds >
• single_mutex_single_condvar() : cds::algo::flat_combining::wait_strategy::single_mutex_single_condvar< Milliseconds >
• size() : cds::container::BasketQueue< GC, T, Traits > , cds::container::BronsonAVLTreeMap< cds::urcu::gc< RCU >, Key, T *, Traits > , cds::container::BronsonAVLTreeMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::CuckooMap< Key, T, Traits > , cds::container::CuckooSet< T, Traits > , cds::container::EllenBinTreeMap< GC, Key, T, Traits > , cds::container::EllenBinTreeMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::EllenBinTreeSet< GC, Key, T, Traits > , cds::container::EllenBinTreeSet< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::FCDeque< T, Deque, Traits > , cds::container::FCPriorityQueue< T, PriorityQueue, Traits > , cds::container::FCQueue< T, Queue, Traits > , cds::container::FCStack< T, Stack, Traits > , cds::container::FeldmanHashMap< GC, Key, T, Traits > , cds::container::FeldmanHashMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::FeldmanHashSet< GC, T, Traits > , cds::container::FeldmanHashSet< cds::urcu::gc< RCU >, T, Traits > , cds::container::IterableKVList< GC, Key, Value, Traits > , cds::container::IterableList< GC, T, Traits > , cds::container::LazyKVList< GC, Key, Value, Traits > , cds::container::LazyKVList< cds::urcu::gc< RCU >, Key, Value, Traits > , cds::container::LazyKVList< gc::nogc, Key, Value, Traits > , cds::container::LazyList< GC, T, Traits > , cds::container::LazyList< cds::gc::nogc, T, Traits > , cds::container::LazyList< cds::urcu::gc< RCU >, T, Traits > , cds::container::MichaelHashMap< GC, OrderedList, Traits > , cds::container::MichaelHashMap< cds::gc::nogc, OrderedList, Traits > , cds::container::MichaelHashMap< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::container::MichaelHashSet< GC, OrderedList, Traits > , cds::container::MichaelHashSet< cds::gc::nogc, OrderedList, Traits > , cds::container::MichaelHashSet< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::container::MichaelKVList< GC, Key, Value, Traits > , cds::container::MichaelKVList< cds::urcu::gc< RCU >, Key, Value, Traits > , cds::container::MichaelKVList< gc::nogc, Key, Value, Traits > , cds::container::MichaelList< GC, T, Traits > , cds::container::MichaelList< cds::urcu::gc< RCU >, T, Traits > , cds::container::MichaelList< gc::nogc, T, Traits > , cds::container::MoirQueue< GC, T, Traits > , cds::container::MSPriorityQueue< T, Traits > , cds::container::MSQueue< GC, T, Traits > , cds::container::OptimisticQueue< GC, T, Traits > , cds::container::RWQueue< T, Traits > , cds::container::SegmentedQueue< GC, T, Traits > , cds::container::SkipListMap< GC, Key, T, Traits > , cds::container::SkipListMap< cds::gc::nogc, Key, T, Traits > , cds::container::SkipListMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::SkipListSet< GC, T, Traits > , cds::container::SkipListSet< cds::urcu::gc< RCU >, T, Traits > , cds::container::SkipListSet< gc::nogc, T, Traits > , cds::container::SplitListMap< GC, Key, Value, Traits > , cds::container::SplitListMap< cds::gc::nogc, Key, Value, Traits > , cds::container::SplitListMap< cds::urcu::gc< RCU >, Key, Value, Traits > , cds::container::SplitListSet< GC, T, Traits > , cds::container::SplitListSet< cds::gc::nogc, T, Traits > , cds::container::SplitListSet< cds::urcu::gc< RCU >, T, Traits > , cds::container::StripedMap< Container, Options > , cds::container::StripedSet< Container, Options > , cds::container::TreiberStack< GC, T, Traits > , cds::container::VyukovMPMCCycleQueue< T, Traits > , cds::container::WeakRingBuffer< T, Traits > , cds::container::WeakRingBuffer< void, Traits > , cds::intrusive::BasketQueue< GC, T, Traits > , cds::intrusive::CuckooSet< T, Traits > , cds::intrusive::EllenBinTree< GC, Key, T, Traits > , cds::intrusive::EllenBinTree< cds::urcu::gc< RCU >, Key, T, Traits > , cds::intrusive::FCQueue< T, Container, Traits > , cds::intrusive::FCStack< T, Container, Traits > , cds::intrusive::FeldmanHashSet< GC, T, Traits > , cds::intrusive::FeldmanHashSet< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::IterableList< GC, T, Traits > , cds::intrusive::LazyList< GC, T, Traits > , cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::LazyList< gc::nogc, T, Traits > , cds::intrusive::MichaelHashSet< GC, OrderedList, Traits > , cds::intrusive::MichaelHashSet< cds::gc::nogc, OrderedList, Traits > , cds::intrusive::MichaelHashSet< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::intrusive::MichaelList< GC, T, Traits > , cds::intrusive::MichaelList< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::MichaelList< gc::nogc, T, Traits > , cds::intrusive::MSPriorityQueue< T, Traits > , cds::intrusive::MSQueue< GC, T, Traits > , cds::intrusive::OptimisticQueue< GC, T, Traits > , cds::intrusive::SegmentedQueue< GC, T, Traits > , cds::intrusive::SkipListSet< GC, T, Traits > , cds::intrusive::SkipListSet< cds::gc::nogc, T, Traits > , cds::intrusive::SkipListSet< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::SplitListSet< GC, OrderedList, Traits > , cds::intrusive::SplitListSet< cds::gc::nogc, OrderedList, Traits > , cds::intrusive::SplitListSet< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::intrusive::StripedSet< Container, Options > , cds::intrusive::TreiberStack< GC, T, Traits > , cds::intrusive::VyukovMPMCCycleQueue< T, Traits > , cds::sync::lock_array< Lock, SelectPolicy, Alloc >
• size_type : cds::OS::aligned_allocator< T >
• skew_permutation() : cds::opt::v::skew_permutation< Generator >
• SkipListMap() : cds::container::SkipListMap< GC, Key, T, Traits > , cds::container::SkipListMap< cds::gc::nogc, Key, T, Traits > , cds::container::SkipListMap< cds::urcu::gc< RCU >, Key, T, Traits >
• SkipListSet() : cds::container::SkipListSet< GC, T, Traits > , cds::container::SkipListSet< cds::urcu::gc< RCU >, T, Traits > , cds::container::SkipListSet< gc::nogc, T, Traits > , cds::intrusive::SkipListSet< GC, T, Traits > , cds::intrusive::SkipListSet< cds::gc::nogc, T, Traits > , cds::intrusive::SkipListSet< cds::urcu::gc< RCU >, T, Traits >
• slow_path_backoff : cds::backoff::exponential_const_traits , cds::backoff::exponential_runtime_traits
• sort : cds::intrusive::lazy_list::traits
• source() : cds::algo::byte_splitter< BitString, BitStringSize, UInt > , cds::algo::number_splitter< Int > , cds::algo::split_bitstring< BitString, BitStringSize, UInt >
• spin_backoff : cds::backoff::exponential< Traits >
• spin_lock() : cds::sync::spin_lock< Backoff >
• split_bitstring() : cds::algo::split_bitstring< BitString, BitStringSize, UInt >
• SplitListMap() : cds::container::SplitListMap< GC, Key, Value, Traits > , cds::container::SplitListMap< cds::gc::nogc, Key, Value, Traits > , cds::container::SplitListMap< cds::urcu::gc< RCU >, Key, Value, Traits >
• SplitListSet() : cds::container::SplitListSet< GC, T, Traits > , cds::container::SplitListSet< cds::gc::nogc, T, Traits > , cds::container::SplitListSet< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::SplitListSet< GC, OrderedList, Traits > , cds::intrusive::SplitListSet< cds::gc::nogc, OrderedList, Traits > , cds::intrusive::SplitListSet< cds::urcu::gc< RCU >, OrderedList, Traits >
• stack_type : cds::container::FCStack< T, Stack, Traits >
• start() : cds::urcu::dispose_thread< Buffer >
• stat : cds::algo::flat_combining::kernel< PublicationRecord, Traits > , cds::algo::flat_combining::traits , cds::container::basket_queue::traits , cds::container::BasketQueue< GC, T, Traits > , cds::container::bronson_avltree::traits , cds::container::BronsonAVLTreeMap< cds::urcu::gc< RCU >, Key, T *, Traits > , cds::container::BronsonAVLTreeMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::cuckoo::traits , cds::container::CuckooMap< Key, T, Traits > , cds::container::CuckooSet< T, Traits > , cds::container::ellen_bintree::traits , cds::container::EllenBinTreeMap< GC, Key, T, Traits > , cds::container::EllenBinTreeMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::EllenBinTreeSet< GC, Key, T, Traits > , cds::container::EllenBinTreeSet< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::FCDeque< T, Deque, Traits > , cds::container::fcdeque::traits , cds::container::fcpqueue::traits , cds::container::FCPriorityQueue< T, PriorityQueue, Traits > , cds::container::FCQueue< T, Queue, Traits > , cds::container::fcqueue::traits , cds::container::FCStack< T, Stack, Traits > , cds::container::fcstack::traits , cds::container::feldman_hashmap::traits , cds::container::feldman_hashset::traits , cds::container::FeldmanHashMap< GC, Key, T, Traits > , cds::container::FeldmanHashMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::FeldmanHashSet< GC, T, Traits > , cds::container::FeldmanHashSet< cds::urcu::gc< RCU >, T, Traits > , cds::container::IterableKVList< GC, Key, Value, Traits > , cds::container::IterableList< GC, T, Traits > , cds::container::LazyKVList< GC, Key, Value, Traits > , cds::container::LazyKVList< cds::urcu::gc< RCU >, Key, Value, Traits > , cds::container::LazyKVList< gc::nogc, Key, Value, Traits > , cds::container::LazyList< GC, T, Traits > , cds::container::LazyList< cds::gc::nogc, T, Traits > , cds::container::LazyList< cds::urcu::gc< RCU >, T, Traits > , cds::container::MichaelHashMap< GC, OrderedList, Traits > , cds::container::MichaelHashMap< cds::gc::nogc, OrderedList, Traits > , cds::container::MichaelHashMap< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::container::MichaelHashSet< GC, OrderedList, Traits > , cds::container::MichaelHashSet< cds::gc::nogc, OrderedList, Traits > , cds::container::MichaelHashSet< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::container::MichaelKVList< GC, Key, Value, Traits > , cds::container::MichaelKVList< cds::urcu::gc< RCU >, Key, Value, Traits > , cds::container::MichaelKVList< gc::nogc, Key, Value, Traits > , cds::container::MichaelList< GC, T, Traits > , cds::container::MichaelList< cds::urcu::gc< RCU >, T, Traits > , cds::container::MichaelList< gc::nogc, T, Traits > , cds::container::MoirQueue< GC, T, Traits > , cds::container::MSPriorityQueue< T, Traits > , cds::container::MSQueue< GC, T, Traits > , cds::container::msqueue::traits , cds::container::optimistic_queue::traits , cds::container::OptimisticQueue< GC, T, Traits > , cds::container::segmented_queue::traits , cds::container::SegmentedQueue< GC, T, Traits > , cds::container::skip_list::traits , cds::container::SkipListMap< GC, Key, T, Traits > , cds::container::SkipListMap< cds::gc::nogc, Key, T, Traits > , cds::container::SkipListMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::SkipListSet< GC, T, Traits > , cds::container::SkipListSet< cds::urcu::gc< RCU >, T, Traits > , cds::container::SkipListSet< gc::nogc, T, Traits > , cds::container::SplitListMap< GC, Key, Value, Traits > , cds::container::SplitListMap< cds::gc::nogc, Key, Value, Traits > , cds::container::SplitListMap< cds::urcu::gc< RCU >, Key, Value, Traits > , cds::container::SplitListSet< GC, T, Traits > , cds::container::SplitListSet< cds::gc::nogc, T, Traits > , cds::container::SplitListSet< cds::urcu::gc< RCU >, T, Traits > , cds::container::treiber_stack::traits , cds::container::TreiberStack< GC, T, Traits > , cds::gc::DHP , cds::gc::dhp::stat , cds::gc::HP , cds::gc::hp::stat , cds::intrusive::basket_queue::traits , cds::intrusive::BasketQueue< GC, T, Traits > , cds::intrusive::cuckoo::traits , cds::intrusive::CuckooSet< T, Traits > , cds::intrusive::ellen_bintree::traits , cds::intrusive::EllenBinTree< GC, Key, T, Traits > , cds::intrusive::EllenBinTree< cds::urcu::gc< RCU >, Key, T, Traits > , cds::intrusive::FCQueue< T, Container, Traits > , cds::intrusive::fcqueue::traits , cds::intrusive::FCStack< T, Container, Traits > , cds::intrusive::fcstack::traits , cds::intrusive::feldman_hashset::traits , cds::intrusive::FeldmanHashSet< GC, T, Traits > , cds::intrusive::FeldmanHashSet< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::iterable_list::traits , cds::intrusive::IterableList< GC, T, Traits > , cds::intrusive::lazy_list::traits , cds::intrusive::LazyList< GC, T, Traits > , cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::LazyList< gc::nogc, T, Traits > , cds::intrusive::michael_list::traits , cds::intrusive::MichaelHashSet< GC, OrderedList, Traits > , cds::intrusive::MichaelHashSet< cds::gc::nogc, OrderedList, Traits > , cds::intrusive::MichaelHashSet< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::intrusive::MichaelList< GC, T, Traits > , cds::intrusive::MichaelList< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::MichaelList< gc::nogc, T, Traits > , cds::intrusive::mspriority_queue::traits , cds::intrusive::MSPriorityQueue< T, Traits > , cds::intrusive::MSQueue< GC, T, Traits > , cds::intrusive::msqueue::traits , cds::intrusive::optimistic_queue::traits , cds::intrusive::OptimisticQueue< GC, T, Traits > , cds::intrusive::segmented_queue::traits , cds::intrusive::SegmentedQueue< GC, T, Traits > , cds::intrusive::skip_list::traits , cds::intrusive::SkipListSet< GC, T, Traits > , cds::intrusive::SkipListSet< cds::gc::nogc, T, Traits > , cds::intrusive::SkipListSet< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::split_list::traits , cds::intrusive::SplitListSet< GC, OrderedList, Traits > , cds::intrusive::SplitListSet< cds::gc::nogc, OrderedList, Traits > , cds::intrusive::SplitListSet< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::intrusive::treiber_stack::traits , cds::intrusive::TreiberStack< GC, T, Traits >
• static_bucket_table() : cds::intrusive::split_list::static_bucket_table< GC, Node, Options >
• statistics() : cds::algo::flat_combining::kernel< PublicationRecord, Traits > , cds::container::BasketQueue< GC, T, Traits > , cds::container::BronsonAVLTreeMap< cds::urcu::gc< RCU >, Key, T *, Traits > , cds::container::BronsonAVLTreeMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::CuckooMap< Key, T, Traits > , cds::container::CuckooSet< T, Traits > , cds::container::EllenBinTreeMap< GC, Key, T, Traits > , cds::container::EllenBinTreeMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::EllenBinTreeSet< GC, Key, T, Traits > , cds::container::EllenBinTreeSet< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::FCDeque< T, Deque, Traits > , cds::container::FCPriorityQueue< T, PriorityQueue, Traits > , cds::container::FCQueue< T, Queue, Traits > , cds::container::FCStack< T, Stack, Traits > , cds::container::FeldmanHashMap< GC, Key, T, Traits > , cds::container::FeldmanHashMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::FeldmanHashSet< GC, T, Traits > , cds::container::FeldmanHashSet< cds::urcu::gc< RCU >, T, Traits > , cds::container::IterableKVList< GC, Key, Value, Traits > , cds::container::IterableList< GC, T, Traits > , cds::container::LazyKVList< GC, Key, Value, Traits > , cds::container::LazyKVList< cds::urcu::gc< RCU >, Key, Value, Traits > , cds::container::LazyKVList< gc::nogc, Key, Value, Traits > , cds::container::LazyList< GC, T, Traits > , cds::container::LazyList< cds::gc::nogc, T, Traits > , cds::container::LazyList< cds::urcu::gc< RCU >, T, Traits > , cds::container::MichaelHashMap< GC, OrderedList, Traits > , cds::container::MichaelHashMap< cds::gc::nogc, OrderedList, Traits > , cds::container::MichaelHashMap< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::container::MichaelHashSet< GC, OrderedList, Traits > , cds::container::MichaelHashSet< cds::gc::nogc, OrderedList, Traits > , cds::container::MichaelHashSet< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::container::MichaelKVList< GC, Key, Value, Traits > , cds::container::MichaelKVList< cds::urcu::gc< RCU >, Key, Value, Traits > , cds::container::MichaelKVList< gc::nogc, Key, Value, Traits > , cds::container::MichaelList< GC, T, Traits > , cds::container::MichaelList< cds::urcu::gc< RCU >, T, Traits > , cds::container::MichaelList< gc::nogc, T, Traits > , cds::container::MoirQueue< GC, T, Traits > , cds::container::MSPriorityQueue< T, Traits > , cds::container::MSQueue< GC, T, Traits > , cds::container::OptimisticQueue< GC, T, Traits > , cds::container::SegmentedQueue< GC, T, Traits > , cds::container::SkipListMap< GC, Key, T, Traits > , cds::container::SkipListMap< cds::gc::nogc, Key, T, Traits > , cds::container::SkipListMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::SkipListSet< GC, T, Traits > , cds::container::SkipListSet< cds::urcu::gc< RCU >, T, Traits > , cds::container::SkipListSet< gc::nogc, T, Traits > , cds::container::SplitListMap< GC, Key, Value, Traits > , cds::container::SplitListMap< cds::gc::nogc, Key, Value, Traits > , cds::container::SplitListMap< cds::urcu::gc< RCU >, Key, Value, Traits > , cds::container::SplitListSet< GC, T, Traits > , cds::container::SplitListSet< cds::gc::nogc, T, Traits > , cds::container::SplitListSet< cds::urcu::gc< RCU >, T, Traits > , cds::container::TreiberStack< GC, T, Traits > , cds::gc::DHP , cds::gc::HP , cds::intrusive::BasketQueue< GC, T, Traits > , cds::intrusive::cuckoo::refinable< RecursiveLock, Arity, BackOff, Alloc, Stat > , cds::intrusive::cuckoo::striping< RecursiveLock, Arity, Alloc, Stat > , cds::intrusive::CuckooSet< T, Traits > , cds::intrusive::EllenBinTree< GC, Key, T, Traits > , cds::intrusive::EllenBinTree< cds::urcu::gc< RCU >, Key, T, Traits > , cds::intrusive::FCQueue< T, Container, Traits > , cds::intrusive::FCStack< T, Container, Traits > , cds::intrusive::FeldmanHashSet< GC, T, Traits > , cds::intrusive::FeldmanHashSet< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::IterableList< GC, T, Traits > , cds::intrusive::LazyList< GC, T, Traits > , cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::LazyList< gc::nogc, T, Traits > , cds::intrusive::MichaelHashSet< GC, OrderedList, Traits > , cds::intrusive::MichaelHashSet< cds::gc::nogc, OrderedList, Traits > , cds::intrusive::MichaelHashSet< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::intrusive::MichaelList< GC, T, Traits > , cds::intrusive::MichaelList< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::MichaelList< gc::nogc, T, Traits > , cds::intrusive::MSPriorityQueue< T, Traits > , cds::intrusive::MSQueue< GC, T, Traits > , cds::intrusive::OptimisticQueue< GC, T, Traits > , cds::intrusive::SegmentedQueue< GC, T, Traits > , cds::intrusive::SkipListSet< GC, T, Traits > , cds::intrusive::SkipListSet< cds::gc::nogc, T, Traits > , cds::intrusive::SkipListSet< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::SplitListSet< GC, OrderedList, Traits > , cds::intrusive::SplitListSet< cds::gc::nogc, OrderedList, Traits > , cds::intrusive::SplitListSet< cds::urcu::gc< RCU >, OrderedList, Traits > , cds::intrusive::TreiberStack< GC, T, Traits > , cds::sync::pool_monitor< LockPool, BackOff, Stat >
• statistics_type : cds::intrusive::cuckoo::refinable< RecursiveLock, Arity, BackOff, Alloc, Stat > , cds::intrusive::cuckoo::striping< RecursiveLock, Arity, Alloc, Stat >
• stop() : cds::urcu::dispose_thread< Buffer >
• store_hash : cds::container::cuckoo::traits
• StripedMap() : cds::container::StripedMap< Container, Options >
• StripedSet() : cds::container::StripedSet< Container, Options > , cds::intrusive::StripedSet< Container, Options >
• striping() : cds::intrusive::cuckoo::striping< RecursiveLock, Arity, Alloc, Stat > , cds::intrusive::striped_set::striping< Lock, Alloc >
• sync_monitor : cds::container::bronson_avltree::traits , cds::container::BronsonAVLTreeMap< cds::urcu::gc< RCU >, Key, T *, Traits > , cds::container::BronsonAVLTreeMap< cds::urcu::gc< RCU >, Key, T, Traits >
• synchronize() : cds::urcu::gc< general_buffered< Buffer, Lock, Backoff > > , cds::urcu::gc< general_instant< Lock, Backoff > > , cds::urcu::gc< general_threaded< Buffer, Lock, DisposerThread, Backoff > > , cds::urcu::gc< signal_buffered< Buffer, Lock, Backoff > > , cds::urcu::general_buffered< Buffer, Lock, Backoff > , cds::urcu::general_instant< Lock, Backoff > , cds::urcu::general_threaded< Buffer, Lock, DisposerThread, Backoff > , cds::urcu::signal_buffered< Buffer, Lock, Backoff >