Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
pm::AccurateFloatMinimalistic wrapper for MPFR numbers
pm::Array< E, SharedParams >Container class with constant time random access
pm::attrib< C >
pm::BitsetContainer class for dense sets of integers
pm::color_errorAn exception of this type is thrown by an attempt to assign a wrong value to some color component
pm::Complement< _Set, E, Comparator >Complement as GenericSet
pm::conv< From, To >
pm::conv< T, T >Trivial conversion of a type to itself
pm::graph::EdgeMap< dir, E, Params >Data structure to store data at the edges of a Graph
pm::EquivalenceRelationAn equivalence relation on the integers `0,..,n-1` for a given size `n`
pm::GMP::errorException type A constructor of Integer or Rational from const char* throws an exception of this type in case of a syntax error
pm::FaceMap< Traits >
pm::FacetList
pm::FixedVector< E, _size >Built-in array decorated as a vector
pm::function_argument< T >
pm::GenericGraph< _Graph, _dir >Generic type for all graph classes
pm::GenericMutableSet< _Set, E, Comparator >Generic type for ordered mutable sets
pm::GenericSet< _Set, E, Comparator >Generic type for ordered sets
pm::GenericVector< _Vector, E >
pm::graph::Graph< _dir >Directed or undirected finite graphs
pm::Heap< Key, Params >
pm::HeapConstructorMetaconstructor for this heap implementation
pm::HSVColor description in HSV space
pm::if_else< Cond, Then, Else >
pm::ignore< T, Expected >Masquerade class for suppressing I/O and conversion
pm::IncidenceMatrix< symmetric >0/1 incidence matrix
pm::IntegerWrapper class for GMP's mpz_t type
pm::Integer::div_tAnalogous to div_t
pm::iterator_product< Iterator1, Iterator2, _has_state1, _has_state2 >
std::iterator_traits< back_insert_iterator< Container > >
pm::list_search< First, Second, Predicate >
pm::list_search_all< First, Second, Predicate >
pm::Map< K, D, Comparator >Associative array based on AVL::tree
pm::Matrix< E >Matrix type class which holds the elements in a contiguous array
pm::merge_list< First, Second, Predicate >
pm::GMP::NaNException type: "not a number"
pm::no_match
pm::face_map::node< Traits >
pm::AVL::node< K, D >
pm::AVL::node_accessor_impl< NodeRef, _no_data >
pm::graph::NodeMap< dir, E, Params >Data structure to store data at the nodes of a Graph
pm::nothingStructure denoting the absence of data
pm::output_predicate_selector< Iterator, Predicate >
pm::permutation_iterator< permutations_heap >Implementation of the Heap's algorithm by R. Sedgewick
pm::AVL::Ptr< Node >Pointer class
pm::ptr_wrapper< T >
pm::RandomSpherePoints< Num >Generator of uniformly distributed random points on the unit sphere in R^d
pm::RationalA class for rational numbers
pm::RGBColor description in RGB space: Red-Green-Blue additive color model
pm::Set< E, Comparator >An associative container based on a balanced binary search (AVL) tree. Comparator is a functor defining a total ordering on the element value domain. In the most cases, the default choice (lexicographical order) will suffice for your needs
pm::shared_array< Object, Params >
pm::shared_array< Object, Params >::repAttached objects plus housekeeping
pm::shared_object< Object, Params >
pm::shared_pointer< Object, Params >
pm::SingleElementSet< E >Singleton as GenericSet
pm::size_discriminant< n >Derivation and conversion tests due to Andrei Alexandrescu
pm::SparseMatrixStatistics< E >Sparse matrix statistics collection
pm::SparseVector< E, Predicate >
pm::facet_list::TableAbstraction of FacetList
pm::AVL::tree< Traits >Balanced binary search tree
pm::UniformlyRandom< AccurateFloat >Generator of random AccurateFloat numbers from [0, 1)
pm::UniformlyRandom< Bitset >Generator of random Bitset of a given maximal cardinality
pm::UniformlyRandom< Rational >
pm::unlimited
pm::Vector< E >Vector type class which holds the elements in a contiguous array
pm::GMP::ZeroDivideException type: "division by zero"
Generated on Wed Mar 30 23:31:30 2011 for Polymake Template Library (PTL) by doxygen 1.5.6