|
Frobby
0.9.5
|
This is the complete list of members for Ideal, including all inherited members.
| _allocator | Ideal | protected |
| _terms | Ideal | protected |
| _varCount | Ideal | protected |
| begin() const | Ideal | inline |
| begin() | Ideal | inline |
| clear() | Ideal | |
| clearAndSetVarCount(size_t varCount) | Ideal | |
| clearStaticCache() | Ideal | static |
| colon(const Exponent *by) | Ideal | |
| colon(size_t var, Exponent e) | Ideal | |
| colonReminimize(const Exponent *colon) | Ideal | |
| colonReminimize(size_t var, Exponent e) | Ideal | |
| const_iterator typedef | Ideal | |
| const_reverse_iterator typedef | Ideal | |
| Cont typedef | Ideal | private |
| contains(const Exponent *term) const | Ideal | |
| containsIdentity() const | Ideal | |
| disjointSupport() const | Ideal | |
| end() const | Ideal | inline |
| end() | Ideal | inline |
| getGcd(Exponent *gcd) const | Ideal | |
| getGcdAtExponent(Exponent *gcd, size_t var, Exponent exp) | Ideal | |
| getGcdOfMultiplesOf(Exponent *gcd, const Exponent *divisor) | Ideal | |
| getGeneratorCount() const | Ideal | inline |
| getLcm(Exponent *lcm) const | Ideal | |
| getLeastExponents(Exponent *least) const | Ideal | |
| getMostNonGenericExponent(size_t &var, Exponent &exp) | Ideal | |
| getMultiple(size_t var) const | Ideal | |
| getNonGenericExponent(size_t &var, Exponent &exp) | Ideal | |
| getSupportCounts(Exponent *counts) const | Ideal | |
| getTypicalExponent(size_t &var, Exponent &exp) | Ideal | |
| getTypicalNonGenericExponent(size_t &var, Exponent &exp) | Ideal | |
| getVarCount() const | Ideal | inline |
| Ideal(size_t varCount=0) | Ideal | |
| Ideal(const Term &term) | Ideal | explicit |
| Ideal(const Ideal &ideal) | Ideal | |
| insert(const Exponent *term) | Ideal | |
| insert(const Ideal &ideal) | Ideal | |
| insert(size_t var, Exponent e) | Ideal | |
| insertNonMultiples(const Exponent *term, const Ideal &ideal) | Ideal | |
| insertNonMultiples(size_t var, Exponent e, const Ideal &ideal) | Ideal | |
| insertReminimize(const Exponent *term) | Ideal | |
| insertReminimize(size_t var, Exponent e) | Ideal | |
| isIncomparable(const Exponent *term) const | Ideal | |
| isIrreducible() const | Ideal | |
| isMinimallyGenerated() const | Ideal | |
| isSquareFree() const | Ideal | |
| isStronglyGeneric() | Ideal | |
| isWeaklyGeneric() const | Ideal | |
| isZeroIdeal() const | Ideal | |
| iterator typedef | Ideal | |
| mapExponentsToZeroNoMinimize(const Term &zeroExponents) | Ideal | |
| minimize() | Ideal | |
| operator=(const Ideal &ideal) | Ideal | |
| operator==(const Ideal &ideal) const | Ideal | |
| operator[](size_t index) const | Ideal | inline |
| operator[](size_t index) | Ideal | inline |
| print(FILE *file) const | Ideal | |
| print(ostream &out) const | Ideal | |
| product(const Exponent *term) | Ideal | |
| remove(const_iterator it) | Ideal | |
| removeDuplicates() | Ideal | |
| removeIf(Predicate pred) | Ideal | inline |
| removeMultiples(const Exponent *term) | Ideal | |
| removeMultiples(size_t var, Exponent e) | Ideal | |
| removeStrictMultiples(const Exponent *term) | Ideal | |
| reverse_iterator typedef | Ideal | |
| singleDegreeSort(size_t var) | Ideal | |
| sortLex() | Ideal | |
| sortReverseLex() | Ideal | |
| strictlyContains(const Exponent *term) const | Ideal | |
| swap(Ideal &ideal) | Ideal | |
| takeRadicalNoMinimize() | Ideal | |
| ~Ideal() | Ideal |
1.9.1