/third_party/boost/libs/geometry/doc/generated/ |
D | intersects.qbk | 16 [section:intersects_1_one_geometry intersects (one geometry)] 18 '''<indexterm><primary>intersects</primary></indexterm>''' 23 bool intersects(Geometry const & geometry)`` 44 `#include <boost/geometry/algorithms/intersects.hpp>` 47 [include reference/algorithms/intersects.qbk] 52 [section:intersects_3_with_strategy intersects (with strategy)] 54 '''<indexterm><primary>intersects</primary></indexterm>''' 59 bool intersects(Geometry1 const & geometry1, Geometry2 const & geometry2, Strategy const & strategy… 67 …sects Strategy Concept ] [strategy] [The strategy which will be used for intersects calculations ]] 82 `#include <boost/geometry/algorithms/intersects.hpp>` [all …]
|
/third_party/boost/libs/geometry/index/test/rtree/ |
D | rtree_intersects_geom.cpp | 30 rt.query(bgi::intersects(Point()), back_inserter(found)); in test_all() 31 rt.query(bgi::intersects(Seg()), back_inserter(found)); in test_all() 32 rt.query(bgi::intersects(Box()), back_inserter(found)); in test_all() 33 rt.query(bgi::intersects(Ring()), back_inserter(found)); in test_all() 34 rt.query(bgi::intersects(Poly()), back_inserter(found)); in test_all() 35 rt.query(bgi::intersects(MPoly()), back_inserter(found)); in test_all() 36 rt.query(bgi::intersects(Ls()), back_inserter(found)); in test_all() 37 rt.query(bgi::intersects(MLs()), back_inserter(found)); in test_all() 38 rt.query(bgi::intersects(MPt()), back_inserter(found)); in test_all()
|
D | rtree_epsilon.cpp | 38 BOOST_CHECK(bg::intersects(qpt, values[0])); in test_rtree() 44 rt.query(bgi::intersects(qpt), std::back_inserter(result)); in test_rtree() 50 rt.query(bgi::intersects(qpt), std::back_inserter(result)); in test_rtree() 59 rt.query(bgi::intersects(qpt), std::back_inserter(result)); in test_rtree() 65 rt.query(bgi::intersects(qpt), std::back_inserter(result)); in test_rtree()
|
/third_party/boost/boost/geometry/algorithms/detail/intersects/ |
D | interface.hpp | 33 namespace detail { namespace intersects namespace 58 inline bool intersects(Geometry const& geometry) in intersects() function 60 return detail::intersects::self_intersects<Geometry>::apply(geometry); in intersects() 79 inline bool intersects(Geometry1 const& geometry1, in intersects() function 103 inline bool intersects(Geometry1 const& geometry1, Geometry2 const& geometry2) in intersects() function
|
/third_party/boost/libs/geometry/doc/index/rtree/ |
D | query.qbk | 34 rt.query(bgi::intersects(box_region), std::back_inserter(returned_values)); 40 bgi::query(rt, bgi::intersects(box_region), std::back_inserter(returned_values)); 45 BOOST_FOREACH(__value__ & v, rt | bgi::adaptors::queried(bgi::intersects(box_region))) 52 std::copy(rt.qbegin(bgi::intersects(box_region)), rt.qend(), std::back_inserter(returned_values)); 58 …std::copy(bgi::qbegin(rt, bgi::intersects(box_region)), bgi::qend(rt), std::back_inserter(returned… 67 [[intersects(Box)] [covered_by(Box)] [disjoint(Box)] [overlaps(Box)] [within(Box)]] 68 [[[$img/index/rtree/intersects.png]] [[$img/index/rtree/within.png]] [[$img/index/rtree/disjoint.pn… 72 [[intersects(Segment)] [intersects(Box)] [disjoint(Box)] [intersects(Box)] [disjoint(Box)]] 77 [[intersects(Ring)] [intersects(Polygon)] [intersects(MultiPolygon)] [intersects(Segment)] [interse… 82 [[intersects(Box)] [disjoint(Box)] [intersects(Box)] [disjoint(Box)]] [all …]
|
/third_party/boost/libs/date_time/test/local_time/ |
D | testlocal_time_period.cpp | 53 check("intersects with myself", p1.intersects(p1)); in main() 54 check("not intersects", !(p1.intersects(p5))); in main() 55 check("not intersects", !(p5.intersects(p1))); in main() 61 check("shifted intersects", p5.intersects(p6)); in main() 62 check("shifted intersects", p6.intersects(p5)); in main() 67 check("shifted !intersects", !p5.intersects(p6)); in main() 68 check("shifted !intersects", !p6.intersects(p5)); in main()
|
/third_party/boost/libs/date_time/test/posix_time/ |
D | testtime_period.cpp | 48 check("intersects with myself", p1.intersects(p1)); in main() 49 check("not intersects", !(p1.intersects(p5))); in main() 50 check("not intersects", !(p5.intersects(p1))); in main() 56 check("shifted intersects", p5.intersects(p6)); in main() 57 check("shifted intersects", p6.intersects(p5)); in main() 62 check("shifted !intersects", !p5.intersects(p6)); in main() 63 check("shifted !intersects", !p6.intersects(p5)); in main()
|
/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/vulkan/shaders/src/ |
D | OverlayCull.comp | 77 const bool intersects = widgetCoords.x < widgetCoords.z && 83 return subgroupBallot(intersects).xy; 89 localId < MAX_TEXT_WIDGETS ? uint(intersects) << localId : 0; 91 localId >= MAX_TEXT_WIDGETS ? uint(intersects) << (localId - MAX_TEXT_WIDGETS) : 0; 94 return uvec2(subgroupOr(uint(intersects) << localId), 0); 105 intersectingWidgets[localId] = uint(intersects) << localId; 115 intersectingWidgets[graphLocalId] = uint(intersects) << graphLocalId; 123 intersectingWidgets[localId] = uint(intersects) << localId;
|
/third_party/skia/tests/graphite/ |
D | RectTest.cpp | 82 CHECK(rect.intersects(rect2) == rect2.intersects(rect)); in DEF_GRAPHITE_TEST() 83 CHECK(rect.intersects(rect2) == skRect.intersects(skRect2)); in DEF_GRAPHITE_TEST() 100 CHECK(rect.intersects(rect2) == !rect.makeIntersect(rect2).isEmptyNegativeOrNaN()); in DEF_GRAPHITE_TEST() 102 if (rect.intersects(rect2)) { in DEF_GRAPHITE_TEST() 103 CHECK(skRect.intersects(skRect2)); in DEF_GRAPHITE_TEST()
|
/third_party/boost/libs/geometry/doc/index/generated/ |
D | predicates.qbk | 11 …867c591ffb51b7d8c5 `intersects(Geometry const &)`]][Generate [^[link group__predicates_1ga78cb2ef2… 147 [section intersects(Geometry const &)] 148 '''<indexterm><primary>intersects</primary></indexterm>''' 149 Generate [^[link group__predicates_1ga78cb2ef221b951867c591ffb51b7d8c5 intersects()]] predicate. 152 …at intersect passed Geometry. Value is returned by the query if [^`bg::intersects(Indexable, Geome… 155 /unspecified/ `intersects``(``Geometry const &` `g``)` 172 bgi::query(spatial_index, bgi::intersects(box), std::back_inserter(result)); 173 bgi::query(spatial_index, bgi::intersects(ring), std::back_inserter(result)); 174 bgi::query(spatial_index, bgi::intersects(polygon), std::back_inserter(result)); 278 rt.query(index::intersects(box) && index::satisfies(is_red), [all …]
|
/third_party/boost/libs/date_time/test/gregorian/ |
D | testperiod.cpp | 32 check("intersects with myself", p1.intersects(p1)); in main() 33 check("not intersects", !(p1.intersects(p3))); in main() 34 check("not intersects", !(p3.intersects(p1))); in main() 36 check("intersects", p1.intersects(p4)); in main() 37 check("intersects", p4.intersects(p1)); in main() 39 check("intersects", p1.intersects(p5)); in main() 40 check("intersects", p5.intersects(p1)); in main()
|
/third_party/boost/boost/icl/concept/ |
D | element_set.hpp | 64 intersects(const Type& object, const typename Type::key_type& operand) in intersects() function 71 intersects(const Type& object, const Type& operand) in intersects() function 74 return Set::intersects(object, operand); in intersects() 76 return Set::intersects(operand, object); in intersects()
|
D | element_map.hpp | 307 intersects(const Type&, const CoType&) in intersects() function 316 intersects(const Type& object, const typename Type::domain_type& operand) in intersects() function 325 intersects(const Type& object, const typename Type::set_type& operand) in intersects() function 328 return Map::intersects(object, operand); in intersects() 330 return Map::intersects(operand, object); in intersects() 337 intersects(const Type& object, const typename Type::element_type& operand) in intersects() function 348 intersects(const Type& object, const Type& operand) in intersects() function 351 return Map::intersects(object, operand); in intersects() 353 return Map::intersects(operand, object); in intersects()
|
/third_party/boost/libs/geometry/test/algorithms/intersects/ |
D | test_intersects.hpp | 43 return bg::intersects(geometry1, geometry2, strategy); in call_intersects() 51 return bg::intersects(geometry1, geometry2); in call_intersects() 105 bool detected = bg::intersects(geometry); in test_self_intersects()
|
/third_party/skia/third_party/externals/harfbuzz/src/ |
D | hb-ot-layout-gsub-table.hh | 46 bool intersects (const hb_set_t *glyphs) const in intersects() function 47 { return (this+coverage).intersects (glyphs); } in intersects() 152 bool intersects (const hb_set_t *glyphs) const in intersects() function 153 { return (this+coverage).intersects (glyphs); } in intersects() 315 bool intersects (const hb_set_t *glyphs) const in intersects() function 376 if (!intersects (&glyphset)) return_trace (false); in subset() 402 bool intersects (const hb_set_t *glyphs) const in intersects() function 403 { return (this+coverage).intersects (glyphs); } in intersects() 541 bool intersects (const hb_set_t *glyphs) const in intersects() function 636 bool intersects (const hb_set_t *glyphs) const in intersects() function [all …]
|
/third_party/boost/libs/date_time/test/ |
D | testgeneric_period.cpp | 89 check("Intersects", p1.intersects(p2)); in main() 90 check("Intersects", p2.intersects(p1)); in main() 128 check("Intersects", zero_len.intersects(p1)); in main() 129 check("Intersects", p1.intersects(zero_len)); in main() 149 check("Intersects", null_per.intersects(p1)); in main() 150 check("Intersects", p1.intersects(null_per)); in main()
|
/third_party/boost/libs/geometry/index/example/ |
D | benchmark_experimental.cpp | 158 … t.query(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))), std::back_inserter(result)); in main() 189 … t.query(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))), std::back_inserter(result)); in main() 204 … boost::copy(t | bgi::adaptors::queried(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))), in main() 222 t.qbegin_(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))), in main() 223 t.qend_(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))), in main() 239 t.qbegin_(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))), in main() 257 t.qbegin_(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))), in main() 258 t.qend_(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))) in main() 275 …RT::const_query_iterator first = t.qbegin(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))… in main() 291 …RT::const_query_iterator first = t.qbegin(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))… in main() [all …]
|
/third_party/flutter/skia/third_party/externals/harfbuzz/src/ |
D | hb-ot-layout-gsub-table.hh | 46 bool intersects (const hb_set_t *glyphs) const in intersects() function 47 { return (this+coverage).intersects (glyphs); } in intersects() 142 bool intersects (const hb_set_t *glyphs) const in intersects() function 143 { return (this+coverage).intersects (glyphs); } in intersects() 365 bool intersects (const hb_set_t *glyphs) const in intersects() function 366 { return (this+coverage).intersects (glyphs); } in intersects() 544 bool intersects (const hb_set_t *glyphs) const in intersects() function 545 { return (this+coverage).intersects (glyphs); } in intersects() 663 bool intersects (const hb_set_t *glyphs) const in intersects() function 674 if (!intersects (c->glyphs)) return; in closure() [all …]
|
D | hb-ot-layout-gsubgpos.hh | 49 return_t dispatch (const T &obj) { return obj.intersects (this->glyphs); } in dispatch() 676 intersects_func_t intersects; member 700 return (data+coverage).intersects (glyphs); in intersects_coverage() 1229 lookup_context.funcs.intersects, lookup_context.intersects_data); in context_intersects() 1293 bool intersects (const hb_set_t *glyphs, ContextClosureLookupContext &lookup_context) const in intersects() function 1369 bool intersects (const hb_set_t *glyphs, in intersects() function 1375 | hb_map ([&] (const Rule &_) { return _.intersects (glyphs, lookup_context); }) in intersects() 1441 bool intersects (const hb_set_t *glyphs) const in intersects() function 1453 | hb_map ([&] (const RuleSet &_) { return _.intersects (glyphs, lookup_context); }) in intersects() 1543 bool intersects (const hb_set_t *glyphs) const in intersects() function [all …]
|
/third_party/harfbuzz/src/ |
D | hb-ot-layout-gsub-table.hh | 46 bool intersects (const hb_set_t *glyphs) const in intersects() function 47 { return (this+coverage).intersects (glyphs); } in intersects() 152 bool intersects (const hb_set_t *glyphs) const in intersects() function 153 { return (this+coverage).intersects (glyphs); } in intersects() 315 bool intersects (const hb_set_t *glyphs) const in intersects() function 371 if (!intersects (&glyphset)) return_trace (false); in subset() 397 bool intersects (const hb_set_t *glyphs) const in intersects() function 398 { return (this+coverage).intersects (glyphs); } in intersects() 538 bool intersects (const hb_set_t *glyphs) const in intersects() function 628 bool intersects (const hb_set_t *glyphs) const in intersects() function [all …]
|
/third_party/skia/experimental/graphite/src/geom/ |
D | IntersectionTree.h | 29 if (!fRoot->intersects(rect)) { in add() 41 virtual bool intersects(Rect) = 0;
|
/third_party/boost/libs/icl/test/ |
D | test_interval_map_shared.hpp | 557 BOOST_CHECK_EQUAL( intersects(left, right), true ); in interval_map_operators_4_bicremental_types() 566 BOOST_CHECK_EQUAL( intersects(section, complement), false ); in interval_map_operators_4_bicremental_types() 848 BOOST_CHECK_EQUAL( intersects(map_A, map_B), false ); in interval_map_base_is_disjoint_4_bicremental_types() 849 BOOST_CHECK_EQUAL( intersects(map_B, map_A), false ); in interval_map_base_is_disjoint_4_bicremental_types() 857 BOOST_CHECK_EQUAL( intersects(map_A, set_B), false ); in interval_map_base_is_disjoint_4_bicremental_types() 858 BOOST_CHECK_EQUAL( intersects(set_B, map_A), false ); in interval_map_base_is_disjoint_4_bicremental_types() 859 BOOST_CHECK_EQUAL( intersects(set_A, map_B), false ); in interval_map_base_is_disjoint_4_bicremental_types() 860 BOOST_CHECK_EQUAL( intersects(map_B, set_A), false ); in interval_map_base_is_disjoint_4_bicremental_types() 866 BOOST_CHECK_EQUAL( intersects(map_A, map_B), true ); in interval_map_base_is_disjoint_4_bicremental_types() 867 BOOST_CHECK_EQUAL( intersects(map_B, map_A), true ); in interval_map_base_is_disjoint_4_bicremental_types() [all …]
|
/third_party/boost/boost/geometry/algorithms/detail/distance/ |
D | geometry_to_segment_or_box.hpp | 174 struct intersects struct in boost::geometry::detail::distance::geometry_to_segment_or_box 178 return geometry::intersects(g1, g2); in apply() 183 struct intersects<SegOrBox, segment_tag> struct in boost::geometry::detail::distance::geometry_to_segment_or_box 187 return geometry::intersects(g1, g2, s.get_relate_segment_segment_strategy()); in apply() 219 && intersects<SegmentOrBox>::apply(geometry, segment_or_box, strategy)) in apply()
|
/third_party/boost/libs/geometry/test/robustness/overlay/areal_areal/ |
D | Jamfile.v2 | 22 exe intersects : intersects.cpp ;
|
D | Jamfile | 22 exe intersects : intersects.cpp ;
|