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

__gnu_cxx::_Hashtable_const_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > |
__gnu_cxx::_Hashtable_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > |
__gnu_cxx::_Hashtable_node< _Val > |
Action |
AlexanderDualAction |
AnalyzeAction |
AssociatedPrimesAction |
DimensionAction | Implements the command line interface action dimension
DynamicFrobeniusAction |
EulerAction | Implements the command line interface action euler
FrobeniusAction |
GenerateFrobeniusAction |
GenerateIdealAction |
HelpAction |
HilbertAction |
IntersectionAction |
IrreducibleDecomAction |
LatticeAnalyzeAction |
LatticeFormatAction |
MaximalStandardAction |
OptimizeAction |
PolyTransformAction |
PrimaryDecomAction |
TestAction |
TransformAction |
ActionPrinter |
Arena | This is an arena allocator
BigattiBaseCase | This class handles the base cases for the Hilbert-Poincare series by Bigatti et.al
BigattiHilbertAlgorithm |
BigattiPivotStrategy | A BigattiPivotStrategy is an implementation of a pivot selection strategy for the Hilbert series algorithm by Bigatti et.al
BigPolynomial::BigCoefTerm |
BigIdeal |
FrobbyImpl::BigIdeal |
BigIdealComparator |
BigIntVector |
BigPolynomial |
Arena::Block |
ChunkPool |
CliParams |
Polynomial::CoefTerm |
CoefTermConsumer |
CanonicalCoefTermConsumer |
CoefBigTermConsumer |
CoefBigTermRecorder |
ExternalPolynomialConsumerWrapper |
IO::PolyWriter |
IO::CoCoA4PolyWriter |
IO::Fourti2PolyWriter |
IO::M2PolyWriter |
IO::SingularPolyWriter |
NullCoefTermConsumer | This follows the null object pattern
PolynomialConsolidator |
TranslatingCoefTermConsumer |
HilbertIndependenceConsumer |
HilbertIndependenceConsumer::RightConsumer |
TotalDegreeCoefTermConsumer |
UndeformConsumer |
ColumnPrinter::Col |
ColumnPrinter |
CommonParams |
ScarfParams |
SliceLikeParams |
BigattiParams |
SliceParams |
CommonParamsHelper | Utility class for dealing with the contents of CommonParams
RawSquareFreeIdeal::const_iterator | Const_iterator doesn't have all it needs to be a proper STL iterator
ConsumerWrapper |
ExternalIdealConsumerWrapper |
ExternalPolynomialConsumerWrapper |
DataType | The intention of this class is to describe the different kinds of mathematical structures that Frobby supports, such as a monomial ideal or a polynomial
Deformer | Objects of this class encapsulate the process of applying a generic deformation to a monomial ideal
DoubleLcmPredicate |
ElementDeleter< Container > |
HilbertBasecase::Entry |
InputConsumer::Entry |
EulerState |
Ideal::ExponentAllocator |
Facade | This is the super class of all facades
BigattiFacade | A facade for computing Hilbert series of monomial ideals using the divide-and-conquer algorithm by Bigatti et.al
DynamicFrobeniusFacade | A facade for using the dynamic programming Frobenius problem algorithm
GenerateDataFacade | A facade for random and other kinds of data
IOFacade | A facade for input and output of mathematical objects
IdealFacade | A facade for performing operations on BigIdeal
IntersectFacade | A facade for intersecting monomial ideals
LatticeFacade | A facade for operations on lattices
PolynomialFacade | A facade for operations on polynomials
ScarfFacade |
SliceFacade | A facade for operations on monomial ideals using the Slice Algorithm
FrobbyHash< Key > |
FrobbyHash< mpz_class > | This template specialization makes the hash code of an mpz_clas available to the implementation of HashMap
FrobbyHash< Term > | This template specialization makes the hash code of a term available to the implementation of HashMap
FrobbyImpl::FrobbyIdealHelper |
FrobbyStringStream | A replacement for stringstream
GrobLat | A lattice with associated Grobner basis/neighbors
__gnu_cxx::hash< _Key > |
__gnu_cxx::hash< char * > |
__gnu_cxx::hash< char > |
__gnu_cxx::hash< const char * > |
__gnu_cxx::hash< int > |
__gnu_cxx::hash< long > |
__gnu_cxx::hash< short > |
__gnu_cxx::hash< signed char > |
__gnu_cxx::hash< string > |
__gnu_cxx::hash< unsigned char > |
__gnu_cxx::hash< unsigned int > |
__gnu_cxx::hash< unsigned long > |
__gnu_cxx::hash< unsigned short > |
HashPolynomial | A sparse multivariate polynomial represented by a hash table mapping terms to coefficients
__gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > |
HilbertBasecase |
Frobby::Ideal |
Ideal | Represents a monomial ideal with int exponents
IdealComparator |
Frobby::IdealConsumer | This class provides a way to get monomial ideals as output from Frobby one generator at a time
IrreducibleIdealDecoder |
LibIdealConsumer | Records library interface output into a BigIdeal
LibIdealsConsumer | Records library interface output into a vector of BigIdeals
IdealFactory | This class has static methods that return various ideals
IdealOrderer |
IdealTree | Objects of this class represents a monomial ideal
IndependenceSplitter |
InputConsumer |
IOHandler | An IOHandler implements input and output for some format in such a way that client code does not need to know which format is being used
IO::IOHandlerImpl | This class contains a minimum level of functionality that makes it more convenient to derive from than IOHandler
IO::CountingIOHandler | This class displays the total number of things written to output, without actually displaying those things
IO::Fourti2IOHandler |
IO::IOHandlerCommon | This class contains further functionality that makes it more convenient to derive from than IOHandlerImpl in most but not all cases
IO::CoCoA4IOHandler |
IO::Macaulay2IOHandler |
IO::MonosIOHandler |
IO::SingularIOHandler |
IO::NewMonosIOHandler |
IO::NullIOHandler | This class ignores the input and discards all output
RawSquareFreeIdeal::iterator | Iterator doesn't have all it needs to be a proper STL iterator
LocalArray< T, ArenaSource > | Emulates stack allocation of an array using an Arena
logic_error |
AssertException |
std::logic_error |
InternalFrobbyException | This exception signals that a bug in Frobby has been detected
std::map |
HashMap< Term, mpz_class > |
HashMap< mpz_class, mpz_class > |
HashMap< Key, Value > |
Matrix |
Minimizer |
Mlfb |
NameFactory< AbstractProduct > | A NameFactory takes a name and then creates an instance of a class that has been previously registered under that name
Neighbor |
IdealTree::Node |
ObjectCache< T > | An ObjectCache keeps a cache of previously-used objects to cut down on the number of allocations
OffsetTermCompare |
Parameter |
BoolParameter |
IntegerParameter |
StringParameter |
ParameterGroup |
IOParameters |
SliceParameters | This class represents the parameters associated to the Slice Algorithm and the similar Bigatti et.al
Partition |
PivotEulerAlg |
PivotStrategy | A pivot selection strategy for the Euler algorithm
DebugStrategy | A wrapper for a SliceStrategy that prints out what is going out for debugging purposes, while delegating everything to the strategy being wrapped
StatisticsStrategy | A wrapper for a SliceStrategy that collects statistics on what is going on, while delegating everything to the strategy being wrapped
Plane |
Polynomial |
Frobby::PolynomialConsumer | This class provides a way to get polynomials as output from Frobby one term at a time
LibPolynomialConsumer | Records library interface output into a BigPolynomial
PolynomialFactory | This class has static methods that return various polynomials
Projection |
RawSquareFreeIdeal | A bit packed square free ideal placed in a pre-allocated buffer
runtime_error |
FrobbyStringStream::NotAnIntegerException |
std::runtime_error |
FrobbyException | This is the base of the Frobby exception hierarchy for exceptions that can occur due to expected error conditions
SatBinomConsumer |
SatBinomRecorder | SatBinomRecorder records all consumed saturated binomials into a passed-in ideal
SatBinomIdeal | Represents a saturated binomial ideal
Scanner | This class offers an input interface which is more convenient and for some purposes more efficient than dealing with a FILE* directly
ScarfHilbertAlgorithm |
SeqPos |
SizeMaxIndepSetAlg | Encapsulates an algorithm for computing size-maximal independent sets of a hypergraph
SliceStrategy | This class describes the interface of a strategy object for the Slice Algorithm
DebugStrategy | A wrapper for a SliceStrategy that prints out what is going out for debugging purposes, while delegating everything to the strategy being wrapped
SliceStrategyCommon | This class adds code to the SliceStrategy base class that is useful for derived classes
HilbertStrategy |
MsmStrategy |
OptimizeStrategy | OptimizeStrategy optimizes a function on the maximal standard monomials of a monomial ideal using branch-and-bound
StatisticsStrategy | A wrapper for a SliceStrategy that collects statistics on what is going on, while delegating everything to the strategy being wrapped
SplitStrategy | A SplitStrategy is an implementation of a split selection strategy for the Slice Algorithm
SplitStrategyCommon | This common base class provides code that is useful for writing pivot split strategies
LabelSplit |
MaxLabelSplit |
MinLabelSplit |
VarLabelSplit |
PivotSplit |
DegreeSplit |
DeprecatedFrobeniusSplit | This class is deprecated and is only here to create the alias "frob" for the degree split
GcdSplit |
MaximumSplit |
MedianSplit |
IndependencePivotSplit |
MinGenSplit |
MinimumSplit |
SquareFreeIdeal |
BigattiBaseCase::State | Used in enumerateScarfComplex and necessary to have here to define _states
ScarfHilbertAlgorithm::State |
StatisticsStrategy::StatTracker | Tracks statistics on slices
TestInternal::StdData |
StlTermPredicate | Adapter for TermPredicate which allows it to be used as a predicate in STL
StrictMultiplePredicate |
Task | A Task object represents a unit of work that is performed when the method run() is called
BigattiState |
HilbertIndependenceConsumer |
MsmIndependenceSplit |
Slice | This class represents a slice, which is the central data structure of the Slice Algorithm
HilbertSlice |
MsmSlice | Invariant: either the slice is a trivial base case, or removeDoubleLcm returns false
TaskEngine | TaskEngine handles a list of tasks that are to be carried out
Term | Term represents a product of variables which does not include a coefficient
TermConsumer | This class is used to transfer terms one at a time from one part of the program to another, and possibly to perform computations on those terms
BigTermConsumer |
AnalyzeConsumer |
BigTermRecorder | BigTermRecorder records all the terms it consumes into an ideal
ExternalIdealConsumerWrapper |
IO::IdealWriter |
IO::CoCoA4IdealWriter |
IO::Fourti2IdealWriter |
IO::M2IdealWriter |
IO::MonosIdealWriter |
IO::NewMonosIdealWriter |
IO::SingularIdealWriter |
IdealConsolidator |
IrreducibleIdealSplitter |
NullTermConsumer | This follows the null object pattern
TranslatingTermConsumer |
CanonicalTermConsumer | Passes consumed items on in a canonical order
DecomRecorder |
MsmIndependenceSplit |
MsmIndependenceSplit::RightConsumer |
OptimizeStrategy | OptimizeStrategy optimizes a function on the maximal standard monomials of a monomial ideal using branch-and-bound
TermIgnorer |
TermGrader | A TermGrader assigns a value, the degree, to each monomial
TermPredicate |
EqualsPredicate | A predicate that compares for equality
LexComparator | A predicate that sorts terms according to lexicographic order
ReverseLexComparator | A predicate that sorts according to reverse lexicographic order
ReverseSingleDegreeComparator | A predicate that sorts terms in weakly descending order according to degree of the specified variable
SingleDegreeComparator | A predicate that sorts terms in weakly ascending order according to degree of the specified variable
TermTranslator | TermTranslator handles translation between terms whose exponents are infinite precision integers and terms whose exponents are 32 bit integers
Test | This class represents a test or a suite of tests according to the Composite Pattern
TestCase | Represents a test case, which is usually created through a macro that defines a subclass
TestSuite | Represents a collection of tests, be they individual tests or yet other collections of tests
TestVisitor | This class is a visitor for classes derived from Test according to the Visitor Pattern
TestQualifier | Visits a tree of Test while keeping track of the path taken from the root to the current node as a dot-separated string
TestRunner | Runs every test in forward order
TestSorter | Sorts tests to avoid using the order imposed by the order of construction of global objects, since this is inconsistent across compilers and platforms
Timer | Measures spans of CPU time
TranslatedIdealComparator |
TranslatedReverseLexComparator | A predicate that sorts according to reverse lexicographic order on the translated values of a term
TreeNode |
Tri |
TriPlane |
UniHashPolynomial | A sparse univariate polynomial represented by a hash table mapping terms to coefficients
VarNames | Defines the variables of a polynomial ring and facilities IO involving them
VarSorter |
VarSorterCompare |