| /dports/math/cgal/CGAL-5.3/examples/Polygon/ |
| H A D | draw_polygon_with_holes.cpp | 18 std::vector<Polygon_2> holes(3); in main() local
19 holes[0].push_back(Point(6,2)); holes[0].push_back(Point(7,1)); in main()
20 holes[0].push_back(Point(7,3)); holes[0].push_back(Point(6,3)); in main()
21 holes[0].push_back(Point(5,2)); in main()
23 holes[1].push_back(Point(2,1)); holes[1].push_back(Point(3,1)); in main()
24 holes[1].push_back(Point(3,3)); holes[1].push_back(Point(2,2)); in main()
25 holes[1].push_back(Point(1,2)); in main()
27 holes[2].push_back(Point(1,4)); holes[2].push_back(Point(2,4)); in main()
28 holes[2].push_back(Point(2,5)); holes[2].push_back(Point(3,5)); in main()
29 holes[2].push_back(Point(3,6)); holes[2].push_back(Point(1,6)); in main()
[all …]
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/geom/ |
| H A D | Polygon.java | 66 protected LinearRing[] holes; field in Polygon
120 if (holes == null) { in Polygon()
130 this.holes = holes; in Polygon()
216 return holes.length; in getNumInteriorRing()
220 return holes[n]; in getInteriorRingN()
270 rings[i + 1] = holes[i]; in getBoundary()
292 if (holes.length != otherPolygon.holes.length) { in equalsExact()
296 if (!((Geometry) holes[i]).equalsExact(otherPolygon.holes[i], tolerance)) { in equalsExact()
332 holes[i].apply(filter); in apply()
364 holes[i] = normalized(holes[i], false); in normalize()
[all …]
|
| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libslic3r/ |
| H A D | ExPolygon.hpp | 38 Polygons holes; member in Slic3r::ExPolygon
215 polygons.insert(polygons.end(), src.holes.begin(), src.holes.end()); in to_polygons()
225 polygons.insert(polygons.end(), it->holes.begin(), it->holes.end()); in to_polygons()
236 src.holes.clear(); in to_polygons()
247 it->holes.clear(); in to_polygons()
256 dst.insert(dst.end(), src.holes.begin(), src.holes.end()); in polygons_append()
264 dst.insert(dst.end(), it->holes.begin(), it->holes.end()); in polygons_append()
272 std::move(std::begin(src.holes), std::end(src.holes), std::back_inserter(dst)); in polygons_append()
273 src.holes.clear(); in polygons_append()
281 std::move(std::begin(it->holes), std::end(it->holes), std::back_inserter(dst)); in polygons_append()
[all …]
|
| H A D | ClipperUtils.cpp | 278 holes.reserve(expolygon.holes.size()); in _offset()
291 holes.insert(holes.end(), out.begin(), out.end()); in _offset()
364 holes.insert(holes.end(), out.begin(), out.end()); in _offset()
396 std::reverse(holes[i].begin(), holes[i].end()); in _offset()
1058 holes.reserve(expoly.holes.size()); in variable_offset_inner()
1068 if (holes.empty()) in variable_offset_inner()
1102 holes.reserve(expoly.holes.size()); in variable_offset_outer()
1112 if (holes.empty()) in variable_offset_outer()
1146 holes.reserve(expoly.holes.size()); in variable_offset_outer_ex()
1157 if (holes.empty()) { in variable_offset_outer_ex()
[all …]
|
| /dports/graphics/geos/geos-3.9.1/src/geom/ |
| H A D | Polygon.cpp | 57 holes(p.holes.size()) in Polygon()
60 holes[i] = detail::make_unique<LinearRing>(*p.holes[i]); in Polygon()
115 if (hasNullElements(&holes)) { in Polygon()
148 for(const auto& lr : holes) { in getNumPoints()
197 return holes.size(); in getNumInteriorRing()
203 return holes[n].get(); in getInteriorRingN()
229 if(holes.empty()) { in getBoundary()
263 size_t nholes = holes.size(); in equalsExact()
293 for(auto& lr : holes) { in apply_rw()
320 for(auto& lr : holes) { in normalize()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/geometry/example/ |
| H A D | c06_custom_polygon_example.cpp | 41 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()
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()
128 p1.holes[1].push_back(my_point(3, 4)); in main()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/geometry/example/ |
| H A D | c06_custom_polygon_example.cpp | 41 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()
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()
128 p1.holes[1].push_back(my_point(3, 4)); in main()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/geometry/example/ |
| H A D | c06_custom_polygon_example.cpp | 41 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()
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()
128 p1.holes[1].push_back(my_point(3, 4)); in main()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/geometry/example/ |
| H A D | c06_custom_polygon_example.cpp | 41 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()
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()
128 p1.holes[1].push_back(my_point(3, 4)); in main()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/geometry/example/ |
| H A D | c06_custom_polygon_example.cpp | 41 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()
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()
128 p1.holes[1].push_back(my_point(3, 4)); in main()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/geometry/example/ |
| H A D | c06_custom_polygon_example.cpp | 41 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()
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()
128 p1.holes[1].push_back(my_point(3, 4)); in main()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/libs/geometry/example/ |
| H A D | c06_custom_polygon_example.cpp | 41 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()
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()
128 p1.holes[1].push_back(my_point(3, 4)); in main()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/geometry/example/ |
| H A D | c06_custom_polygon_example.cpp | 41 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()
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()
128 p1.holes[1].push_back(my_point(3, 4)); in main()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/geometry/example/ |
| H A D | c06_custom_polygon_example.cpp | 41 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()
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()
128 p1.holes[1].push_back(my_point(3, 4)); in main()
[all …]
|
| /dports/cad/meshlab/meshlab-Meshlab-2020.05/src/meshlabplugins/edit_hole/ |
| H A D | holeListModel.cpp | 51 for( ; it != holesManager.holes.end(); ++it) in drawHoles()
80 for(it = holesManager.holes.begin(); it != holesManager.holes.end(); ++it) in drawHoles()
105 for(it = holesManager.holes.begin(); it != holesManager.holes.end(); ++it) in drawCompenetratingFaces()
113 for(it = holesManager.holes.begin(); it != holesManager.holes.end(); ++it) in drawCompenetratingFaces()
120 for(it = holesManager.holes.begin(); it != holesManager.holes.end(); ++it) in drawCompenetratingFaces()
210 if(holesManager.holes.size()==0) in acceptFilling()
273 return holesManager.holes[index.row()].name; in data()
375 if(row >= (int)holesManager.holes.size()) in index()
409 holesManager.holes[index.row()].name = newName; in setData()
419 holesManager.holes[index.row()].SetSelect( !holesManager.holes[index.row()].IsSelected() ); in setData()
[all …]
|
| H A D | holeSetManager.h | 85 for(it=holes.begin(); it!=holes.end(); it++) in Clear()
88 holes.clear(); in Clear()
156 while( it != holes.end() ) in ConfirmFilling()
182 it = holes.erase(it++); in ConfirmFilling()
211 for( it= holes.begin(); it != holes.end(); it++) in ConfirmFilling()
360 holes.clear(); in getMeshHoles()
424 assert( holes.size()>0 ); in removeBridges()
439 while(hit != holes.end() ) in removeBridges()
452 hit = holes.erase(hit++); in removeBridges()
495 holes.push_back( newHole ); in removeBridges()
[all …]
|
| /dports/databases/R-cran-fastmap/fastmap/R/ |
| H A D | fastmap.R | 170 holes <- NULL functionVar
182 holes <<- seq_len(INITIAL_SIZE)
211 idx <- holes[n_holes]
302 holes[n_holes] <<- idx
378 holes <<- holes[seq_len(n_holes)]
381 remap_inv <- remap_inv[-holes]
397 values <<- values[-holes]
398 keys_ <<- keys_[-holes]
399 holes <<- integer()
416 holes <- holes[seq_len(n_holes)] functionVar
[all …]
|
| /dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/geost/ |
| H A D | InArea.java | 63 public Collection<DBox> holes; field in InArea
78 public InArea(DBox area, Collection<DBox> holes) { in InArea() argument
82 if (holes != null) in InArea()
83 this.holes = holes; in InArea()
85 this.holes = new ArrayList<DBox>(0); in InArea()
99 if (holes == null) in checkInvariants()
112 constraints = new HashSet<InternalConstraint>(holes.size() + 1); in genInternalConstraints()
116 for (DBox hole : holes) in genInternalConstraints()
|
| /dports/sysutils/fwup/fwup-1.9.0/tests/ |
| H A D | 093_sparse_concat.test | 48 skip-holes = true
52 skip-holes = true
56 skip-holes = true
60 skip-holes = true
64 skip-holes = true
68 skip-holes = true
72 skip-holes = true
76 skip-holes = true
80 skip-holes = true
84 skip-holes = true
[all …]
|
| H A D | 094_sparse_concat2.test | 54 skip-holes = true
58 skip-holes = true
62 skip-holes = true
66 skip-holes = true
70 skip-holes = true
74 skip-holes = true
78 skip-holes = true
82 skip-holes = true
86 skip-holes = true
90 skip-holes = true
[all …]
|
| /dports/databases/tile38/tile38-1.12.0/geojson/poly/ |
| H A D | inside.go | 8 func (p Point) Inside(exterior Polygon, holes []Polygon) bool {
12 for i := 0; i < len(holes); i++ {
13 if insideshpext(p, holes[i], false) {
21 func (r Rect) Inside(exterior Polygon, holes []Polygon) bool {
22 return r.Polygon().Inside(exterior, holes)
26 func (shape Polygon) Inside(exterior Polygon, holes []Polygon) bool {
29 ok = p.Inside(exterior, holes)
35 for _, hole := range holes {
|
| /dports/math/octave-forge-image/image-2.12.0/inst/ |
| H A D | imfill.m | 25 ## Fill image holes or regions.
50 ## imfill (im, "holes")
87 ## syntax: imfill (BW, "holes") or imfill (IMG, "holes")
106 ## syntax: imfill (BW, CONN, "holes") or imfill (IMG, CONN, "holes")
255 %! assert (imfill (bw, "holes"), bw2)
268 %! imfill (true (3), 4, "holes", 5)
317 %! assert (imfill (bw, "holes"), bw2)
359 %! assert (imfill (bw, "holes"), bw)
361 %! assert (imfill (bw, "holes"), bw)
415 %! assert (imfill (I, 4, "holes"), I2)
[all …]
|
| /dports/graphics/wings/libigl-2.1.0/include/igl/ |
| H A D | topological_hole_fill.cpp | 18 const std::vector<VectorIndex> & holes, in topological_hole_fill() argument
22 int num_holes = holes.size(); in topological_hole_fill()
27 n_filled_faces += holes[i].size(); in topological_hole_fill()
36 int cur_bnd_size = holes[i].size(); in topological_hole_fill()
38 int back = holes[i].size() - 1; in topological_hole_fill()
39 F_filled.row(new_face_id++) << holes[i][it], holes[i][back], new_vert_id; in topological_hole_fill()
43 << holes[i][(it + 1)], in topological_hole_fill()
44 holes[i][(it)], new_vert_id; in topological_hole_fill()
|
| /dports/math/clingo/clingo-5.5.1/examples/c/ |
| H A D | propagator.c | 11 clingo_literal_t *holes; member
41 int holes = 0; in init() local
122 if (h + 1 > holes) { holes = h + 1; } in init()
132 …if (!(data->states[i].holes = (clingo_literal_t*)malloc(sizeof(*data->states[i].holes) * holes))) { in init()
139 memset(data->states[i].holes, 0, sizeof(*data->states[i].holes) * holes); in init()
140 data->states[i].size = holes; in init()
155 clingo_literal_t *prev = state.holes + data->pigeons[lit]; in propagate()
192 if (state.holes[hole] == lit) { in undo()
194 state.holes[hole] = 0; in undo()
344 if (prop_data.states[i].holes) { in main()
[all …]
|
| /dports/games/wesnoth/wesnoth-1.14.17/data/ai/micro_ais/cas/ |
| H A D | ca_forest_animals_new_rabbit.lua | 26 local holes = {}
38 table.insert(holes, item)
42 table.insert(holes, item)
47 table.sort(holes, function(a, b) return a.random > b.random end)
51 number = math.min(number, #holes)
58 x, y = wesnoth.find_vacant_tile(holes[i].x, holes[i].y, tmp_unit)
60 x, y = wesnoth.find_vacant_tile(holes[i].x, holes[i].y)
|