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