TowerPolynomial Struct Reference

Heap-allocated node of a tower polynomial: a dense degree-indexed coefficient array that recurses through levels. More...

#include <dpoly.hpp>

Inheritance diagram for TowerPolynomial:

Public Attributes
int	deg
int	len
union {
long *   ints
TowerPolynomial *   polys
}	arr

Additional Inherited Members
Static Public Member Functions inherited from our_new_delete
static void *	operator new (size_t size)
static void *	operator new[] (size_t size)
static void	operator delete (void *obj)
static void	operator delete[] (void *obj)
static void *	operator new (size_t size, void *existing_memory)
static void *	operator new[] (size_t size, void *existing_memory)
static void	operator delete (void *obj, void *existing_memory)
static void	operator delete[] (void *obj, void *existing_memory)

Detailed Description

Heap-allocated node of a tower polynomial: a dense degree-indexed coefficient array that recurses through levels.

Note

AI-generated documentation. Verify against the source before relying on it.

deg is the polynomial's degree in the current top variable and len is the allocated capacity. The arr union picks the coefficient kind by depth: at the bottom level the coefficients are integers mod p stored in arr.ints, and at higher levels each "coefficient" is itself a TowerPolynomial one level down, stored in arr.polys. Tower polynomials are accessed through DPoly / DRing, which always carry the current level so the right union arm is consulted.

Definition at line 80 of file dpoly.hpp.

---

The documentation for this struct was generated from the following file:

• Macaulay2/e/dpoly.hpp