| ads::AdaptedIterator< _Iterator, IteratorCategory, ValueType, DifferenceType, Pointer, Reference > | A base class for all adapted iterators |
| ads::Address< Object > | A functor for taking the address of an object |
| ads::Array< N, T, A > | A multi-array of type T in N dimensions |
| ads::Array< 1, T, A > | A 1-D array of type T |
| ads::ArrayContainer< T, A > | The interface to the container representation of arrays |
| ads::ArrayIndexing< N, T > | The indexing interface to N-D arrays |
| ads::ArrayIndexing< 1, T > | The indexing interface to 1-D arrays |
| ads::ArrayIndexingBase< N > | The indexing interface to N-D arrays that is independent of the value type |
| ads::ArrayIndexingBase< 1 > | The indexing interface to 1-D arrays. Independent of the value type |
| ads::ArrayIndexIterator< N > | An index iterator for an array |
| ads::ArrayTypes< T > | Defines types for arrays |
| ads::ArrayWithNullHoles< T > | A 1-D array with holes |
| ads::binary_compose_binary_unary< F, G, H > | Binary function composition of a binary and unary functions: f(g(x),h(y)) |
| ads::binary_compose_unary_binary< F, G > | Binary function composition of a unary and binary function: f(g(x,y)) |
| ads::BinaryConstant< _FirstArgument, _SecondArgument, _Result > | Binary functor that returns a constant |
| ads::Dereference< Handle, Result > | A functor for dereferencing a handle |
| ads::EqualToByHandle< Handle > | Functor for equality comparison of objects by their handles |
| ads::EqualToByHandleHandle< Handle > | Functor for equality comparison of objects by handles to their handles |
| ads::Face_Halfedge_circ< Iterator > | Halfedge circulator for the halfedges around a face |
| ads::FixedArray< N, T > | A fixed size array with size N and type T |
| ads::FixedArray< 0, T > | Partial template specialization for N = 0 |
| ads::FixedArray< 1, T > | Partial template specialization for N = 1 |
| ads::FixedArray< 2, T > | Partial template specialization for N = 2 |
| ads::FixedArray< 3, T > | Partial template specialization for N = 3 |
| ads::GeneratorConstant< _Result > | Generator that returns a constant |
| ads::GeneratorConstant< void > | Generator that returns void |
| ads::GreaterByHandle< Handle > | Functor for greater than comparison of objects by their handles |
| ads::GreaterByHandleHandle< Handle > | Functor for greater than comparison of objects by handles to their handles |
| ads::GreaterEqualByHandle< Handle > | Functor for greater than or equal to comparison of objects by their handles |
| ads::GreaterEqualByHandleHandle< Handle > | Functor for greater than or equal to comparison of objects by handles to their handles |
| ads::HalfedgeDS< Vertex, Halfedge, Face > | A halfedge data structure |
| ads::HandleToPointer< Handle, Pointer > | A functor for converting handles to pointers |
| ads::HDSFace< HDS > | A face in a halfedge data structure |
| ads::HDSHalfedge< HDS > | A halfedge in a halfedge data structure |
| ads::HDSNode< HDS > | A node in a halfedge data structure |
| ads::HDSVertex< HDS > | A vertex in a halfedge data structure |
| ads::HeapHandleArray< DataConstIterator, HeapIterator > | A functor for getting handles into a heap |
| ads::Identity< T > | The identity functor |
| ads::IndexConstObject< Object > | Index a const object |
| ads::IndexIterator< N, T > | An index iterator |
| ads::IndexIteratorFunctor< RAIter > | Index the iterator |
| ads::IndexIterUnary< RAIter > | Unary function for indexing an iterator |
| ads::IndexObject< Object > | Index the object |
| ads::IndexRange< N, T > | An N-D index range class |
| ads::IndirectIterator< _Iterator > | An iterator that performs two dereferences in operator*() |
| ads::IndirectIterator2< _Iterator > | An iterator that performs three dereferences in operator*() |
| ads::IntIterator< T > | A random access iterator over an integer type |
| ads::IntSetSparse< T > | A set of integers |
| ads::less_composite< N, PointType > | Composite comparison of points |
| ads::LessByHandle< Handle > | Functor for less than comparison of objects by their handles |
| ads::LessByHandleHandle< Handle > | Functor for less than comparison of objects by handles to their handles |
| ads::LessEqualByHandle< Handle > | Functor for less than or equal to comparison of objects by their handles |
| ads::LessEqualByHandleHandle< Handle > | Functor for less than or equal to comparison of objects by handles to their handles |
| ads::LessThanCompareCoordinate< Point > | Less than comparison in a specified coordinate |
| ads::MemFunIterator< _Iterator, Pointee, Result, Const > | An iterator that calls a member function in operator*() |
| ads::NotEqualToByHandle< Handle > | Functor for inequality comparison of objects by their handles |
| ads::NotEqualToByHandleHandle< Handle > | Functor for inequality comparison of objects by handles to their handles |
| ads::ObjectAndBlankSpace< _Object, _BlankSpaceSize > | Useful for avoiding false sharing |
| ads::OrderedPair< T > | OrderedPair holds two objects of the same arbitrary type |
| ads::ParseOptionsArguments | Class for parsing command line options and arguments |
| ads::PriorityQueue< T, Key, GetKey, CompareKeys, Sequence > | A base class for priority queues |
| ads::PriorityQueueBinaryHeap< T, Key, GetKey, CompareKeys, Sequence > | A priority queue implemented with a binary heap |
| ads::PriorityQueueBinaryHeapArray< T, Key, GetKey, CompareKeys, Sequence > | A binary heap priority queue for the data in an array |
| ads::PriorityQueueBinaryHeapDynamicKeys< T, GetHandle, Key, GetKey, CompareKeys, Sequence > | A priority queue with dynamic keys implemented with a binary heap |
| ads::PriorityQueueBinaryHeapStoreKeys< T, Key, GetKey, CompareKeys, Sequence > | A priority queue implemented with a binary heap that stores the keys |
| ads::PriorityQueueCellArray< T, Key, GetKey, Container > | A priority queue utilizing a cell array |
| ads::Select1st< Pair > | Functor for selecting the first element of a pair |
| ads::Select2nd< Pair > | Functor for selecting the second element of a pair |
| ads::SelectElement< Sequence, N > | Functor for selecting an element of a sequence |
| ads::SparseArray< 1, T > | A sparse array of type T in 1 dimension |
| ads::SparseArray< 2, T > | A sparse array of type T in 2-D |
| ads::SparseArraySigned< 1, T > | A sparse array of type T in 1 dimension |
| ads::SquareMatrix< N, T > | An NxN matrix |
| ads::SquareMatrix< 1, T > | A 1x1 matrix |
| ads::SquareMatrix< 2, T > | A 2x2 matrix |
| ads::SquareMatrix< 3, T > | A 3x3 matrix |
| ads::StaticArrayOfArrays< T > | A static array of arrays |
| ads::SubtractiveRNG | Subtractive random number generator |
| ads::TensorTypes< T > | A base class that defines types for all tensors |
| ads::Timer | A timer that measures ellapsed time in seconds |
| ads::TransformIterator< _Iterator, _Transform > | A transform iterator |
| ads::Triplet< T1, T2, T3 > | Triplet holds three objects of arbitrary type |
| ads::TrivialAssignable | A trivial assignable object |
| ads::TrivialOutputIterator | A trivial output iterator |
| ads::TrivialOutputIteratorCount | A trivial output iterator that counts assignments |
| ads::unary_compose_binary_unary< F, G, H > | Unary function composition of a binary and unary functions: f(g(x),h(x)) |
| ads::unary_compose_unary_unary< F, G > | Unary function composition of two unary functions: f(g(x)) |
| ads::UnaryConstant< _Argument, _Result > | Unary functor that returns a constant |
| ads::UnaryLinear< T > | Linear functor |
| ads::UniformRandom< T > | Uniformly distributed random numbers |
| ads::UniformRandom< char > | Uniform random number generator for char |
| ads::UniformRandom< double > | Uniform random number generator for double |
| ads::UniformRandom< float > | Uniform random number generator for float |
| ads::UniformRandom< int > | Uniform random number generator for int |
| ads::UniformRandom< long double > | Uniform random number generator for long double |
| ads::UniformRandom< short > | Uniform random number generator for short |
| ads::UniformRandom< signed char > | Uniform random number generator for signed char |
| ads::UniformRandom< unsigned char > | Uniform random number generator for unsigned char |
| ads::UniformRandom< unsigned int > | Uniform random number generator for unsigned int |
| ads::UniformRandom< unsigned short > | Uniform random number generator for usigned short |
| ads::UniformRandomBase | The base class manages the subtractive random number generator |
| ads::UniformRandomInteger< T > | Implementation for integer types |
| ads::UniformRandomPoint< N, T > | Uniform random points in N-D |
| ads::UniformRandomReal< T > | Implementation for real (floating point) number types |
| ads::xless_composite< PointType > | Compare x coordinate using the composite number (x,y,z) |
| ads::yless_composite< PointType > | Compare y coordinate using the composite number (y,z,x) |
| ads::zless_composite< PointType > | Compare z coordinate using the composite number (z,x,y) |
