 |
Basic Polynomial Algebra Subprograms (BPAS)
v. 1.791
|
|
Basic Polynomial Algebra Subprograms (BPAS)
v. 1.791
|
This is the complete list of members for RegularChain< Field, RecursivePoly >, including all inherited members.
| allVariables() const | TriangularSet< Field, RecursivePoly > | |
| canComputeInDimensionZero(const RecursivePoly &p, bool excludeMainVariable=false) const | TriangularSet< Field, RecursivePoly > | |
| cleanSet(std::vector< RecursivePoly > &polys) const | RegularChain< 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 |
| TriangularSet::cutChain(const TriangularSet< Field, RecursivePoly > &T, const Symbol &v, TriangularSet< Field, RecursivePoly > &Tlv, RecursivePoly &Tv, TriangularSet< Field, RecursivePoly > &Tgv) const | TriangularSet< Field, RecursivePoly > | |
| TriangularSet::cutChain(const Symbol &v, RecursivePoly &Tv, TriangularSet< Field, RecursivePoly > &Tgv) const | TriangularSet< Field, RecursivePoly > | |
| TriangularSet::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 > | |
| intersect(const RecursivePoly &p, bool lazardDecompose=false, int heightBound=0) const | RegularChain< Field, RecursivePoly > | |
| intersectOne (defined in RegularChain< Field, RecursivePoly >) | RegularChain< Field, RecursivePoly > | friend |
| 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 > | |
| isInSaturatedIdealMinimal(const RecursivePoly &p) const | RegularChain< Field, RecursivePoly > | |
| isInSaturatedIdealMinimal_inner(const RecursivePoly &p) const (defined in RegularChain< Field, RecursivePoly >) | RegularChain< Field, RecursivePoly > | |
| isIteratedResultantZeroModular(const RecursivePoly &p) const | RegularChain< Field, RecursivePoly > | |
| isRegular(const RecursivePoly &p) const | RegularChain< Field, RecursivePoly > | |
| isSaturatedIdealPrime() const (defined in RegularChain< Field, RecursivePoly >) | RegularChain< Field, RecursivePoly > | inline |
| isSquareFree() const | RegularChain< Field, RecursivePoly > | inline |
| 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!=(const RegularChain< Field, RecursivePoly > &a) const | RegularChain< Field, RecursivePoly > | |
| TriangularSet::operator!=(const TriangularSet< Field, RecursivePoly > &a) const | 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 TriangularSet< Field, RecursivePoly > &a) (defined in RegularChain< Field, RecursivePoly >) | 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=(TriangularSet< Field, RecursivePoly > &&a) (defined in RegularChain< Field, RecursivePoly >) | RegularChain< Field, RecursivePoly > | |
| operator=(BPASTriangularSet< Field, RecursivePoly > &&a) override | RegularChain< Field, RecursivePoly > | virtual |
| operator=(BPASRegularChain< Field, RecursivePoly > &&a) override | RegularChain< Field, RecursivePoly > | virtual |
| operator==(const RegularChain< Field, RecursivePoly > &a) const | RegularChain< Field, RecursivePoly > | |
| TriangularSet::operator==(const TriangularSet< Field, RecursivePoly > &a) const | 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 takeMainPrimitivePart=false, 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 std::vector< RecursivePoly > polys) | 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, bool lazardDecompose=false, int heightBound=0) const | RegularChain< Field, RecursivePoly > | |
| regularize(const RecursivePoly &p, bool lazardDecompose=false, int heightBound=0) const | RegularChain< Field, RecursivePoly > | |
| removeRedundantChains(const std::vector< RegularChain< Field, RecursivePoly >> &lrc, std::vector< RegularChain< Field, RecursivePoly >> &results) | 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, bool lazardDecompose=false, int heightBound=0, int options=ASSUME_REGULAR) const | RegularChain< Field, RecursivePoly > | |
| transcendentalVariables() const | TriangularSet< Field, RecursivePoly > | inline |
| triangularize(const std::vector< RecursivePoly > &F, bool lazardDecompose=false, int type=0) | RegularChain< Field, RecursivePoly > | |
| triangularizeTask (defined in RegularChain< Field, RecursivePoly >) | RegularChain< Field, RecursivePoly > | friend |
| 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 > |
1.8.13