|  | Basic Polynomial Algebra Subprograms (BPAS)
    v. 1.791
    | 
This is the complete list of members for TriangularSet< Field, RecursivePoly >, including all inherited members.
| allVariables() const | TriangularSet< Field, RecursivePoly > | |
| canComputeInDimensionZero(const RecursivePoly &p, bool excludeMainVariable=false) const | TriangularSet< Field, RecursivePoly > | |
| codimension() const | TriangularSet< Field, RecursivePoly > | inline | 
| convertToExpressionTree() const | TriangularSet< Field, RecursivePoly > | inline | 
| cutChain(const TriangularSet< Field, RecursivePoly > &T, const Symbol &v, TriangularSet< Field, RecursivePoly > &Tlv, RecursivePoly &Tv, TriangularSet< Field, RecursivePoly > &Tgv) const | TriangularSet< Field, RecursivePoly > | |
| cutChain(const Symbol &v, RecursivePoly &Tv, TriangularSet< Field, RecursivePoly > &Tgv) const | TriangularSet< Field, RecursivePoly > | |
| cutChain(const Symbol &v, TriangularSet< Field, RecursivePoly > &Tlv, RecursivePoly &Tv) const | TriangularSet< Field, RecursivePoly > | |
| dimension() const | TriangularSet< Field, RecursivePoly > | inline | 
| dimensionLower(Symbol v) const | TriangularSet< Field, RecursivePoly > | inline | 
| display() | TriangularSet< Field, RecursivePoly > | |
| isAlgebraic(const Symbol &s) const | TriangularSet< Field, RecursivePoly > | inline | 
| isConstantPolynomial(const RecursivePoly &p) const | TriangularSet< Field, RecursivePoly > | |
| isEmpty() const | TriangularSet< Field, RecursivePoly > | |
| isStronglyNormalized() const | TriangularSet< Field, RecursivePoly > | inline | 
| isZeroDimensionalMathematically() const | TriangularSet< Field, RecursivePoly > | |
| lower(const Symbol &s, BPASTriangularSet< Field, RecursivePoly > &ts) const | TriangularSet< Field, RecursivePoly > | virtual | 
| 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 | TriangularSet< Field, RecursivePoly > | inlinevirtual | 
| operator!=(const TriangularSet< Field, RecursivePoly > &a) const | TriangularSet< Field, RecursivePoly > | |
| operator+(const RecursivePoly &p) | TriangularSet< Field, RecursivePoly > | |
| operator+=(const RecursivePoly &p) | TriangularSet< Field, RecursivePoly > | |
| operator<<(std::ostream &out, const TriangularSet< Field, RecursivePoly > &a) | TriangularSet< Field, RecursivePoly > | friend | 
| operator=(const TriangularSet< Field, RecursivePoly > &a) | TriangularSet< Field, RecursivePoly > | |
| operator=(const BPASTriangularSet< Field, RecursivePoly > &a) override | TriangularSet< Field, RecursivePoly > | virtual | 
| operator=(TriangularSet< Field, RecursivePoly > &&a) | TriangularSet< Field, RecursivePoly > | |
| operator=(BPASTriangularSet< Field, RecursivePoly > &&a) override | TriangularSet< Field, RecursivePoly > | virtual | 
| operator==(const TriangularSet< Field, RecursivePoly > &a) const | TriangularSet< 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 | 
| 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 takeMainPrimitivePart=false, bool onlyInDimZero=false) const | TriangularSet< Field, RecursivePoly > | |
| select(const Symbol &s) const | TriangularSet< Field, RecursivePoly > | virtual | 
| size() const | TriangularSet< Field, RecursivePoly > | inline | 
| transcendentalVariables() const | TriangularSet< Field, RecursivePoly > | inline | 
| 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 | TriangularSet< Field, RecursivePoly > | virtual | 
| variables() const | TriangularSet< Field, RecursivePoly > | inlinevirtual | 
| ~TriangularSet() | TriangularSet< Field, RecursivePoly > | 
 1.8.13
 1.8.13