@class ExtensionInfo ExtensionInfo.h "factory/ExtensionInfo.h" * ExtensionInfo contains information about extension. * If @a m_extension is true w

* class to do operations mod p^k for int's p and k **/

@class DegreePattern DegreePattern.h "factory/DegreePattern.h" * * DegreePattern provides a functionality to create, intersect and refine * degree

-> class gmp_complex * @short gmp_complex numbers based on */

* generate random integers **/

* class to generate random evaluation points * * @sa cf_eval.h **/

* The permutation class represents an element in the symmetric group S_n. */

Class defining a complex number with double precision. ********************************************************************/

-> class gmp_float * @short wrapper class for GNU Multi Precision Floats */

! \class IntMinorValue \brief Class IntMinorValue is derived from MinorValue and can be used for representing values in a cache for sub-determ

typedef boosRing

* The philosophy here is that if this class overflows, then the computation needs to be restarted. Therefore * all overflows must be caught. */

class MapPair * * class MapPair - stores one mapping pair (Variable -> CanonicalForm). * * This class is only used to store such pairs. It has no

* generate random elements in F_p **/

This is a very basic spinlock implementation that does not guarantee fairness. TODO: add a wait queue and/or use futexes on Linux.

Classifier to assign the given input to a Singular helppage.

! \class PolyMinorValue \brief Class PolyMinorValue is derived from MinorValue and can be used for representing values in a cache for sub-dete

@class PythonCastDynamic * This class does conversion of Singular objects to python objects on runtime. * **/

class CFMap * * class CFMap - class to map canonical forms. * * Use an object of class CFMap to insert 'values' into canonical * form. Such a ma

The Most important class singular=SingularGlobalsProxy() for some ideal singular.groebner(i) singular.std(i) in gene

This struct holds information about one step of a traversal.

internal Version: 1.10.1.4 Some data types needed by the fglm algorithm. claptmpl.cc has to know them.

* generate random elements in F_p(alpha) **/

this class represents an equivalent relation, which is implemented by repeated evaluatation of a map c[n]=m means that n is equivalent to m

* generate all elements in F_p starting from 0 **/

* generate random elements in GF **/

@class LeftvShallow * Ths class wraps @c leftv by taking into acount memory allocation, destruction * as well as shallowly copying of a given @c lef

hopefully fixed possible problems: reevaluation writes new scope, if it isn't meant so, references do not work correctly because of scop

@class Template template.h <someRootDirectory/template.h> * * Brief description of class Template. * * Detailed description of class Template. *

* This class represents a Polyhedral fan with the combined features of a SymmetricComplex, and * a PolyhedralFan (which we regards as some collection

simple class for Turaev/Viro colors, each color has an inverse, but it doesn't have to be an algebraic structure

* generate all elements in F_p(alpha) starting from 0 **/

* class to evaluate a polynomial at points **/

! \class MinorKey \brief Class MinorKey can be used for representing keys in a cache for sub-determinantes; see class Cache. As such, it