#include <BigIdeal.h>
|
static bool | bigTermCompare (const vector< mpz_class > &a, const vector< mpz_class > &b) |
|
Definition at line 27 of file BigIdeal.h.
◆ BigIdeal() [1/2]
◆ BigIdeal() [2/2]
BigIdeal::BigIdeal |
( |
const VarNames & |
names | ) |
|
◆ addVarToClearedIdeal()
bool BigIdeal::addVarToClearedIdeal |
( |
const char * |
var | ) |
|
◆ bigTermCompare()
bool BigIdeal::bigTermCompare |
( |
const vector< mpz_class > & |
a, |
|
|
const vector< mpz_class > & |
b |
|
) |
| |
|
static |
◆ clear()
◆ clearAndSetNames()
void BigIdeal::clearAndSetNames |
( |
const VarNames & |
names | ) |
|
◆ contains()
bool BigIdeal::contains |
( |
const vector< mpz_class > & |
term | ) |
const |
◆ containsIdentity()
bool BigIdeal::containsIdentity |
( |
| ) |
const |
◆ deform()
void BigIdeal::deform |
( |
| ) |
|
◆ empty()
bool BigIdeal::empty |
( |
| ) |
const |
◆ eraseVar()
void BigIdeal::eraseVar |
( |
size_t |
var | ) |
|
◆ getExponent() [1/2]
mpz_class & BigIdeal::getExponent |
( |
size_t |
term, |
|
|
size_t |
var |
|
) |
| |
◆ getExponent() [2/2]
const mpz_class & BigIdeal::getExponent |
( |
size_t |
term, |
|
|
size_t |
var |
|
) |
| const |
◆ getGeneratorCount()
size_t BigIdeal::getGeneratorCount |
( |
| ) |
const |
|
inline |
◆ getLastTermExponentRef()
mpz_class & BigIdeal::getLastTermExponentRef |
( |
size_t |
var | ) |
|
|
inline |
◆ getLastTermRef()
vector< mpz_class > & BigIdeal::getLastTermRef |
( |
| ) |
|
|
inline |
◆ getLcm()
void BigIdeal::getLcm |
( |
vector< mpz_class > & |
lcm | ) |
const |
◆ getNames()
const VarNames & BigIdeal::getNames |
( |
| ) |
const |
◆ getTerm()
const vector< mpz_class > & BigIdeal::getTerm |
( |
size_t |
term | ) |
const |
|
inline |
◆ getVarCount()
size_t BigIdeal::getVarCount |
( |
| ) |
const |
|
inline |
◆ insert() [1/4]
void BigIdeal::insert |
( |
const Ideal & |
ideal | ) |
|
◆ insert() [2/4]
◆ insert() [3/4]
◆ insert() [4/4]
void BigIdeal::insert |
( |
const vector< mpz_class > & |
term | ) |
|
◆ newLastTerm()
void BigIdeal::newLastTerm |
( |
| ) |
|
◆ operator<()
bool BigIdeal::operator< |
( |
const BigIdeal & |
ideal | ) |
const |
◆ operator==()
bool BigIdeal::operator== |
( |
const BigIdeal & |
b | ) |
const |
◆ operator[]() [1/2]
vector< mpz_class > & BigIdeal::operator[] |
( |
size_t |
index | ) |
|
|
inline |
◆ operator[]() [2/2]
const vector< mpz_class > & BigIdeal::operator[] |
( |
size_t |
index | ) |
const |
|
inline |
◆ print() [1/2]
void BigIdeal::print |
( |
FILE * |
file | ) |
const |
◆ print() [2/2]
void BigIdeal::print |
( |
ostream & |
out | ) |
const |
◆ projectVar()
void BigIdeal::projectVar |
( |
size_t |
var | ) |
|
◆ renameVars()
void BigIdeal::renameVars |
( |
const VarNames & |
names | ) |
|
◆ reserve()
void BigIdeal::reserve |
( |
size_t |
capacity | ) |
|
◆ setExponent()
void BigIdeal::setExponent |
( |
size_t |
term, |
|
|
size_t |
var, |
|
|
const mpz_class & |
exp |
|
) |
| |
◆ sortGenerators()
void BigIdeal::sortGenerators |
( |
| ) |
|
◆ sortGeneratorsUnique()
void BigIdeal::sortGeneratorsUnique |
( |
| ) |
|
◆ sortVariables()
void BigIdeal::sortVariables |
( |
| ) |
|
◆ swap()
◆ takeRadical()
void BigIdeal::takeRadical |
( |
| ) |
|
◆ _names
◆ _terms
vector<vector<mpz_class> > BigIdeal::_terms |
|
private |
The documentation for this class was generated from the following files: