permlib
0.2.9
Library for permutation computations
|
▼Cpermlib::AbstractPermutationGroup | A high level interface for a permutation group |
Cpermlib::AbstractBSGS< TRANS > | A high level interface implementing a group represented by a BSGS data structure |
Cpermlib::AbstractSymmetricProduct | A high level interface implementing a direct product of symmetric groups |
▼Cpermlib::BaseChange< PERM, TRANS > | Abstract base class for base change algorithms |
Cpermlib::ConjugatingBaseChange< PERM, TRANS, permlib::RandomBaseTranspose< PERM, TRANS > > | |
Cpermlib::ConjugatingBaseChange< PERM, TRANS, BASETRANSPOSE > | Base change by conjugation and, if necessary, transpositions |
Cpermlib::NewBaseChange< PERM, TRANS > | Base change by constructing a new base with random schreier sims |
Cpermlib::SimpleBaseChange< PERM, TRANS, BASETRANSPOSE > | Base change by a sequence of point insertions and transpositions |
▼Cpermlib::BaseChange< PERM, typename BSGSIN::TRANStype > | |
Cpermlib::ConjugatingBaseChange< PERM, typename BSGSIN::TRANStype, permlib::RandomBaseTranspose< PERM, typename BSGSIN::TRANStype > > | |
▼Cpermlib::BaseConstruction< PERM, TRANS > | Base class for BSGS construction algorithms |
Cpermlib::KnownBSGSConstruction< PERM, TRANS > | BSGS construction from a known base and strong generating set |
Cpermlib::RandomSchreierSimsConstruction< PERM, TRANS, Integer > | BSGS construction with Random Schreier-Sims algorithm |
Cpermlib::SchreierSimsConstruction< PERM, TRANS > | BSGS construction with classic Schreier-Sims algorithm |
Cpermlib::RandomSchreierSimsConstruction< PERM, TRANS > | |
▼Cpermlib::BaseConstruction< TRANS::PERMtype, TRANS > | |
▶Cpermlib::KnownBSGSConstruction< TRANS::PERMtype, TRANS > | |
▼Cpermlib::BaseSearch< BSGSIN, TRANSRET > | Base class for searching in a group |
▶Cpermlib::classic::BacktrackSearch< BSGSIN, TRANSRET > | Searching in a group with classical backtracking |
▶Cpermlib::partition::RBase< BSGSIN, TRANSRET > | R-base for partition backtracking |
▼Cpermlib::BaseTranspose< PERM, TRANS > | Abstract base class for base transposition |
Cpermlib::DeterministicBaseTranspose< PERM, TRANS > | Implementation of a deterministic base transposition algorithm |
Cpermlib::RandomBaseTranspose< PERM, TRANS > | Implementation of a randomized base transposition algorithm |
▼Cbinary_function | |
▶Cpermlib::OrderedSorter< const std::vector< unsigned long > &> | |
▶Cpermlib::OrderedSorter< std::vector< unsigned long > > | |
Cpermlib::GroupSorter< PERM > | A sorter that sorts a sequence of permutations with respect to a ordering induced by a base |
Cpermlib::OrderedSorter< ORDER > | A sorter that sorts a sequence with respect to a given input ordering |
Cpermlib::StrongGeneratingSetSorter< PERM > | Class that can be used to sort a strong generating set |
Cpermlib::TrivialSorter | A sorter that sorts a sequence in natural numerical order (1 < 2 < 3 < ...) |
Cpermlib::BlockVectorAction< PERM > | |
▼Cpermlib::BSGSCore< PERM, TRANS > | Core data of a base and strong generating set (BSGS) |
Cpermlib::BSGS< PERM, TRANS > | Represents a base and strong generating set (BSGS) |
▼Cpermlib::BSGSCore< PERM, SymmetricGroupTransversal< PERM > > | |
Cpermlib::SymmetricGroup< PERM > | Representation of a symmetric group |
▼Cpermlib::exports::BSGSSchreierBase | Base class for import/export of a BSGS based on SchreierTreeTransversal |
Cpermlib::exports::BSGSSchreierExport | Export of a BSGS based on SchreierTreeTransversal |
Cpermlib::exports::BSGSSchreierImport | Import of a BSGS based on SchreierTreeTransversal |
Cpermlib::exports::BSGSSchreierData | Data structure with elementary data types to represent a BSGS based on SchreierTreeTransversal |
Cpermlib::delete_object | Callable object to delete a pointer |
Cpermlib::DSetAction< PERM > | Action of a permutation on a dynamic bitset |
▼Cpermlib::Generator< PERM > | Interface for group element generators |
▶Cpermlib::RandomGenerator< PERM > | Abstract base class for random group element generators |
Cpermlib::SchreierGenerator< PERM, TRANS > | Stateful generator of Schreier generators |
▼Cpermlib::Generator< TRANS::PERMtype > | |
Cpermlib::BSGSGenerator< TRANS > | Stateful generator of BSGS elements |
▼Cpermlib::GiantTestBase | |
Cpermlib::GiantTest< PERM > | Tests a group given by generators for being an Alternating Group or a Symmetric Group |
▼Cpermlib::GroupType | Abstract base class for permutation group types |
Cpermlib::AnonymousGroupType< IntegerType > | Group type for a permutation group whose type could not be determined |
Cpermlib::DirectProductGroupType | Group type for a direct product of two groups |
▶Cpermlib::NamedGroupType | Abstract base class for named groups (such as cyclic and symmetric groups) |
Cpermlib::TrivialGroupType | Group type for a trivial permutation group |
Cpermlib::WreathSymmetricGroupType | Group type for a wreath product of symmetric groups |
▼Cpermlib::Orbit< PERM, PDOMAIN > | Abstract base class for orbit computation |
Cpermlib::OrbitList< PERM, PDOMAIN > | Stores an orbit in a sorted list |
Cpermlib::OrbitSet< PERM, PDOMAIN > | Stores an orbit in a set for fast contains() operation |
▼Cpermlib::Orbit< PERM, unsigned long > | |
▶Cpermlib::Transversal< PERM > | Transversal base class corresponding to a base element ![]() |
Cpermlib::OrbitLexMinSearch< BSGSIN > | Algorithm to find the lexicographically minimal set in an orbit |
Cpermlib::partition::Partition | Partition |
Cpermlib::Permutation | Permutation class storing all values explicitly |
Cpermlib::PermutationWord | Permutation class storing permutations as words of elementary Permutation 's |
Cpermlib::PrimeHelper | Helper class for primality checks |
Cpermlib::PrimitivitySGSTest< TRANS > | Tests a transitive group for which a strong generating set is availble for primitivity |
Cpermlib::PrimitivityTest< PERM > | Tests a transitive group is availble for primitivity |
▼Cpermlib::RedundantBasePointInsertionStrategy< PERM, TRANS > | Strategy for redundant base point insertion |
Cpermlib::FirstRedundantBasePointInsertionStrategy< PERM, TRANS > | Insertion position at first position i such that ![]() |
Cpermlib::TrivialRedundantBasePointInsertionStrategy< PERM, TRANS > | Insertion position after first non-trivial transversal |
▼Cpermlib::partition::Refinement< PERM > | Base class for a ![]() |
Cpermlib::partition::BacktrackRefinement< PERM > | Backtrack refinement |
Cpermlib::partition::GroupRefinement< PERM, TRANS > | Concrete ![]() |
Cpermlib::partition::MatrixRefinement1< PERM, MATRIX > | Concrete ![]() |
Cpermlib::partition::MatrixRefinement2< PERM, MATRIX > | Concrete ![]() |
Cpermlib::partition::SetImageRefinement< PERM > | |
Cpermlib::partition::SetStabilizeRefinement< PERM > | Concrete ![]() |
Cpermlib::RefinementFamily< PERM > | |
▼Cpermlib::partition::RefinementFamily< PERM > | Class of ![]() |
Cpermlib::partition::GroupRefinementFamily< PERM, TRANS > | ![]() |
Cpermlib::partition::MatrixAutomorphismRefinementFamily< PERM, MATRIX > | ![]() |
Cpermlib::partition::SetImageRefinementFamily< PERM > | ![]() |
Cpermlib::partition::SetStabilizeRefinementFamily< PERM > | ![]() |
▼Cpermlib::helpers::SupportRestriction | Helper class to decide when an permutation action on a set is trivial or can be reduced to a subset |
▶Cpermlib::helpers::BaseSupportRestriction | This class never imposes a restriction on any set |
Cpermlib::SymmetricGroupRecognitionHeuristic< PERM > | Fast recognition of symmetric group subgroups |
Cpermlib::SymmetricGroupTransversal< PERM > | Transversal of a symmetric group |
Cpermlib::Transversal< PERM >::TrivialAction | Action of a PERM on unsigned long element |
Cpermlib::TypeRecognition< PERM, TRANSVERSAL > | Class for a basic type recognition of permutation groups |
▼Cunary_function | |
Cpermlib::IdentityPredicate< PERM > | Predicate matching a permutation if it stabilizes a given list of points pointwise |
Cpermlib::PointwiseStabilizerPredicate< PERM > | Predicate matching a permutation if it stabilizes a given list of points pointwise |
Cpermlib::StabilizesPointPredicate< PERM > | Predicate matching points that are stabilized by given permutations |
▶Cpermlib::SubgroupPredicate< PERM > | Abstract base class for subgroup (and coset) predicates |