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

- n -

• nAge : cds::algo::flat_combining::publication_record
• native_current_processor() : cds::OS::Aix::topology , cds::OS::Free_BSD::topology , cds::OS::Hpux::topology , cds::OS::Linux::topology , cds::OS::OS_X::topology , cds::OS::posix::topology , cds::OS::Sun::topology , cds::OS::Win32::topology
• New() : cds::details::AlignedAllocator< T, ALIGNED_ALLOCATOR > , cds::details::Allocator< T, Alloc >
• NewArray() : cds::details::AlignedAllocator< T, ALIGNED_ALLOCATOR > , cds::details::Allocator< T, Alloc >
• NewBlock() : cds::details::Allocator< T, Alloc >
• next : cds::intrusive::iterable_list::node< T > , cds::intrusive::skip_list::node< GC, Tag > , cds::opt::v::random2_permutation< Int > , cds::opt::v::random_permutation< Int > , cds::opt::v::random_shuffle_permutation< Int, RandomGenerator, RandomDevice > , cds::opt::v::skew_permutation< Generator >
• node() : cds::container::ellen_bintree::node< GC, T > , cds::intrusive::CachedFreeList< FreeList, CacheSize, Padding > , cds::intrusive::ellen_bintree::node< GC, Tag > , cds::intrusive::lazy_list::node< GC, Lock, Tag > , cds::intrusive::lazy_list::node< cds::urcu::gc< RCU >, Lock, Tag > , cds::intrusive::split_list::node< OrderedListNode >
• node_allocator : cds::container::bronson_avltree::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::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::segmented_queue::traits , cds::container::SegmentedQueue< GC, 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::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 >
• node_allocator_type : cds::container::BronsonAVLTreeMap< cds::urcu::gc< RCU >, Key, T *, Traits > , cds::container::BronsonAVLTreeMap< cds::urcu::gc< RCU >, Key, T, Traits > , cds::container::EllenBinTreeMap< GC, Key, T, Traits > , cds::container::EllenBinTreeMap< cds::urcu::gc< RCU >, Key, T, Traits >
• node_capacity : cds::intrusive::feldman_hashset::level_statistics
• node_to_value_cast : cds::urcu::exempt_ptr< RCU, NodeType, ValueType, Disposer, Cast >
• node_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::LazyList< GC, T, Traits > , cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::LazyList< gc::nogc, T, 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::MSQueue< GC, T, Traits > , cds::intrusive::OptimisticQueue< 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::TreiberStack< GC, T, Traits >
• node_type : cds::container::BasketQueue< GC, T, Traits > , cds::container::TreiberStack< GC, T, 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::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::MichaelList< GC, T, Traits > , cds::intrusive::MichaelList< cds::urcu::gc< RCU >, T, Traits > , cds::intrusive::MichaelList< gc::nogc, T, Traits > , cds::intrusive::MSQueue< GC, T, Traits > , cds::intrusive::node_traits< T, NodeType, Hook > , cds::intrusive::OptimisticQueue< 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::split_list::expandable_bucket_table< GC, Node, Options > , cds::intrusive::split_list::static_bucket_table< GC, Node, Options > , cds::intrusive::TreiberStack< GC, T, Traits > , cds::sync::monitor_scoped_lock< Monitor, Node > , cds::urcu::exempt_ptr< RCU, NodeType, ValueType, Disposer, Cast >
• not_enought_hazard_ptr_exception : cds::gc::HP
• notify() : cds::algo::flat_combining::wait_strategy::backoff< BackOff > , cds::algo::flat_combining::wait_strategy::empty , cds::algo::flat_combining::wait_strategy::multi_mutex_multi_condvar< Milliseconds > , cds::algo::flat_combining::wait_strategy::single_mutex_multi_condvar< Milliseconds > , cds::algo::flat_combining::wait_strategy::single_mutex_single_condvar< Milliseconds >
• nRequest : cds::algo::flat_combining::publication_record
• nState : cds::algo::flat_combining::publication_record
• number_splitter() : cds::algo::number_splitter< Int >