Basic Polynomial Algebra Subprograms (BPAS)  v. 1.791
TriangularSet< Field, RecursivePoly > Member List

This is the complete list of members for TriangularSet< Field, RecursivePoly >, including all inherited members.

allVariables() constTriangularSet< Field, RecursivePoly >
canComputeInDimensionZero(const RecursivePoly &p, bool excludeMainVariable=false) constTriangularSet< Field, RecursivePoly >
codimension() constTriangularSet< Field, RecursivePoly >inline
convertToExpressionTree() constTriangularSet< Field, RecursivePoly >inline
cutChain(const TriangularSet< Field, RecursivePoly > &T, const Symbol &v, TriangularSet< Field, RecursivePoly > &Tlv, RecursivePoly &Tv, TriangularSet< Field, RecursivePoly > &Tgv) constTriangularSet< Field, RecursivePoly >
cutChain(const Symbol &v, RecursivePoly &Tv, TriangularSet< Field, RecursivePoly > &Tgv) constTriangularSet< Field, RecursivePoly >
cutChain(const Symbol &v, TriangularSet< Field, RecursivePoly > &Tlv, RecursivePoly &Tv) constTriangularSet< Field, RecursivePoly >
dimension() constTriangularSet< Field, RecursivePoly >inline
dimensionLower(Symbol v) constTriangularSet< Field, RecursivePoly >inline
display()TriangularSet< Field, RecursivePoly >
isAlgebraic(const Symbol &s) constTriangularSet< Field, RecursivePoly >inline
isConstantPolynomial(const RecursivePoly &p) constTriangularSet< Field, RecursivePoly >
isEmpty() constTriangularSet< Field, RecursivePoly >
isStronglyNormalized() constTriangularSet< Field, RecursivePoly >inline
isZeroDimensionalMathematically() constTriangularSet< Field, RecursivePoly >
lower(const Symbol &s, BPASTriangularSet< Field, RecursivePoly > &ts) constTriangularSet< Field, RecursivePoly >virtual
mainVariables() constTriangularSet< Field, RecursivePoly >inline
makePrimitive()TriangularSet< Field, RecursivePoly >
normalForm(const RecursivePoly &p, std::vector< RecursivePoly > *Q=NULL) constTriangularSet< Field, RecursivePoly >virtual
numberOfAlgebraicVariables() constTriangularSet< Field, RecursivePoly >inline
numberOfTranscendentalVariables() constTriangularSet< Field, RecursivePoly >inline
numberOfVariables() constTriangularSet< Field, RecursivePoly >inlinevirtual
operator!=(const TriangularSet< Field, RecursivePoly > &a) constTriangularSet< 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) overrideTriangularSet< Field, RecursivePoly >virtual
operator=(TriangularSet< Field, RecursivePoly > &&a)TriangularSet< Field, RecursivePoly >
operator=(BPASTriangularSet< Field, RecursivePoly > &&a) overrideTriangularSet< Field, RecursivePoly >virtual
operator==(const TriangularSet< Field, RecursivePoly > &a) constTriangularSet< Field, RecursivePoly >
polynomials() constTriangularSet< Field, RecursivePoly >inline
pseudoDivide(const RecursivePoly &p, std::vector< RecursivePoly > *quo=NULL, RecursivePoly *c=NULL) constTriangularSet< 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) constTriangularSet< Field, RecursivePoly >
reduce(const RecursivePoly &p, RecursivePoly &c, bool takeMainPrimitivePart=false, bool onlyInDimZero=false) constTriangularSet< Field, RecursivePoly >
select(const Symbol &s) constTriangularSet< Field, RecursivePoly >virtual
size() constTriangularSet< Field, RecursivePoly >inline
transcendentalVariables() constTriangularSet< 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) constTriangularSet< Field, RecursivePoly >virtual
variables() constTriangularSet< Field, RecursivePoly >inlinevirtual
~TriangularSet()TriangularSet< Field, RecursivePoly >