Home
last modified time | relevance | path

Searched refs:rings (Results 1 – 25 of 83) sorted by relevance

1234

/third_party/skia/third_party/externals/brotli/java/org/brotli/dec/
DState.java23 int[] rings; field in State
94 this.rings = new int[10]; in State()
95 this.rings[0] = 16; in State()
96 this.rings[1] = 15; in State()
97 this.rings[2] = 11; in State()
98 this.rings[3] = 4; in State()
/third_party/boost/libs/geometry/doc/generated/
Dinterior_rings.qbk19 Function to get the interior rings of a polygon (non const version)
29 [[Polygon &] [polygon type ] [polygon] [the polygon to get the interior rings from ]]
34 the interior rings (possibly a reference)
52 Function to get the interior rings of a polygon (const version)
62 [[Polygon const &] [polygon type ] [polygon] [the polygon to get the interior rings from ]]
67 the interior rings (possibly a const reference)
Dpolygon.qbk19 The polygon contains an outer ring and zero or more inner rings.
40 [[template< typename, typename > class RingList] [std::vector] [container type for inner rings, for…
42 [[template< typename > class RingAlloc] [std::allocator] [container-allocator-type, for the rings ]]
99 ] [Utility method, clears outer and inner rings. ] [
Dnum_interior_rings.qbk19 Calculates the number of interior rings of a geometry.
22 The free function num\u005finterior\u005frings calculates the number of interior rings of a geometr…
37 The calculated number of interior rings
Dring_type.qbk22 …ero or more interior rings (holes). This metafunction retrieves the type of the rings. Exterior ri…
Dcorrect.qbk22 Corrects a geometry: all rings which are wrongly oriented with respect to their expected orientatio…
57 Corrects a geometry: all rings which are wrongly oriented with respect to their expected orientatio…
/third_party/boost/libs/geometry/doc/reference/algorithms/
Dappend.qbk31 …either the exterior ring (the default) or specify a zero-based index for one of the interior rings
32 In the last case, the interior rings are not resized automatically,
33 so ensure that the zero-based index is smaller than the number of interior rings]]
43 the interior rings.
46 in the multi-polygon. The same applies for the interior rings
47 of the polygon: the interior rings are not resized
49 smaller than the number of interior rings of the polygon.]]
Dnum_interior_rings.qbk21 [[__polygon__][[qbk_ret the number of its interior rings]]]
22 [[__multi_polygon__][[qbk_ret the number of the interior rings of all polygons]]]
Dunique.qbk27 [[__polygon__][__applies_unique__ in all rings]]
30 [[__multi_polygon__][__applies_unique__ in all contained polygons (all rings)]]
/third_party/boost/boost/geometry/algorithms/detail/overlay/
Doverlay.hpp241 ring_container_type rings; in return_if_one_input_is_empty() local
242 assign_parents<OverlayType>(geometry1, geometry2, rings, all_of_one_of_them, strategy); in return_if_one_input_is_empty()
243 return add_rings<GeometryOut>(all_of_one_of_them, geometry1, geometry2, rings, out, in return_if_one_input_is_empty()
354 ring_container_type rings; in apply() local
360 turns, rings, in apply()
387 it = boost::begin(rings); in apply()
388 it != boost::end(rings); in apply()
398 rings, selected_ring_properties, strategy); in apply()
407 return add_rings<GeometryOut>(selected_ring_properties, geometry1, geometry2, rings, out, in apply()
Dtraversal_ring_creator.hpp260 Rings& rings, std::size_t& finalized_ring_size, in traverse_with_operation()
292 rings.push_back(ring); in traverse_with_operation()
302 rings, ring, m_turns, start_turn, in traverse_with_operation()
329 void iterate(Rings& rings, std::size_t& finalized_ring_size, in iterate()
346 rings, finalized_ring_size, state); in iterate()
353 rings, finalized_ring_size, state); in iterate()
361 Rings& rings, std::size_t& finalized_ring_size, in iterate_with_preference()
390 rings, finalized_ring_size, state); in iterate_with_preference()
402 rings, finalized_ring_size, state); in iterate_with_preference()
Dtraverse.hpp73 Turns& turns, Rings& rings, in apply() argument
101 std::size_t finalized_ring_size = boost::size(rings); in apply()
105 trav.iterate(rings, finalized_ring_size, state); in apply()
Dbacktrack_check_si.hpp122 Rings& rings, in apply() argument
148 rings.resize(size_at_start); in apply()
172 Rings& rings, typename boost::range_value<Rings>::type& ring, in apply() argument
184 rings.resize(size_at_start); in apply()
Dselect_rings.hpp121 rings = interior_rings(polygon); in apply() local
123 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
141 rings = interior_rings(polygon); in apply() local
143 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
/third_party/boost/libs/geometry/test/algorithms/overlay/
Dsplit_rings.cpp47 std::vector<ring_type> rings; in apply() local
48 bg::split_rings(geometry, rings); in apply()
50 BOOST_CHECK_EQUAL(rings.size(), expected_ring_count); in apply()
65 BOOST_FOREACH(ring_type const& ring, rings) in apply()
Ddissolver.cpp118 std::vector<ring_type> rings; in test_geometry() local
121 rings.push_back(bg::exterior_ring(polygon)); in test_geometry()
124 test_dissolve_plusmin<MultiPolygon>(caseid + "_rings", rings, in test_geometry()
/third_party/boost/libs/geometry/doc/concept/
Dpolygon.qbk30 …ialization of `traits::ring_type` defining the type of its exterior ring and interior rings as type
32 …ation of `traits::interior_type` defining the type of the collection of its interior rings as type;
35 …s::interior_rings` with two functions named `get`, returning the interior rings, one being const, …
47 reversed w.r.t. the defined orientation (so: counter clockwise for clockwise exterior rings).
49 * If the polygons underlying `ring_type` is defined as closed, all rings must be
53 exterior/interior rings) are allowed (as long as the interior is a connected
56 * The interior rings should be located within the exterior ring. Interior rings
/third_party/boost/boost/geometry/algorithms/detail/
Dcalculate_sum.hpp35 static inline ReturnType sum_interior_rings(Rings const& rings, Strategy const& strategy) in sum_interior_rings() argument
39 it = boost::begin(rings); it != boost::end(rings); ++it) in sum_interior_rings()
Dcounting.hpp70 rings = interior_rings(poly); in apply() local
72 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
/third_party/boost/boost/geometry/algorithms/
Dfor_each.hpp171 rings = interior_rings(poly); in apply() local
174 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
190 rings = interior_rings(poly); in apply() local
193 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
Dreverse.hpp61 rings = interior_rings(polygon); in apply() local
64 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
Dunique.hpp66 rings = interior_rings(polygon); in apply() local
69 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
Dcorrect_closure.hpp93 rings = interior_rings(poly); in apply() local
96 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
/third_party/boost/libs/geometry/test/core/
Dring.cpp63 the_interior rings = bg::interior_rings(poly); in test_ring() local
66 BOOST_CHECK_EQUAL(boost::size(rings), expected_interior_ring_count); in test_ring()
68 if (boost::size(rings)) in test_ring()
70 BOOST_CHECK_EQUAL(boost::size(rings.front()), expected_first_interior_count); in test_ring()
/third_party/skia/third_party/externals/brotli/js/
Ddecode.js627 var /** !Int32Array */ ringBuffers = s.rings;
655 var /** number */ literalBlockType = s.rings[5];
668 s.commandTreeIdx = s.rings[7];
676 s.distContextMapSlice = s.rings[9] << 2;
854 s.rings[4] = 1;
855 s.rings[5] = 0;
856 s.rings[6] = 1;
857 s.rings[7] = 0;
858 s.rings[8] = 1;
859 s.rings[9] = 0;
[all …]

1234