This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 123]

Chxconstexpr_list< T, deleter_t_ >::const_iterator	const_iterator - Bidirectional iterator over const nodes
Chxconstexpr_list< T, deleter_t_ >::iterator	iterator - Bidirectional iterator over mutable nodes
Chxdeque< T, capacity_ >::const_iterator	const_iterator - A const random-access iterator over logical indices
Chxdeque< T, capacity_ >::iterator	iterator - A mutable random-access iterator over logical indices
Chxflat_map< key_t_, mapped_t_, compare_t_, multi_t_, capacity_ >::const_iterator	const_iterator - A random-access iterator over key-value pairs
Chxflat_map< key_t_, mapped_t_, compare_t_, multi_t_, capacity_ >::iterator	iterator - A mutable random-access iterator that allows modifying the mapped value
Chxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >::const_iterator	const_iterator - A const forward iterator over the elements of the hash table
Chxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >::iterator	iterator - A mutable iterator that can modify the elements of the hash table
Chxlist< T, deleter_t_ >::const_iterator	const_iterator - Bidirectional iterator over const nodes
Chxlist< T, deleter_t_ >::iterator	iterator - Bidirectional iterator over mutable nodes
Cdeleter_t
Chxptr< T, deleter_t >
Chxfree_list< T, capacity_ >::deleter_t	deleter_t - A callable deleter that releases a T back to this hxfree_list
Chxallocator< T, fixed_capacity_ >	hxallocator<1+> - Provides static allocation when capacity is greater than zero
Chxallocator< key_t_, hxallocator_dynamic_capacity >
Chxflat_set< key_t_, compare_t_, multi_t_, capacity_ >	hxflat_set - A sorted associative container that stores keys in a single array
Chxallocator< T, 1 >
Chxexpected< T, E_ >	hxexpected<T, E=bool> - Holds either a value of type T or an error of type E
Chxallocator< T, hxallocator_dynamic_capacity >	hxallocator<0> - Capacity is set by first call to reserve_storage and may not be extended
Chxarray< T, capacity_ >	hxarray - Implements std::array with a few things added
Chxdeque< T, capacity_ >	hxdeque - A fixed-capacity deque backed by a power-of-two ring buffer
Chxfree_list< T, capacity_ >	hxfree_list - A fixed-capacity pool of T managed by a singly linked free list
Chxvector< T, capacity_ >	hxvector - Implements std::vector, std::inplace_vector and std::back_insert_iterator with a few things added and a few things unimplemented
Chxbitset< bit_count_ >	hxbitset - A fixed-size bitset stored as an array of size_t words with no heap allocation
Chxcondition_variable	hxcondition_variable - std::condition_variable style condition variable wrapper for the configured thread backend
Chxconsteval_delete	hxconsteval_delete - A constexpr-compatible deleter that uses ::delete
Chxconstexpr_list_node	hxconstexpr_list_node - Intrusive doubly linked list node base
Chxdefault_delete	hxdefault_delete - A callable that deletes objects of type T using hxdelete
Chxconstexpr_list< T, deleter_t_ >	hxconstexpr_list - An intrusive doubly linked list that takes ownership of nodes via a deleter_t callable, defaulting to hxdefault_delete
Chxhandle_table< T, deleter_t_, table_size_bits_ >	hxhandle_table - A table that maps 64-bit handles to owned pointers without reallocating memory or moving values
Chxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >	hxhash_table - A hash table that operates without reallocating memory or copying data
Chxlist< T, deleter_t_ >	hxlist - An intrusive doubly linked list that takes ownership of nodes via a deleter_t callable, defaulting to hxdefault_delete
Chxptr< T, deleter_t_ >	hxptr<T, deleter_t> - A unique owning pointer
Chxdo_not_delete	hxdo_not_delete - A version of hxdefault_delete that does not delete the object
Chxfalse_t	hxfalse_t - Implements std::false_type
Chxfile	hxfile - Single-ownership C++ RAII abstraction for file I/O
Chxflat_map< key_t_, mapped_t_, compare_t_, multi_t_, capacity_ >	hxflat_map - A sorted associative container that stores keys and mapped values in two parallel arrays
Chxflat_map_const_value_t< key_t_, mapped_t_ >	hxflat_map_const_value_t - A proxy referencing the key and mapped value at a fixed position, returned by dereferencing an hxflat_map's const_iterator
Chxflat_map_value_t< key_t_, mapped_t_ >	hxflat_map_value_t - A proxy referencing the key and mapped value at a fixed position, returned by dereferencing an hxflat_map's iterator
Chxhash_node_base	hxhash_node_base - Intrusive hash-chain node base
Chxhash_table_set_node< const char * >
Chxhash_table_node_string< allocator_ >	hxhash_table_node_string - Subclass of hxhash_table_set_node for C strings
Chxhash_table_node_string_literal	hxhash_table_node_string_literal - Subclass of hxhash_table_set_node for static C strings
Chxhash_table_node_integer< key_t_ >	hxhash_table_node_integer - node_t for use with hxhash_table for integer types
Chxhash_table_set_node< key_t_ >	hxhash_table_set_node - Optional base class for unordered set entries
Chxhash_table_map_node< key_t_, value_t_ >	hxhash_table_map_node - Base class for unordered map entries
Chxhash_table_base_
Chxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >	hxhash_table - A hash table that operates without reallocating memory or copying data
Chxkey_equal_t< T, enabled_t >	hxkey_equal_t<T> - A constexpr callable that returns true if two objects are equivalent
Chxkey_equal_t< hxarray< T, capacity_ > >	hxkey_equal_t<hxarray<T, N>> - Compares the contents of x and y for equivalence
Chxkey_equal_t< hxexpected< T, E_ > >	hxkey_equal_t<hxexpected<T, E>> - Compares x and y for equivalence
Chxkey_equal_t< hxptr< T, deleter_t_ > >	hxkey_equal_t<hxptr<T>> - Compares x and y for equivalence
Chxkey_equal_t< hxref< T > >	hxkey_equal_t<hxref<T>> - Compares x and y for equivalence
Chxkey_equal_t< hxvector< T, capacity_x_ > >	hxkey_equal_t<hxvector<T>> - Compares the contents of x and y for equivalence
Chxkey_equal_t< T, hxenable_if_t< hxis_string< T >()> >	hxkey_equal_t<T> for a C string pointer T - Compares two C strings with strcmp(a, b) == 0
Chxkey_hash_t< T, enabled_t >	hxkey_hash_t<T> - A callable that returns the xxhash32 of a numeric value cast to 32 bits
Chxkey_hash_t< hxarray< T, capacity_ > >	hxkey_hash_t<hxarray<T, N>> - Returns a hash mixing the hashes of every element in order
Chxkey_hash_t< hxexpected< T, E_ > >	hxkey_hash_t<hxexpected<T, E>> - Returns the hash of the contained value if non-null, otherwise 31u
Chxkey_hash_t< hxptr< T, deleter_t_ > >	hxkey_hash_t<hxptr<T>> - Returns the hash of the owned value if non-null, otherwise 31u
Chxkey_hash_t< hxref< T > >	hxkey_hash_t<hxref<T>> - Returns the hash of the referenced value if non-null, otherwise 31u
Chxkey_hash_t< hxvector< T, capacity_x_ > >	hxkey_hash_t<hxvector<T>> - Returns a hash mixing the hashes of every element in order
Chxkey_hash_t< T, hxenable_if_t< hxis_string< T >()> >	hxkey_hash_t<T> for a C string pointer T - Returns the xxhash32 style hash of a C string
Chxkey_less_t< T, enabled_t >	hxkey_less_t<T> - A constexpr callable that returns true if the first object is less than the second
Chxkey_less_t< hxarray< T, capacity_ > >	hxkey_less_t<hxarray<T, N>> - Compares the contents of x and y lexicographically using hxkey_equal_t and hxkey_less_t on each element
Chxkey_less_t< hxvector< T, capacity_x_ > >	hxkey_less_t<hxvector<T>> - Compares the contents of x and y lexicographically using hxkey_equal_t and hxkey_less_t on each element
Chxkey_less_t< T, hxenable_if_t< hxis_string< T >()> >	hxkey_less_t<T> for a C string pointer T - Returns true if the first C string is lexicographically less than the second by ASCII
Chxlist_node	hxlist_node - Intrusive doubly linked list node base
Chxmemory_manager_stats	hxmemory_manager_stats - The utilization statistics reported by hxmemory_manager_utilization
Chxminmax_result< iterator_t_ >	hxminmax_result - Return type of hxminmax holding iterators to the minimum and maximum elements of a range
Chxmutex	hxmutex - std::mutex style wrapper for the configured threading backend
Chxnil_t	hxnil_t - A class that will only convert to a null T pointer or a null hxhandle_t
Chxradix_sort_key< key_t_, value_t_ >	hxradix_sort_key - A key-value pair used with hxradix_sort
Chxrandom	hxrandom - 64-bit MMIX LCG
Chxrange< iterator_t_ >	hxrange - Wraps an iterator pair [begin, end) for use with algorithms on that pair
Chxref< T >	hxref<T> - Holds a reference to a value of type T, or null
Chxsettings_t	hxsettings_t - Constructed by first call to hxinit which happens when on or before the system memory allocators construct
Chxslot_map< T, table_size_bits_ >	hxslot_map - A table that maps 64-bit generational handles to values kept in a contiguous array of size 2^table_size_bits - 1 without reallocating memory
Chxsystem_allocator_scope	hxsystem_allocator_scope - An RAII class to set the current memory manager allocator for the current scope
Chxtask	hxtask - Pure virtual base class for operations to be performed on a different thread or at a later time
Chxtask_dag_node< max_successors_ >	hxtask_dag_node<max_successors> - A hxtask subclass that implements DAG dependency tracking as a layer on top of hxtask_queue
Chxtask_queue	hxtask_queue - Provides a priority queue of tasks and a worker thread pool
Chxthread	hxthread - std::thread style thread wrapper for the configured backend
Chxthread_local< T >	hxthread_local - Provides thread-local storage for an integer or a pointer
Chxtrue_t	hxtrue_t - Implements std::true_type
Chxunique_lock	hxunique_lock - std::unique_lock style RAII-style unique lock for hxmutex
Chxtask_queue::record_t	record_t - Iterated over by all_of, any_of, erase_if and for_each
Ctesting::Test	Test - Base class for tests required by Google Test's TEST_F