Main Page   Class Hierarchy   Compound List   File List   Compound Members   File Members  

GIC Class Reference

#include <GIC.h>

Inheritance diagram for GIC::

InformationCenter FEData List of all members.

Public Types

enum  AlgorithmID {
  NONE, AB_INV, NORM_CLOSURE, REWR_SYSTEM,
  AUT_STRUCTURE, GENETIC, FREE
}

Public Methods

 GIC (OID group_oid)
 ~GIC ()
void putHaveOrder (Integer the_order, Chars explanation="", bool showExplanation=true)
void putHaveSolvedWordProblem (Chars explanation, bool bShowExplanation=true)
void putHaveFastWordProblem (Chars explanation, bool bShowExplanation=true)
void putHaveCompleteCayleyGraph (SubgroupGraph CG)
void putHaveConfluentKBMachine (KBMachine kbm)
void putIsAutomatic (Trichotomy IsAutomatic)
void putHaveAutomatic (GroupDFSA wa, DiffMachine dm)
void putIsOneRelator (const Word &relator)
void putIsOneRelatorWithTorsion (const Word &relator)
void putHaveCyclicDecomposition (const AbelianGroup &)
void putHavePrimaryDecomposition (const AbelianGroup &)
void putHaveCanonicalSmithPresentation (const AbelianGroup &)
void putIsAbelian ()
void putIsFree (bool IsFree=true, Chars explanation="")
void putIsFinite (bool IsFinite=true, Chars explanation="", bool showExplanation=true)
void putHaveNilpotentQuotInited (const NilpotentGroup &theQuot, int theClass)
void putHaveNilpotentGroupInited (const NilpotentGroup &theGroup, Chars filename)
void putIsFreeNilpotent (const FreeGroup &F, int theClass)
void putIsNilpotent (int theClass)
void putIsFreeByCyclic (const FreeGroup &F, const Map &aut)
void putHaveMSC (FPGroup G, int lambda)
void putHaveMSCLambda (int lambda)
void putHaveAPOfFree (const AmalgProductOfFreeGroups &)
void putHaveHNNofFree (const class HNNExtOfFreeGroup &)
void putHaveSchreierTransvl (const PermutationRepresentation &)
void putHaveWordDecomposer (const class DecomposeInSubgroupOfFPGroup &)
void postSecondaryLogMessage (Chars message)
bool haveOrder () const
const Integer& getOrder () const
const Chars getOrderExplanation () const
const Chars getOrderMessage () const
bool haveSolvedWordProblem () const
bool haveFastWordProblem () const
bool haveCompleteCayleyGraph () const
SubgroupGraph getCompleteCayleyGraph () const
bool haveConfluentKBMachine () const
const KBMachinegetConfluentKBMachine () const
Trichotomy isAutomatic () const
bool haveAutomatic () const
const Chars getAutomaticMessage () const
const GroupDFSA& getWordAcceptor () const
const DiffMachinegetDiffMachine () const
bool isOneRelatorWithTorsion () const
bool isOneRelator () const
Word getOneRelator () const
bool haveCyclicDecomposition () const
bool havePrimaryDecomposition () const
const AbelianGroupgetCyclicDecomposition () const
const Chars getCyclicDecompositionMessage () const
Trichotomy isAbelian () const
Trichotomy isFree () const
Trichotomy isFinite () const
const Chars getFiniteExplanation () const
const Chars getFiniteMessage () const
bool haveNilpotentQuotInited (int theClass) const
bool haveNilpotentGroupInited () const
const NilpotentGroupgetNilpotentQuotInited (int theClass) const
const NilpotentGroupgetNilpotentGroupInited () const
const CharsgetBasisFileName () const
Trichotomy isFreeNilpotent () const
Trichotomy isNilpotent () const
int getNilpotentcyClass () const
void putActualNilpotencyClass (int c)
bool haveActualNilpotencyClass () const
int getActualNilpotencyClass () const
bool isFreeByCyclic () const
const FreeByCyclicgetFreeByCyclic () const
bool haveMSC () const
const MSCGroupgetMSC () const
bool haveMSCLambda () const
int getMSCLambda () const
Chars getMSCMessage () const
bool haveAPOfFree () const
const AmalgProductOfFreeGroupsgetAPOfFree () const
bool haveHNNofFree () const
const class HNNExtOfFreeGroupgetHNNofFree () const
bool haveSchreierTransvl () const
const PermutationRepresentationgetSchreierTransvl () const
bool haveWordDecomposer () const
const class DecomposeInSubgroupOfFPGroupgetWordDecomposer () const

