Polymake Template Library (PTL) 4.12
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 12345]
 Cpm::AccurateFloatMinimalistic wrapper for MPFR numbers
 Cpolymake::AnyString
 Cpm::Array< E, SharedParams >Container class with constant time random access
 Cpm::Array< Int >
 Cpm::Array< std::string >
 Cpolymake::cleanOperations::assign< Operation >
 Cpm::attrib< C >
 Cpm::attrib< masquerade2< Masquerade, OrigRef, Second >::type >
 Cpm::attrib< masquerade3< Masquerade, OrigRef, Second, Third >::type >
 Cpm::attrib< masquerade< Masquerade, OrigRef >::type >
 Cpm::attrib< masquerade_add_features< ContainerRef, Features >::type >
 Cpm::attrib< Orig >
 Cpm::attrib< Result >
 Cpm::attrib< SetRef >
 Cpm::attrib< T >
 Cpm::attrib< TMapRef >
 Cpolymake::cleanOperations::can< Operation, T1, T2, is_defined >Check whether the given elementary operation is defined for given argument types
 Cpolymake::cleanOperations::can< Operation, E, E2 >
 Cpolymake::cleanOperations::can< Operation, E, T >
 Cpm::chunk_allocatorMaintains a list of private memory chunks of fixed size
 Cpm::operations::cmp
 Cpm::operations::cmp_unorderedComparator only checking for equality, should not be used for sets and other structures requiring total ordering
 Cpm::Div< T >Result of integer division of two numbers (a,b)
 Cpm::graph::EdgeMap< TDir, E, TParams >Data structure to store data at the edges of a Graph
 Cpm::EquivalenceRelationAn equivalence relation on the integers 0,..,n-1 for a given size n
 Cstd::exceptionSTL class
 Cpm::ExtGCD< T >Result of the extended gcd calculation for two numbers (a, b)
 Cpm::FaceMap< Traits >
 Cpm::FacetList
 Cpm::first_of_equalSpecial tags for find_nearest denoting the first and last occurrence of a given key in a multi-set
 Cpm::function_argument< T >
 Cpm::function_argument< T & >
 Cpm::GenericGraph< TGraph, dir_val >Generic type for all graph classes
 Cpm::GenericGraph< Graph< TDir >, TDir >
 Cpm::GenericGraph< IndexedSubgraph< GraphRef, SetRef, mlist<> >, deref< GraphRef >::type::dir >
 Cpm::GenericGraph< Wary< graph::Graph< TDir > >, TGraph::dir >
 Cpm::GenericGraph< Wary< TGraph >, TGraph::dir >
 Cpm::GenericMatrix< TMatrix, E >Generic type for matrices
 Cpm::GenericMatrix< AdjacencyMatrix< TGraph, true >, Int >
 Cpm::GenericMatrix< BlockDiagMatrix< MatrixRef1, MatrixRef2, true >, deref< MatrixRef1 >::type::element_type >
 Cpm::GenericMatrix< DiagMatrix< VectorRef, true >, deref< VectorRef >::type::element_type >
 Cpm::GenericMatrix< LazyMatrix1< MatrixRef, Operation >, lazy1_traits< MatrixRef, Operation >::element_type >
 Cpm::GenericMatrix< LazyMatrix2< MatrixRef1, MatrixRef2, Operation >, lazy2_traits< MatrixRef1, MatrixRef2, Operation >::element_type >
 Cpm::GenericMatrix< ListMatrix< TVector >, TVector::element_type >
 Cpm::GenericMatrix< Matrix< E >, E >
 Cpm::GenericMatrix< MatrixProduct< MatrixRef1, MatrixRef2 >, lazy_product_traits< MatrixRef1, MatrixRef2 >::element_type >
 Cpm::GenericMatrix< PermutationMatrix< PermutationRef, Int >, Int >
 Cpm::GenericMatrix< RepeatedCol< VectorRef >, pure_type_t< VectorRef >::element_type >
 Cpm::GenericMatrix< RepeatedRow< VectorRef >, pure_type_t< VectorRef >::element_type >
 Cpm::GenericMatrix< SameElementMatrix< ERef >, pure_type_t< ERef > >
 Cpm::GenericMatrix< SameElementSparseMatrix< IncMatrixRef, ElemRef >, object_traits< deref< ElemRef >::type >::persistent_type >
 Cpm::GenericMatrix< SparseMatrix< E, symmetric >, E >
 Cpm::GenericSet< Top, E, Comparator >Generic type for ordered sets
 Cpm::GenericSet< Bitset, Int, operations::cmp >
 Cpm::GenericSet< Complement< SetRef >, Int, operations::cmp >
 Cpm::GenericSet< element< Traits >, Traits::key_type, Traits::key_comparator_type >
 Cpm::GenericSet< Facet, Int, operations::cmp >
 Cpm::GenericSet< incidence_line< TreeRef >, Int, operations::cmp >
 Cpm::GenericSet< IncidenceLineChain< ContainerList >, Int, operations::cmp >
 Cpm::GenericSet< IndexedSubset< ContainerRef1, ContainerRef2, Params >, E, Comparator >
 Cpm::GenericSet< Indices< ContainerRef >, Int, operations::cmp >
 Cpm::GenericSet< Keys< TMap >, TMap::key_type, TMap::key_comparator_type >
 Cpm::GenericSet< LazySet2< sequence, SetRef, set_difference_zipper >, deref< sequence >::type::element_type, deref< sequence >::type::element_comparator >
 Cpm::GenericSet< LazySet2< SetRef1, SetRef2, Controller >, deref< SetRef1 >::type::element_type, deref< SetRef1 >::type::element_comparator >
 Cpm::GenericSet< LexOrdered, fl_internal::Facet::persistent_type, operations::cmp >
 Cpm::GenericSet< node_container< TDir >, Int, operations::cmp >
 Cpm::GenericSet< Nodes< TGraph >, Int, operations::cmp >
 Cpm::GenericSet< OrderedContainer< Container, operations::cmp, mlist<> >, object_traits< Container::value_type >::persistent_type, operations::cmp >
 Cpm::GenericSet< SameElementIncidenceLine< elem >, Int, operations::cmp >
 Cpm::GenericSet< Series< E, step_equal_1 >, E, operations::cmp >
 Cpm::GenericSet< Series< Int, step_equal_1 >, Int, operations::cmp >
 Cpm::GenericSet< Set< E, Comparator >, E, Comparator >
 Cpm::GenericSet< Set< Int, Comparator >, Int, Comparator >
 Cpm::GenericSet< Set_with_dim< SetRef >, deref< SetRef >::type::element_type, deref< SetRef >::type::element_comparator >
 Cpm::GenericSet< SingleElementIncidenceLine, Int, operations::cmp >
 Cpm::GenericSet< SingleElementSetCmp< ElemRef, Comparator >, pure_type_t< ElemRef >, Comparator >
 Cpm::GenericSet< TruncatedSet< SetRef, direction >, deref< SetRef >::type::element_type, deref< SetRef >::type::element_comparator >
 Cpm::GenericSet< TSet, typename TSet::element_type, typename TSet::element_comparator >
 Cpm::GenericVector< TVector, E >Generic type for vectors
 Cpm::GenericVector< ConcatRows< BlockMatrix< MatrixList, std::true_type > >, deref< mlist_head< MatrixList >::type >::type::element_type >
 Cpm::GenericVector< ConcatRows< DiagMatrix< VectorRef, main_diag > >, deref< VectorRef >::type::element_type >
 Cpm::GenericVector< ConcatRows< LazyMatrix1< masquerade< Transposed, MatrixRef >, Operation > >, object_traits< TMatrix::value_type >::persistent_type >
 Cpm::GenericVector< ConcatRows< LazyMatrix2< masquerade< Transposed, MatrixRef1 >, masquerade< Transposed, MatrixRef2 >, Operation > >, object_traits< TMatrix::value_type >::persistent_type >
 Cpm::GenericVector< ConcatRows< Matrix_base< E > >, E >
 Cpm::GenericVector< ConcatRows< Matrix_base< E > >, object_traits< TMatrix::value_type >::persistent_type >
 Cpm::GenericVector< ConcatRows< MatrixMinor< MatrixRef, RowIndexSetRef, ColIndexSetRef > >, deref< MatrixRef >::type::element_type >
 Cpm::GenericVector< ConcatRows< MatrixProduct< MatrixRef1, MatrixRef2 > >, lazy_product_traits< MatrixRef1, MatrixRef2 >::element_type >
 Cpm::GenericVector< ConcatRows< RepeatedCol< VectorRef > >, pure_type_t< VectorRef >::element_type >
 Cpm::GenericVector< ConcatRows< RepeatedRow< VectorRef > >, pure_type_t< VectorRef >::element_type >
 Cpm::GenericVector< ConcatRows< TMatrix >, object_traits< TMatrix::value_type >::persistent_type >
 Cpm::GenericVector< ExpandedVector< VectorRef >, deref< VectorRef >::type::element_type >
 Cpm::GenericVector< LazyVector1< masquerade< ConcatRows, MatrixRef >, Operation >, object_traits< TransformedContainer< masquerade< ConcatRows, MatrixRef >, Operation >::value_type >::persistent_type >
 Cpm::GenericVector< LazyVector1< VectorRef, Operation >, object_traits< TransformedContainer< VectorRef, Operation >::value_type >::persistent_type >
 Cpm::GenericVector< LazyVector2< masquerade< ConcatRows, MatrixRef1 >, masquerade< ConcatRows, MatrixRef2 >, Operation >, object_traits< TransformedContainerPair< masquerade< ConcatRows, MatrixRef1 >, masquerade< ConcatRows, MatrixRef2 >, Operation >::value_type >::persistent_type >
 Cpm::GenericVector< LazyVector2< VectorRef1, VectorRef2, Operation >, object_traits< TransformedContainerPair< VectorRef1, VectorRef2, Operation >::value_type >::persistent_type >
 Cpm::GenericVector< multi_adjacency_line< Tree >, Int >
 Cpm::GenericVector< SameElementSparseVector< SetRef, ElemRef >, object_traits< deref< ElemRef >::type >::persistent_type >
 Cpm::GenericVector< SameElementVector< ElemRef >, object_traits< pure_type_t< ElemRef > >::persistent_type >
 Cpm::GenericVector< sparse_matrix_line< Tree &, symmetric >, deref< Tree & >::type::mapped_type >
 Cpm::GenericVector< sparse_matrix_line< TreeRef, SkewSymmetric >, deref< TreeRef >::type::mapped_type >
 Cpm::GenericVector< sparse_matrix_line< TreeRef, symmetric >, deref< TreeRef >::type::mapped_type >
 Cpm::GenericVector< sparse_matrix_line< TreeRef, TSymmetric >, deref< TreeRef >::type::mapped_type >
 Cpm::GenericVector< SparseVector< E >, E >
 Cpm::GenericVector< Vector< AccurateFloat >, AccurateFloat >
 Cpm::GenericVector< Vector< double >, double >
 Cpm::GenericVector< Vector< E >, E >
 Cpm::GenericVector< Vector< Int >, Int >
 Cpm::GenericVector< Vector< pm::AccurateFloat >, pm::AccurateFloat >
 Cpm::GenericVector< Vector< pm::Rational >, pm::Rational >
 Cpm::GenericVector< VectorChain< VectorList >, pure_type_t< mlist_head< VectorList >::type >::element_type >
 Cpm::GenericVector< VectorTensorProduct< VectorRef1, VectorRef2, Operation >, object_traits< ContainerProduct< VectorRef1, VectorRef2, Operation >::value_type >::persistent_type >
 Cpm::Heap< Policy >
 Cpm::HSVColor description in HSV space
 Cpm::IncidenceMatrix< symmetric >0/1 incidence matrix
 Cpm::input_truncator< Iterator, Predicate >
 Cpm::IntegerIntegral number of unlimited precision
 Cpolymake::is_derived_from_instance_of< T, Template, TrailingParams >
 Cpolymake::is_derived_from_instance_of< pure_type_t< VectorRef >, SameElementVector >
 Cpolymake::is_instance_of< T, Template >Check whether a type is an instance of a given class template
 Cpolymake::is_instance_of< T, optional >
 Cpolymake::is_lossless_convertible_impl2< Source, Target, typename >
 Cpm::is_ordered< T >Check whether the default comparator operations::cmp can be used with the given type
 Cpm::is_ordered< container_element_type< T >::type >
 Cpm::is_unordered_comparable< T >Check whether the comparator operations::cmp_unordered can be used with the given type
 Cpm::is_unordered_comparable< container_element_type< T >::type >
 Cpm::iterator_product< Iterator1, Iterator2, has_state1, has_state2 >
 Cpm::iterator_product< Iterator1, Iterator2, has_state1, false >
 Cstd::iterator_traits< back_insert_iterator< Container > >
 Cpm::fl_internal::lex_order_iterator
 Cpm::list_search< First, Second, Predicate >
 Cpm::list_search< Tail, Second, Predicate >
 Cpm::Map< K, D, Params >Associative array based on AVL::tree
 Cpm::Map< Set< Int >, T >
 Cpolymake::mbind1st< BinaryFunc, Const >Reduce a binary meta-function to a unary one by fixing the first argument to a given value
 Cpolymake::mbind2nd< BinaryFunc, Const >Reduce a binary meta-function to a unary one by fixing the second argument to a given value
 Cpolymake::mbind_const< Const >Wrappers for arbitrary meta-functions
 Cpm::merge_list< First, Second, Predicate >
 Cpolymake::meta_function< Func >
 Cpolymake::mget_template_parameter< T, Pos >
 Cpolymake::mget_template_parameter< Top, 0 >
 Cpolymake::mlist< T >Container for arbitrary many types
 Cpolymake::mlist_and_nonempty< T >Like mlist_and, but delivers false_type on empty input
 Cpolymake::mlist_and_nonempty< isomorphic_to_container_of< Containers, Element, exclude_generic_tag >... >
 Cpolymake::mlist_at< T, Pos >
 Cpolymake::mlist_at< mlist< Params... >, Pos >
 Cpolymake::mlist_at< mlist< Tail... >, Pos-1 >
 Cpolymake::mlist_difference< List1, List2 >
 Cpolymake::mlist_even_subset< List >Extract elements at even positions
 Cpolymake::mlist_filter_binary< List1, List2, BinaryFunc >
 Cpolymake::mlist_filter_unary< T, UnaryFunc >
 Cpolymake::mlist_find_first< List, Func, Match >
 Cpolymake::mlist_find_first< mlist_tail< List >::type, Func >
 Cpolymake::mlist_find_first< mlist_wrap< List >::type, mbind2nd< BinaryFunc, RightArg >::template func >
 Cpolymake::mlist_find_first< mlist_wrap< List >::type, UnaryFunc >
 Cpolymake::mlist_find_if< List, Func, Args >
 Cpolymake::mlist_fold< T, BinaryFunc, InitVal >
 Cpolymake::mlist_fold_transform< T, Transform, Fold >
 Cpolymake::mlist_insert< List, AddElement, Less >
 Cpolymake::mlist_insert< mlist_sort< mlist< Tail... >, Less >::type, T, Less >
 Cpolymake::mlist_insert_unique< List, AddElement, Less >
 Cpolymake::mlist_intersection< List1, List2 >
 Cpolymake::mlist_is_tail_of< List1, List2, valid >Check whether one list coincides with the tail of another list
 Cpolymake::mlist_length< T >Compute the length of a meta-list
 Cpolymake::mlist_match_all< List1, List2, Compare >
 Cpolymake::mlist_match_impl< List1, List2, Compare >
 Cpolymake::mlist_odd_subset< List >Extract elements at odd positions
 Cpolymake::mlist_reverse< T >Reverse the elements in a meta-list
 Cpolymake::mlist_slice< List, Start, End, TotalSize >
 Cpolymake::mlist_slice< mlist_tail< mlist< Elements... > >::type, Start-1, End-1, TotalSize-1 >
 Cpolymake::mlist_sort< List, Less >Sort a meta-list according to the given element comparator
 Cpolymake::mlist_tail< T >
 Cpolymake::mlist_transform_binary< T1, T2, BinaryFunc >Apply a binary meta-function pairwise to the elements of two meta-lists
 Cpolymake::mlist_transform_unary< T, UnaryFunc >Apply a unary meta-function to the elements of a meta-list
 Cpolymake::mlist_transform_unary< mlist< Args... >, add_try_canned >
 Cpolymake::mlist_unwrap< T >Extract the single element from a meta-list, preserve the list if it contains more than one element
 Cpolymake::mlist_wrap< T >Construct a meta-list with given elements unless it's already a meta-list itself
 Cpolymake::mlist_wrap< BinaryFunc< T1, T2 >::type >
 Cpolymake::mlist_wrap< List >
 Cpolymake::mlist_wrap< mtag_value< Tag, Operation< void, MoreOperands... >::type >::type >
 Cpolymake::mlist_wrap< T... >
 Cpolymake::mnegate_binary< BinaryFunc >Negate the result of a binary boolean meta-function
 Cpolymake::mnegate_unary< UnaryFunc >Negate the result of a unary boolean meta-function
 Cpolymake::mprefer1st< T1, T2 >Operation on a pair of types: selects the first one unless it is void
 Cpolymake::mprefer2nd< T1, T2 >Operation on a pair of types: selects the second one unless it is void
 Cpolymake::mproject1st< T1, T2 >Operation on a pair of types: selects the first one
 Cpolymake::mproject2nd< T1, T2 >Operation on a pair of types: selects the second one
 Cpolymake::mrepeat< T >
 Cpolymake::mreplace_template_parameter< T, Pos, NewParam >
 Cpolymake::mreplace_template_parameter< Top, subst_pos, mtagged_list_replace< Options, OptionInst >::type >
 Cpolymake::mreplace_template_parameter< Top, subst_pos, NewOptions >
 Cpolymake::mreplicate< T, N >Construct a meta-list consisting of N copies of the same element
 Cpolymake::msafely_eval< Func, Fallback, IsDefined >
 Cpolymake::msafely_eval_boolean< T, Func >
 Cpolymake::mselect< TClauses >
 Cpolymake::mselect< std::enable_if< check_container_feature< TMatrix, Symmetric >::value, Symmetric >, std::enable_if< check_container_feature< TMatrix, SkewSymmetric >::value, SkewSymmetric >, NonSymmetric >
 Cpolymake::mselect< T2, Tail... >
 Cpolymake::mswap_args< BinaryFunc >Swap arguments passed to a binary meta-function
 Cpolymake::mtagged_list_add_default< List, Defaults >Append elements to a tagged meta-list unless another elements with identical tags are already there
 Cpolymake::mtagged_list_extract< List, Tag, Default >
 Cpolymake::mtagged_list_extract< Options, TTag, TDefault >
 Cpolymake::mtagged_list_extract< params, ComparatorTag, operations::cmp >
 Cpolymake::mtagged_list_extract< params, DefaultValueTag, operations::clear< E > >
 Cpolymake::mtagged_list_extract< params, DivorceHandlerTag, nop_divorce_handler >
 Cpolymake::mtagged_list_remove< List, Tag >
 Cpolymake::mtagged_list_replace< List, Replacements >
 Cpolymake::munwrap_index_sequence< T >Convert a meta-list of encapsulated integer constants into an index sequence
 Cpm::AVL::node< K, D >
 Cpm::face_map::node< Traits >
 Cpm::AVL::node_accessor_impl< NodeRef, no_data >
 Cpm::graph::NodeMap< TDir, E, TParams >Data structure to store data at the nodes of a Graph
 Cpm::NormalRandom< Num >
 Cpm::NormalRandom< AccurateFloat >
 Cpm::NormalRandom< pm::AccurateFloat >
 Cpm::nothingStructure denoting the absence of data
 Cpm::output_predicate_selector< Iterator, Predicate >
 Cpolymake::cleanOperations::partial_left< Operation >
 Cpolymake::cleanOperations::partial_right< Operation >
 Cpm::permutation_iterator< permutations_heap >Implementation of the Heap's algorithm by R. Sedgewick
 Cpm::AVL::Ptr< Node >Pointer class
 Cpm::AVL::Ptr< cell >
 Cpm::AVL::Ptr< pm::AVL::node >
 Cpm::AVL::Ptr< pm::face_map::node >
 Cpm::AVL::Ptr< value_type >
 Cpm::ptr_wrapper< T, is_reversed >Wrapper for a pointer used as an iterator
 Cpm::ptr_wrapper< T, false >
 Cpm::QuadraticExtension< Field >Realizes quadratic extensions of fields
 Cpm::RandomPoints< FillClass, normalize, Num >Generator of uniformly distributed random points on the unit sphere in R^d
 Cpm::RandomPoints< RandomNormalPoints< AccurateFloat >, false, AccurateFloat >
 Cpm::RandomPoints< RandomSpherePoints< AccurateFloat >, true, AccurateFloat >
 Cpm::RandomPoints< RandomSpherePoints< pm::AccurateFloat >, true, pm::AccurateFloat >
 Cpm::range_contractor< Iterator, Predicate >
 Cpm::RationalRational number with unlimited precision
 Cpm::shared_array< Object, TParams >::repAttached objects plus housekeeping
 Cpolymake::reverse_index_sequence< N >Construct a falling index sequence N-1, N-2, ..., 1, 0
 Cpm::RGBColor description in RGB space: Red-Green-Blue additive color model
 Cpm::shared_array< Object, TParams >
 Cpm::shared_array< AccurateFloat, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_array< double, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_array< E, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_array< E, PrefixDataTag< dim_t >, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_array< E, typename polymake::mtagged_list_add_default< typename polymake::mlist_wrap< SharedParams... >::type, AliasHandlerTag< shared_alias_handler > >::type >
 Cpm::shared_array< Int, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_array< Int, typename polymake::mtagged_list_add_default< typename polymake::mlist_wrap< SharedParams... >::type, AliasHandlerTag< shared_alias_handler > >::type >
 Cpm::shared_array< pm::AccurateFloat, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_array< pm::Rational, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_array< std::string, typename polymake::mtagged_list_add_default< typename polymake::mlist_wrap< SharedParams... >::type, AliasHandlerTag< shared_alias_handler > >::type >
 Cpm::shared_object< Object, TParams >
 Cpm::shared_object< fl_internal::Table, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_object< impl, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_object< it_vector >
 Cpm::shared_object< ListMatrix_data< TVector >, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_object< pm::AVL::tree, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_object< table_type, AliasHandlerTag< shared_alias_handler > >
 Cpm::shared_object< table_type, AliasHandlerTag< shared_alias_handler >, DivorceHandlerTag< divorce_maps > >
 Cpm::SmithNormalForm< E >Complete result of computation of Smith normal form
 Cpm::SparseMatrixStatistics< E >Sparse matrix statistics collection
 Cpm::spec_object_traits< TropicalNumber< Addition, Scalar > >
 Cpm::AVL::tree< Traits >Balanced binary search tree
 Cpm::AVL::tree< AVL::traits< Int, E > >
 Cpm::AVL::tree< face_map::tree_traits< face_map::index_traits<> > >
 Cpm::AVL::tree< sparse2d::traits< traits_base< TDir, false, restriction >, false, restriction > >
 Cpm::AVL::tree< sparse2d::traits< traits_base< TDir, false, restriction >, TDir::value, restriction > >
 Cpm::AVL::tree< sparse2d::traits< traits_base< TDir, true, restriction >, false, restriction > >
 Cpm::TropicalNumber< Addition, Scalar >
 Cpm::unary_predicate_selector< Iterator, Predicate >
 Cpm::unary_predicate_selector< Iterator, Accessor >
 Cpm::UniformlyRandom< AccurateFloat >Generator of random AccurateFloat numbers from [0, 1)
 Cpm::UniformlyRandom< Bitset >Generator of random Bitset of a given maximal cardinality
 Cpm::UniformlyRandom< Rational >
 Cpm::unlimited