allVariables() const | TriangularSet< Field, RecursivePoly > | |
canComputeInDimensionZero(const RecursivePoly &p, bool excludeMainVariable=false) const | TriangularSet< Field, RecursivePoly > | |
codimension() const | TriangularSet< Field, RecursivePoly > | inline |
compareCertifiedNoSplit(const RegularChain< Field, RecursivePoly > &rc1, const RegularChain< Field, RecursivePoly > &rc2) | RegularChain< Field, RecursivePoly > | static |
compareHeuristicNoSplit(const RegularChain< Field, RecursivePoly > &rc1, const RegularChain< Field, RecursivePoly > &rc2) | RegularChain< Field, RecursivePoly > | static |
constructChains(const TriangularSet< Field, RecursivePoly > &T) | RegularChain< Field, RecursivePoly > | static |
convertToExpressionTree() const | TriangularSet< Field, RecursivePoly > | inline |
dimension() const | TriangularSet< Field, RecursivePoly > | inline |
dimensionLower(Symbol v) const | TriangularSet< Field, RecursivePoly > | inline |
display() | TriangularSet< Field, RecursivePoly > | |
intersect(const RecursivePoly &p) const | RegularChain< Field, RecursivePoly > | |
isAlgebraic(const Symbol &s) const | TriangularSet< Field, RecursivePoly > | inline |
isConstantPolynomial(const RecursivePoly &p) const | TriangularSet< Field, RecursivePoly > | |
isEmpty() const | TriangularSet< Field, RecursivePoly > | |
isInRadicalSaturatedIdeal(const RecursivePoly &p) const | RegularChain< Field, RecursivePoly > | |
isInSaturatedIdeal(const RecursivePoly &p) const | RegularChain< Field, RecursivePoly > | |
isInSaturatedIdeal(const RecursivePoly &p, RecursivePoly &redp) const | RegularChain< Field, RecursivePoly > | |
isKnownToBeSquareFree() const | RegularChain< Field, RecursivePoly > | |
isRegular(const RecursivePoly &p) const | RegularChain< Field, RecursivePoly > | |
isStronglyNormalized() const | TriangularSet< Field, RecursivePoly > | inline |
isZeroDimensionalMathematically() const | TriangularSet< Field, RecursivePoly > | |
lower(const Symbol &s, BPASTriangularSet< Field, RecursivePoly > &ts) const | RegularChain< Field, RecursivePoly > | virtual |
lowerSlice(const Symbol &s) | RegularChain< Field, RecursivePoly > | |
mainVariables() const | TriangularSet< Field, RecursivePoly > | inline |
makePrimitive() | TriangularSet< Field, RecursivePoly > | |
normalForm(const RecursivePoly &p, std::vector< RecursivePoly > *Q=NULL) const | TriangularSet< Field, RecursivePoly > | virtual |
numberOfAlgebraicVariables() const | TriangularSet< Field, RecursivePoly > | inline |
numberOfTranscendentalVariables() const | TriangularSet< Field, RecursivePoly > | inline |
numberOfVariables() const | RegularChain< Field, RecursivePoly > | inlinevirtual |
operator!=(RegularChain< Field, RecursivePoly > &a) | RegularChain< Field, RecursivePoly > | |
TriangularSet::operator!=(TriangularSet< Field, RecursivePoly > &a) | TriangularSet< Field, RecursivePoly > | |
operator+(const RecursivePoly &p) const | RegularChain< Field, RecursivePoly > | |
operator+(const RegularChain< Field, RecursivePoly > &T) const | RegularChain< Field, RecursivePoly > | |
TriangularSet::operator+(const RecursivePoly &p) | TriangularSet< Field, RecursivePoly > | |
operator+=(const RecursivePoly &p) | RegularChain< Field, RecursivePoly > | |
operator+=(const RegularChain< Field, RecursivePoly > &T) | RegularChain< Field, RecursivePoly > | |
operator=(const ZeroDimensionalRegularChain< Field, RecursivePoly > &a) | RegularChain< Field, RecursivePoly > | |
operator=(const RegularChain< Field, RecursivePoly > &a) | RegularChain< Field, RecursivePoly > | |
operator=(const BPASTriangularSet< Field, RecursivePoly > &a) override | RegularChain< Field, RecursivePoly > | virtual |
operator=(const BPASRegularChain< Field, RecursivePoly > &a) override | RegularChain< Field, RecursivePoly > | virtual |
operator=(ZeroDimensionalRegularChain< Field, RecursivePoly > &&a) | RegularChain< Field, RecursivePoly > | |
operator=(RegularChain< Field, RecursivePoly > &&a) | RegularChain< Field, RecursivePoly > | |
operator=(BPASTriangularSet< Field, RecursivePoly > &&a) override | RegularChain< Field, RecursivePoly > | virtual |
operator=(BPASRegularChain< Field, RecursivePoly > &&a) override | RegularChain< Field, RecursivePoly > | virtual |
TriangularSet::operator=(const TriangularSet< Field, RecursivePoly > &a) | TriangularSet< Field, RecursivePoly > | |
TriangularSet::operator=(TriangularSet< Field, RecursivePoly > &&a) | TriangularSet< Field, RecursivePoly > | |
operator==(RegularChain< Field, RecursivePoly > &a) | RegularChain< Field, RecursivePoly > | |
TriangularSet::operator==(TriangularSet< Field, RecursivePoly > &a) | TriangularSet< Field, RecursivePoly > | |
options() const | RegularChain< Field, RecursivePoly > | |
polynomials() const | TriangularSet< Field, RecursivePoly > | inline |
pseudoDivide(const RecursivePoly &p, std::vector< RecursivePoly > *quo=NULL, RecursivePoly *c=NULL) const | TriangularSet< Field, RecursivePoly > | virtual |
randomRegularChain(int nVars, int nAlgVars, int nTrcVars, int nTerms, unsigned long int coefBound, int pSparsity, bool includeNeg) | RegularChain< Field, RecursivePoly > | |
randomRegularChain(int nVars, int nAlgVars, int nTrcVars, std::vector< int > maxDegs, unsigned long int coefBound, double pSparsity, bool includeNeg) | RegularChain< Field, RecursivePoly > | |
randomStronglyNormalizedTriangularSet(int nVars, int nAlgVars, int nTrcVars, int nTerms, unsigned long int coefBound, int pSparsity, bool includeNeg) | TriangularSet< Field, RecursivePoly > | |
randomTriangularSet(int nVars, int nAlgVars, int nTrcVars, int nTerms, unsigned long int coefBound, int pSparsity, bool includeNeg) | TriangularSet< Field, RecursivePoly > | |
randomTriangularSetPolynomial(std::vector< Symbol > variables, int algVar, std::vector< Symbol > transcendentalVariables, int nTerms, unsigned long int coefBound, int pSparsity, bool includeNeg) | TriangularSet< Field, RecursivePoly > | |
randomTriangularSetPolynomial(std::vector< Symbol > variables, int algVar, std::vector< Symbol > transcendentalVariables, std::vector< int > maxDegs, unsigned long int coefBound, double pSparsity, bool includeNeg) | TriangularSet< Field, RecursivePoly > | |
reduce(const RecursivePoly &p) const | TriangularSet< Field, RecursivePoly > | |
reduce(const RecursivePoly &p, RecursivePoly &c, bool usePrimitiveFactorization=true, bool onlyInDimZero=false) const | TriangularSet< Field, RecursivePoly > | |
RegularChain() | RegularChain< Field, RecursivePoly > | |
RegularChain(const std::vector< Symbol > &xs) | RegularChain< Field, RecursivePoly > | |
RegularChain(const std::vector< Symbol > &xs, const std::vector< Symbol > &ts) | RegularChain< Field, RecursivePoly > | |
RegularChain(const RecursivePoly &p) | RegularChain< Field, RecursivePoly > | |
RegularChain(const RecursivePoly &p, const std::vector< Symbol > &ts) | RegularChain< Field, RecursivePoly > | |
RegularChain(const ZeroDimensionalRegularChain< Field, RecursivePoly > &a) | RegularChain< Field, RecursivePoly > | |
RegularChain(const RegularChain< Field, RecursivePoly > &a) | RegularChain< Field, RecursivePoly > | |
RegularChain(const TriangularSet< Field, RecursivePoly > &a) | RegularChain< Field, RecursivePoly > | |
RegularChain(ZeroDimensionalRegularChain< Field, RecursivePoly > &&a) | RegularChain< Field, RecursivePoly > | |
RegularChain(RegularChain< Field, RecursivePoly > &&a) | RegularChain< Field, RecursivePoly > | |
RegularChain(TriangularSet< Field, RecursivePoly > &&a) | RegularChain< Field, RecursivePoly > | |
RegularChain(const std::vector< Symbol > &vs, const std::vector< Symbol > &avs, const std::vector< Symbol > &tvs, const std::vector< RecursivePoly > &ts, TriangularSetMode tsm, const mpz_class &c) | RegularChain< Field, RecursivePoly > | |
regularGCD(const RecursivePoly &p, const RecursivePoly &q, const Symbol &v, const SubResultantChain< RecursivePoly, RecursivePoly > &src) const | RegularChain< Field, RecursivePoly > | |
regularize(const RecursivePoly &p) const | RegularChain< Field, RecursivePoly > | |
removeRedundantChains(const std::vector< RegularChain< Field, RecursivePoly >> &lrc) | RegularChain< Field, RecursivePoly > | static |
select(const Symbol &s) const | RegularChain< Field, RecursivePoly > | inlinevirtual |
setOptions(int opts) | RegularChain< Field, RecursivePoly > | |
size() const | TriangularSet< Field, RecursivePoly > | inline |
squareFreePart(const RecursivePoly &p, const Symbol &v, int options=ASSUME_REGULAR) const | RegularChain< Field, RecursivePoly > | |
transcendentalVariables() const | TriangularSet< Field, RecursivePoly > | inline |
triangularize(const std::vector< RecursivePoly > &F) | RegularChain< Field, RecursivePoly > | |
TriangularSet() | TriangularSet< Field, RecursivePoly > | |
TriangularSet(const std::vector< Symbol > &xs) | TriangularSet< Field, RecursivePoly > | |
TriangularSet(const std::vector< Symbol > &xs, const std::vector< Symbol > &ts) | TriangularSet< Field, RecursivePoly > | |
TriangularSet(const RecursivePoly &p) | TriangularSet< Field, RecursivePoly > | |
TriangularSet(const RecursivePoly &p, const std::vector< Symbol > &ts) | TriangularSet< Field, RecursivePoly > | |
TriangularSet(const TriangularSet< Field, RecursivePoly > &a) | TriangularSet< Field, RecursivePoly > | |
TriangularSet(TriangularSet< Field, RecursivePoly > &&a) | TriangularSet< Field, RecursivePoly > | |
TriangularSet(const std::vector< Symbol > &vs, const std::vector< Symbol > &avs, const std::vector< Symbol > &tvs, const std::vector< RecursivePoly > &ts, TriangularSetMode tsm, const mpz_class &c) | TriangularSet< Field, RecursivePoly > | |
upper(const Symbol &s, BPASTriangularSet< Field, RecursivePoly > &ts) const | RegularChain< Field, RecursivePoly > | virtual |
variables() const | RegularChain< Field, RecursivePoly > | inlinevirtual |
~TriangularSet() | TriangularSet< Field, RecursivePoly > | |