Private Methods

 GIC (const GIC &)
AssociationsOf<int,NilpotentGroup*>& getNilpotentQuotients () const

Private Attributes

OID groupOID
Chars BCfileName

Member Enumeration Documentation

enum GIC::AlgorithmID
 

Enumeration values:
NONE  
AB_INV  
NORM_CLOSURE  
REWR_SYSTEM  
AUT_STRUCTURE  
GENETIC  
FREE  

Definition at line 484 of file GIC.h.


Constructor & Destructor Documentation

GIC::GIC ( OID group_oid )
 

GIC::~GIC ( )
 

GIC::GIC ( const GIC & ) [private]
 


Member Function Documentation

void GIC::putHaveOrder ( Integer the_order,
Chars explanation = "",
bool showExplanation = true )
 

void GIC::putHaveSolvedWordProblem ( Chars explanation,
bool bShowExplanation = true )
 

void GIC::putHaveFastWordProblem ( Chars explanation,
bool bShowExplanation = true )
 

void GIC::putHaveCompleteCayleyGraph ( SubgroupGraph CG )
 

void GIC::putHaveConfluentKBMachine ( KBMachine kbm )
 

void GIC::putIsAutomatic ( Trichotomy IsAutomatic )
 

void GIC::putHaveAutomatic ( GroupDFSA wa,
DiffMachine dm )
 

void GIC::putIsOneRelator ( const Word & relator )
 

void GIC::putIsOneRelatorWithTorsion ( const Word & relator )
 

void GIC::putHaveCyclicDecomposition ( const AbelianGroup & )
 

void GIC::putHavePrimaryDecomposition ( const AbelianGroup & )
 

void GIC::putHaveCanonicalSmithPresentation ( const AbelianGroup & )
 

void GIC::putIsAbelian ( )
 

void GIC::putIsFree ( bool IsFree = true,
Chars explanation = "" )
 

void GIC::putIsFinite ( bool IsFinite = true,
Chars explanation = "",
bool showExplanation = true )
 

void GIC::putHaveNilpotentQuotInited ( const NilpotentGroup & theQuot,
int theClass )
 

void GIC::putHaveNilpotentGroupInited ( const NilpotentGroup & theGroup,
Chars filename )
 

void GIC::putIsFreeNilpotent ( const FreeGroup & F,
int theClass )
 

void GIC::putIsNilpotent ( int theClass )
 

void GIC::putIsFreeByCyclic ( const FreeGroup & F,
const Map & aut )
 

void GIC::putHaveMSC ( FPGroup G,
int lambda )
 

void GIC::putHaveMSCLambda ( int lambda )
 

void GIC::putHaveAPOfFree ( const AmalgProductOfFreeGroups & )
 

void GIC::putHaveHNNofFree ( const class HNNExtOfFreeGroup & )
 

void GIC::putHaveSchreierTransvl ( const PermutationRepresentation & )
 

void GIC::putHaveWordDecomposer ( const class DecomposeInSubgroupOfFPGroup & )
 

void GIC::postSecondaryLogMessage ( Chars message )
 

bool GIC::haveOrder ( ) const
 

const Integer& GIC::getOrder ( ) const
 

