This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 1234]

▼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, typename BSGSIN::TRANStype, permlib::RandomBaseTranspose< PERM, typename BSGSIN::TRANStype > >
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::BaseConstruction< PERM, TRANS >	Base class for BSGS construction algorithms
►Cpermlib::KnownBSGSConstruction< TRANS::PERMtype, TRANS >
Cpermlib::CyclicGroupConstruction< TRANS >	BSGS construction for a cyclic group of given order
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::BaseSearch< BSGSIN, TRANSRET >	Base class for searching in a group
►Cpermlib::classic::BacktrackSearch< BSGSIN, TRANSRET >	Searching in a group with classical backtracking
Cpermlib::classic::IntersectionSearch< BSGSIN, TRANSRET >	Subgroup search for a group intersection based on classical backtracking
Cpermlib::classic::LexSmallerImageSearch< BSGSIN, TRANSRET >	Coset representative search for a lex-smaller set images
Cpermlib::classic::SetImageSearch< BSGSIN, TRANSRET >	Coset representative search for a set image based on classical backtracking
Cpermlib::classic::SetStabilizerSearch< BSGSIN, TRANSRET >	Subgroup search for a set stabilizer based on classical backtracking
►Cpermlib::partition::RBase< BSGSIN, TRANSRET >	R-base for partition backtracking
Cpermlib::partition::IntersectionSearch< BSGSIN, TRANSRET >	Subgroup search for a group intersection based on partition backtracking
Cpermlib::partition::MatrixAutomorphismSearch< BSGSIN, TRANSRET >	Subgroup search for the automorphism group of a symmetric matrix based on partition backtracking
Cpermlib::partition::SetImageSearch< BSGSIN, TRANSRET >	Coset representative search for a set image based on partition backtracking
Cpermlib::partition::SetStabilizerSearch< BSGSIN, TRANSRET >	Subgroup search for a set stabilizer based on partition backtracking
Cpermlib::partition::VectorStabilizerSearch< BSGSIN, TRANSRET >	Subgroup search for a stabilizer of an integer vector based on 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
▼Cstd::binary_function
►Cpermlib::OrderedSorter< const std::vector< unsigned long > & >
Cpermlib::BaseSorterByReference	A sorter that sorts a sequence (e.g. $\Omega$ ) with respect to a given input ordering (e.g. a base)
►Cpermlib::OrderedSorter< std::vector< unsigned long > >
Cpermlib::BaseSorter	A sorter that sorts a sequence (e.g. $\Omega$ ) with respect to a given input ordering (e.g. a base)
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::BSGSRandomGenerator< PERM, TRANS >	Generates uniformly distributed random group elements based on an existing BSGS
Cpermlib::ProductReplacementGenerator< PERM >	Generates nearly-uniformly distributed random group elements using the product replacement algorithm
Cpermlib::RandomSchreierGenerator< PERM, TRANS >	Generates a uniformly distributed random element of $G^{[i]}_\alpha$
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::AlternatingGroupType	Group type for alternating groups
Cpermlib::CyclicGroupType	Group type for cyclic groups
Cpermlib::SymmetricGroupType	Group type for 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 $\alpha$
Cpermlib::ExplicitTransversal< PERM >	Transversal class that stores all transversal elements explicitly
►Cpermlib::SchreierTreeTransversal< PERM >	Transversal class that stores transversal elements in a Schreier tree
Cpermlib::ShallowSchreierTreeTransversal< PERM >	Transversal class that stores elements in a shallow Schreier tree
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 $G^{[i]}$ stabilizes beta
Cpermlib::TrivialRedundantBasePointInsertionStrategy< PERM, TRANS >	Insertion position after first non-trivial transversal
▼Cpermlib::partition::Refinement< PERM >	Base class for a $\mathcal P$ -refinement which is used in an R-base and bound to an initial partition
Cpermlib::partition::BacktrackRefinement< PERM >	Backtrack refinement
Cpermlib::partition::GroupRefinement< PERM, TRANS >	Concrete $\mathcal P$ -refinements for group membership
Cpermlib::partition::MatrixRefinement1< PERM, MATRIX >	Concrete $\mathcal P$ -refinement for symmetric matrix automorphisms
Cpermlib::partition::MatrixRefinement2< PERM, MATRIX >	Concrete $\mathcal P$ -refinement for symmetric matrix automorphisms
Cpermlib::partition::SetImageRefinement< PERM >
Cpermlib::partition::SetStabilizeRefinement< PERM >	Concrete $\mathcal P$ -refinements for set stabilization
▼Cpermlib::partition::RefinementFamily< PERM >	Class of $\mathcal P$ -refinements for a given problem
Cpermlib::partition::GroupRefinementFamily< PERM, TRANS >	$\mathcal P$ -refinements for group membership
Cpermlib::partition::MatrixAutomorphismRefinementFamily< PERM, MATRIX >	$\mathcal P$ -refinements for symmetric matrix automorphisms
Cpermlib::partition::SetImageRefinementFamily< PERM >	$\mathcal P$ -refinements for set stabilization
Cpermlib::partition::SetStabilizeRefinementFamily< PERM >	$\mathcal P$ -refinements for set stabilization
Cpermlib::RefinementFamily< 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::helpers::FullSupportRestriction	This class implements both canBeIgnored() and set()
Cpermlib::helpers::ReducedSupportRestriction	This class implements canBeIgnored() but has a trivial 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
▼Cstd::unary_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
Cpermlib::GroupIntersectionPredicate< PERM, TRANS >	Predicate for the subgroup that arises as the intersection of two given groups
Cpermlib::LexSmallerImagePredicate< PERM >	Coset-type predicate for group elements that map one set of zeros and ones to a lex-smaller set (w.r.t. to the indices)
Cpermlib::MatrixAutomorphismPredicate< PERM, MATRIX >	Predicate for the automorphisms of a symmetric matrix
Cpermlib::SetImagePredicate< PERM >	Coset-type predicate for group elements that map one set of points onto another given set of points
Cpermlib::SetwiseStabilizerPredicate< PERM >	Predicate for the subgroup that stabilizes a given point set
Cpermlib::VectorStabilizerPredicate< PERM >	Predicate for the subgroup that stabilizes a given integer vector