Go to the documentation of this file.
17 #ifndef EULER_STATE_GUARD
18 #define EULER_STATE_GUARD
59 void print(FILE* out);
62 bool debugIsValid()
const;
EulerState(const EulerState &)
size_t getVarCount() const
static EulerState * construct(const Ideal &idealParam, Arena *arena)
void toColonSubStateNoReminimizeNecessary(size_t pivotVar)
This is an arena allocator.
RawSquareFreeIdeal & getIdeal()
EulerState * makeSumSubState(size_t pivotVar)
RawSquareFreeIdeal * ideal
size_t getNonEliminatedVarCount() const
bool toColonSubState(const Word *pivot)
static EulerState * rawConstruct(size_t varCount, size_t capacity, Arena *arena)
EulerState * inPlaceStdSplit(size_t pivotVar)
void compactEliminatedVariablesIfProfitable()
void removeGenerator(size_t index)
Removes the generator at index.
A bit packed square free ideal placed in a pre-allocated buffer.
unsigned long Word
The native unsigned type for the CPU.
EulerState * inPlaceGenSplit(size_t pivotIndex)
size_t getVarCount() const
Represents a monomial ideal with int exponents.
void allocateIdealAndEliminated(size_t varCount, size_t capacity)
void removeGenerator(size_t index)
const RawSquareFreeIdeal & getIdeal() const
const Word * getEliminatedVars() const