Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

ash::Bench	A lightweight stopwatch class for benchmarking
ash::const_table_iterator< Table >	Const iterator type used by sparse_group & sparse_table
ash::const_two_d_iterator< Container >	2D const iterator used by sparse_table
ash::dense_hashgrid< Coord, Data, Alloc >	A hashgrid with dense_hashtable as a backend
ash::dense_hashlist< Key, Data, HashFx, EqualKey, Alloc >	A hashlist with dense_hashtable as a backend
ash::dense_hashmap< Key, Data, HashFx, EqualKey, Alloc >	A STL-like hashmap with dense_hashtable as the backend
ash::dense_hashmatrix< Coord, Data, Alloc >	A hashmatrix with dense_hashtable as a backend
ash::dense_hashset< Value, HashFx, EqualKey, Alloc >	A STL-like hashset with dense_hashtable as the backend
ash::dense_hashtable< Value, Key, HashFx, KeyAccess, EqualKey, TblAlloc >	Hash table class from the google-sparsehash package, optimized for speed
ash::destructive_two_d_iterator< Container >	Destructive iterator used by sparse_table
ash::f_access_node< Node, KeyAccess >	Key access functor for nodes
ash::f_first< Key, Data >	Key access functor for pair-associative containers
ash::f_interleave< D, U >	Functor for interleaving bits
ash::f_self< Key >	Key access functor for simple-associative containers
ash::f_uninterleave< D, U >	Functor for un-interleaving bits
ash::geometric_path_iterator< Nav, _D >	The base class for hashgrid::path_iterator and hashgrid::const_path_iterator
ash::geometric_path_iterator< Nav, DIM_3D >	The base class for hashgrid::path_iterator and hashgrid::const_path_iterator
ash::geometric_range_iterator< Nav, _D >	The base class for hashgrid::range_iterator and hashgrid::const_range_iterator
ash::geometric_range_iterator< Nav, DIM_3D >	The base class for hashgrid::range_iterator and hashgrid::const_range_iterator
ash::GlobalSeed< N, M, MATRIX_A >	Global random number seeder
ash::hash< T >	Hash functor
ash::hash< std::basic_string< Ch > >	Hash functor - spec for strings
ash::hashgraph	A base class which adds a graph layer to a hashtable
ash::hashgraph::const_iterator	The const type used to iterate through the contents of the container.
ash::hashgraph::const_navigator	The hashgraph's const_navigator
ash::hashgraph::iterator	The type used to iterate through the contents of the container.
ash::hashgraph::navigator	The hashgraph's navigator
ash::hashgrid	A hashgraph implemented as a spatial grid
ash::hashgrid::const_navigator	The const type used to move around the grid in an arbitrary manner.
ash::hashgrid::navigator	The type used to move around the grid in an arbitrary manner.
ash::hashlist	A hashgraph implemented as a list
ash::hashlist::const_iterator	The const type used to iterate through the contents of the container.
ash::hashlist::iterator	The type used to iterate through the contents of the container.
ash::hashmatrix	The base class for dense_hashmatrix and sparse_hashmatrix
ash::hashmatrix::const_iterator	The const type used to iterate through the contents of the container.
ash::hashmatrix::const_local_iterator	The const type used to iterate through a set of elements that share a hash code.
ash::hashmatrix::const_navigator	The const type used to move around the matrix in an arbitrary manner.
ash::hashmatrix::const_path_iterator	The const type used to iterate through a group of objects along a path.
ash::hashmatrix::const_range_iterator	The const type used to iterate through a group of contiguous objects.
ash::hashmatrix::iterator	The type used to iterate through the contents of the container.
ash::hashmatrix::local_iterator	The type used to iterate through a set of elements that share a hash code.
ash::hashmatrix::navigator	The type used to move around the matrix in an arbitrary manner.
ash::hashmatrix::path_iterator	The type used to iterate through a group of objects along a path.
ash::hashmatrix::range_iterator	The type used to iterate through a group of contiguous objects.
ash::m_ilv< U, v, d, i >	Interleave meta
ash::m_ilv< U, v, d, d >	Spec to stop recursion after all components
ash::m_log2< U, v >	Binary logarithm meta
ash::m_pow< T, x, n >	Power meta: value = x ^ n
ash::m_pow< T, x, 0 >	Stop recursion for x ^0: value = 1
ash::m_strip_lsb< T, x >	Isolate the least significant bit
ash::m_strip_msb< T, x, l >	Isolate the most significant bit
ash::m_strip_msb< T, v, v >	Stop recursion when there's only 1 bit left
ash::m_uilv< U, v, d, i >	Un-interleave meta
ash::m_uilv< U, v, d, d >	Spec to stop recursion after all components
ash::Morton< D, U >	Meta to get a morton type with the dimension as a template parameter
ash::Morton< DIM_3D, U >	Spec for 3D
ash::morton_hasher< M >	Type-sensitive hash functor for morton-keyed hash containers
ash::MortonXY< U >	A data type for dealing with an interleaved 2D coordinate
ash::MortonXYZ< U >	A data type for dealing with an interleaved 3D coordinate
ash::move_node< Node >	Move functor for graph/grid containers
ash::move_node< graph_node< Value, N > >	Spec for graph container
ash::move_node< grid_node< Value, D > >	Spec for grid container
ash::move_node< list_node< Value > >	Spec for list container
ash::move_trivial< T >	Move functor that does nothing
ash::PCoord< D, U >	Meta to get a pcoord type with the dimension as a template parameter
ash::PCoord< DIM_3D, U >	Spec for 3D
ash::PCoordXY< U >	A coordinate packed for fast conversion to and from MortonXY
ash::PCoordXYZ< U >	A coordinate packed for fast conversion to and from MortonXYZ
ash::Point< D >	No-frills floating-point coordinate
ash::Point< DIM_2D >	No-frills floating-point coordinate
ash::Random< T, Global, S, I, F >	Auto-seeded random number generator
ash::Random< T, Global, 32, false, true >	Spec for 32-bit float
ash::Random< T, Global, 64, true, false >	Spec for 64-bit integral types
ash::Random< T, Global, S, false, true >	Spec for floating-point types
ash::Random< T, Global, S, true, false >	Spec for integral types
ash::Seed< N, M, MATRIX_A >	Random number seeder
ash::sparse_group< Val, GroupSz, TblAlloc >	A subset of a sparse_table
ash::sparse_hashgrid< Coord, Data, Alloc >	A hashgrid with sparse_hashtable as a backend
ash::sparse_hashlist< Key, Data, HashFx, EqualKey, Alloc >	A hashlist with sparse_hashtable as a backend
ash::sparse_hashmap< Key, Data, HashFx, EqualKey, Alloc >	A STL-like hashmap with sparse_hashtable as the backend
ash::sparse_hashmatrix< Coord, Data, Alloc >	A hashmatrix with sparse_hashtable as a backend
ash::sparse_hashset< Value, HashFx, EqualKey, Alloc >	A STL-like hashset with sparse_hashtable as the backend
ash::sparse_hashtable< Value, Key, HashFx, KeyAccess, EqualKey, TblAlloc >	Hash table class from the google-sparsehash package, optimized for frugal memory use
ash::sparse_table< Val, GroupSz, TblAlloc >	A container that implements a sparse array
ash::table_element_adaptor< Table >	An adaptor for lazy insertions into a sparse table
ash::table_iterator< Table >	Iterator type used by sparse_group & sparse_table
ash::trait::add_const< T >	Meta to add const
ash::trait::add_const< T & >	Spec for reference
ash::trait::add_const< T * >	Spec for pointer
ash::trait::has_trivial_assign< T >	Meta to test for types with trivial assignment operators
ash::trait::has_trivial_assign< A[N]>	Spec for std::pair
ash::trait::has_trivial_assign< std::pair< T, U > >	Spec for std::pair
ash::trait::has_trivial_constructor< T >	Meta to test for types with trivial constructors
ash::trait::has_trivial_constructor< A[N]>	Spec for arrays
ash::trait::has_trivial_constructor< const T >	Spec for const
ash::trait::has_trivial_constructor< std::pair< T, U > >	Spec for std::pair
ash::trait::has_trivial_copy< T >	Meta to test for types with trivial copy constructors
ash::trait::has_trivial_copy< A[N]>	Spec for arrays
ash::trait::has_trivial_copy< const T >	Spec for const
ash::trait::has_trivial_copy< std::pair< T, U > >	Spec for std::pair
ash::trait::has_trivial_destructor< T >	Meta to test for types with trivial destructors
ash::trait::has_trivial_destructor< A[N]>	Spec for arrays
ash::trait::has_trivial_destructor< const T >	Spec for const
ash::trait::has_trivial_destructor< std::pair< T, U > >	Spec for std::pair
ash::trait::integral_constant< T, v >	Wrapper for an integer value
ash::trait::is_convertible< From, To >	Meta to test if a type is convertible to another type
ash::trait::is_floating_point< T >	Meta to test for built-in floating-point types
ash::trait::is_floating_point< double >	Spec for double
ash::trait::is_floating_point< float >	Spec for float
ash::trait::is_floating_point< long double >	Spec for long double
ash::trait::is_integral< T >	Meta to test for built-in integer types
ash::trait::is_integral< bool >	Spec for bool
ash::trait::is_integral< char >	Spec for char (not explicitly signed or unsigned)
ash::trait::is_integral< int >	Spec for int
ash::trait::is_integral< long >	Spec for long
ash::trait::is_integral< short >	Spec for short
ash::trait::is_integral< signed char >	Spec for signed char
ash::trait::is_integral< unsigned char >	Spec for unsigned char
ash::trait::is_integral< unsigned int >	Spec for unsigned int
ash::trait::is_integral< unsigned long >	Spec for unsigned long
ash::trait::is_integral< unsigned short >	Spec for unsigned short
ash::trait::is_pod< T >	Meta to test for built-in POD types
ash::trait::is_pod< const T >	Spec for const
ash::trait::is_pointer< T >	Meta to test for pointer types
ash::trait::is_pointer< T * >	Spec for pointer
ash::trait::is_reference< T >	Meta to test for reference types
ash::trait::is_reference< T & >	Spec for reference
ash::trait::is_same< T1, T2 >	Meta to test if 2 types are the same
ash::trait::is_same< T, T >	Spec for the same
ash::trait::is_scalar< T >	Meta to test for built-in scalar types
ash::trait::is_signed< T, bool, bool >	Meta to test for signed types
ash::trait::is_signed< T, false, true >	Spec for floating-point types
ash::trait::is_signed< T, true, false >	Spec for integral types
ash::trait::is_unsigned< T >	Meta to test for unsigned types
ash::trait::remove_const< T >	Meta to remove const
ash::trait::remove_const< T const >	Spec for const
ash::trait::remove_cv< T >	Meta to remove const volatile
ash::trait::remove_pointer< T >	Meta to remove pointer
ash::trait::remove_pointer< T * >	Spec for pointer
ash::trait::remove_pointer< T *const >	Spec for const pointer
ash::trait::remove_pointer< T *const volatile >	Spec for const volatile pointer
ash::trait::remove_pointer< T *volatile >	Spec for volatile pointer
ash::trait::remove_reference< T >	Meta to remove reference
ash::trait::remove_reference< T & >	Spec for reference
ash::trait::remove_volatile< T >	Meta to remove volatile
ash::trait::remove_volatile< T volatile >	Spec for volatile
ash::trait::tag::binary_type_trait< T1, T2 >	Test for type relations
ash::trait::tag::conversion_type_trait< From, To >	Test for type conversion relations
ash::trait::tag::transformation_type_trait< T >	Modify a type
ash::trait::tag::unary_type_trait< T >	Test for type traits
ash::trait::trivial< T >	Meta to do nothing
ash::trait::trivial< T & >	Spec for reference
ash::trait::trivial< T * >	Spec for pointer
ash::trait::unsigned_constant< U, v >	Wrapper for an unsigned value
ash::two_d_iterator< Container >	2D iterator used by sparse_table
ash::typelist::contains< TL, T, L >	Recursive checker to see if a typelist contains a given type
ash::typelist::contains< TL, T, 0 >
ash::typelist::empty	The type used to represent an unspecified typelist entry
ash::typelist::find< TL, T, F, C >	Recursive search for the index of a type in a typelist
ash::typelist::find< TL, T, F, false >	Spec for type not found
ash::typelist::find< TL, T, true, true >	Ends the recursion, found our type
ash::typelist::get< TL, E, C >	Recursive extractor for types in a typelist
ash::typelist::get< TL, E, E >	Ends the recursion, at this point we're at the type we want
ash::typelist::list< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, TA, TB, TC, TD, TE, TF >	A list of up to 16 types
ash::typelist::list< empty, empty, empty, empty, empty, empty, empty, empty, empty, empty, empty, empty, empty, empty, empty, empty >
ash::typelist::merge< TL1, TL2, L >	Combine a pair of typelists
ash::typelist::merge< TL1, TL2, 0 >	End the recursion, we're done
concept::ash::basic_navigator	Basic Navigator concept
concept::ash::graph_navigator	Graph Navigator concept
concept::ash::grid_navigator	Grid Navigator concept
concept::ash::hash_graph	Hash-Graph concept
concept::ash::hash_grid	Hash-Grid concept
concept::ash::hash_list	Hash-List concept
concept::ash::hash_matrix	Hash-Matrix concept
concept::ash::matrix_navigator	Matrix Navigator concept
concept::ash::morton	Morton concept
concept::ash::pcoord	Packed Coord concept
concept::stl::arbitrary	No requirements
concept::stl::assignable	Assignable concept
concept::stl::associative_container	Associative Container concept
concept::stl::back_insertion_sequence	Back Insertion Sequence concept
concept::stl::bidirectional_iterator	Bidirectional Iterator concept
concept::stl::container	Container concept
concept::stl::default_constructible	Default Constructible concept
concept::stl::equality_comparable	Equality Comparable concept
concept::stl::forward_container	Forward Container concept
concept::stl::forward_iterator	Forward Iterator concept
concept::stl::front_insertion_sequence	Front Insertion Sequence concept
concept::stl::hashed_associative_container	Hashed Associative Container concept
concept::stl::input_iterator	Input Iterator concept
concept::stl::less_than_comparable	Less-than Comparable concept
concept::stl::list	List concept
concept::stl::multiple_associative_container	Multiple Associative Container concept
concept::stl::multiple_hashed_associative_container	Multiple Hashed Associative Container concept
concept::stl::multiple_sorted_associative_container	Multiple Sorted Associative Container concept
concept::stl::output_iterator	Output Iterator concept
concept::stl::pair_associative_container	Pair Associative Container concept
concept::stl::random_access_container	Random Access Container concept
concept::stl::random_access_iterator	Random Access Iterator concept
concept::stl::reversible_container	Reversible Container concept
concept::stl::sequence	Sequence concept
concept::stl::simple_associative_container	Simple Associative Container concept
concept::stl::sorted_associative_container	Sorted Associative Container concept
concept::stl::trivial_iterator	Trivial Iterator concept
concept::stl::unique_associative_container	Unique Associative Container concept
concept::stl::unique_hashed_associative_container	Unique Hashed Associative Container concept
concept::stl::unique_sorted_associative_container	Unique Sorted Associative Container concept
concept::tr1::unordered_associative_container	TR1 Unordered Associative Container concept