Class List
Here are the classes, structs, unions and interfaces with brief descriptions:

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