const Chars GIC::getOrderExplanation ( ) const
 

const Chars GIC::getOrderMessage ( ) const
 

bool GIC::haveSolvedWordProblem ( ) const
 

bool GIC::haveFastWordProblem ( ) const
 

bool GIC::haveCompleteCayleyGraph ( ) const
 

SubgroupGraph GIC::getCompleteCayleyGraph ( ) const
 

bool GIC::haveConfluentKBMachine ( ) const
 

const KBMachine& GIC::getConfluentKBMachine ( ) const
 

Trichotomy GIC::isAutomatic ( ) const
 

bool GIC::haveAutomatic ( ) const
 

const Chars GIC::getAutomaticMessage ( ) const
 

const GroupDFSA& GIC::getWordAcceptor ( ) const
 

const DiffMachine& GIC::getDiffMachine ( ) const
 

bool GIC::isOneRelatorWithTorsion ( ) const
 

bool GIC::isOneRelator ( ) const
 

Word GIC::getOneRelator ( ) const
 

bool GIC::haveCyclicDecomposition ( ) const
 

bool GIC::havePrimaryDecomposition ( ) const
 

const AbelianGroup& GIC::getCyclicDecomposition ( ) const
 

const Chars GIC::getCyclicDecompositionMessage ( ) const
 

Trichotomy GIC::isAbelian ( ) const
 

Trichotomy GIC::isFree ( ) const
 

Trichotomy GIC::isFinite ( ) const
 

const Chars GIC::getFiniteExplanation ( ) const
 

const Chars GIC::getFiniteMessage ( ) const
 

bool GIC::haveNilpotentQuotInited ( int theClass ) const
 

bool GIC::haveNilpotentGroupInited ( ) const
 

const NilpotentGroup& GIC::getNilpotentQuotInited ( int theClass ) const
 

const NilpotentGroup& GIC::getNilpotentGroupInited ( ) const
 

const Chars & GIC::getBasisFileName ( ) const [inline]
 

Definition at line 624 of file GIC.h.

Trichotomy GIC::isFreeNilpotent ( ) const
 

Trichotomy GIC::isNilpotent ( ) const
 

int GIC::getNilpotentcyClass ( ) const
 

void GIC::putActualNilpotencyClass ( int c )
 

bool GIC::haveActualNilpotencyClass ( ) const
 

int GIC::getActualNilpotencyClass ( ) const
 

bool GIC::isFreeByCyclic ( ) const
 

const FreeByCyclic& GIC::getFreeByCyclic ( ) const
 

bool GIC::haveMSC ( ) const
 

const MSCGroup& GIC::getMSC ( ) const
 

bool GIC::haveMSCLambda ( ) const
 

int GIC::getMSCLambda ( ) const
 

Chars GIC::getMSCMessage ( ) const
 

bool GIC::haveAPOfFree ( ) const
 

const AmalgProductOfFreeGroups& GIC::getAPOfFree ( ) const
 

bool GIC::haveHNNofFree ( ) const
 

const class HNNExtOfFreeGroup& GIC::getHNNofFree ( ) const
 

bool GIC::haveSchreierTransvl ( ) const
 

const PermutationRepresentation& GIC::getSchreierTransvl ( ) const
 

bool GIC::haveWordDecomposer ( ) const
 

const class DecomposeInSubgroupOfFPGroup& GIC::getWordDecomposer ( ) const
 

AssociationsOf<int,NilpotentGroup*>& GIC::getNilpotentQuotients ( ) const [private]
 


Member Data Documentation

OID GIC::groupOID [private]
 

Definition at line 670 of file GIC.h.

Chars GIC::BCfileName [private]
 

Definition at line 735 of file GIC.h.


The documentation for this class was generated from the following file:
Generated at Tue Jun 19 09:49:55 2001 for Magnus Classes by doxygen1.2.6 written by Dimitri van Heesch, © 1997-2001