Implementation of the test-side polynomial-ring builders declared in util-polyring-creation.hpp. More...

#include "util-polyring-creation.hpp"

Functions
const Monoid *	degreeMonoid (const std::vector< std::string > &names)
const PolynomialRing *	degreeRing (const std::vector< std::string > &names)
const PolynomialRing *	degreeRing (int ndegrees)
const PolynomialRing *	simplePolynomialRing (const Ring kk, const std::vector< std::string > &names, MonomialOrdering monorder)
const PolynomialRing *	simplePolynomialRing (int p, const std::vector< std::string > &names)

Detailed Description

Implementation of the test-side polynomial-ring builders declared in util-polyring-creation.hpp.

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

Defines degreeMonoid(names) (a MonomialOrderings::join of negative-weight, GroupLex, and PositionUp blocks fed through Monoid::create against the trivial degree polynomial ring), the two degreeRing(...) overloads (variable-name list and fixed ndegrees == 1), and the two simplePolynomialRing(...) variants that wire a coefficient ring, monoid, and MonomialOrdering into the engine's PolyRing::create. The Z/p GRevLex shortcut at the bottom gives F4 tests one-liner ring construction.

Companion to the header it implements and to the other harness files (testMain.cpp, fromStream.cpp, M2-cpp-replacement.cpp) under the file-test-harness markdown family.

See also: util-polyring-creation.hpp; polyring.hpp; monoid.hpp; interface/monomial-ordering.h

Definition in file util-polyring-creation.cpp.

Functions

Detailed Description