| /dports/lang/spidermonkey78/firefox-78.9.0/dom/base/ |
| H A D | RangeUtils.cpp | 88 nsContentUtils::ComparePoints(aStartBoundary, aEndBoundary); in IsValidPoints()
157 Maybe<int32_t> order = nsContentUtils::ComparePoints( in CompareNodeToRange()
168 order = nsContentUtils::ComparePoints( in CompareNodeToRange()
|
| H A D | ContentIterator.cpp | 36 nsContentUtils::ComparePoints(aStart, afterNode); in ComparePostMode()
43 nsContentUtils::ComparePoints(afterNode, aEnd); in ComparePostMode()
63 nsContentUtils::ComparePoints(aStart, beforeNode); in ComparePreMode()
70 nsContentUtils::ComparePoints(beforeNode, aEnd); in ComparePreMode()
|
| H A D | nsRange.cpp | 766 Maybe<int32_t> order = nsContentUtils::ComparePoints(point, mStart); in ComparePoint()
774 order = nsContentUtils::ComparePoints(mEnd, point); in ComparePoint()
798 const Maybe<int32_t> startOrder = nsContentUtils::ComparePoints( in IntersectsNode()
803 const Maybe<int32_t> endOrder = nsContentUtils::ComparePoints( in IntersectsNode()
1023 const Maybe<int32_t> order = nsContentUtils::ComparePoints(aPoint, mEnd); in SetStart()
1112 const Maybe<int32_t> order = nsContentUtils::ComparePoints(mStart, aPoint); in SetEnd()
1629 *nsContentUtils::ComparePoints(startContainer, in CutContents()
1632 *nsContentUtils::ComparePoints(doctype, 0, endContainer, in CutContents()
1950 const Maybe<int32_t> order = nsContentUtils::ComparePoints( in CompareBoundaryPoints()
|
| /dports/editors/cudatext/CudaText-1.151.0/atsyneditex/atsynedit_ex/ |
| H A D | atsynedit_sortedrange.pas | 42 function ComparePoints(const P1, P2: TPoint): integer; inline; in ComparePoints() function
94 function ComparePoints(const P1, P2: TPoint): integer; inline; in ComparePoints() function
208 Result:= ComparePoints(Item^.Pos1, APos);
367 dif1:= ComparePoints(Pnt, APos1);
368 dif2:= ComparePoints(Pnt, APos2);
502 if (ComparePoints(RngOut^.Pos1, Rng^.Pos1)<=0) and
503 (ComparePoints(RngOut^.Pos2, Rng^.Pos2)>=0) then
|
| /dports/www/firefox-esr/firefox-91.8.0/dom/base/ |
| H A D | RangeUtils.cpp | 89 nsContentUtils::ComparePoints(aStartBoundary, aEndBoundary); in IsValidPoints()
173 Maybe<int32_t> order = nsContentUtils::ComparePoints( in CompareNodeToRange()
184 order = nsContentUtils::ComparePoints( in CompareNodeToRange()
|
| H A D | ContentIterator.cpp | 37 nsContentUtils::ComparePoints(aStart, afterNode); in ComparePostMode()
44 nsContentUtils::ComparePoints(afterNode, aEnd); in ComparePostMode()
64 nsContentUtils::ComparePoints(aStart, beforeNode); in ComparePreMode()
71 nsContentUtils::ComparePoints(beforeNode, aEnd); in ComparePreMode()
|
| H A D | nsRange.cpp | 778 Maybe<int32_t> order = nsContentUtils::ComparePoints(point, mStart); in ComparePoint()
786 order = nsContentUtils::ComparePoints(mEnd, point); in ComparePoint()
810 const Maybe<int32_t> startOrder = nsContentUtils::ComparePoints( in IntersectsNode()
815 const Maybe<int32_t> endOrder = nsContentUtils::ComparePoints( in IntersectsNode()
1057 const Maybe<int32_t> order = nsContentUtils::ComparePoints(aPoint, mEnd); in SetStart()
1146 const Maybe<int32_t> order = nsContentUtils::ComparePoints(mStart, aPoint); in SetEnd()
1665 *nsContentUtils::ComparePoints(startContainer, in CutContents()
1668 *nsContentUtils::ComparePoints(doctype, 0, endContainer, in CutContents()
2007 const Maybe<int32_t> order = nsContentUtils::ComparePoints( in CompareBoundaryPoints()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/dom/base/ |
| H A D | RangeUtils.cpp | 89 nsContentUtils::ComparePoints(aStartBoundary, aEndBoundary); in IsValidPoints()
173 Maybe<int32_t> order = nsContentUtils::ComparePoints( in CompareNodeToRange()
184 order = nsContentUtils::ComparePoints( in CompareNodeToRange()
|
| H A D | ContentIterator.cpp | 37 nsContentUtils::ComparePoints(aStart, afterNode); in ComparePostMode()
44 nsContentUtils::ComparePoints(afterNode, aEnd); in ComparePostMode()
64 nsContentUtils::ComparePoints(aStart, beforeNode); in ComparePreMode()
71 nsContentUtils::ComparePoints(beforeNode, aEnd); in ComparePreMode()
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/tests/ |
| H A D | rectangle_tree_test.cpp | 657 REQUIRE(tree.AuxiliaryInfo().HilbertValue().ComparePoints( in CheckHilbertOrdering()
748 REQUIRE(DiscreteHilbertValue<double>::ComparePoints(point01, point02) == -1);
753 REQUIRE(DiscreteHilbertValue<double>::ComparePoints(point01, point02) == -1);
758 REQUIRE(DiscreteHilbertValue<double>::ComparePoints(point01, point02) == -1);
799 REQUIRE(DiscreteHilbertValue<double>::ComparePoints(point1, point2) == -1);
807 REQUIRE(DiscreteHilbertValue<double>::ComparePoints(point1, point2) == -1);
815 REQUIRE(DiscreteHilbertValue<double>::ComparePoints(point1, point2) == -1);
823 REQUIRE(DiscreteHilbertValue<double>::ComparePoints(point1, point2) == -1);
831 REQUIRE(DiscreteHilbertValue<double>::ComparePoints(point1, point2) == 1);
846 REQUIRE(DiscreteHilbertValue<double>::ComparePoints(point3, point4) == -1);
[all …]
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/points/ |
| H A D | colocate.cpp | 145 class ComparePoints { class
154 ComparePoints( in ComparePoints() function in __anonbc20f4620111::ComparePoints
285 ComparePoints compare_points(points, dim, stride); in colocate_by_lexico_sort()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Nef_3/ |
| H A D | SNC_k3_tree_traits.h | 31 class ComparePoints {
35 ComparePoints(Coordinate c) : coord(c) { in ComparePoints() function
59 class ComparePoints<CGAL::Lazy_kernel<EK>, Coordinate> {
64 ComparePoints(Coordinate c) : coord(c) { in ComparePoints() function
127 typedef ComparePoints<Kernel, int> ComparePoints_;
|
| /dports/www/firefox/firefox-99.0/dom/base/ |
| H A D | RangeUtils.cpp | 89 nsContentUtils::ComparePoints(aStartBoundary, aEndBoundary); in IsValidPoints()
186 order = nsContentUtils::ComparePoints( in CompareNodeToRange()
|
| H A D | ContentIterator.cpp | 37 nsContentUtils::ComparePoints(aStart, afterNode); in ComparePostMode()
44 nsContentUtils::ComparePoints(afterNode, aEnd); in ComparePostMode()
64 nsContentUtils::ComparePoints(aStart, beforeNode); in ComparePreMode()
71 nsContentUtils::ComparePoints(beforeNode, aEnd); in ComparePreMode()
|
| /dports/lang/spidermonkey60/firefox-60.9.0/dom/base/ |
| H A D | nsRange.cpp | 129 nsContentUtils::ComparePoints(rangeStartContainer, in CompareNodeToRange()
135 *outNodeAfter = nsContentUtils::ComparePoints( in CompareNodeToRange()
162 int32_t cmp = nsContentUtils::ComparePoints( in operator ()()
166 cmp = nsContentUtils::ComparePoints( in operator ()()
233 nsContentUtils::ComparePoints( in IsNodeSelected()
241 nsContentUtils::ComparePoints( in IsNodeSelected()
879 if (nsContentUtils::ComparePoints(mEnd.AsRaw(), aPoint) == -1) { in ComparePoint()
1264 int32_t order = nsContentUtils::ComparePoints( in IsValidPoints()
1319 nsContentUtils::ComparePoints(aPoint, mEnd.AsRaw()) == 1) { in SetStart()
1511 if (nsContentUtils::ComparePoints(aStart, aEnd) == 1) { in SetStartAndEnd()
[all …]
|
| H A D | nsContentIterator.cpp | 67 return nsContentUtils::ComparePoints(aStart, afterNode) < 0 && in NodeIsInTraversalRange()
68 nsContentUtils::ComparePoints(aEnd, afterNode) >= 0; in NodeIsInTraversalRange()
73 return nsContentUtils::ComparePoints(aStart, beforeNode) <= 0 && in NodeIsInTraversalRange()
74 nsContentUtils::ComparePoints(aEnd, beforeNode) > 0; in NodeIsInTraversalRange()
|
| /dports/www/firefox/firefox-99.0/editor/spellchecker/ |
| H A D | FilteredContentIterator.cpp | 218 const Maybe<int32_t> startRes = nsContentUtils::ComparePoints( in ContentIsInTraversalRange()
223 const Maybe<int32_t> endRes = nsContentUtils::ComparePoints( in ContentIsInTraversalRange()
|
| /dports/www/firefox-esr/firefox-91.8.0/editor/spellchecker/ |
| H A D | FilteredContentIterator.cpp | 228 const Maybe<int32_t> startRes = nsContentUtils::ComparePoints( in ContentIsInTraversalRange()
230 const Maybe<int32_t> endRes = nsContentUtils::ComparePoints( in ContentIsInTraversalRange()
|
| /dports/lang/spidermonkey78/firefox-78.9.0/editor/spellchecker/ |
| H A D | FilteredContentIterator.cpp | 228 const Maybe<int32_t> startRes = nsContentUtils::ComparePoints( in ContentIsInTraversalRange()
230 const Maybe<int32_t> endRes = nsContentUtils::ComparePoints( in ContentIsInTraversalRange()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/editor/spellchecker/ |
| H A D | FilteredContentIterator.cpp | 228 const Maybe<int32_t> startRes = nsContentUtils::ComparePoints( in ContentIsInTraversalRange()
230 const Maybe<int32_t> endRes = nsContentUtils::ComparePoints( in ContentIsInTraversalRange()
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/editor/txtsvc/ |
| H A D | nsFilteredContentIterator.cpp | 228 int32_t startRes = nsContentUtils::ComparePoints(aStartNode, aStartOffset, in ContentIsInTraversalRange()
230 int32_t endRes = nsContentUtils::ComparePoints(aEndNode, aEndOffset, in ContentIsInTraversalRange()
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/dom/base/ |
| H A D | nsRange.cpp | 128 *outNodeBefore = nsContentUtils::ComparePoints(rangeStartParent, in CompareNodeToRange()
135 *outNodeAfter = nsContentUtils::ComparePoints(rangeEndParent, in CompareNodeToRange()
167 int32_t cmp = nsContentUtils::ComparePoints(mNode, mEndOffset, in operator ()()
171 cmp = nsContentUtils::ComparePoints(mNode, mStartOffset, in operator ()()
830 if ((cmp = nsContentUtils::ComparePoints(&aParent, aOffset, in ComparePoint()
835 if (nsContentUtils::ComparePoints(mEndParent, mEndOffset, in ComparePoint()
882 nsContentUtils::ComparePoints(parent, nodeIndex, in IntersectsNode()
1228 nsContentUtils::ComparePoints(aParent, aOffset, in SetStart()
1332 nsContentUtils::ComparePoints(mStartParent, mStartOffset, in SetEnd()
1903 nsContentUtils::ComparePoints(doctype, 0, in CutContents()
[all …]
|
| /dports/lang/spidermonkey60/firefox-60.9.0/editor/spellchecker/ |
| H A D | nsFilteredContentIterator.cpp | 251 int32_t startRes = nsContentUtils::ComparePoints( in ContentIsInTraversalRange()
253 int32_t endRes = nsContentUtils::ComparePoints(aEndContainer, aEndOffset, in ContentIsInTraversalRange()
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/rectangle_tree/ |
| H A D | discrete_hilbert_value.hpp | 82 static int ComparePoints(
|
| /dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/3d-viewer/3d_rendering/raytracing/accelerators/ |
| H A D | bvh_pbrt.cpp | 322 struct ComparePoints struct
324 explicit ComparePoints( int d ) { dim = d; } in ComparePoints() function
540 &primitiveInfo[end - 1] + 1, ComparePoints( dim ) ); in recursiveBuild()
555 &primitiveInfo[end - 1] + 1, ComparePoints( dim ) ); in recursiveBuild()
|