Home
last modified time | relevance | path

Searched refs:holes (Results 1 – 25 of 108) sorted by relevance

12345

/third_party/boost/libs/geometry/example/
Dc06_custom_polygon_example.cpp41 boost::array<my_ring, 2> holes; member
95 return p.holes; in get()
100 return p.holes; in get()
119 p1.holes[0].push_back(my_point(2, 1)); in main()
120 p1.holes[0].push_back(my_point(2.4, 2)); in main()
121 p1.holes[0].push_back(my_point(1.9, 2)); in main()
122 p1.holes[0].push_back(my_point(2, 1)); in main()
125 p1.holes[1].push_back(my_point(3, 3)); in main()
126 p1.holes[1].push_back(my_point(4, 3)); in main()
127 p1.holes[1].push_back(my_point(4, 4)); in main()
[all …]
/third_party/typescript/tests/baselines/reference/
DjsxNestedWithinTernaryParsesCorrectly.types9 …must be identifier? ) : ( // must be exactly two expression holes <span> …
12 …must be identifier? ) : ( // must be exactly two expression holes <span> …
16 …must be identifier? ) : ( // must be exactly two expression holes <span> …
24 >( // must be exactly two expression holes <span> {0}{0} </span> …
26 // must be exactly two expression holes
DjsxNestedWithinTernaryParsesCorrectly.symbols14 // must be exactly two expression holes
/third_party/boost/libs/geometry/test/algorithms/overlay/
Doverlay.cpp459 #define TEST_INTERSECTION(caseid, area, clips, holes) (test_overlay<multi_polygon, bg::overlay_inte… argument
460 ( #caseid "_int", caseid[0], caseid[1], area, clips, holes)
461 #define TEST_UNION(caseid, area, clips, holes) (test_overlay<multi_polygon, bg::overlay_union>) \ argument
462 ( #caseid "_union", caseid[0], caseid[1], area, clips, holes)
463 #define TEST_DIFFERENCE_A(caseid, area, clips, holes) (test_overlay<multi_polygon, bg::overlay_diff… argument
464 ( #caseid "_diff_a", caseid[0], caseid[1], area, clips, holes)
465 #define TEST_DIFFERENCE_B(caseid, area, clips, holes) (test_overlay<multi_polygon, bg::overlay_diff… argument
466 ( #caseid "_diff_b", caseid[1], caseid[0], area, clips, holes)
468 #define TEST_INTERSECTION_WITH(caseid, index1, index2, area, clips, holes) (test_overlay<multi_poly… argument
469 ( #caseid "_int_" #index1 "_" #index2, caseid[index1], caseid[index2], area, clips, holes)
[all …]
/third_party/boost/libs/geometry/test/geometries/
Dboost_polygon.cpp46 std::vector<boost::polygon::polygon_data<T> > holes; in fill_polygon_with_two_holes() local
47 holes.resize(2); in fill_polygon_with_two_holes()
56 holes[0].set(point_vector.begin(), point_vector.end()); in fill_polygon_with_two_holes()
66 holes[1].set(point_vector.begin(), point_vector.end()); in fill_polygon_with_two_holes()
68 boost_polygon_polygon.set_holes(holes.begin(), holes.end()); in fill_polygon_with_two_holes()
/third_party/mesa3d/src/util/
Dvma.c37 list_for_each_entry(struct util_vma_hole, _hole, &(_heap)->holes, link)
40 list_for_each_entry_safe(struct util_vma_hole, _hole, &(_heap)->holes, link)
43 list_for_each_entry_safe_rev(struct util_vma_hole, _hole, &(_heap)->holes, link)
49 list_inithead(&heap->holes); in util_vma_heap_init()
72 if (&hole->link == heap->holes.next) { in util_vma_heap_validate()
303 list_add(&hole->link, &heap->holes); in util_vma_heap_free()
Dvma.h37 struct list_head holes; member
/third_party/boost/boost/polygon/
Dpolygon_traits.hpp627 std::vector<hole_type> holes; in convolve() local
628 holes.reserve(size_holes(polygon)); in convolve()
631 holes.push_back(*itr); in convolve()
632 convolve(holes.back(), point); in convolve()
635 set_holes(polygon, holes.begin(), holes.end()); in convolve()
676 std::vector<hole_type> holes; in transform() local
677 holes.reserve(size_holes(polygon)); in transform()
680 holes.push_back(*itr); in transform()
681 transform(holes.back(), tr); in transform()
684 set_holes(polygon, holes.begin(), holes.end()); in transform()
[all …]
/third_party/boost/libs/geometry/test/algorithms/set_operations/union/
Dtest_union.hpp136 std::size_t holes = 0; in test_union() local
141 holes += bg::num_interior_rings(*it); in test_union()
178 << " holes: " << holes in test_union()
189 BOOST_CHECK_MESSAGE(expected_hole_count < 0 || int(holes) == expected_hole_count, in test_union()
192 << " detected: " << holes in test_union()
Dunion_multi.cpp32 #define TEST_UNION(caseid, clips, holes, points, area) \ argument
34 ( #caseid, caseid[0], caseid[1], clips, holes, points, area)
36 #define TEST_UNION_IGNORE(caseid, clips, holes, points, area) \ argument
40 clips, holes, points, area, ignore_validity); }
Dunion.cpp29 #define TEST_UNION(caseid, clips, holes, points, area) \ argument
31 ( #caseid, caseid[0], caseid[1], clips, holes, points, area)
33 #define TEST_UNION_REV(caseid, clips, holes, points, area) \ argument
35 ( #caseid "_rev", caseid[1], caseid[0], clips, holes, points, area)
/third_party/boost/libs/geometry/doc/concept/
Dpolygon.qbk21 …on of a Boost.Geometry polygon differs a bit from e.g. Wiki, where a polygon does not have holes. A
22 polygon of Boost.Geometry is a polygon with or without holes.
23 ['(A polygon without holes is a ['helper geometry] within Boost.Geometry, and referred to as a ring…
44 but holes are allowed in __boost_geometry__ polygons).
/third_party/e2fsprogs/tests/f_holedir/
Dname1 directory with holes and illegal blocks
/third_party/e2fsprogs/tests/f_holedir2/
Dname1 directories with holes and zero i_size
/third_party/e2fsprogs/tests/f_holedir3/
Dname1 real directories with holes and zero i_size
/third_party/typescript/tests/cases/compiler/
DjsxNestedWithinTernaryParsesCorrectly.tsx8 // must be exactly two expression holes
/third_party/gettext/gettext-tools/doc/
Dlang-bash.texi12 holes it opens and due to its portability problems.
14 The security holes of @code{$"..."} come from the fact that after looking up
/third_party/skia/infra/bots/analysis/
DREADME.md3 A set of scripts that analyzes `jobs.json` to look for possible holes in our
/third_party/mesa3d/src/gallium/winsys/radeon/drm/
Dradeon_drm_winsys.h52 struct list_head holes; member
Dradeon_drm_bo.c216 LIST_FOR_EACH_ENTRY_SAFE(hole, n, &heap->holes, list) { in radeon_bomgr_find_va()
263 list_add(&n->list, &heap->holes); in radeon_bomgr_find_va()
299 if (!list_is_empty(&heap->holes)) { in radeon_bomgr_free_va()
300 hole = container_of(heap->holes.next, struct radeon_bo_va_hole, list); in radeon_bomgr_free_va()
310 hole = container_of(&heap->holes, struct radeon_bo_va_hole, list); in radeon_bomgr_free_va()
311 LIST_FOR_EACH_ENTRY(next, &heap->holes, list) { in radeon_bomgr_free_va()
317 if (&hole->list != &heap->holes) { in radeon_bomgr_free_va()
323 if (next != hole && &next->list != &heap->holes && in radeon_bomgr_free_va()
334 if (next != hole && &next->list != &heap->holes && in radeon_bomgr_free_va()
/third_party/ntfs-3g/libntfs-3g/
Dcompress.c1270 int holes = 0; in ntfs_compress_overwr_free() local
1283 holes++; in ntfs_compress_overwr_free()
1300 holes++; in ntfs_compress_overwr_free()
1315 switch (holes) { in ntfs_compress_overwr_free()
1379 if (freerl[holes].lcn == LCN_HOLE) { in ntfs_compress_overwr_free()
1380 freerl->length += freerl[holes].length; in ntfs_compress_overwr_free()
1381 holes++; in ntfs_compress_overwr_free()
1386 *erl = erl[holes - 1]; in ntfs_compress_overwr_free()
Dattrib.c1826 hole_type holes);
5301 hole_type holes) argument
5339 if ((newsize < vol->mft_record_size) && (holes != HOLES_NONRES)) {
5384 if (holes == HOLES_NONRES) {
5395 return ntfs_attr_truncate_i(na, newsize, holes);
5451 return ntfs_resident_attr_resize_i(na, newsize, holes);
5475 return ntfs_resident_attr_resize_i(na, newsize, holes);
5514 return ntfs_resident_attr_resize_i(na, newsize, holes);
5535 return ntfs_resident_attr_resize_i(na, newsize, holes);
5773 hole_type holes, ntfs_attr_search_ctx *ctx) argument
[all …]
/third_party/boost/libs/geometry/doc/reference/geometries/adapted/boost_polygon/
Dpolygon_with_holes_data.qbk16 Boost.Polygon's polygon type supporting holes (boost::polygon::polygon_with_holes_data)
/third_party/boost/libs/geometry/doc/generated/
Dring_type.qbk22 A polygon contains one exterior ring and zero or more interior rings (holes). This metafunction ret…
/third_party/boost/libs/geometry/doc/reference/io/
Dwkt_format.qbk28 * can be read from WKT by specifying a polygon (with no holes)

12345