| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/s2/ |
| H A D | s2polygon.cc | 758 S2Loop* a_loop = a->loop(i); in ClipBoundary() local
759 int n = a_loop->num_vertices(); in ClipBoundary()
763 S2Point const& a0 = a_loop->vertex(j); in ClipBoundary()
1124 S2Loop* a_loop = loop(i); in BoundaryEquals() local
1128 if ((b_loop->depth() == a_loop->depth()) && in BoundaryEquals()
1129 b_loop->BoundaryEquals(a_loop)) { in BoundaryEquals()
1147 S2Loop* a_loop = loop(i); in BoundaryApproxEquals() local
1151 if (b_loop->depth() == a_loop->depth() && in BoundaryApproxEquals()
1169 S2Loop* a_loop = loop(i); in BoundaryNear() local
1173 if (b_loop->depth() == a_loop->depth() && in BoundaryNear()
[all …]
|
| H A D | s2polygon_test.cc | 945 S2Loop* a_loop = poly_a.loop(l); in MaximumDistanceInDegrees() local
946 if (LoopDiameter(*a_loop).degrees() <= min_diameter_in_degrees) { in MaximumDistanceInDegrees()
950 for (int v = 0; v < a_loop->num_vertices(); ++v) { in MaximumDistanceInDegrees()
952 DistanceToPolygonInDegrees(a_loop->vertex(v), poly_b); in MaximumDistanceInDegrees()
|
| /dports/graphics/R-cran-s2/s2/src/s2/ |
| H A D | s2polygon.cc | 1117 const S2Loop& a_loop = *a.loop(i); in SimplifyEdgesInCell() local
1118 const S2Point* v0 = &a_loop.oriented_vertex(0); in SimplifyEdgesInCell()
1338 const S2Loop* a_loop = loop(i); in Equals() local
1340 if ((b_loop->depth() != a_loop->depth()) || !b_loop->Equals(a_loop)) { in Equals()
1351 const S2Loop* a_loop = loop(i); in BoundaryEquals() local
1355 if ((b_loop->depth() == a_loop->depth()) && in BoundaryEquals()
1356 b_loop->BoundaryEquals(a_loop)) { in BoundaryEquals()
1374 const S2Loop& a_loop = *loop(i); in BoundaryApproxEquals() local
1378 if (b_loop.depth() == a_loop.depth() && in BoundaryApproxEquals()
1396 const S2Loop& a_loop = *loop(i); in BoundaryNear() local
[all …]
|
| /dports/graphics/s2/s2geometry-0.9.0/src/s2/ |
| H A D | s2polygon.cc | 1117 const S2Loop& a_loop = *a.loop(i); in SimplifyEdgesInCell() local
1118 const S2Point* v0 = &a_loop.oriented_vertex(0); in SimplifyEdgesInCell()
1338 const S2Loop* a_loop = loop(i); in Equals() local
1340 if ((b_loop->depth() != a_loop->depth()) || !b_loop->Equals(a_loop)) { in Equals()
1351 const S2Loop* a_loop = loop(i); in BoundaryEquals() local
1355 if ((b_loop->depth() == a_loop->depth()) && in BoundaryEquals()
1356 b_loop->BoundaryEquals(a_loop)) { in BoundaryEquals()
1374 const S2Loop& a_loop = *loop(i); in BoundaryApproxEquals() local
1378 if (b_loop.depth() == a_loop.depth() && in BoundaryApproxEquals()
1396 const S2Loop& a_loop = *loop(i); in BoundaryNear() local
[all …]
|
| H A D | s2polygon_test.cc | 2544 const S2Loop* a_loop = poly_a.loop(l); in MaximumDistanceInDegrees() local
2545 if (LoopDiameter(*a_loop).degrees() <= min_diameter_in_degrees) { in MaximumDistanceInDegrees()
2549 for (int v = 0; v < a_loop->num_vertices(); ++v) { in MaximumDistanceInDegrees()
2550 double distance = poly_b.GetDistance(a_loop->vertex(v)).degrees(); in MaximumDistanceInDegrees()
|
| /dports/graphics/py-s2/s2geometry-0.9.0/src/s2/ |
| H A D | s2polygon.cc | 1117 const S2Loop& a_loop = *a.loop(i); in SimplifyEdgesInCell() local
1118 const S2Point* v0 = &a_loop.oriented_vertex(0); in SimplifyEdgesInCell()
1338 const S2Loop* a_loop = loop(i); in Equals() local
1340 if ((b_loop->depth() != a_loop->depth()) || !b_loop->Equals(a_loop)) { in Equals()
1351 const S2Loop* a_loop = loop(i); in BoundaryEquals() local
1355 if ((b_loop->depth() == a_loop->depth()) && in BoundaryEquals()
1356 b_loop->BoundaryEquals(a_loop)) { in BoundaryEquals()
1374 const S2Loop& a_loop = *loop(i); in BoundaryApproxEquals() local
1378 if (b_loop.depth() == a_loop.depth() && in BoundaryApproxEquals()
1396 const S2Loop& a_loop = *loop(i); in BoundaryNear() local
[all …]
|
| H A D | s2polygon_test.cc | 2544 const S2Loop* a_loop = poly_a.loop(l); in MaximumDistanceInDegrees() local
2545 if (LoopDiameter(*a_loop).degrees() <= min_diameter_in_degrees) { in MaximumDistanceInDegrees()
2549 for (int v = 0; v < a_loop->num_vertices(); ++v) { in MaximumDistanceInDegrees()
2550 double distance = poly_b.GetDistance(a_loop->vertex(v)).degrees(); in MaximumDistanceInDegrees()
|
| /dports/devel/py-asynctest/asynctest-0.13.0/test/ |
| H A D | test_case.py | 137 a_loop = asyncio.new_event_loop()
138 self.addCleanup(a_loop.close)
144 asyncio.set_event_loop(a_loop)
145 self.assertIs(a_loop, asyncio.get_event_loop())
155 self.assertIs(a_loop, asyncio.get_event_loop())
|
| /dports/multimedia/libv4l/linux-5.13-rc2/arch/alpha/lib/ |
| H A D | stxcpy.S | 60 $a_loop:
66 beq t8, $a_loop # .. e1 (zdb)
|
| H A D | ev6-stxcpy.S | 73 $a_loop:
82 beq t8, $a_loop # U : (stall for t8)
|
| H A D | stxncpy.S | 68 $a_loop:
76 beq t8, $a_loop # e1 :
|
| H A D | ev6-stxncpy.S | 89 $a_loop:
100 beq t8, $a_loop # U :
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/arch/alpha/lib/ |
| H A D | stxcpy.S | 60 $a_loop:
66 beq t8, $a_loop # .. e1 (zdb)
|
| H A D | ev6-stxcpy.S | 73 $a_loop:
82 beq t8, $a_loop # U : (stall for t8)
|
| H A D | stxncpy.S | 68 $a_loop:
76 beq t8, $a_loop # e1 :
|
| H A D | ev6-stxncpy.S | 89 $a_loop:
100 beq t8, $a_loop # U :
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/arch/alpha/lib/ |
| H A D | stxcpy.S | 60 $a_loop:
66 beq t8, $a_loop # .. e1 (zdb)
|
| H A D | ev6-stxcpy.S | 73 $a_loop:
82 beq t8, $a_loop # U : (stall for t8)
|
| H A D | stxncpy.S | 68 $a_loop:
76 beq t8, $a_loop # e1 :
|
| H A D | ev6-stxncpy.S | 89 $a_loop:
100 beq t8, $a_loop # U :
|