BacktrackSearch(const BSGSIN &bsgs, unsigned int pruningLevelDCM, bool breakAfterChildRestriction=false, bool stopAfterFirstElement=false) | permlib::classic::BacktrackSearch< BSGSIN, TRANSRET > | |
BaseSearch(const BSGSIN &bsgs, unsigned int pruningLevelDCM, bool stopAfterFirstElement) | permlib::BaseSearch< BSGSIN, TRANSRET > | |
checkLeaf(unsigned int level) | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
construct(BSGSIN *bsgs2) | permlib::classic::IntersectionSearch< BSGSIN, TRANSRET > | |
permlib::classic::BacktrackSearch::construct(SubgroupPredicate< PERM > *pred, bool addPredRefinement) | permlib::classic::BacktrackSearch< BSGSIN, TRANSRET > | protected |
IntersectionSearch(const BSGSIN &bsgs, unsigned int pruningLevelDCM) | permlib::classic::IntersectionSearch< BSGSIN, TRANSRET > | |
m_baseChange | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_bsgs | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_bsgs2 | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_lastElement | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_limitBase | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_limitInitialized | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_limitLevel | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_order | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_pred | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_pruningLevelDCM | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_sorter | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
m_statNodesPrunedChildRestriction | permlib::BaseSearch< BSGSIN, TRANSRET > | |
m_statNodesPrunedCosetMinimality | permlib::BaseSearch< BSGSIN, TRANSRET > | |
m_statNodesPrunedCosetMinimality2 | permlib::BaseSearch< BSGSIN, TRANSRET > | |
m_statNodesVisited | permlib::BaseSearch< BSGSIN, TRANSRET > | |
m_stopAfterFirstElement | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
minOrbit(unsigned long alpha, BSGS< PERM, TRANSRET > &groupK, unsigned int i, unsigned long beta_i) const | permlib::BaseSearch< BSGSIN, TRANSRET > | |
PERM typedef (defined in permlib::classic::IntersectionSearch< BSGSIN, TRANSRET >) | permlib::classic::IntersectionSearch< BSGSIN, TRANSRET > | |
PERMlistType typedef (defined in permlib::BaseSearch< BSGSIN, TRANSRET >) | permlib::BaseSearch< BSGSIN, TRANSRET > | |
processLeaf(const PERM &t, unsigned int level, unsigned int backtrackLevel, unsigned int completed, BSGS< PERM, TRANSRET > &groupK, BSGS< PERM, TRANSRET > &groupL) | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
pruneDCM(const PERM &t, unsigned int backtrackLevel, BSGS< PERM, TRANSRET > &groupK, BSGS< PERM, TRANSRET > &groupL) | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
search(BSGS< PERM, TRANSRET > &groupK) | permlib::classic::BacktrackSearch< BSGSIN, TRANSRET > | |
search(const PERM &t, unsigned int level, unsigned int &completed, BSGS< PERM, TRANSRET > &groupK, BSGS< PERM, TRANSRET > &groupL) | permlib::classic::BacktrackSearch< BSGSIN, TRANSRET > | protected |
searchCosetRepresentative(BSGS< PERM, TRANSRET > &groupK, BSGS< PERM, TRANSRET > &groupL) | permlib::classic::BacktrackSearch< BSGSIN, TRANSRET > | virtual |
permlib::BaseSearch::searchCosetRepresentative() | permlib::BaseSearch< BSGSIN, TRANSRET > | virtual |
setupEmptySubgroup(BSGS< PERM, TRANSRET > &group) const | permlib::BaseSearch< BSGSIN, TRANSRET > | protected |
subgroupBase() const | permlib::classic::BacktrackSearch< BSGSIN, TRANSRET > | protectedvirtual |
TRANS typedef (defined in permlib::classic::IntersectionSearch< BSGSIN, TRANSRET >) | permlib::classic::IntersectionSearch< BSGSIN, TRANSRET > | |
~BaseSearch() | permlib::BaseSearch< BSGSIN, TRANSRET > | inlinevirtual |