#include <HilbertBasecase.h>
Definition at line 27 of file HilbertBasecase.h.
◆ HilbertBasecase()
HilbertBasecase::HilbertBasecase |
( |
| ) |
|
◆ ~HilbertBasecase()
HilbertBasecase::~HilbertBasecase |
( |
| ) |
|
◆ canSimplify()
bool HilbertBasecase::canSimplify |
( |
size_t | var, |
|
|
const Ideal & | ideal, |
|
|
const Term & | counts ) |
|
private |
◆ clearTodo()
void HilbertBasecase::clearTodo |
( |
| ) |
|
|
private |
◆ computeCoefficient()
void HilbertBasecase::computeCoefficient |
( |
Ideal & | ideal | ) |
|
◆ eliminate1Counts()
size_t HilbertBasecase::eliminate1Counts |
( |
Ideal & | ideal, |
|
|
Term & | counts, |
|
|
bool & | negate ) |
|
private |
◆ freeIdeal()
void HilbertBasecase::freeIdeal |
( |
auto_ptr< Ideal > | ideal | ) |
|
|
private |
◆ getLastCoefficient()
const mpz_class & HilbertBasecase::getLastCoefficient |
( |
| ) |
|
◆ getNewIdeal()
auto_ptr< Ideal > HilbertBasecase::getNewIdeal |
( |
| ) |
|
|
private |
◆ stepComputation()
bool HilbertBasecase::stepComputation |
( |
Entry & | entry, |
|
|
Entry & | newEntry ) |
|
private |
◆ _idealCache
vector<Ideal*> HilbertBasecase::_idealCache |
|
private |
◆ _idealCacheDeleter
◆ _stepsPerformed
size_t HilbertBasecase::_stepsPerformed |
|
private |
◆ _sum
mpz_class HilbertBasecase::_sum |
|
private |
◆ _term
Term HilbertBasecase::_term |
|
private |
◆ _todo
vector<Entry> HilbertBasecase::_todo |
|
private |
The documentation for this class was generated from the following files: