Go to the source code of this file.
|
#define | TEST_MINIMIZE(idealStr, minimizedStr) |
|
#define | TEST_COLON_REMINIMIZE_TERM(idealStr, colonStr, minimizedStr) |
|
#define | TEST_COLON_REMINIMIZE_VAR(idealStr, colonVar, minimizedStr) |
|
#define | TEST_HASFULLSUPPORT(idealStr, _extraStr, value) |
|
#define | TEST_COMPACT(beforeStr, removeStr, afterStr) |
|
#define | TEST_TRANSPOSE(beforeStr, removeStr, afterStr) |
|
|
| TEST (RawSquareFreeIdeal, Insert_Term) |
|
| TEST (RawSquareFreeIdeal, NewIdealParse) |
|
| TEST (RawSquareFreeIdeal, Equality) |
|
| TEST (RawSquareFreeIdeal, SortLexAscending) |
|
| TEST (RawSquareFreeIdeal, MinimizeAndMinimizable) |
|
| TEST (RawSquareFreeIdeal, ColonReminimizeMinimize_VarAndTerm) |
|
| TEST (RawSquareFreeIdeal, GetVarDividesCounts) |
|
| TEST (RawSquareFreeIdeal, HasFullSupport) |
|
| TEST (RawSquareFreeIdeal, Compact) |
|
| TEST (RawSquareFreeIdeal, Transpose) |
|
◆ TEST_COLON_REMINIMIZE_TERM
#define TEST_COLON_REMINIMIZE_TERM |
( |
| idealStr, |
|
|
| colonStr, |
|
|
| minimizedStr ) |
Value: { \
ASSERT_TRUE2(sortedEqual(*ideal, *minimized), *ideal, *minimized); \
deleteRawSquareFreeIdeal(ideal); \
deleteRawSquareFreeIdeal(minimized); \
}
RawSquareFreeIdeal * newRawSquareFreeIdealParse(const char *str)
Allocates and returns an ideal based on str.
A bit packed square free ideal placed in a pre-allocated buffer.
void colonReminimize(const Word *colon)
Performs a colon and minimize.
bool isMinimallyGenerated() const
Returns true if no generator divides another.
void colon(Word *res, const Word *resEnd, const Word *a, const Word *b)
Word * newTermParse(const char *strParam)
Allocates and returns a term based on str.
unsigned long Word
The native unsigned type for the CPU.
Definition at line 184 of file RawSquareFreeIdealTest.cpp.
◆ TEST_COLON_REMINIMIZE_VAR
#define TEST_COLON_REMINIMIZE_VAR |
( |
| idealStr, |
|
|
| colonVar, |
|
|
| minimizedStr ) |
Value: { \
setExponent(
colon, colonVar, 1); \
ASSERT_TRUE2(sortedEqual(*idealVar, *minimized), *idealVar, *minimized); \
ASSERT_TRUE2(sortedEqual(*idealTerm, *minimized), *idealVar, *minimized); \
deleteRawSquareFreeIdeal(idealVar); \
deleteRawSquareFreeIdeal(idealTerm); \
deleteRawSquareFreeIdeal(minimized); \
}
size_t getVarCount() const
Word * newTerm(size_t varCount)
Returns identity term of varCount variables.
Definition at line 196 of file RawSquareFreeIdealTest.cpp.
◆ TEST_COMPACT
#define TEST_COMPACT |
( |
| beforeStr, |
|
|
| removeStr, |
|
|
| afterStr ) |
Value: { \
ASSERT_EQ(*before, *after); \
deleteRawSquareFreeIdeal(before); \
deleteTerm(remove); \
deleteRawSquareFreeIdeal(after); \
}
void compact(const Word *remove)
Removes the variables that divide remove.
Definition at line 371 of file RawSquareFreeIdealTest.cpp.
◆ TEST_HASFULLSUPPORT
#define TEST_HASFULLSUPPORT |
( |
| idealStr, |
|
|
| _extraStr, |
|
|
| value ) |
Value: { \
const char* extraStr = _extraStr; \
if (value) { \
} else { \
} \
deleteRawSquareFreeIdeal(ideal); \
deleteTerm(extra); \
}
bool hasFullSupport(const Word *ignore) const
Returns true if for every variable it either divides ignore or it divides some (not necessarily minim...
Definition at line 319 of file RawSquareFreeIdealTest.cpp.
◆ TEST_MINIMIZE
#define TEST_MINIMIZE |
( |
| idealStr, |
|
|
| minimizedStr ) |
Value: { \
ASSERT_TRUE(sortedEqual(*ideal, *minimized)); \
ASSERT_TRUE(sortedEqual(*ideal, *minimized)); \
deleteRawSquareFreeIdeal(ideal); \
deleteRawSquareFreeIdeal(minimized); \
}
Definition at line 146 of file RawSquareFreeIdealTest.cpp.
◆ TEST_TRANSPOSE
#define TEST_TRANSPOSE |
( |
| beforeStr, |
|
|
| removeStr, |
|
|
| afterStr ) |
Value: { \
ASSERT_EQ(*calculated, *after); \
ASSERT_EQ(*calculated, *after); \
deleteRawSquareFreeIdeal(before); \
deleteTerm(remove); \
deleteRawSquareFreeIdeal(after); \
deleteRawSquareFreeIdeal(calculated); \
}
RSFIdeal * newRawSquareFreeIdeal(size_t varCount, size_t capacity)
Allocates object with enough memory for capacity generators in varCount variables.
size_t getGeneratorCount() const
void transpose(Word *eraseVars=0)
Equivalent to setToTransposeOf(this, eraseVars).
void setToTransposeOf(const RawSquareFreeIdeal &ideal, Word *eraseVars=0)
Resets this object to the transpose of ideal.
Definition at line 397 of file RawSquareFreeIdealTest.cpp.
◆ TEST() [1/10]
◆ TEST() [2/10]
◆ TEST() [3/10]
◆ TEST() [4/10]
◆ TEST() [5/10]
◆ TEST() [6/10]
◆ TEST() [7/10]
◆ TEST() [8/10]
◆ TEST() [9/10]
◆ TEST() [10/10]