|
Macaulay2 Engine
|
Interreducer — skeleton class for inter-reducing a list of gbvector* elements (currently unused). More...
#include "gbring.hpp"Go to the source code of this file.
Classes | |
| class | Interreducer |
| Interreduces a list of gbvector*s in place so that no element's leading term divides any other element's terms. More... | |
Interreducer — skeleton class for inter-reducing a list of gbvector* elements (currently unused).
Declares Interreducer, the intended helper for bringing a collection of gbvector* polynomials into a head-reduced state by applying smaller-pivot cancellation between any pair (f_i, f_j) whose leading terms divide each other. The class stores its working GBRing* R, FreeModule* F, and the live VECTOR(gbvector*) G. The declared reduction primitives are cancelLT(f, g) (cancel lt(f) using g, returning the reduction count), reduceTail(f, g) (keep going until no term of f is divisible by lt(g)), plus the index-flavoured reduceLT(f, i) / reduceTail(f, i) that reduce by every element of G except entry i; showElem / show are debug printers.
Caveat: this is orphan scaffolding. The constructor in interreduce.cpp is a (void) R0; (void) F0; (void) elems0; stub that does not initialise any field, and no other engine translation unit references Interreducer — a grep of *.cpp / *.hpp finds only the declaration and the empty .cpp. The class exists as a planned API surface but is not wired into any GB driver today.
Definition in file interreduce.hpp.