Go to the documentation of this file.
29 TEST(IrreducibleDecom, TypicalEncoded) {
41 TEST(IrreducibleDecom, Typical) {
50 TEST(IrreducibleDecom, ZeroIdealEncoded) {
51 for (
size_t varCount = 0; varCount <= 3; ++varCount) {
63 TEST(IrreducibleDecom, ZeroIdeal) {
64 for (
size_t varCount = 0; varCount <= 3; ++varCount) {
70 vector<BigIdeal> ideals;
76 TEST(IrreducibleDecom, WholeRingEncoded) {
77 for (
size_t varCount = 0; varCount <= 3; ++varCount) {
90 TEST(IrreducibleDecom, WholeRing) {
91 for (
size_t varCount = 0; varCount <= 3; ++varCount) {
static BigIdeal xy_xxyyz()
Returns .
Records library interface output into a BigIdeal.
bool irreducibleDecompositionAsMonomials(const Ideal &ideal, IdealConsumer &consumer)
Compute the irreducible decomposition of ideal, and encode each irreducible component as a monomial.
static vector< BigIdeal > irrdecom_xx_yy_xz_yz()
Returns the irreducible decomposition of .
void irreducibleDecompositionAsIdeals(const Ideal &ideal, IdealConsumer &consumer)
Compute the irreducible decomposition of ideal.
TEST(IrreducibleDecom, TypicalEncoded)
bool hasAnyOutput() const
Returns whether any ideal has been recorded.
static BigIdeal wholeRing(size_t varCount)
Returns in the ring VarNames(varCount).
#define ASSERT_TRUE(VALUE)
const vector< BigIdeal > & getIdeals() const
Returns the recorded ideals in a canonical form.
static VarNames ring_xyzt()
Returns the ring in the four variables , , and .
Records library interface output into a vector of BigIdeals.
#define ASSERT_FALSE(VALUE)
Frobby::Ideal toLibIdeal(const BigIdeal &ideal)
Returns a library interface ideal that corresponds to the parameter ideal.
Defines the variables of a polynomial ring and facilities IO involving them.
const BigIdeal & getIdeal() const
Returns the recorded ideal in a canonical form.
static BigIdeal xx_yy_xz_yz()
Returns .
static BigIdeal zeroIdeal(size_t varCount)
Returns the ideal in the ring VarNames(varCount).
#define TEST_SUITE2(PARENT, SUITE)