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

#include <aring-tower.hpp>

Public Attributes
int	deg
int	len
union {
ARingZZpFFPACK::ElementType * coeffs
ARingPolynomial * polys
};

Detailed Description

Heap-allocated node of an ARingTower polynomial: a dense degree-indexed coefficient array that recurses through tower 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 anonymous union picks the coefficient kind by depth: at the bottom level the coefficients are ARingZZpFFPACK::ElementType values stored in coeffs, and at higher levels each "coefficient" is itself an ARingPolynomial one level down, stored in polys. Accessed through ARingTower (the aring-shaped sibling of DRing in dpoly.hpp), which always carries the current level so the right union arm is consulted.

Definition at line 76 of file aring-tower.hpp.

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

Macaulay2/e/aring-tower.hpp

Public Attributes

Detailed Description