Macaulay2 Engine
Loading...
Searching...
No Matches
Polynomial Rings

Classes

struct  TowerPolynomial
 Heap-allocated node of a tower polynomial: a dense degree-indexed coefficient array that recurses through levels. More...
class  DPoly
 Arithmetic engine for tower-polynomial rings: (Z/p)[x_0][x_1]...[x_{nvars-1}] modulo a chain of extensions. More...
class  DRing
 Single-level view of a tower-polynomial ring: a DPoly plus a fixed working level and a Tower-flavoured ring_type typedef. More...
class  DPolyTraverser
 Visitor base class that walks every term of a TowerPolynomial, calling viewTerm(coeff, exponents) once per leaf. More...
class  Polynomial< CoefficientRingType >
class  PolyRingQuotient
 PolyRingFlat subclass for quotients R / I of a polynomial ring by an ideal. More...
class  PolynomialRing
 Abstract base for the engine's polynomial-ring hierarchy. More...
class  PolyRingFlat
 PolynomialRing subclass whose elements are represented as a single flat Nterm* linked list (no fraction / quotient wrapper). More...

Typedefs

typedef struct ARingPolynomialStructM2::ARingPolynomial

Detailed Description