| Cpm::AccurateFloat | Minimalistic wrapper for MPFR numbers |
| Cpolymake::AnyString | |
| Cpm::Array< E, SharedParams > | Container class with constant time random access |
| Cpm::Array< int > | |
| Cpm::Array< unsigned int > | |
| Cpm::attrib< C > | |
| Cpm::attrib< const T > | |
| 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::can_construct_any< TSource, TTargets > | |
| Cpm::chunk_allocator | Maintains a list of private memory chunks of fixed size |
| Cpm::Complement< SetTop, E, Comparator > | Complement as GenericSet |
| Cpm::conv< From, To > | Explicit type converter |
| Cpm::conv< From1, To1 > | |
| Cpm::conv< From2, To2 > | |
| 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::EquivalenceRelation | An equivalence relation on the integers 0,..,n-1 for a given size n |
| ►Cstd::exception | STL class |
| ►Cstd::logic_error | STL class |
| ►Cstd::domain_error | STL class |
| Cpm::color_error | An exception of this type is thrown by an attempt to assign a wrong value to some color component |
| ►Cpm::GMP::error | Exception type A constructor of Integer or Rational from const char* throws an exception of this type in case of a syntax error |
| Cpm::GMP::BadCast | Exception type: a number can't be casted to a smaller type without overflow or lost of data (e.g. non-integral Rational to Integer) |
| Cpm::GMP::NaN | Exception type: "not a number" |
| Cpm::GMP::ZeroDivide | Exception type: "division by zero" |
| ►Cstd::runtime_error | STL class |
| Cpm::no_match | |
| Cpm::ExtGCD< T > | Result of the extended gcd calculation for two numbers (a, b) |
| Cpm::FaceMap< Traits > | |
| Cpm::FacetList | |
| Cpm::first_of_equal | Special tags for find_nearest denoting the first and last occurrence of a given key in a multi-set |
| Cpm::fixed_array< E, Tsize > | Following should die when all C arrays disappear from client code |
| ►Cpm::fixed_array< E, TSize > | |
| Cpm::FixedVector< E, TSize > | Built-in array decorated as a vector |
| Cpm::fixed_array< E, Tsubsize > | |
| Cpm::function_argument< T > | |
| Cpm::function_argument< T & > | |
| Cpm::GenericGraph< GraphTop, dir_val > | Generic type for all graph classes |
| ►Cpm::GenericGraph< Graph< TDir >, TDir > | |
| Cpm::graph::Graph< TDir > | Directed or undirected finite graphs |
| Cpm::GenericGraph< IndexedSubgraph< GraphRef, SetRef, TParams >, deref< GraphRef >::type::dir > | |
| Cpm::GenericGraph< Wary< Graph >, Graph::dir > | |
| Cpm::GenericGraph< Wary< graph::Graph< TDir > >, graph::Graph< TDir >::dir > | |
| Cpm::GenericMatrix< TMatrix, E > | Generic type for matrices |
| Cpm::GenericMatrix< AdjacencyMatrix< Graph, true >, int > | |
| Cpm::GenericMatrix< BlockDiagMatrix< MatrixRef1, MatrixRef2, _main >, deref< MatrixRef1 >::type::element_type > | |
| Cpm::GenericMatrix< constant_value_matrix< E >, deref< E >::type > | |
| Cpm::GenericMatrix< DiagMatrix< VectorRef, _main >, 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::ListMatrix< TVector > | List of row vectors |
| ►Cpm::GenericMatrix< Matrix< E >, E > | |
| Cpm::Matrix< E > | Matrix type class which holds the elements in a contiguous array
Additional arithmetic operations for matrices and useful constructions (unit_matrix, diag, ...) are listed at operations |
| Cpm::GenericMatrix< MatrixProduct< MatrixRef1, MatrixRef2 >, lazy_product_traits< MatrixRef1, MatrixRef2 >::element_type > | |
| Cpm::GenericMatrix< PermutationMatrix< PermutationRef, Element >, Element > | |
| Cpm::GenericMatrix< RepeatedCol< VectorRef >, deref< VectorRef >::type::element_type > | |
| Cpm::GenericMatrix< RepeatedRow< VectorRef >, deref< VectorRef >::type::element_type > | |
| Cpm::GenericMatrix< SameElementSparseMatrix< IncMatrixRef, ElemRef >, object_traits< deref< ElemRef >::type >::persistent_type > | |
| Cpm::GenericMatrix< SingleCol< VectorRef >, deref< VectorRef >::type::element_type > | |
| Cpm::GenericMatrix< SingleRow< VectorRef >, deref< VectorRef >::type::element_type > | |
| ►Cpm::GenericMatrix< SparseMatrix< E, symmetric >, E > | |
| Cpm::SparseMatrix< E, symmetric > | A two-dimensional associative array with row and column indices as keys |
| Cpm::SparseMatrix< E > | |
| ►Cpm::GenericSet< TSet, E, Comparator > | Generic type for ordered sets |
| Cpm::GenericMutableSet< TSet, E, Comparator > | Generic type for ordered mutable sets |
| ►Cpm::GenericSet< Bitset, int, operations::cmp > | |
| Cpm::Bitset | Container class for dense sets of integers |
| 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::GenericMutableSet< incidence_line< TreeRef >, int, operations::cmp > | |
| Cpm::GenericSet< IncidenceLineChain< ContainerRef1, ContainerRef2 >, int, operations::cmp > | |
| Cpm::GenericSet< IndexedSubset< ContainerRef1, ContainerRef2, TParams >, E, Comparator > | |
| Cpm::GenericSet< Indices< ContainerRef >, int, operations::cmp > | |
| Cpm::GenericSet< Keys< TMap >, TMap::key_type, TMap::key_comparator_type > | |
| Cpm::GenericSet< LazySet2< SetRef1, const Set2 &, set_difference_zipper >, deref< SetRef1 >::type::element_type, deref< SetRef1 >::type::element_comparator > | |
| Cpm::GenericSet< LazySet2< SetRef1, const Set2 &, set_intersection_zipper >, deref< SetRef1 >::type::element_type, deref< SetRef1 >::type::element_comparator > | |
| Cpm::GenericSet< LazySet2< SetRef1, SetRef2, Controller >, deref< SetRef1 >::type::element_type, deref< SetRef1 >::type::element_comparator > | |
| Cpm::GenericSet< LazySet2< SetRef2, const Set1 &, set_difference_zipper >, deref< SetRef2 >::type::element_type, deref< SetRef2 >::type::element_comparator > | |
| Cpm::GenericSet< LexOrdered, fl_internal::Facet::persistent_type, operations::cmp > | |
| Cpm::GenericSet< node_container< TDir >, int, operations::cmp > | |
| Cpm::GenericSet< Nodes< Graph >, int, operations::cmp > | |
| Cpm::GenericSet< OrderedContainer< Container, Comparator, ProvidedFeatures >, object_traits< Container::value_type >::persistent_type, Comparator > | |
| Cpm::GenericSet< SameElementIncidenceLine< elem >, int, operations::cmp > | |
| Cpm::GenericSet< Series< E, _step_equal_1 >, E, operations::cmp > | |
| Cpm::GenericSet< Series< E, true >, E, operations::cmp > | |
| Cpm::GenericSet< Series< int, _step_equal_1 >, int, operations::cmp > | |
| ►Cpm::GenericSet< Set< E, Comparator >, E, Comparator > | |
| ►Cpm::GenericMutableSet< Set< E, Comparator >, E, Comparator > | |
| Cpm::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 most cases, the default choice (lexicographical order) will suffice for your needs |
| ►Cpm::GenericSet< Set< int, Comparator >, int, Comparator > | |
| ►Cpm::GenericMutableSet< Set< int, Comparator >, int, Comparator > | |
| Cpm::Set< int > | |
| ►Cpm::GenericSet< Set< Set< E, Comparator >, Comparator >, Set< E, Comparator >, Comparator > | |
| ►Cpm::GenericMutableSet< Set< Set< E, Comparator >, Comparator >, Set< E, Comparator >, Comparator > | |
| Cpm::Set< Set< E, Comparator > > | |
| ►Cpm::GenericSet< Set_with_dim< SetRef >, deref< SetRef >::type::element_type, deref< SetRef >::type::element_comparator > | |
| Cpm::Set_with_dim< SetRef > | Set_with_dim as GenericSet |
| Cpm::GenericSet< SingleElementIncidenceLine, int, operations::cmp > | |
| ►Cpm::GenericSet< SingleElementSetCmp< Eref, Comparator >, deref< Eref >::type, Comparator > | |
| Cpm::SingleElementSetCmp< Eref, Comparator > | A set consisting of exactly one element |
| Cpm::GenericSet< Subset, E, Comparator > | |
| Cpm::GenericSet< Subsets, object_traits< Source >::persistent_type, operations::cmp > | |
| Cpm::GenericSet< TruncatedSet< SetRef, direction >, deref< SetRef >::type::element_type, deref< SetRef >::type::element_comparator > | |
| Cpm::GenericVector< TVector, E > | Generic type for vectors |
| Cpm::GenericVector< ConcatRows< ColChain< masquerade< Transposed, MatrixRef1 >, masquerade< Transposed, MatrixRef2 > > >, object_traits< ColChain< masquerade< Transposed, MatrixRef1 >, masquerade< Transposed, MatrixRef2 > >::value_type >::persistent_type > | |
| Cpm::GenericVector< ConcatRows< DiagMatrix< VectorRef, main_diag > >, deref< VectorRef >::type::element_type > | |
| Cpm::GenericVector< ConcatRows< LazyMatrix1< masquerade< Transposed, MatrixRef >, Operation > >, object_traits< LazyMatrix1< masquerade< Transposed, MatrixRef >, Operation >::value_type >::persistent_type > | |
| Cpm::GenericVector< ConcatRows< LazyMatrix2< masquerade< Transposed, MatrixRef1 >, masquerade< Transposed, MatrixRef2 >, Operation > >, object_traits< LazyMatrix2< masquerade< Transposed, MatrixRef1 >, masquerade< Transposed, MatrixRef2 >, Operation >::value_type >::persistent_type > | |
| Cpm::GenericVector< ConcatRows< Matrix >, object_traits< Matrix::value_type >::persistent_type > | |
| Cpm::GenericVector< ConcatRows< Matrix_base< E > >, E > | |
| Cpm::GenericVector< ConcatRows< Matrix_base< E > >, object_traits< Matrix_base< E >::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 > >, deref< VectorRef >::type::element_type > | |
| Cpm::GenericVector< ConcatRows< RepeatedCol< VectorRef > >, object_traits< RepeatedCol< VectorRef >::value_type >::persistent_type > | |
| Cpm::GenericVector< ConcatRows< RepeatedRow< VectorRef > >, deref< VectorRef >::type::element_type > | |
| Cpm::GenericVector< ConcatRows< RepeatedRow< VectorRef > >, object_traits< RepeatedRow< VectorRef >::value_type >::persistent_type > | |
| Cpm::GenericVector< ConcatRows< RowChain< masquerade< Transposed, MatrixRef1 >, masquerade< Transposed, MatrixRef2 > > >, object_traits< RowChain< masquerade< Transposed, MatrixRef1 >, masquerade< Transposed, MatrixRef2 > >::value_type >::persistent_type > | |
| Cpm::GenericVector< ConcatRows< RowChain< MatrixRef1, MatrixRef2 > >, deref< MatrixRef1 >::type::element_type > | |
| Cpm::GenericVector< ConcatRows< SingleRow< VectorRef > >, deref< VectorRef >::type::element_type > | |
| Cpm::GenericVector< ConcatRows< SingleRow< VectorRef > >, object_traits< SingleRow< VectorRef >::value_type >::persistent_type > | |
| Cpm::GenericVector< ConcatRows< Transposed< Matrix > >, object_traits< Transposed< Matrix >::value_type >::persistent_type > | |
| Cpm::GenericVector< ExpandedVector< VectorRef >, deref< VectorRef >::type::element_type > | |
| ►Cpm::GenericVector< FixedVector< E, TSize >, E > | |
| Cpm::FixedVector< E, TSize > | Built-in array decorated as a vector |
| 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< deref< ElemRef >::type >::persistent_type > | |
| Cpm::GenericVector< SingleElementSparseVector< E >, deref< E >::type > | |
| Cpm::GenericVector< SingleElementVector< E >, deref< E >::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::SparseVector< E > | |
| ►Cpm::GenericVector< SparseVector< Exponent >, Exponent > | |
| Cpm::SparseVector< Exponent > | |
| ►Cpm::GenericVector< Vector< double >, double > | |
| Cpm::Vector< double > | |
| ►Cpm::GenericVector< Vector< E >, E > | |
| Cpm::Vector< E > | Vector type class which holds the elements in a contiguous array |
| ►Cpm::GenericVector< Vector< Num >, Num > | |
| Cpm::Vector< Num > | |
| ►Cpm::GenericVector< Vector< number_type >, number_type > | |
| Cpm::Vector< number_type > | |
| Cpm::GenericVector< VectorChain< VectorRef1, VectorRef2 >, deref< VectorRef1 >::type::element_type > | |
| Cpm::GenericVector< VectorTensorProduct< VectorRef1, VectorRef2, Operation >, object_traits< ContainerProduct< VectorRef1, VectorRef2, Operation >::value_type >::persistent_type > | |
| Cpm::Heap< Policy > | |
| Cpm::HSV | Color description in HSV space |
| Cpm::IncidenceMatrix< symmetric > | 0/1 incidence matrix |
| Cpm::input_truncator< Iterator, Predicate > | |
| Cpm::Integer | Integral number of unlimited precision |
| Cpolymake::is_derived_from_any< TDerived, TBases > | |
| Cpolymake::is_derived_from_instance_of< T, Template > | |
| Cpolymake::is_instance_of< T, Template > | Check whether a type is an instance of a given class template |
| Cpolymake::is_ordered< T > | Check whether the "less than" and "greater than" operators are defined for a given 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 > > | |
| Cpolymake::least_derived_class< T > | |
| Cpm::fl_internal::lex_order_iterator | |
| ►Cpm::list_search< First, Second, Predicate > | |
| Cpm::list_search_all< First, Second, Predicate > | |
| ►Cpm::list_search< Feature, fixed_array< int, 1 >, filter_iterator_features_helper > | |
| Cpm::list_search_all< Feature, fixed_array< int, 1 >, filter_iterator_features_helper > | |
| Cpm::list_search< list2cons< List >::type, Item, std::is_same > | |
| Cpm::list_search< list2cons< list(operations::apply2< BuildUnaryIt< operations::index2element > >, pair< nothing, operations::apply2< BuildUnaryIt< operations::index2element > > >, pair< operations::apply2< BuildUnaryIt< operations::index2element > >, operations::apply2< BuildUnaryIt< operations::index2element > > >) >::type, deref< ContainerRef >::type::operation, std::is_same > | |
| Cpm::list_search< Tail, Second, Predicate > | |
| Cpm::Map< K, D, Comparator > | Associative array based on AVL::tree |
| Cpm::Map< Coord, Key, coord_comparator > | |
| Cpm::Map< Coord, key_list_type, coord_comparator > | |
| Cpm::Map< Coord, YMaps, coord_comparator > | |
| Cpm::Map< Set< int >, T > | |
| Cpm::merge_list< First, Second, Predicate > | |
| Cpolymake::meta_function< TFunction > | |
| Cpolymake::mevaluate< TFunction, TFallback, TDefined > | |
| Cpolymake::mevaluate< least_derived_class< inherit_generic< Result, Head >::type, inherit_generic< Result, Tail >::type >, inherit_generic_helper< Result, Head, void >::type > | |
| Cpolymake::mget_template_parameter< T, TPos > | |
| 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, TPos > | |
| ►Cpolymake::mlist_head< T > | |
| Cpolymake::mlist_fold< T, TOperation > | |
| Cpolymake::mlist_at< mlist< TParams... >, TPos > | |
| Cpolymake::mlist_at< mlist< TTail... >, TPos-1 > | |
| Cpolymake::mlist_at< mlist_wrap< TBases... >::type, mlist_find< mlist_wrap< TBases... >::type, TDerived, std::is_base_of >::value > | |
| Cpolymake::mlist_at< mlist_wrap< TTargets... >::type, mlist_find< mlist_wrap< TTargets... >::type, TSource, is_direct_constructible >::value > | |
| Cpolymake::mlist_at< T, 0 > | |
| Cpolymake::mlist_at< TBases, mlist_find< TBases, TDerived, std::is_base_of >::value > | |
| Cpolymake::mlist_at< TTargets, mlist_find< TTargets, TSource, is_direct_constructible >::value > | |
| Cpolymake::mlist_concat< T, TTail > | |
| Cpolymake::mlist_concat< mlist_flatten_impl< T, TDepth-1 >::type, mlist_flatten_impl< TTail, TDepth-1 >::type... > | |
| ►Cpolymake::mlist_concat< mlist_head< mtagged_list_add_default< TList, TTail... >::type >::type, mtagged_list_modify< mlist_tail< mtagged_list_add_default< TList, TTail... >::type >::type, TTag, mprefer1st, TValue >::type > | |
| Cpolymake::mtagged_list_modify< mtagged_list_add_default< TList, TTail... >::type, TTag, mprefer1st, TValue > | |
| ►Cpolymake::mlist_concat< mlist_head< mtagged_list_replace< TList, TTail... >::type >::type, mtagged_list_modify< mlist_tail< mtagged_list_replace< TList, TTail... >::type >::type, TTag, mproject2nd, TValue >::type > | |
| Cpolymake::mtagged_list_modify< mtagged_list_replace< TList, TTail... >::type, TTag, mproject2nd, TValue > | |
| Cpolymake::mlist_concat< mlist_head< TList >::type, mlist_subset< mlist_tail< TList >::type, 0, TEnd-1, true >::type > | |
| ►Cpolymake::mlist_concat< mlist_head< TList >::type, mtagged_list_modify< mlist_tail< TList >::type, TTag, TOperation, TValue2 >::type > | |
| Cpolymake::mtagged_list_modify< TList, TTag, TOperation, TValue2 > | |
| ►Cpolymake::mlist_concat< mlist_head< TList >::type, mtagged_list_remove< mlist_tail< TList >::type, TTag >::type > | |
| Cpolymake::mtagged_list_remove< TList, TTag > | |
| ►Cpolymake::mlist_concat< mlist_match< TList1, TList2 >::complement, mlist_match< TList1, TList2 >::complement2 > | |
| Cpolymake::mlist_symdifference< TList1, TList2 > | |
| ►Cpolymake::mlist_concat< mlist_reverse< mlist_tail< TList >::type >::type, mlist_head< TList >::type > | |
| Cpolymake::mlist_reverse< TList > | Reverse the elements in a meta-list |
| ►Cpolymake::mlist_concat< mlist_subset< TList, 0, TStart >::type, mlist_concat< TInsert, mlist_subset< TList, TEnd >::type >::type > | |
| ►Cpolymake::mlist_replace_between< TList, TPos, TPos+1, TInsert > | |
| Cpolymake::mlist_replace_at< TList, TPos, TInsert > | |
| Cpolymake::mlist_replace_between< TList, TStart, TEnd, TInsert > | |
| ►Cpolymake::mlist_concat< mlist_subset< TList, 0, TStart >::type, mlist_concat< void, mlist_subset< TList, TEnd >::type >::type > | |
| ►Cpolymake::mlist_replace_between< TList, TPos, TPos+1, void > | |
| ►Cpolymake::mlist_replace_at< TList, TPos, void > | |
| ►Cpolymake::mlist_remove_at< TList, mlist_find< TList, TValue, TCompare >::value > | |
| Cpolymake::mlist_remove< TList, TValue, TCompare > | |
| Cpolymake::mlist_remove_at< TList, TPos > | |
| Cpolymake::mlist_concat< sparse2d::line_params< TreeRef >::type, OperationTag< BuildUnaryIt< operations::index2element > > > | |
| Cpolymake::mlist_concat< sparse2d::line_params< TreeRef >::type, OperationTag< skew_negator<> > > | |
| ►Cpolymake::mlist_concat< T1, T2 > | |
| Cpolymake::mlist_append_if< TEnable, T1, T2 > | |
| Cpolymake::mlist_prepend_if< TEnable, T1, T2 > | |
| ►Cpolymake::mlist_concat< TElement, TList > | |
| Cpolymake::mlist_prepend_if<!mlist_contains< TList, TElement, TCompare >::value, TElement, TList > | |
| ►Cpolymake::mlist_concat< TList1, TList2 > | |
| Cpolymake::mtagged_list_concat< TList1, TList2 > | |
| Cpolymake::mlist_concat< TTag< TOperation< TValue, TValue2 >::type >, mlist< TTail... > > | |
| Cpolymake::mlist_contains< TList, TValue, TCompare > | Tell whether an element is contained in a meta-list |
| ►Cpolymake::mlist_contains< mlist_concat< TExpected... >::type, pure_type_t< Source > > | |
| Cpolymake::is_among< pure_type_t< Source >, const_compatible_with< Iterator >::type > | |
| ►Cpolymake::mlist_contains< mlist_concat< TExpected... >::type, T > | |
| Cpolymake::is_among< T, TExpected > | |
| Cpolymake::mlist_difference< TList1, TList2 > | |
| Cpolymake::mlist_filter_binary< TList1, TList2, TOperation > | |
| Cpolymake::mlist_filter_unary< TList, TOperation > | |
| Cpolymake::mlist_find< TList, TValue, TCompare > | |
| Cpolymake::mlist_flatten< TList, TDepth > | |
| Cpolymake::mlist_fold_transform< T, TTransform, TFold > | |
| Cpolymake::mlist_fold_with_init< mlist< T, TTail... >, TInit, TOperation > | Like mlist_fold, but starting with a prescribed initial value |
| Cpolymake::mlist_intersection< TList1, TList2 > | |
| Cpolymake::mlist_is_included< TList1, TList2, TCompare > | Tell whether one meta-list is completely contained in another one regardless the element order |
| Cpolymake::mlist_length< T > | Compute the length of a meta-list |
| Cpolymake::mlist_match< TList1, TList2, TCompare > | |
| Cpolymake::mlist_match_all< TList1, TList2, TCompare > | |
| ►Cpolymake::mlist_match_all< TList, TTags, has_same_tag > | |
| Cpolymake::mtagged_list_intersect< TList, TTags > | |
| Cpolymake::mlist_subset< TList, TStart, TEnd, TValid > | |
| Cpolymake::mlist_subset< mlist_tail< TList >::type, TStart-1, TEnd-1 > | |
| Cpolymake::mlist_tail< T > | |
| Cpolymake::mlist_transform_binary< T1, T2, TOperation > | Apply a binary meta-function pairwise to the elements of two meta-lists |
| Cpolymake::mlist_transform_unary< T, TOperation > | Apply a unary meta-function to the elements of a meta-list |
| Cpolymake::mlist_union< TList1, TList2 > | |
| 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< mlist_fold< mlist< Iterator, iterator_traits< Iterator >::iterator >, mlist_remove_duplicates_impl< std::is_same >::template TOperation >::type > | |
| Cpolymake::mlist_remove_duplicates< mlist< Iterator, iterator_traits< Iterator >::iterator > > | |
| ►Cpolymake::mlist_wrap< mlist_fold< TList, mlist_remove_duplicates_impl< TCompare >::template TOperation >::type > | |
| Cpolymake::mlist_remove_duplicates< TList, TCompare > | Remove duplicate elements from a meta-list |
| Cpolymake::mlists_are_disjoint< TList1, TList2, TCompare > | Tell whether meta-lists do not have any elements in common |
| Cpolymake::mlists_are_equivalent< TList1, TList2, TCompare > | Shortcut wrappers around mlist_match |
| Cpolymake::mlists_are_intersecting< TList1, TList2, TCompare > | Tell whether meta-lists have any elements in common |
| 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, TPos, TNewValue > | |
| Cpolymake::mreplace_template_parameter< Top, subst_pos, mtagged_list_replace< Options, NewOption< bool_not< get_helper< OptionInst >::type >::type > >::type > | |
| Cpolymake::mreplace_template_parameter< Top, subst_pos, mtagged_list_replace< Options, NewOption< get_helper< OptionInst >::type > >::type > | |
| Cpolymake::mreplace_template_parameter< Top, subst_pos, mtagged_list_replace< Options, OptionInst >::type > | |
| Cpolymake::mreplace_template_parameter< Top, subst_pos, NewOptions > | |
| 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< std::enable_if< std::is_base_of< T, least_derived_class_impl< mlist< T2, TTail... > >::type >::value, T >, std::enable_if< std::is_base_of< least_derived_class_impl< mlist< T2, TTail... > >::type, T >::value, least_derived_class_impl< mlist< T2, TTail... > >::type > > | |
| Cpolymake::mselect< std::enable_if< std::is_base_of< T1, T2 >::value, T1 >, std::enable_if< std::is_base_of< T2, T1 >::value, T2 > > | |
| Cpolymake::mselect< T2, TTail... > | |
| Cpolymake::mtagged_list_add_default< TList, TDefaults > | Append elements to a tagged meta-list unless another elements with identical tags are already there |
| Cpolymake::mtagged_list_extract< TList, TTag, TDefault > | |
| 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_replace< TList, TReplacements > | |
| Cpm::AVL::node< K, D > | |
| Cpm::face_map::node< Traits > | |
| Cpm::AVL::node_accessor_impl< NodeRef, no_data > | |
| Cpm::AVL::node_accessor_impl< NodeRef > | |
| Cpm::graph::NodeMap< TDir, E, TParams > | Data structure to store data at the nodes of a Graph |
| Cpm::NormalRandom< Num > | |
| Cpm::nothing | Structure denoting the absence of data |
| Cpm::output_predicate_selector< Iterator, Predicate > | |
| 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::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::RandomSpherePoints< Num > | Generator of uniformly distributed random points on the unit sphere in R^d |
| Cpm::range_contractor< Iterator, Predicate > | |
| Cpm::Rational | Rational number with unlimited precision |
| Cpm::shared_array< Object, TParams >::rep | Attached objects plus housekeeping |
| Cpm::RGB | Color description in RGB space: Red-Green-Blue additive color model |
| Cpm::shared_array< Object, TParams > | |
| 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, typename polymake::mtagged_list_add_default< typename polymake::mlist_wrap< SharedParams... >::type, AliasHandlerTag< shared_alias_handler > >::type > | |
| Cpm::shared_array< Num, AliasHandlerTag< shared_alias_handler > > | |
| Cpm::shared_array< number_type, AliasHandlerTag< shared_alias_handler > > | |
| Cpm::shared_array< unsigned int, 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 > | |
| Cpm::shared_object< impl, AliasHandlerTag< shared_alias_handler > > | |
| Cpm::shared_object< ListMatrix_data< TVector >, AliasHandlerTag< shared_alias_handler > > | |
| ►Cpm::shared_object< Object *, mtagged_list_add_default< mlist_wrap< TParams... >::type, CopyOnWriteTag< std::false_type >, AllocatorTag< std::allocator< Object > > >::type > | |
| Cpm::shared_pointer< Object, TParams > | |
| Cpm::shared_object< pm::AVL::tree, AliasHandlerTag< shared_alias_handler > > | |
| Cpm::shared_object< RandomState, CopyOnWriteTag< std::false_type > > | |
| Cpm::shared_object< table_type, AliasHandlerTag< shared_alias_handler > > | |
| Cpm::shared_object< table_type, AliasHandlerTag< shared_alias_handler >, DivorceHandlerTag< divorce_maps > > | |
| Cpm::shared_object< typename base_t::container > | |
| ►Cpm::shared_object< value_type *, mtagged_list_add_default< mlist_wrap< TParams... >::type, CopyOnWriteTag< std::false_type >, AllocatorTag< std::allocator< value_type > > >::type > | |
| Cpm::shared_pointer< value_type > | |
| Cpm::size_discriminant< n > | Derivation and conversion tests due to Andrei Alexandrescu |
| 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, operations::cmp > > | |
| Cpm::AVL::tree< face_map::tree_traits< Traits > > | |
| Cpm::AVL::tree< sparse2d::traits< traits_base< TDir, false, restriction >, _symmetric, restriction > > | |
| 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 | |
1.8.11