Home
last modified time | relevance | path

Searched refs:leftOf (Results 1 – 25 of 179) sorted by relevance

12345678

/dports/math/vtk8/VTK-8.2.0/Common/DataModel/
H A DvtkPolyPlane.cxx76 static bool leftOf(double p1[2], double p2[2], double p3[2]) in leftOf() function
199 sign = leftOf(p1,p2,xFlat) ? 1 : -1; in EvaluateFunction()
216 bool leftOf01 = leftOf(p0,p1,xFlat); in EvaluateFunction()
217 bool leftOf12 = leftOf(p1,p2,xFlat); in EvaluateFunction()
220 if (leftOf(p0,p1,p2)) in EvaluateFunction()
235 sign = leftOf(p1,p2,xFlat) ? 1 : -1; in EvaluateFunction()
254 bool leftOf12 = leftOf(p1,p2,xFlat); in EvaluateFunction()
255 bool leftOf23 = leftOf(p2,p3,xFlat); in EvaluateFunction()
258 if (leftOf(p1,p2,p3)) in EvaluateFunction()
273 sign = leftOf(p1,p2,xFlat) ? 1 : -1; in EvaluateFunction()
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/
H A DvtkPolyPlane.cxx76 static bool leftOf(double p1[2], double p2[2], double p3[2]) in leftOf() function
198 sign = leftOf(p1, p2, xFlat) ? 1 : -1; in EvaluateFunction()
215 bool leftOf01 = leftOf(p0, p1, xFlat); in EvaluateFunction()
216 bool leftOf12 = leftOf(p1, p2, xFlat); in EvaluateFunction()
219 if (leftOf(p0, p1, p2)) in EvaluateFunction()
234 sign = leftOf(p1, p2, xFlat) ? 1 : -1; in EvaluateFunction()
253 bool leftOf12 = leftOf(p1, p2, xFlat); in EvaluateFunction()
254 bool leftOf23 = leftOf(p2, p3, xFlat); in EvaluateFunction()
257 if (leftOf(p1, p2, p3)) in EvaluateFunction()
272 sign = leftOf(p1, p2, xFlat) ? 1 : -1; in EvaluateFunction()
/dports/math/vtk6/VTK-6.2.0/Common/DataModel/
H A DvtkPolyPlane.cxx76 static bool leftOf(double p1[2], double p2[2], double p3[2]) in leftOf() function
199 sign = leftOf(p1,p2,xFlat) ? 1 : -1; in EvaluateFunction()
216 bool leftOf01 = leftOf(p0,p1,xFlat); in EvaluateFunction()
217 bool leftOf12 = leftOf(p1,p2,xFlat); in EvaluateFunction()
220 if (leftOf(p0,p1,p2)) in EvaluateFunction()
235 sign = leftOf(p1,p2,xFlat) ? 1 : -1; in EvaluateFunction()
254 bool leftOf12 = leftOf(p1,p2,xFlat); in EvaluateFunction()
255 bool leftOf23 = leftOf(p2,p3,xFlat); in EvaluateFunction()
258 if (leftOf(p1,p2,p3)) in EvaluateFunction()
273 sign = leftOf(p1,p2,xFlat) ? 1 : -1; in EvaluateFunction()
/dports/graphics/Coin/coin-Coin-4.0.0/src/base/
H A DSbBSPTree.cpp76 int leftOf(const SbVec3f &pt) const;
109 coin_bspnode::leftOf(const SbVec3f &pt) const in leftOf() function in coin_bspnode
118 if (this->leftOf(pt)) return this->left->addPoint(pt, maxpts); in addPoint()
147 if (this->leftOf(pt)) return this->left->findPoint(pt); in findPoint()
169 if (this->leftOf(min)) this->left->findPoints(sphere, array); in findPoints()
170 if (!this->leftOf(max)) this->right->findPoints(sphere, array); in findPoints()
190 if (this->leftOf(min)) this->left->findPoints(sphere, array); in findPoints()
191 if (!this->leftOf(max)) this->right->findPoints(sphere, array); in findPoints()
209 if (this->leftOf(pt)) this->left->updateIndex(pt, previdx, newidx); in updateIndex()
227 if (this->leftOf(pt)) return this->left->removePoint(pt); in removePoint()
[all …]
/dports/graphics/qgis-ltr/qgis-3.16.16/src/core/geometry/
H A Dqgsgeometryutils.h739 …const QgsPoint &pt, QgsPoint &segmentPt, QgsVertexId &vertexAfter, int *leftOf, double epsilon ) … in closestSegmentFromComponents() argument
752 sqrDist = container.at( i )->closestSegment( pt, segmentPt, vertexAfter, leftOf, epsilon ); in closestSegmentFromComponents()
762 if ( leftOf ) in closestSegmentFromComponents()
764 minDistLeftOf = *leftOf; in closestSegmentFromComponents()
789 if ( leftOf ) in closestSegmentFromComponents()
791 *leftOf = minDistLeftOf; in closestSegmentFromComponents()
H A Dqgscircularstring.h114 …&pt, QgsPoint &segmentPt SIP_OUT, QgsVertexId &vertexAfter SIP_OUT, int *leftOf SIP_OUT = nullptr,…
180 … const QgsPoint &pt, QgsPoint &segmentPt, QgsVertexId &vertexAfter, int *leftOf, double epsilon );
H A Dqgscircularstring.cpp918 …const QgsPoint &pt, QgsPoint &segmentPt, QgsVertexId &vertexAfter, int *leftOf, double epsilon ) … in closestSegment() argument
930 …, mY[i], mX[i + 1], mY[i + 1], mX[i + 2], mY[i + 2], pt, segmentPt, vertexAfter, leftOf, epsilon ); in closestSegment()
936 if ( leftOf ) in closestSegment()
938 minDistLeftOf = *leftOf; in closestSegment()
950 if ( leftOf ) in closestSegment()
952 *leftOf = qgsDoubleNear( minDist, 0.0 ) ? 0 : minDistLeftOf; in closestSegment()
1035 … const QgsPoint &pt, QgsPoint &segmentPt, QgsVertexId &vertexAfter, int *leftOf, double epsilon ) in closestPointOnArc() argument
1075 if ( leftOf ) in closestPointOnArc()
1078 *leftOf = clockwise ? ( sqrDistancePointToCenter > radius * radius ? -1 : 1 ) in closestPointOnArc()
/dports/graphics/qgis/qgis-3.22.3/src/core/geometry/
H A Dqgsgeometryutils.h965 …const QgsPoint &pt, QgsPoint &segmentPt, QgsVertexId &vertexAfter, int *leftOf, double epsilon ) … in closestSegmentFromComponents() argument
978 sqrDist = container.at( i )->closestSegment( pt, segmentPt, vertexAfter, leftOf, epsilon ); in closestSegmentFromComponents()
988 if ( leftOf ) in closestSegmentFromComponents()
990 minDistLeftOf = *leftOf; in closestSegmentFromComponents()
1015 if ( leftOf ) in closestSegmentFromComponents()
1017 *leftOf = minDistLeftOf; in closestSegmentFromComponents()
H A Dqgscircularstring.h148 …&pt, QgsPoint &segmentPt SIP_OUT, QgsVertexId &vertexAfter SIP_OUT, int *leftOf SIP_OUT = nullptr,…
219 … const QgsPoint &pt, QgsPoint &segmentPt, QgsVertexId &vertexAfter, int *leftOf, double epsilon );
/dports/graphics/qgis/qgis-3.22.3/tests/src/core/geometry/
H A Dtestqgscurvepolygon.cpp1040 int leftOf = 0; in testClosestSegment() local
1053 QCOMPARE( leftOf, 1 ); in testClosestSegment()
1059 QCOMPARE( leftOf, 1 ); in testClosestSegment()
1065 QCOMPARE( leftOf, -1 ); in testClosestSegment()
1071 QCOMPARE( leftOf, 1 ); in testClosestSegment()
1083 QCOMPARE( leftOf, 0 ); in testClosestSegment()
1093 QCOMPARE( leftOf, 1 ); in testClosestSegment()
1099 QCOMPARE( leftOf, 1 ); in testClosestSegment()
1105 QCOMPARE( leftOf, 1 ); in testClosestSegment()
1111 QCOMPARE( leftOf, 1 ); in testClosestSegment()
[all …]
H A Dtestqgsgeometrycollection.cpp755 int leftOf = 0; in geometryCollection() local
767 QCOMPARE( leftOf, 1 ); in geometryCollection()
772 QCOMPARE( leftOf, 1 ); in geometryCollection()
777 QCOMPARE( leftOf, -1 ); in geometryCollection()
782 QCOMPARE( leftOf, 1 ); in geometryCollection()
787 QCOMPARE( leftOf, -1 ); in geometryCollection()
799 QCOMPARE( leftOf, 1 ); in geometryCollection()
804 QCOMPARE( leftOf, 1 ); in geometryCollection()
809 QCOMPARE( leftOf, 1 ); in geometryCollection()
814 QCOMPARE( leftOf, 1 ); in geometryCollection()
[all …]
H A Dtestqgscircularstring.cpp1606 int leftOf = 0; in closestSegment() local
1619 QCOMPARE( leftOf, -1 ); in closestSegment()
1625 QCOMPARE( leftOf, 1 ); in closestSegment()
1631 QCOMPARE( leftOf, -1 ); in closestSegment()
1637 QCOMPARE( leftOf, 1 ); in closestSegment()
1643 QCOMPARE( leftOf, -1 ); in closestSegment()
1649 QCOMPARE( leftOf, 0 ); in closestSegment()
1659 QCOMPARE( leftOf, 1 ); in closestSegment()
1671 QCOMPARE( leftOf, 1 ); in closestSegment()
1683 QCOMPARE( leftOf, 1 ); in closestSegment()
[all …]
H A Dtestqgspolygon.cpp1183 int leftOf = 0; in polygon() local
1195 QCOMPARE( leftOf, 1 ); in polygon()
1200 QCOMPARE( leftOf, 1 ); in polygon()
1205 QCOMPARE( leftOf, -1 ); in polygon()
1210 QCOMPARE( leftOf, 1 ); in polygon()
1215 QCOMPARE( leftOf, -1 ); in polygon()
1227 QCOMPARE( leftOf, 1 ); in polygon()
1232 QCOMPARE( leftOf, 1 ); in polygon()
1237 QCOMPARE( leftOf, 1 ); in polygon()
1242 QCOMPARE( leftOf, 1 ); in polygon()
[all …]
H A Dtestqgscompoundcurve.cpp1656 int leftOf = 0; in compoundCurve() local
1668 QCOMPARE( leftOf, -1 ); in compoundCurve()
1673 QCOMPARE( leftOf, 1 ); in compoundCurve()
1678 QCOMPARE( leftOf, -1 ); in compoundCurve()
1683 QCOMPARE( leftOf, 1 ); in compoundCurve()
1688 QCOMPARE( leftOf, -1 ); in compoundCurve()
1693 QCOMPARE( leftOf, 0 ); in compoundCurve()
1702 QCOMPARE( leftOf, 1 ); in compoundCurve()
1707 QCOMPARE( leftOf, -1 ); in compoundCurve()
1717 QCOMPARE( leftOf, 1 ); in compoundCurve()
[all …]
H A Dtestqgslinestring.cpp2123 int leftOf = 0; in closestSegment() local
2137 QCOMPARE( leftOf, -1 ); in closestSegment()
2141 QCOMPARE( leftOf, -1 ); in closestSegment()
2145 QCOMPARE( leftOf, 1 ); in closestSegment()
2149 QCOMPARE( leftOf, 1 ); in closestSegment()
2158 QCOMPARE( leftOf, 1 ); in closestSegment()
2168 QCOMPARE( leftOf, -1 ); in closestSegment()
2178 QCOMPARE( leftOf, 1 ); in closestSegment()
2188 QCOMPARE( leftOf, -1 ); in closestSegment()
2198 QCOMPARE( leftOf, 1 ); in closestSegment()
[all …]
/dports/devel/spatialindex/spatialindex-src-1.8.5/src/spatialindex/
H A DLineSegment.cc436 bool LineSegment::leftOf(const SpatialIndex::Point &a, const SpatialIndex::Point &b, const SpatialI… in leftOf() function in LineSegment
451 return ((leftOf(a, b, c) ^ leftOf(a, b, d)) && in intersectsProper()
452 (leftOf(c, d, a) ^ leftOf(c, d, b))); in intersectsProper()
/dports/science/opensph/sph-7de6c044339f649e3d19e61f735a6a24572b792a/core/objects/geometry/
H A DSphere.h74 const Vector leftOf = max(box.lower() - p, Vector(0._f)); in overlaps() local
77 const Float distSqr = rSqr - getSqrLength(leftOf) - getSqrLength(rightOf); in overlaps()
/dports/devel/folly/folly-2021.12.27.00/folly/experimental/
H A DRelaxedConcurrentPriorityQueue.h306 deleteAllNodes(leftOf(pos)); in deleteAllNodes()
316 Position lchild = leftOf(pos); in isHeap()
342 FOLLY_ALWAYS_INLINE Position leftOf(const Position& pos) { in leftOf() function
595 Position lchild = leftOf(pos); in startPruning()
626 Position lchild = leftOf(pos); in startPruning()
890 Position lchild = leftOf(pos); in mergeDown()
946 Position lchild = leftOf(pos); in deferSettingRootSize()
/dports/graphics/graphviz/graphviz-2.44.1/lib/neatogen/
H A Dgeometry.h44 extern int leftOf(Point a, Point b, Point c);
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/
H A DTreeMap.java2209 private static <K,V> Entry<K,V> leftOf(Entry<K,V> p) { in leftOf() method in TreeMap
2282 if (x == leftOf(parentOf(x))) { in fixAfterInsertion()
2349 if (x == leftOf(parentOf(x))) { in fixAfterDeletion()
2359 if (colorOf(leftOf(sib)) == BLACK && in fixAfterDeletion()
2365 setColor(leftOf(sib), BLACK); in fixAfterDeletion()
2377 Entry<K,V> sib = leftOf(parentOf(x)); in fixAfterDeletion()
2383 sib = leftOf(parentOf(x)); in fixAfterDeletion()
2387 colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2391 if (colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2395 sib = leftOf(parentOf(x)); in fixAfterDeletion()
[all …]
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/
H A DTreeMap.java2212 private static <K,V> Entry<K,V> leftOf(Entry<K,V> p) { in leftOf() method in TreeMap
2285 if (x == leftOf(parentOf(x))) { in fixAfterInsertion()
2352 if (x == leftOf(parentOf(x))) { in fixAfterDeletion()
2362 if (colorOf(leftOf(sib)) == BLACK && in fixAfterDeletion()
2368 setColor(leftOf(sib), BLACK); in fixAfterDeletion()
2380 Entry<K,V> sib = leftOf(parentOf(x)); in fixAfterDeletion()
2386 sib = leftOf(parentOf(x)); in fixAfterDeletion()
2390 colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2394 if (colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2398 sib = leftOf(parentOf(x)); in fixAfterDeletion()
[all …]
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.base/share/classes/java/util/
H A DTreeMap.java2209 private static <K,V> Entry<K,V> leftOf(Entry<K,V> p) { in leftOf() method in TreeMap
2282 if (x == leftOf(parentOf(x))) { in fixAfterInsertion()
2349 if (x == leftOf(parentOf(x))) { in fixAfterDeletion()
2359 if (colorOf(leftOf(sib)) == BLACK && in fixAfterDeletion()
2365 setColor(leftOf(sib), BLACK); in fixAfterDeletion()
2377 Entry<K,V> sib = leftOf(parentOf(x)); in fixAfterDeletion()
2383 sib = leftOf(parentOf(x)); in fixAfterDeletion()
2387 colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2391 if (colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2395 sib = leftOf(parentOf(x)); in fixAfterDeletion()
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/
H A DTreeMap.java2209 private static <K,V> Entry<K,V> leftOf(Entry<K,V> p) { in leftOf() method in TreeMap
2282 if (x == leftOf(parentOf(x))) { in fixAfterInsertion()
2349 if (x == leftOf(parentOf(x))) { in fixAfterDeletion()
2359 if (colorOf(leftOf(sib)) == BLACK && in fixAfterDeletion()
2365 setColor(leftOf(sib), BLACK); in fixAfterDeletion()
2377 Entry<K,V> sib = leftOf(parentOf(x)); in fixAfterDeletion()
2383 sib = leftOf(parentOf(x)); in fixAfterDeletion()
2387 colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2391 if (colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2395 sib = leftOf(parentOf(x)); in fixAfterDeletion()
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.base/share/classes/java/util/
H A DTreeMap.java2209 private static <K,V> Entry<K,V> leftOf(Entry<K,V> p) { in leftOf() method in TreeMap
2282 if (x == leftOf(parentOf(x))) { in fixAfterInsertion()
2349 if (x == leftOf(parentOf(x))) { in fixAfterDeletion()
2359 if (colorOf(leftOf(sib)) == BLACK && in fixAfterDeletion()
2365 setColor(leftOf(sib), BLACK); in fixAfterDeletion()
2377 Entry<K,V> sib = leftOf(parentOf(x)); in fixAfterDeletion()
2383 sib = leftOf(parentOf(x)); in fixAfterDeletion()
2387 colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2391 if (colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2395 sib = leftOf(parentOf(x)); in fixAfterDeletion()
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.base/share/classes/java/util/
H A DTreeMap.java2221 private static <K,V> Entry<K,V> leftOf(Entry<K,V> p) { in leftOf() method in TreeMap
2294 if (x == leftOf(parentOf(x))) { in fixAfterInsertion()
2361 if (x == leftOf(parentOf(x))) { in fixAfterDeletion()
2371 if (colorOf(leftOf(sib)) == BLACK && in fixAfterDeletion()
2377 setColor(leftOf(sib), BLACK); in fixAfterDeletion()
2389 Entry<K,V> sib = leftOf(parentOf(x)); in fixAfterDeletion()
2395 sib = leftOf(parentOf(x)); in fixAfterDeletion()
2399 colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2403 if (colorOf(leftOf(sib)) == BLACK) { in fixAfterDeletion()
2407 sib = leftOf(parentOf(x)); in fixAfterDeletion()
[all …]

12345678