| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/geometry/policies/relate/ |
| H A D | intersection_points_determinant.hpp | 75 set<0>(result.intersections[0], in segments_intersect()
77 set<1>(result.intersections[0], in segments_intersect()
88 set<0>(result.intersections[0], x); in collinear_touch()
89 set<1>(result.intersections[0], y); in collinear_touch()
98 set<0>(result.intersections[0], get<0, 0>(s)); in collinear_inside()
99 set<1>(result.intersections[0], get<0, 1>(s)); in collinear_inside()
100 set<0>(result.intersections[1], get<1, 0>(s)); in collinear_inside()
126 set<0>(result.intersections[0], x1); in collinear_overlaps()
127 set<1>(result.intersections[0], y1); in collinear_overlaps()
128 set<0>(result.intersections[1], x2); in collinear_overlaps()
[all …]
|
| H A D | intersection_points.hpp | 76 set<0>(result.intersections[0], in segments_intersect()
78 set<1>(result.intersections[0], in segments_intersect()
89 set<0>(result.intersections[0], x); in collinear_touch()
90 set<1>(result.intersections[0], y); in collinear_touch()
131 set<0>(result.intersections[0], x1); in collinear_overlaps()
132 set<1>(result.intersections[0], y1); in collinear_overlaps()
133 set<0>(result.intersections[1], x2); in collinear_overlaps()
134 set<1>(result.intersections[1], y2); in collinear_overlaps()
143 set<0>(result.intersections[0], get<0, 0>(s)); in segment_equal()
144 set<1>(result.intersections[0], get<0, 1>(s)); in segment_equal()
[all …]
|
| H A D | intersection_points_slope.hpp | 70 set<1 - Dimension>(result.intersections[0], in rico()
72 set<Dimension>(result.intersections[0], in rico()
82 set<0>(result.intersections[0], get<0, 0>(s1)); in cross()
83 set<1>(result.intersections[0], get<0, 1>(s2)); in cross()
125 set<0>(result.intersections[0], x); in collinear_touch()
126 set<1>(result.intersections[0], y); in collinear_touch()
135 set<0>(result.intersections[0], get<0, 0>(s)); in collinear_inside()
163 set<0>(result.intersections[0], x1); in collinear_overlaps()
164 set<1>(result.intersections[0], y1); in collinear_overlaps()
165 set<0>(result.intersections[1], x2); in collinear_overlaps()
[all …]
|
| /dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/common/tgeometry/ |
| H A D | tcurveutil.cpp | 24 intersections); in intersect()
96 intersections.push_back(DoublePair(0, 0)); in intersect()
195 for (i = intersections.size() - ret; i < (int)intersections.size(); i++) { in intersect()
196 intersections[i].first = c0.getT(s.getPoint(intersections[i].first)); in intersect()
220 for (i = intersections.size() - ret; i < (int)intersections.size(); i++) { in intersect()
221 intersections[i].second = c1.getT(s.getPoint(intersections[i].second)); in intersect()
276 intersections.push_back(tt); in intersect()
280 return intersections.size(); in intersect()
314 for (UINT i = intersections.size() - ret; i < (int)intersections.size(); in intersectCloseControlPoints()
328 for (UINT i = intersections.size() - ret; i < (int)intersections.size(); in intersectCloseControlPoints()
[all …]
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/include/engine/guidance/ |
| H A D | route_step.hpp | 80 std::vector<IntermediateIntersection> intersections; member
133 intersections.clear(); in Invalidate()
134 intersections.push_back(getInvalidIntersection()); in Invalidate()
148 intersections.insert(intersections.begin(), in AddInFront()
149 preceeding_step.intersections.begin(), in AddInFront()
150 preceeding_step.intersections.end()); in AddInFront()
165 intersections.insert(intersections.end(), in ElongateBy()
166 following_step.intersections.begin(), in ElongateBy()
167 following_step.intersections.end()); in ElongateBy()
199 return intersections.front().lanes.lanes_in_turn; in NumLanesInTurn()
[all …]
|
| /dports/graphics/engauge-digitizer/engauge-digitizer-12.2.2/src/Guideline/ |
| H A D | GuidelineProjectorConstantX.cpp | 25 QList<QPointF> &intersections) in addSide() argument
50 intersections.push_back (posScreen); in addSide()
68 QList<QPointF> intersections; in fromCoordinateX() local
70 addSide (transformation, xGraph, posGraphBL, posGraphTL, intersections); in fromCoordinateX()
71 addSide (transformation, xGraph, posGraphTL, posGraphTR, intersections); in fromCoordinateX()
72 addSide (transformation, xGraph, posGraphTR, posGraphBR, intersections); in fromCoordinateX()
73 addSide (transformation, xGraph, posGraphBR, posGraphBL, intersections); in fromCoordinateX()
75 if (intersections.size() == 2) { in fromCoordinateX()
76 line = QLineF (intersections.at (0), in fromCoordinateX()
77 intersections.at (1)); in fromCoordinateX()
|
| H A D | GuidelineProjectorConstantY.cpp | 25 QList<QPointF> &intersections) in addSide() argument
50 intersections.push_back (posScreen); in addSide()
68 QList<QPointF> intersections; in fromCoordinateY() local
70 addSide (transformation, yGraph, posGraphBL, posGraphTL, intersections); in fromCoordinateY()
71 addSide (transformation, yGraph, posGraphTL, posGraphTR, intersections); in fromCoordinateY()
72 addSide (transformation, yGraph, posGraphTR, posGraphBR, intersections); in fromCoordinateY()
73 addSide (transformation, yGraph, posGraphBR, posGraphBL, intersections); in fromCoordinateY()
75 if (intersections.size() == 2) { in fromCoordinateY()
76 line = QLineF (intersections.at (0), in fromCoordinateY()
77 intersections.at (1)); in fromCoordinateY()
|
| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libslic3r/Fill/ |
| H A D | FillRectilinear.cpp | 838 std::sort(sil.intersections.begin(), sil.intersections.end()); in slice_region_by_vertical_lines()
857 if (j > 0 && sil.intersections[i].iContour == sil.intersections[j-1].iContour) { in slice_region_by_vertical_lines()
859 if (sil.intersections[i].pos() == sil.intersections[j-1].pos()) { in slice_region_by_vertical_lines()
867 if (sil.intersections[i].type == sil.intersections[j-1].type) { in slice_region_by_vertical_lines()
877 } else if (sil.intersections[i].type == sil.intersections[j-1].type) { in slice_region_by_vertical_lines()
886 sil.intersections[j-1] = sil.intersections[i]; in slice_region_by_vertical_lines()
893 sil.intersections[j] = sil.intersections[i]; in slice_region_by_vertical_lines()
899 sil.intersections[j] = sil.intersections[i]; in slice_region_by_vertical_lines()
905 sil.intersections.erase(sil.intersections.begin() + j, sil.intersections.end()); in slice_region_by_vertical_lines()
920 for (; j < sil.intersections.size() && sil.intersections[j].is_inner(); ++ j) ; in slice_region_by_vertical_lines()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/skia/tests/ |
| H A D | PathOpsQuadLineIntersectionTest.cpp | 56 intersections.intersect(quad, line); in doIntersect()
57 result = intersections.used(); in doIntersect()
92 SkIntersections intersections; in testOneOffs() local
93 int result = doIntersect(intersections, quad, line, flipped); in testOneOffs()
95 double quadT = intersections[0][inner]; in testOneOffs()
97 double lineT = intersections[1][inner]; in testOneOffs()
132 SkIntersections intersections; in DEF_TEST() local
134 int result = doIntersect(intersections, quad, line, flipped); in DEF_TEST()
136 if (intersections.used() <= 0) { in DEF_TEST()
140 double tt1 = intersections[0][pt]; in DEF_TEST()
[all …]
|
| H A D | PathOpsConicLineIntersectionTest.cpp | 57 intersections.intersect(conic, line); in doIntersect()
58 result = intersections.used(); in doIntersect()
82 SkIntersections intersections; in testOneOffs() local
83 int result = doIntersect(intersections, conic, line, flipped); in testOneOffs()
85 double conicT = intersections[0][inner]; in testOneOffs()
87 double lineT = intersections[1][inner]; in testOneOffs()
127 SkIntersections intersections; in DEF_TEST() local
129 int result = doIntersect(intersections, conic, line, flipped); in DEF_TEST()
131 if (intersections.used() <= 0) { in DEF_TEST()
135 double tt1 = intersections[0][pt]; in DEF_TEST()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/geometry/policies/relate/ |
| H A D | intersection_points.hpp | 84 sinfo.assign_a(result.intersections[0], s1, s2); in segments_crosses()
88 sinfo.assign_b(result.intersections[0], s1, s2); in segments_crosses()
119 detail::assign_point_from_index<0>(a, result.intersections[index]); in segments_collinear()
135 detail::assign_point_from_index<0>(b, result.intersections[index]); in segments_collinear()
148 detail::assign_point_from_index<1>(a, result.intersections[index]); in segments_collinear()
157 detail::assign_point_from_index<1>(b, result.intersections[index]); in segments_collinear()
171 std::swap(result.intersections[0], result.intersections[1]); in segments_collinear()
194 set<0>(result.intersections[0], get<0, 0>(segment)); in degenerate()
195 set<1>(result.intersections[0], get<0, 1>(segment)); in degenerate()
206 set<0>(result.intersections[0], get<0, 0>(degenerate_segment)); in one_degenerate()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/geometry/policies/relate/ |
| H A D | intersection_points.hpp | 55 sinfo.calculate(result.intersections[0], s1, s2); in segments_crosses()
86 detail::assign_point_from_index<0>(a, result.intersections[index]); in segments_collinear()
102 detail::assign_point_from_index<0>(b, result.intersections[index]); in segments_collinear()
115 detail::assign_point_from_index<1>(a, result.intersections[index]); in segments_collinear()
124 detail::assign_point_from_index<1>(b, result.intersections[index]); in segments_collinear()
138 std::swap(result.intersections[0], result.intersections[1]); in segments_collinear()
161 set<0>(result.intersections[0], get<0, 0>(segment)); in degenerate()
162 set<1>(result.intersections[0], get<0, 1>(segment)); in degenerate()
173 set<0>(result.intersections[0], get<0, 0>(degenerate_segment)); in one_degenerate()
174 set<1>(result.intersections[0], get<0, 1>(degenerate_segment)); in one_degenerate()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/geometry/policies/relate/ |
| H A D | intersection_points.hpp | 55 sinfo.calculate(result.intersections[0], s1, s2); in segments_crosses()
86 detail::assign_point_from_index<0>(a, result.intersections[index]); in segments_collinear()
102 detail::assign_point_from_index<0>(b, result.intersections[index]); in segments_collinear()
115 detail::assign_point_from_index<1>(a, result.intersections[index]); in segments_collinear()
124 detail::assign_point_from_index<1>(b, result.intersections[index]); in segments_collinear()
138 std::swap(result.intersections[0], result.intersections[1]); in segments_collinear()
161 set<0>(result.intersections[0], get<0, 0>(segment)); in degenerate()
162 set<1>(result.intersections[0], get<0, 1>(segment)); in degenerate()
173 set<0>(result.intersections[0], get<0, 0>(degenerate_segment)); in one_degenerate()
174 set<1>(result.intersections[0], get<0, 1>(degenerate_segment)); in one_degenerate()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/geometry/policies/relate/ |
| H A D | intersection_points.hpp | 55 sinfo.calculate(result.intersections[0], s1, s2); in segments_crosses()
86 detail::assign_point_from_index<0>(a, result.intersections[index]); in segments_collinear()
102 detail::assign_point_from_index<0>(b, result.intersections[index]); in segments_collinear()
115 detail::assign_point_from_index<1>(a, result.intersections[index]); in segments_collinear()
124 detail::assign_point_from_index<1>(b, result.intersections[index]); in segments_collinear()
138 std::swap(result.intersections[0], result.intersections[1]); in segments_collinear()
161 set<0>(result.intersections[0], get<0, 0>(segment)); in degenerate()
162 set<1>(result.intersections[0], get<0, 1>(segment)); in degenerate()
173 set<0>(result.intersections[0], get<0, 0>(degenerate_segment)); in one_degenerate()
174 set<1>(result.intersections[0], get<0, 1>(degenerate_segment)); in one_degenerate()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/geometry/policies/relate/ |
| H A D | intersection_points.hpp | 55 sinfo.calculate(result.intersections[0], s1, s2); in segments_crosses()
86 detail::assign_point_from_index<0>(a, result.intersections[index]); in segments_collinear()
102 detail::assign_point_from_index<0>(b, result.intersections[index]); in segments_collinear()
115 detail::assign_point_from_index<1>(a, result.intersections[index]); in segments_collinear()
124 detail::assign_point_from_index<1>(b, result.intersections[index]); in segments_collinear()
138 std::swap(result.intersections[0], result.intersections[1]); in segments_collinear()
161 set<0>(result.intersections[0], get<0, 0>(segment)); in degenerate()
162 set<1>(result.intersections[0], get<0, 1>(segment)); in degenerate()
173 set<0>(result.intersections[0], get<0, 0>(degenerate_segment)); in one_degenerate()
174 set<1>(result.intersections[0], get<0, 1>(degenerate_segment)); in one_degenerate()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/geometry/policies/relate/ |
| H A D | intersection_points.hpp | 55 sinfo.calculate(result.intersections[0], s1, s2); in segments_crosses()
86 detail::assign_point_from_index<0>(a, result.intersections[index]); in segments_collinear()
102 detail::assign_point_from_index<0>(b, result.intersections[index]); in segments_collinear()
115 detail::assign_point_from_index<1>(a, result.intersections[index]); in segments_collinear()
124 detail::assign_point_from_index<1>(b, result.intersections[index]); in segments_collinear()
138 std::swap(result.intersections[0], result.intersections[1]); in segments_collinear()
161 set<0>(result.intersections[0], get<0, 0>(segment)); in degenerate()
162 set<1>(result.intersections[0], get<0, 1>(segment)); in degenerate()
173 set<0>(result.intersections[0], get<0, 0>(degenerate_segment)); in one_degenerate()
174 set<1>(result.intersections[0], get<0, 1>(degenerate_segment)); in one_degenerate()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/geometry/policies/relate/ |
| H A D | intersection_points.hpp | 55 sinfo.calculate(result.intersections[0], s1, s2); in segments_crosses()
86 detail::assign_point_from_index<0>(a, result.intersections[index]); in segments_collinear()
102 detail::assign_point_from_index<0>(b, result.intersections[index]); in segments_collinear()
115 detail::assign_point_from_index<1>(a, result.intersections[index]); in segments_collinear()
124 detail::assign_point_from_index<1>(b, result.intersections[index]); in segments_collinear()
138 std::swap(result.intersections[0], result.intersections[1]); in segments_collinear()
161 set<0>(result.intersections[0], get<0, 0>(segment)); in degenerate()
162 set<1>(result.intersections[0], get<0, 1>(segment)); in degenerate()
173 set<0>(result.intersections[0], get<0, 0>(degenerate_segment)); in one_degenerate()
174 set<1>(result.intersections[0], get<0, 1>(degenerate_segment)); in one_degenerate()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/geometry/policies/relate/ |
| H A D | intersection_points.hpp | 55 sinfo.calculate(result.intersections[0], s1, s2); in segments_crosses()
86 detail::assign_point_from_index<0>(a, result.intersections[index]); in segments_collinear()
102 detail::assign_point_from_index<0>(b, result.intersections[index]); in segments_collinear()
115 detail::assign_point_from_index<1>(a, result.intersections[index]); in segments_collinear()
124 detail::assign_point_from_index<1>(b, result.intersections[index]); in segments_collinear()
138 std::swap(result.intersections[0], result.intersections[1]); in segments_collinear()
161 set<0>(result.intersections[0], get<0, 0>(segment)); in degenerate()
162 set<1>(result.intersections[0], get<0, 1>(segment)); in degenerate()
173 set<0>(result.intersections[0], get<0, 0>(degenerate_segment)); in one_degenerate()
174 set<1>(result.intersections[0], get<0, 1>(degenerate_segment)); in one_degenerate()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/geometry/policies/relate/ |
| H A D | intersection_points.hpp | 55 sinfo.calculate(result.intersections[0], s1, s2); in segments_crosses()
86 detail::assign_point_from_index<0>(a, result.intersections[index]); in segments_collinear()
102 detail::assign_point_from_index<0>(b, result.intersections[index]); in segments_collinear()
115 detail::assign_point_from_index<1>(a, result.intersections[index]); in segments_collinear()
124 detail::assign_point_from_index<1>(b, result.intersections[index]); in segments_collinear()
138 std::swap(result.intersections[0], result.intersections[1]); in segments_collinear()
161 set<0>(result.intersections[0], get<0, 0>(segment)); in degenerate()
162 set<1>(result.intersections[0], get<0, 1>(segment)); in degenerate()
173 set<0>(result.intersections[0], get<0, 0>(degenerate_segment)); in one_degenerate()
174 set<1>(result.intersections[0], get<0, 1>(degenerate_segment)); in one_degenerate()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/geometry/policies/relate/ |
| H A D | intersection_points.hpp | 55 sinfo.calculate(result.intersections[0], s1, s2);
86 detail::assign_point_from_index<0>(a, result.intersections[index]);
102 detail::assign_point_from_index<0>(b, result.intersections[index]);
115 detail::assign_point_from_index<1>(a, result.intersections[index]);
124 detail::assign_point_from_index<1>(b, result.intersections[index]);
138 std::swap(result.intersections[0], result.intersections[1]);
161 set<0>(result.intersections[0], get<0, 0>(segment));
162 set<1>(result.intersections[0], get<0, 1>(segment));
173 set<0>(result.intersections[0], get<0, 0>(degenerate_segment));
174 set<1>(result.intersections[0], get<0, 1>(degenerate_segment));
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/src/engine/guidance/ |
| H A D | post_processing.cpp | 123 BOOST_ASSERT(!begin->intersections.empty()); in processRoundaboutExits()
224 BOOST_ASSERT(steps.front().intersections.size() >= 1); in handleRoundabouts()
229 BOOST_ASSERT(steps.back().intersections.size() == 1); in handleRoundabouts()
353 first_step.intersections.front().bearings.front() = bearing; in trimShortSegments()
356 BOOST_ASSERT(steps.front().intersections.size() >= 1); in trimShortSegments()
361 BOOST_ASSERT(steps.back().intersections.size() == 1); in trimShortSegments()
391 BOOST_ASSERT(next_to_last_step.intersections.size() == 1); in trimShortSegments()
444 BOOST_ASSERT(steps.front().intersections.size() >= 1); in trimShortSegments()
449 BOOST_ASSERT(steps.back().intersections.size() == 1); in trimShortSegments()
490 BOOST_ASSERT(steps.front().intersections.size() >= 1); in assignRelativeLocations()
[all …]
|
| /dports/science/chrono/chrono-7.0.1/src/chrono_synchrono/flatbuffer/message/ |
| H A D | SynMAPMessage.cpp | 37 for (auto flatbuffer_intersection : *state->intersections()) { in ConvertFromFlatBuffers()
44 this->intersections.push_back(intersection); in ConvertFromFlatBuffers()
50 flatbuffer_intersections.reserve(intersections.size()); in ConvertToFlatBuffers()
51 for (const auto& intersection : intersections) { in ConvertToFlatBuffers()
85 while (this->intersections.size() <= (size_t)intersection) in AddLane()
86 this->intersections.emplace_back(); in AddLane()
88 while (this->intersections[intersection].approaches.size() <= approach) in AddLane()
89 this->intersections[intersection].approaches.push_back( in AddLane()
92 …unsigned num_lanes = (unsigned)this->intersections[intersection].approaches[approach]->lanes.size(… in AddLane()
93 this->intersections[intersection].approaches[approach]->lanes.push_back(lane); in AddLane()
|
| /dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Assimp/code/ |
| H A D | IFCBoolean.cpp | 558 if( (intersections.size() & 1) != 0 ) in ProcessPolygonalBoundedBooleanHalfSpaceDifference()
564 if( intersections.size() > 1 ) in ProcessPolygonalBoundedBooleanHalfSpaceDifference()
570 … std::swap(intersections[b], intersections[(b + intersections.size() - 1) % intersections.size()]); in ProcessPolygonalBoundedBooleanHalfSpaceDifference()
573 for( size_t a = 0; intersections.size() > 0 && a < intersections.size() - 1; /**/ ) in ProcessPolygonalBoundedBooleanHalfSpaceDifference()
575 …if( (intersections[a].get<1>() - intersections[(a + 1) % intersections.size()].get<1>()).SquareLen… in ProcessPolygonalBoundedBooleanHalfSpaceDifference()
576 … intersections.erase(intersections.begin() + a, intersections.begin() + a + 2); in ProcessPolygonalBoundedBooleanHalfSpaceDifference()
580 …if( intersections.size() > 1 && (intersections.back().get<1>() - intersections.front().get<1>()).S… in ProcessPolygonalBoundedBooleanHalfSpaceDifference()
582 intersections.pop_back(); intersections.erase(intersections.begin()); in ProcessPolygonalBoundedBooleanHalfSpaceDifference()
590 if( intersections.empty() ) in ProcessPolygonalBoundedBooleanHalfSpaceDifference()
619 while( !intersections.empty() ) in ProcessPolygonalBoundedBooleanHalfSpaceDifference()
[all …]
|
| /dports/astro/celestia-gtk/celestia-1.6.1/src/celmath/ |
| H A D | frustum.cpp | 57 int intersections = 0; in testSphere() local
65 intersections |= (1 << i); in testSphere()
68 return (intersections == 0) ? Inside : Intersect; in testSphere()
75 int intersections = 0; in testSphere() local
87 intersections |= (1 << i); in testSphere()
90 return (intersections == 0) ? Inside : Intersect; in testSphere()
97 int intersections = 0; in testCapsule() local
113 intersections |= (1 << i); in testCapsule()
120 intersections |= (1 << i); in testCapsule()
126 intersections |= (1 << i); in testCapsule()
[all …]
|
| /dports/astro/celestia/celestia-1.6.1/src/celmath/ |
| H A D | frustum.cpp | 57 int intersections = 0; in testSphere() local
65 intersections |= (1 << i); in testSphere()
68 return (intersections == 0) ? Inside : Intersect; in testSphere()
75 int intersections = 0; in testSphere() local
87 intersections |= (1 << i); in testSphere()
90 return (intersections == 0) ? Inside : Intersect; in testSphere()
97 int intersections = 0; in testCapsule() local
113 intersections |= (1 << i); in testCapsule()
120 intersections |= (1 << i); in testCapsule()
126 intersections |= (1 << i); in testCapsule()
[all …]
|