AnySet Documentation
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 1234]
 Cte::AnyHashGeneric hash function object
 Cte::detail::AnyList< Hash, Compare >
 Cte::detail::AnyList< HashFn, KeyEqual >
 Cte::AnyValue< HashFn, Compare >
 Cte::detail::TypedValue< Value, HashFn, Compare >This class is an implementation detail and is not part of the public interface of AnyValue
 Cte::detail::AnyValueLink< Value, HashFn, Compare >This class is an implementation detail and is not part of the public interface of AnyValue
 Cte::detail::ArgHash
 Cconditional_t
 Cte::detail::has_hash_specialization< T >
 Cconst_list_iterator
 Cte::AnySet< HashFn, KeyEqual, Allocator >::const_iteratorForward iterator type returned from const operations on AnySet instances
 Cte::ConstValueHolder< Value, Tag, bool >
 Cte::ConstValueHolder< Value >
 Cte::detail::AnyValueLink< Value, HashFn, Compare >This class is an implementation detail and is not part of the public interface of AnyValue
 Cte::ConstValueHolder< Value, Tag, false >
 Cstd::false_type [external]
 Cte::detail::is_any_set< T >
 Cte::detail::is_equality_comparable< T, class >
 Cte::detail::is_inequality_comparable< T, class >
 Cte::Hash< std::array< T, N > >Specialize te::Hash for std::array
 Cte::Hash< std::complex< T > >Specialize te::Hash for std::complex
 Cte::Hash< std::pair< T, U > >Specialize te::Hash for std::pair
 Cte::Hash< std::tuple< T... > >Specialize te::Hash for std::tuple
 Cstd::hash< T > [external]
 Cte::Hash< T >Function object that implements a hash function for instances of type T. Inherits from std::hash<T> unless otherwise specialized by the user to not do so
 Cte::Hash< void >Function object that implements a hash function for instances of type T
 Cte::detail::is_iterator< T, typename >
 Cte::detail::is_iterator< T, std::enable_if_t<!std::is_same_v< typename std::iterator_traits< T >::value_type, void > > >
 Cte::detail::is_streamable_helper< S, T >
 Clist_iterator
 Cte::AnySet< HashFn, KeyEqual, Allocator >::iteratorForward iterator type returned from non-const operations on AnySet instances
 Cstd::logic_error [external]
 Cte::CopyConstructionErrorBase type of NoCopyConstructorError. Thrown when attempting to make copies of an AnyValue instance that contains a non-copy-constructible type
 Cte::NoCopyConstructorError< T >Exception thrown when attempting to make copies of an AnyValue instance that contains an instance of non-copyable type T
 Cte::detail::AnyList< Hash, Compare >::MakeCopyTag
 Cstd::true_type [external]
 Cte::detail::is_any_set< AnySet< H, E, A > >
 Cte::detail::is_equality_comparable< T, std::enable_if_t< true, decltype((void)(std::declval< T >()==std::declval< T >())) > >
 Cte::detail::is_inequality_comparable< T, std::enable_if_t< true, decltype((void)(std::declval< T >() !=std::declval< T >()),(void) 0) > >
 CValue
 Cte::ConstValueHolder< Value, Tag, true >
 Cte::ValueHolder< Value, Tag, true >
 Cte::ValueHolder< Value, Tag, bool >
 Cte::ValueHolder< HashFn >
 Cte::detail::CompressedPairBase< HashFn >
 Cte::CompressedPair< HashFn, KeyEqual >
 Cte::AnySet< HashFn, KeyEqual, Allocator >AnySet is an associative container that contains a set of unique objects of any constructible type. Search, insertion, and removal have average constant-time complexity. Internally, the elements are not sorted in any particular order, but organized into buckets. Which bucket an element is placed into depends entirely on the hash of its value. This allows fast access to individual elements, since once a hash is computed, it refers to the exact bucket the element is placed into
 Cte::ValueHolder< KeyEqual >
 Cte::CompressedPair< HashFn, KeyEqual >
 Cte::ValueHolder< T >
 Cte::detail::CompressedPairBase< T >
 Cte::CompressedPair< T, U >
 Cte::ValueHolder< U >
 Cte::CompressedPair< T, U >
 Cte::ValueHolder< Value, Tag, false >