Searched refs:getDegree (Results 1 – 14 of 14) sorted by relevance
129 if (a->getDegree() < b->getDegree()) { in runEuclideanAlgorithm()145 while (r->getDegree() >= R / 2) { in runEuclideanAlgorithm()167 int32_t denominatorLeadingTerm = rLast->getCoefficient(rLast->getDegree()); in runEuclideanAlgorithm()181 while (r->getDegree() >= rLast->getDegree() && !r->isZero()) { in runEuclideanAlgorithm()182 int32_t degreeDiff = r->getDegree() - rLast->getDegree(); in runEuclideanAlgorithm()184 m_field->multiply(r->getCoefficient(r->getDegree()), dltInverse); in runEuclideanAlgorithm()331 int32_t numErrors = errorLocator->getDegree(); in findErrorLocations()357 int32_t errorLocatorDegree = errorLocator->getDegree(); in findErrorMagnitudes()
63 int32_t CBC_PDF417ECModulusPoly::getDegree() { in getDegree() function in CBC_PDF417ECModulusPoly254 int32_t denominatorLeadingTerm = other->getCoefficient(other->getDegree()); in divide()262 while (remainder->getDegree() >= other->getDegree() && !remainder->isZero()) { in divide()263 int32_t degreeDifference = remainder->getDegree() - other->getDegree(); in divide()265 m_field->multiply(remainder->getCoefficient(remainder->getDegree()), in divide()306 for (int32_t degree = getDegree(); degree >= 0; degree--) { in toString()
18 int32_t getDegree();
25 return subfield.getDimension() * minimalPolynomial.getDegree(); in getDimension()33 public int getDegree() in getDegree() method in GenericPolynomialExtensionField35 return minimalPolynomial.getDegree(); in getDegree()
5 int getDegree(); in getDegree() method
7 int getDegree(); in getDegree() method
14 public int getDegree() in getDegree() method in GF2Polynomial
127 public double getDegree() in getDegree() method in SVM
638 double _retval_ = (*me)->getDegree( ); in Java_org_opencv_ml_SVM_getDegree_10()
46 return new ECFieldF2m(poly.getDegree(), ks); in convertField()
193 return new ECFieldF2m(poly.getDegree(), ks); in convertField()
99 size_t getDegree(size_t id) const;
481 size_t Graph::getDegree(size_t id) const in getDegree() function in Graph1283 conf += (int)basisGraphs[1 - (int)graphIdx].getDegree(v2); in findLongestPath()
514 CV_WRAP virtual double getDegree() const = 0;