/dports/graphics/opencv/opencv-4.5.3/contrib/modules/wechat_qrcode/src/zxing/common/reedsolomon/ |
H A D | reed_solomon_decoder.cpp | 72 if (a->getDegree() < b->getDegree()) { in runEuclideanAlgorithm() 84 while (r->getDegree() >= R / 2) { in runEuclideanAlgorithm() 98 int denominatorLeadingTerm = rLast->getCoefficient(rLast->getDegree()); in runEuclideanAlgorithm() 101 while (r->getDegree() >= rLast->getDegree() && !r->isZero()) { in runEuclideanAlgorithm() 102 int degreeDiff = r->getDegree() - rLast->getDegree(); in runEuclideanAlgorithm() 103 int scale = field->multiply(r->getCoefficient(r->getDegree()), dltInverse); in runEuclideanAlgorithm() 115 if (r->getDegree() >= rLast->getDegree()) { in runEuclideanAlgorithm() 140 int numErrors = errorLocator->getDegree(); in findErrorLocations()
|
H A D | genericgfpoly.cpp | 52 int GenericGFPoly::getDegree() { return coefficients_->size() - 1; } in getDegree() function in GenericGFPoly 209 int denominatorLeadingTerm = other->getCoefficient(other->getDegree()); in divide() 213 while (remainder->getDegree() >= other->getDegree() && !remainder->isZero()) { in divide() 214 int degreeDifference = remainder->getDegree() - other->getDegree(); in divide() 215 int scale = field_.multiply(remainder->getCoefficient(remainder->getDegree()), in divide()
|
/dports/graphics/lightzone/LightZone-4.1.8-3-g36e87773/lightcrafts/src/com/lightcrafts/ui/region/curves/ |
H A D | Polynomial.java | 43 int getDegree() { in getDegree() method in Polynomial 54 while (n <= Math.min(getDegree(), poly.getDegree())) { in add() 59 while (n <= getDegree()) { in add() 63 while (n <= poly.getDegree()) { in add() 85 int degree = getDegree(); in translate() 118 if (p1.getDegree() != p2.getDegree()) { in createShape() 121 int degree = p1.getDegree(); in createShape()
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/src/tests/ |
H A D | test_edgecontainer.cc | 53 BOOST_CHECK(edge_container.getDegree(1) == 1); 54 BOOST_CHECK(edge_container.getDegree(2) == 2); 55 BOOST_CHECK(edge_container.getDegree(3) == 1); 56 BOOST_CHECK_THROW(edge_container.getDegree(4), invalid_argument); 73 BOOST_CHECK_EQUAL(edge_container.getDegree(1), 3); 74 BOOST_CHECK_EQUAL(edge_container.getDegree(4), 2); 75 BOOST_CHECK_EQUAL(edge_container.getDegree(8), 3); 76 BOOST_CHECK_EQUAL(edge_container.getDegree(3), 1); 77 BOOST_CHECK_EQUAL(edge_container.getDegree(5), 1);
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/tools-9c102e0/src/tests/ |
H A D | test_edgecontainer.cc | 53 BOOST_CHECK(edge_container.getDegree(1) == 1); in BOOST_AUTO_TEST_CASE() 54 BOOST_CHECK(edge_container.getDegree(2) == 2); in BOOST_AUTO_TEST_CASE() 55 BOOST_CHECK(edge_container.getDegree(3) == 1); in BOOST_AUTO_TEST_CASE() 56 BOOST_CHECK_THROW(edge_container.getDegree(4), invalid_argument); in BOOST_AUTO_TEST_CASE() 73 BOOST_CHECK_EQUAL(edge_container.getDegree(1), 3); in BOOST_AUTO_TEST_CASE() 74 BOOST_CHECK_EQUAL(edge_container.getDegree(4), 2); in BOOST_AUTO_TEST_CASE() 75 BOOST_CHECK_EQUAL(edge_container.getDegree(8), 3); in BOOST_AUTO_TEST_CASE() 76 BOOST_CHECK_EQUAL(edge_container.getDegree(3), 1); in BOOST_AUTO_TEST_CASE() 77 BOOST_CHECK_EQUAL(edge_container.getDegree(5), 1); in BOOST_AUTO_TEST_CASE()
|
/dports/java/bouncycastle15/crypto-169/core/src/main/java/org/bouncycastle/pqc/math/linearalgebra/ |
H A D | GF2nPolynomial.java | 72 size = B1.getDegree() + 1; in GF2nPolynomial() 138 public final int getDegree() in getDegree() method in GF2nPolynomial 260 if (getDegree() != otherPol.getDegree()) in equals() 280 return getDegree() + coeff.hashCode(); in hashCode() 474 int bDegree = b.getDegree(); in divide() 476 if (a.getDegree() < bDegree) in divide() 487 int i = a.getDegree() - bDegree; in divide() 490 factor = (GF2nElement)a.coeff[a.getDegree()].multiply(inv); in divide() 496 i = a.getDegree() - bDegree; in divide() 556 alpha = a.coeff[a.getDegree()]; in gcd()
|
H A D | GF2nPolynomialElement.java | 45 mDegree = mField.getDegree(); in GF2nPolynomialElement() 59 mDegree = mField.getDegree(); in GF2nPolynomialElement() 75 mDegree = mField.getDegree(); in GF2nPolynomialElement() 90 mDegree = mField.getDegree(); in GF2nPolynomialElement() 143 GF2Polynomial polynomial = new GF2Polynomial(f.getDegree()); in ZERO() 155 GF2Polynomial polynomial = new GF2Polynomial(f.getDegree(), in ONE() 448 b = mField.getDegree() - 1; in invertSquare() 733 for (int i = 0; i < mField.getDegree() - 1; i++) in squareRootThis()
|
H A D | GF2mVector.java | 39 while (field.getDegree() > d) in GF2mVector() 125 while (field.getDegree() > d) in getEncoded() 239 for (int j = 0; j < field.getDegree(); j++) in toString()
|
/dports/science/gabedit/GabeditSrc251_300720/src/Symmetry/ |
H A D | SOperation.c | 30 static gint getDegree(SOperation* operation); 50 o.getDegree = getDegree; in newSOperation() 66 static gint getDegree(SOperation* operation) in getDegree() function
|
H A D | PointGroupGabedit.c | 162 for(n=0; n<elem->getDegree(elem); n++) in findUniqueAtoms() 312 gint degree = elem->getDegree(elem); in createSymmetrizedMolecule() 392 for(i=0; i<primaryRotation->getDegree(primaryRotation)*2; i++) in symmetrizeIcosahedralElements() 486 for(i=0; i<primaryRotation->getDegree(primaryRotation)*2; i++) in symmetrizeOctahedralElements() 562 if(firstRot->getDegree(firstRot) == 2) in symmetrizeTetrahedralElements() 566 if(primaryRotation->getDegree(primaryRotation) == 3) in symmetrizeTetrahedralElements() 583 for(i=0; i<primaryRotation->getDegree(primaryRotation)*2; i++) in symmetrizeTetrahedralElements() 655 if(elem->getDegree(elem)> startElement.getDegree(&startElement)) in symmetrizeMolecule() 689 if(startElement.getDegree(&startElement) > 1) in symmetrizeMolecule() 695 gdouble maxAngle = (2 * M_PI / primaryRotation->getDegree(primaryRotation)); in symmetrizeMolecule() [all …]
|
/dports/devel/fuzzylite/fuzzylite-6.0/fuzzylite/src/term/ |
H A D | Activated.cpp | 59 ss << Op::str(getDegree()) << " " << exporter.toString(getImplication()) << " " in parameters() 73 << Op::str(getDegree()) << "," in toString() 76 ss << "(" << Op::str(getDegree()) << "*" //"\u2297: (*)" in toString() 94 scalar Activated::getDegree() const { in getDegree() function in fl::Activated
|
/dports/security/steghide/steghide-0.5.1/src/ |
H A D | WKSConstructionHeuristic.cc | 39 UWORD32 degree = v->getDegree() ; in WKSConstructionHeuristic() 114 if (soccit->getVertex()->getDegree() == 1) { in checkNeighboursDeg1() 135 …if ((TheMatching->isExposed(v)) && (v->getDegree() > 1)) { // implicitly delete vertices that have… in findVertexDegG() 164 …if ((TheMatching->isExposed(v)) && (v->getDegree() == 1)) { // implicitly delete vertices that hav… in findVertexDeg1() 175 UWORD32 deg1 = v1->getDegree() ; in operator ()() 176 UWORD32 deg2 = v2->getDegree() ; in operator ()()
|
H A D | SMDConstructionHeuristic.h | 47 { return (v1->getDegree() < v2->getDegree()) ; } ; in operator()
|
/dports/java/bouncycastle15/crypto-169/core/src/main/java/org/bouncycastle/math/field/ |
H A D | GenericPolynomialExtensionField.java | 25 return subfield.getDimension() * minimalPolynomial.getDegree(); in getDimension() 33 public int getDegree() in getDegree() method in GenericPolynomialExtensionField 35 return minimalPolynomial.getDegree(); in getDegree()
|
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/operation/linemerge/ |
H A D | LineSequencer.java | 256 if (node.getDegree() % 2 == 1) in hasSequence() 341 if (minDegreeNode == null || node.getDegree() < minDegree) { in findLowestDegreeNode() 342 minDegree = node.getDegree(); in findLowestDegreeNode() 375 boolean hasDegree1Node = startNode.getDegree() == 1 in orient() 376 || endNode.getDegree() == 1; in orient() 383 if (endEdge.getToNode().getDegree() == 1 && endEdge.getEdgeDirection() == false) { in orient() 387 if (startEdge.getFromNode().getDegree() == 1 && startEdge.getEdgeDirection() == true) { in orient() 395 if (startEdge.getFromNode().getDegree() == 1) in orient()
|
/dports/graphics/geos/geos-3.9.1/src/operation/linemerge/ |
H A D | LineSequencer.cpp | 113 if(node->getDegree() % 2 == 1) { in hasSequence() 258 if(minDegreeNode == nullptr || node->getDegree() < minDegree) { in findLowestDegreeNode() 259 minDegree = node->getDegree(); in findLowestDegreeNode() 385 startNode->getDegree() == 1 || endNode->getDegree() == 1; in orient() 392 if(endEdge->getToNode()->getDegree() == 1 && in orient() 397 if(startEdge->getFromNode()->getDegree() == 1 && in orient() 408 if(startEdge->getFromNode()->getDegree() == 1) { in orient()
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/ChemReactions/ |
H A D | ReactionUtils.cpp | 194 order.reserve(atom1->getDegree()); in getNbrOrder() 206 if (atom1->getDegree() < atom2->getDegree()) { in getNbrOrder() 246 if (reactAtom->getDegree() >= 3 && prodAtom->getDegree() >= 3 && in countSwapsBetweenReactantAndProduct() 247 std::abs(static_cast<int>(prodAtom->getDegree()) - in countSwapsBetweenReactantAndProduct() 248 static_cast<int>(reactAtom->getDegree())) <= 1) { in countSwapsBetweenReactantAndProduct()
|
/dports/math/frobby/frobby-0.9.1/src/ |
H A D | TermGrader.h | 33 mpz_class getDegree(const Term& term) const; 36 void getDegree(const Term& term, mpz_class& degree) const; 41 void getDegree(const Term& term,
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/ |
H A D | FindStereo.cpp | 37 if (beginAtom->getDegree() < 2 || endAtom->getDegree() < 2 || in getStereoInfo() 38 beginAtom->getDegree() > 3 || endAtom->getDegree() > 3) { in getStereoInfo() 59 if (beginAtom->getDegree() == 2) { in getStereoInfo() 73 if (endAtom->getDegree() == 2) { in getStereoInfo() 136 sinfo.controllingAtoms.reserve(atom->getDegree()); in getStereoInfo() 201 if (begHeavyDegree > 1 && beginAtom->getDegree() < 4 && endHeavyDegree > 1 && in isBondPotentialStereoBond() 202 endAtom->getDegree() < 4) { in isBondPotentialStereoBond()
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/csg/src/libcsg/ |
H A D | beadmotif.cc | 89 Index degree = reduced_graph_.getDegree(vertex); in isLine_() 112 if (graph_.getDegree(vertex) != 2) { in isLoop_() 160 if (graph_.getDegree(vertex) < 2) { in isFusedRing_()
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/csg/csg-da5c1dc/src/libcsg/ |
H A D | beadmotif.cc | 89 Index degree = reduced_graph_.getDegree(vertex); in isLine_() 112 if (graph_.getDegree(vertex) != 2) { in isLoop_() 160 if (graph_.getDegree(vertex) < 2) { in isFusedRing_()
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/src/libtools/ |
H A D | edgecontainer.cc | 47 Index degree = getDegree(vertex_and_neigh_and_count.first); in getMaxDegree() 55 Index EdgeContainer::getDegree(const Index vertex) const { in getDegree() function in votca::tools::EdgeContainer 77 Index degree_count = getDegree(vertex_and_neigh_and_count.first); in getVerticesDegree() 87 Index degree_count = getDegree(vertex_and_neigh_and_count.first); in vertexExistWithDegree()
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/tools-9c102e0/src/libtools/ |
H A D | edgecontainer.cc | 47 Index degree = getDegree(vertex_and_neigh_and_count.first); in getMaxDegree() 55 Index EdgeContainer::getDegree(const Index vertex) const { in getDegree() function in votca::tools::EdgeContainer 77 Index degree_count = getDegree(vertex_and_neigh_and_count.first); in getVerticesDegree() 87 Index degree_count = getDegree(vertex_and_neigh_and_count.first); in vertexExistWithDegree()
|
/dports/math/openturns/openturns-1.18/lib/src/Base/Func/ |
H A D | UniVariatePolynomialImplementation.cxx | 188 const UnsignedInteger leftDegree = getDegree(); in operator *() 191 const UnsignedInteger rightDegree = uniVariatePolynomial.getDegree(); in operator *() 232 if ((getDegree() == 0) && (coefficients_[0] == 0.0)) return *this; in incrementDegree() 280 UnsignedInteger UniVariatePolynomialImplementation::getDegree() const in getDegree() function in UniVariatePolynomialImplementation 289 const UnsignedInteger degree = getDegree(); in getRoots()
|
/dports/security/helib/HElib-1.3.1/include/helib/ |
H A D | randomMatrices.h | 41 long d = ea.getDegree(); in RandomMatrix() 94 long d = ea.getDegree(); in RandomMultiMatrix() 151 long d = _ea.getDegree(); in RandomBlockMatrix() 207 long d = _ea.getDegree(); in RandomMultiBlockMatrix() 260 long d = ea.getDegree(); in RandomFullMatrix() 299 long d = ea.getDegree(); in RandomFullBlockMatrix()
|