| /dports/www/osrm-backend/osrm-backend-5.26.0/src/guidance/ |
| H A D | motorway_handler.cpp | 101 intersection = fromMotorway(via_eid, std::move(intersection)); in operator ()()
102 std::for_each(intersection.begin(), intersection.end(), [](ConnectedRoad &road) { in operator ()()
106 return intersection; in operator ()()
179 if (intersection[1].entry_allowed && intersection[2].entry_allowed) in fromMotorway()
181 assignFork(via_eid, intersection[2], intersection[1]); in fromMotorway()
201 assignFork(via_eid, intersection[3], intersection[2], intersection[1]); in fromMotorway()
357 return intersection; in fromMotorway()
483 assignFork(via_eid, intersection[2], intersection[1]); in fromRamp()
500 assignFork(via_eid, intersection[2], intersection[1]); in fromRamp()
532 return intersection; in fromRamp()
[all …]
|
| H A D | turn_handler.cpp | 165 return intersection; in handleOneWayTurn()
174 return intersection; in handleTwoWayTurn()
270 else if (isEndOfRoad(intersection[0], intersection[1], intersection[2]) && obvious_index == 0) in handleThreeWayTurn()
340 return intersection; in handleThreeWayTurn()
429 assignTrivialTurns(via_edge, intersection, 1, intersection.size()); in handleComplexTurn()
432 return intersection; in handleComplexTurn()
450 std::reverse(intersection.begin() + 1, intersection.end()); in assignLeftTurns()
456 intersection = assignRightTurns(via_edge, std::move(intersection), count); in assignLeftTurns()
459 return intersection; in assignLeftTurns()
490 handleDistinctConflict(via_edge, intersection[2], intersection[1]); in assignRightTurns()
[all …]
|
| H A D | turn_analysis.cpp | 107 Intersection intersection; in AssignTurnTypes() local
127 return intersection; in AssignTurnTypes()
132 intersection = roundabout_handler( in AssignTurnTypes()
138 intersection = in AssignTurnTypes()
156 intersection = turn_handler( in AssignTurnTypes()
162 intersection = sliproad_handler( in AssignTurnTypes()
168 std::for_each(intersection.begin(), intersection.end(), [](ConnectedRoad &road) { in AssignTurnTypes()
177 intersection = statistics_handler( in AssignTurnTypes()
180 return intersection; in AssignTurnTypes()
188 for (auto &road : intersection) in setTurnTypes()
[all …]
|
| H A D | turn_lane_matcher.cpp | 146 return intersection.begin(); in findBestMatchForReverse()
149 intersection.begin() + std::distance(intersection.begin(), neighbor_itr), in findBestMatchForReverse()
150 intersection.end(), in findBestMatchForReverse()
174 if (intersection[0].entry_allowed) in canMatchTrivially()
214 if (intersection[0].entry_allowed) in triviallyMatchLanesToTurns()
219 if (intersection.size() <= 1 || !intersection[1].entry_allowed || in triviallyMatchLanesToTurns()
223 return intersection; in triviallyMatchLanesToTurns()
236 return intersection; in triviallyMatchLanesToTurns()
263 return intersection; in triviallyMatchLanesToTurns()
265 u_turn = intersection.size() - 1; in triviallyMatchLanesToTurns()
[all …]
|
| H A D | sliproad_handler.cpp | 84 return intersection; in operator ()()
93 return intersection; in operator ()()
133 if (!std::any_of(begin(intersection), end(intersection), is_potential_link)) in operator ()()
135 return intersection; in operator ()()
141 return intersection; in operator ()()
149 return intersection; in operator ()()
154 return intersection; in operator ()()
160 return intersection; in operator ()()
628 return intersection; in operator ()()
670 if (first->intersection.isDeadEnd() || second->intersection.isDeadEnd()) in getObviousIndexWithSliproads()
[all …]
|
| H A D | turn_lane_handler.cpp | 31 return std::count_if(intersection.begin(), intersection.end(), [](const ConnectedRoad &road) { in getNumberOfTurns()
85 if (intersection.size() == 1) in assignTurnLanes()
86 return intersection; in assignTurnLanes()
136 return intersection; in assignTurnLanes()
143 return intersection; in assignTurnLanes()
165 if (intersection.end() != in deduceScenario()
166 std::find_if(intersection.begin(), intersection.end(), [](const auto &road) { in deduceScenario()
172 if (intersection.size() == 1) in deduceScenario()
421 if (intersection.size() == 2) in isSimpleIntersection()
698 return intersection; in simpleMatchTuplesToTurns()
[all …]
|
| H A D | turn_classification.cpp | 17 if (intersection.empty()) in classifyIntersection()
20 std::sort(intersection.begin(), in classifyIntersection()
21 intersection.end(), in classifyIntersection()
30 if (intersection.size() <= 1) in classifyIntersection()
35 for (const auto &road : intersection) in classifyIntersection()
52 intersection.back().perceived_bearing) < in classifyIntersection()
54 intersection.front().perceived_bearing)) in classifyIntersection()
56 intersection.insert(intersection.begin(), intersection.back()); in classifyIntersection()
57 intersection.pop_back(); in classifyIntersection()
59 for (const auto &road : intersection) in classifyIntersection()
[all …]
|
| /dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/dune/fem/misc/ |
| H A D | boundaryidprovider.hh | 50 static int boundaryId ( const Intersection &intersection ) in boundaryId()
52 return intersection.impl().boundaryId(); in boundaryId()
69 static int boundaryId ( const Intersection &intersection ) in boundaryId()
71 return intersection.impl().boundaryId(); in boundaryId()
88 static int boundaryId ( const Intersection &intersection ) in boundaryId()
191 return intersection.boundarySegmentIndex(); in boundaryId()
249 return (intersection.boundary() ? (intersection.indexInInside()+1) : 0); in boundaryId()
267 return (intersection.boundary() ? (intersection.impl().boundaryId()) : 0); in boundaryId()
284 return (intersection.boundary() ? (intersection.impl().boundaryId()) : 0); in boundaryId()
301 return intersection.boundarySegmentIndex(); in boundaryId()
[all …]
|
| /dports/math/dune-grid-glue/dune-grid-glue-17bd9898df80a52e2c316fc053119d190c149a2e/dune/grid-glue/merging/ |
| H A D | intersectionlist.hh | 48 virtual std::size_t parents0(Index intersection) const = 0;
55 virtual std::size_t parents1(Index intersection) const = 0;
102 { return p.parents0(intersection); } in parents()
105 { return p.parent0(intersection, index); } in parent()
108 { return p.corner0(intersection, corner, index); } in corner()
115 { return p.parents1(intersection); } in parents()
118 { return p.parent1(intersection, index); } in parent()
121 { return p.corner1(intersection, corner, index); } in corner()
154 std::size_t parents(Index intersection) const in parents()
270 std::size_t parents0(Index intersection) const override in parents0()
[all …]
|
| /dports/graphics/dilay/dilay-1.9.0/lib/src/tool/ |
| H A D | sketch-spheres.cpp | 138 SketchPathIntersection intersection; in runMoveEvent() local
147 intersection.mesh ().smoothPath (intersection.path (), in runMoveEvent()
153 this->mesh = &intersection.mesh (); in runMoveEvent()
158 SketchMeshIntersection intersection; in runMoveEvent() local
176 if (intersection.isIntersection ()) in runMoveEvent()
213 this->mesh = &intersection.mesh (); in runPressEvent()
221 SketchPathIntersection intersection; in runPressEvent() local
227 intersection.path (), in runPressEvent()
234 SketchMeshIntersection intersection; in runPressEvent() local
240 this->newSpherePosition (true, intersection.position (), intersection.normal ()); in runPressEvent()
[all …]
|
| /dports/devel/p5-Set-Infinite/Set-Infinite-0.65/t/ |
| H A D | backtrack.t | 99 # max with intersection
101 test ('intersection-max', '$r->intersection($q)->max', '11' );
110 # min with intersection
113 test ('intersection-min', '$r->intersection($q)->min', '15' );
137 test ('intersection', '$q->intersection(10,20)', '[10..16)');
163 # 29 intersection with 'b' complex
177 test ('complex intersection', '$a_quant->intersection($b)',
182 test ('complex no-intersection', '$a_quant->intersection($c)',
189 test ('too-complex intersection', '$a_quant->intersection($d)',
195 # print "i = ",$a_quant->intersection($d)->intersection($finite),"\n";
[all …]
|
| /dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/dune/fem/quadrature/caching/ |
| H A D | twistutility.hh | 51 return inside ? intersection.inside().type() : intersection.outside().type(); in elementGeometry()
120 elementGeometry(const Intersection& intersection, in elementGeometry()
146 assert( dim == 2 ? (intersection.impl().twistInInside() == 0 || in twistInSelf()
147 intersection.impl().twistInInside() == 1 ) : true ); in twistInSelf()
148 return intersection.impl().twistInInside(); in twistInSelf()
155 assert( dim == 2 ? (intersection.impl().twistInOutside() == 0 || in twistInNeighbor()
156 intersection.impl().twistInOutside() == 1 ) : true ); in twistInNeighbor()
157 return intersection.impl().twistInOutside(); in twistInNeighbor()
164 elementGeometry(const Intersection& intersection, in elementGeometry()
201 elementGeometry ( const Intersection &intersection, const bool inside ) in elementGeometry()
[all …]
|
| /dports/science/opensph/sph-7de6c044339f649e3d19e61f735a6a24572b792a/core/objects/finders/test/ |
| H A D | Bvh.cpp | 40 IntersectionInfo intersection; variable
43 REQUIRE(intersection.object);
45 REQUIRE(intersection.t == 1._f);
49 REQUIRE(intersection.object);
62 IntersectionInfo intersection; variable
64 REQUIRE(intersection.t == 1._f);
65 REQUIRE(intersection.object);
81 IntersectionInfo intersection; variable
85 REQUIRE(intersection.t > 1._f);
86 REQUIRE(intersection.t < 5._f);
[all …]
|
| /dports/graphics/opencv/opencv-4.5.3/modules/imgproc/src/ |
| H A D | intersection.cpp | 80 intersection.resize(4); in _rotatedRectangleIntersection()
84 intersection[i] = pts1[i]; in _rotatedRectangleIntersection()
138 if( !intersection.empty() ) in _rotatedRectangleIntersection()
219 int N = (int)intersection.size(); in _rotatedRectangleIntersection()
240 intersection[j] = intersection[N - 1]; in _rotatedRectangleIntersection()
271 intersection[minJ] = intersection[N - 1]; in _rotatedRectangleIntersection()
280 Point2f diffI = intersection[i + 1] - intersection[i]; in _rotatedRectangleIntersection()
283 Point2f diffJ = intersection[j] - intersection[i]; in _rotatedRectangleIntersection()
286 std::swap(intersection[i + 1], intersection[j]); in _rotatedRectangleIntersection()
292 intersection.resize(N); in _rotatedRectangleIntersection()
[all …]
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/include/guidance/ |
| H A D | intersection_handler.hpp | 117 extractor::intersection::IntersectionView intersection; // < actual intersection member
393 return std::find_if(intersection.begin() + 1, intersection.end(), is_similar_turn) == in IsDistinctNarrowTurn()
394 intersection.end(); in IsDistinctNarrowTurn()
468 return std::find_if(intersection.begin() + 1, intersection.end(), is_similar_turn) == in IsDistinctWideTurn()
469 intersection.end(); in IsDistinctWideTurn()
495 if (intersection.size() == 1) in findObviousTurn()
499 if (intersection.size() == 2) in findObviousTurn()
636 intersection.countEnterable() == 1) in findObviousTurn()
643 std::all_of(intersection.begin(), in findObviousTurn()
644 intersection.end(), in findObviousTurn()
[all …]
|
| /dports/math/py-sympy/sympy-1.9/sympy/geometry/tests/ |
| H A D | test_parabola.py | 88 assert parabola1.intersection(parabola1) == [parabola1]
90 assert parabola1.intersection(Parabola(p2, l3)) == [Point2D(0, -1)]
93 assert parabola1.intersection(Parabola(p3, l3)) == []
95 assert parabola1.intersection(p1) == []
96 assert parabola1.intersection(Point2D(0, -1)) == [Point2D(0, -1)]
97 assert parabola1.intersection(Point2D(4, 3)) == [Point2D(4, 3)]
106 assert parabola1.intersection(Segment2D((-12, -65), (14, -68))) == []
110 assert parabola1.intersection(Ray2D((0, 7), (0, 14))) == []
115 assert parabola1.intersection(Ellipse(Point(0, 19), 5, 7)) == []
116 assert parabola1.intersection(Ellipse((0, 3), 12, 4)) == \
[all …]
|
| /dports/security/hs-cryptol/cryptol-2.11.0/_cabal_deps/sbv-8.12/SBVBenchSuite/BenchSuite/Misc/ |
| H A D | SetAlgebra.hs | 83 commutivityCap = \(a :: SI) b -> a `intersection` b .== b `intersection` a
85 …assocCap = \(a :: SI) b c -> a `intersection` (b `intersection` c) .== (a `intersection` b) …
86 …distribCup = \(a :: SI) b c -> a `union` (b `intersection` c) .== (a `union` b) `intersection`…
87 …distribCap = \(a :: SI) b c -> a `intersection` (b `union` c) .== (a `intersection` b) `union`…
89 identCap = \(a :: SI) -> a `intersection` full .== a
97 idempCap = \(a :: SI) -> a `intersection` a .== a
99 domCap = \(a :: SI) -> a `intersection` empty .== empty
110 joinMeet3 = \(a :: SI) b -> (a `intersection` b) `isSubsetOf` a
111 joinMeet4 = \(a :: SI) b -> (a `intersection` b) `isSubsetOf` b
120 relCompCapCap = \(a :: SI) b c -> (b \\ a) `intersection` c .== (b `intersection` c) \\ a
[all …]
|
| /dports/math/dune-alugrid/dune-alugrid-08c6496d4d4a33df6456c3b402182f353dc2e76d/dune/alugrid/test/ |
| H A D | checkintersectionit.hh | 141 const Entity inside = intersection.inside(); in checkIntersection()
148 if( intersection.boundary() ) in checkIntersection()
150 if( !intersection.conforming() && !intersection.neighbor() ) in checkIntersection()
159 if( geometry.type() != intersection.type() ) in checkIntersection()
223 if( intersection.neighbor() ) in checkIntersection()
240 if( !intersection.boundary() ) in checkIntersection()
292 if( !intersection.type().isNone() ) in checkIntersection()
324 = intersection.outerNormal( pt ); in checkIntersection()
501 if( *eIt != intersection.inside() ) in checkIntersectionIterator()
566 if( intersection.conforming() && intersection.neighbor() && !intersection.boundary() ) in checkIntersectionIterator()
[all …]
|
| /dports/devel/libslang2/slang-2.3.2/slsh/lib/test/ |
| H A D | test_setfuns.sl | 32 test_func (&intersection, {[1:5], [3:7]}, [2:4]);
33 test_func (&intersection, {[1:5], [5:7]}, [4]);
34 test_func (&intersection, {[1:5], [0:1]}, [0]);
35 test_func (&intersection, {[1:5], [5]}, [4]);
36 test_func (&intersection, {[1:5], [6]}, Int_Type[0]);
38 test_func (&intersection, {{1,2,3,4,5}, [3:7]}, [2:4]);
39 test_func (&intersection, {{1,2,3,4,5}, [5:7]}, [4]);
40 test_func (&intersection, {{1,2,3,4,5}, [0:1]}, [0]);
41 test_func (&intersection, {{1,2,3,4,5}, [5]}, [4]);
47 test_func (&intersection, {{"foo", 3i},{}}, Int_Type[0]);
[all …]
|
| /dports/cad/openscad/openscad-41f58fe57c03457a3a8b4dc541ef5654ec3e8c78/testdata/scad/3D/features/ |
| H A D | intersection-tests.scad | 2 intersection();
5 intersection() { }
7 intersection() {
12 translate([0,12,0]) intersection() {
17 translate([12,0,0]) intersection() {
23 translate([12,12,0]) intersection() {
28 translate([24,0,0]) intersection() {
33 translate([-12,0,0]) intersection() {
38 translate([-12,12,0]) intersection() {
44 translate([0,-12,0]) intersection() {
[all …]
|
| /dports/cad/openscad-devel/openscad-63a7c77740030c63d646eb0684ba6947eecb0db7/testdata/scad/3D/features/ |
| H A D | intersection-tests.scad | 2 intersection();
5 intersection() { }
7 intersection() {
12 translate([0,12,0]) intersection() {
17 translate([12,0,0]) intersection() {
23 translate([12,12,0]) intersection() {
28 translate([24,0,0]) intersection() {
33 translate([-12,0,0]) intersection() {
38 translate([-12,12,0]) intersection() {
44 translate([0,-12,0]) intersection() {
[all …]
|
| /dports/math/dune-metagrid/dune-metagrid-45fe80d530d18d8b86e77f20e38865f2101e571a/dune/grid/prismgrid/ |
| H A D | boundarysegmentindexset.hh | 52 Key key = getKey( intersection ); in index()
59 void add ( const Intersection &intersection ) in add() argument
61 assert( intersection.boundary() ); in add()
62 Key key = getKey( intersection ); in add()
67 Key getKey ( const Intersection &intersection ) const in getKey()
102 const Intersection &intersection = *iit; in BoundaryIntersectionIndexSet() local
103 if( intersection.boundary() ) in BoundaryIntersectionIndexSet()
104 add( intersection ); in BoundaryIntersectionIndexSet()
189 if( intersection.isLateral() ) in index()
191 assert( intersection.hasHostIntersection() ); in index()
[all …]
|
| /dports/math/gnuplot/gnuplot-5.4.1/src/ |
| H A D | vplot.c | 100 static double intersection[12][3]; variable
286 intersection[iedge][0] = in tessellate_one_cube()
288 intersection[iedge][1] = in tessellate_one_cube()
290 intersection[iedge][2] = in tessellate_one_cube()
305 quad[0].x = intersection[ivertex][0]; in tessellate_one_cube()
306 quad[0].y = intersection[ivertex][1]; in tessellate_one_cube()
307 quad[0].z = intersection[ivertex][2]; in tessellate_one_cube()
309 quad[1].x = intersection[ivertex][0]; in tessellate_one_cube()
310 quad[1].y = intersection[ivertex][1]; in tessellate_one_cube()
311 quad[1].z = intersection[ivertex][2]; in tessellate_one_cube()
[all …]
|
| /dports/math/gnuplot-lite/gnuplot-5.4.1/src/ |
| H A D | vplot.c | 100 static double intersection[12][3]; variable
286 intersection[iedge][0] = in tessellate_one_cube()
288 intersection[iedge][1] = in tessellate_one_cube()
290 intersection[iedge][2] = in tessellate_one_cube()
305 quad[0].x = intersection[ivertex][0]; in tessellate_one_cube()
306 quad[0].y = intersection[ivertex][1]; in tessellate_one_cube()
307 quad[0].z = intersection[ivertex][2]; in tessellate_one_cube()
309 quad[1].x = intersection[ivertex][0]; in tessellate_one_cube()
310 quad[1].y = intersection[ivertex][1]; in tessellate_one_cube()
311 quad[1].z = intersection[ivertex][2]; in tessellate_one_cube()
[all …]
|
| /dports/graphics/openorienteering-mapper/mapper-0.9.2/test/ |
| H A D | path_object_t.cpp | 837 intersection.length = 10; in calcIntersectionsTest()
865 intersection.length = 20; in calcIntersectionsTest()
892 intersection.length = 10; in calcIntersectionsTest()
897 intersection.length = 40; in calcIntersectionsTest()
914 intersection.length = 10; in calcIntersectionsTest()
919 intersection.length = 20; in calcIntersectionsTest()
942 intersection.length = 0; in calcIntersectionsTest()
965 intersection.length = 0; in calcIntersectionsTest()
1007 intersection.length = 0; in calcIntersectionsTest()
1042 intersection.length = 0; in calcIntersectionsTest()
[all …]
|