| /third_party/boost/libs/geometry/test/cs_undefined/ |
| D | distance.cpp | 18 bg::distance(g.pt, g.pt, bg::strategy::distance::pythagoras<>()); in test_main()
19 bg::distance(g.pt, g.pt, bg::strategy::distance::haversine<>()); in test_main()
20 bg::distance(g.pt, g.pt, bg::strategy::distance::geographic<>()); in test_main()
21 bg::distance(g.pt, g.mpt, bg::strategy::distance::pythagoras<>()); in test_main()
22 bg::distance(g.pt, g.mpt, bg::strategy::distance::haversine<>()); in test_main()
23 bg::distance(g.pt, g.mpt, bg::strategy::distance::geographic<>()); in test_main()
24 bg::distance(g.mpt, g.mpt, bg::strategy::distance::pythagoras<>()); in test_main()
25 bg::distance(g.mpt, g.mpt, bg::strategy::distance::haversine<>()); in test_main()
26 bg::distance(g.mpt, g.mpt, bg::strategy::distance::geographic<>()); in test_main()
27 bg::distance(g.pt, g.ls, bg::strategy::distance::projected_point<>()); in test_main()
[all …]
|
| D | measure.cpp | 30 bg::length(g.s, bg::strategy::distance::pythagoras<>()); in test_main()
31 bg::length(g.s, bg::strategy::distance::haversine<>()); in test_main()
32 bg::length(g.s, bg::strategy::distance::geographic<>()); in test_main()
33 bg::length(g.ls, bg::strategy::distance::pythagoras<>()); in test_main()
34 bg::length(g.ls, bg::strategy::distance::haversine<>()); in test_main()
35 bg::length(g.ls, bg::strategy::distance::geographic<>()); in test_main()
36 bg::length(g.mls, bg::strategy::distance::pythagoras<>()); in test_main()
37 bg::length(g.mls, bg::strategy::distance::haversine<>()); in test_main()
38 bg::length(g.mls, bg::strategy::distance::geographic<>()); in test_main()
40 bg::perimeter(g.r, bg::strategy::distance::pythagoras<>()); in test_main()
[all …]
|
| /third_party/skia/src/core/ |
| D | SkContourMeasure.cpp | 197 SkScalar compute_line_seg(SkPoint p0, SkPoint p1, SkScalar distance, unsigned ptIndex);
198 SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance,
200 SkScalar compute_conic_segs(const SkConic& conic, SkScalar distance,
204 SkScalar compute_cubic_segs(const SkPoint pts[4], SkScalar distance,
208 SkScalar SkContourMeasureIter::Impl::compute_quad_segs(const SkPoint pts[3], SkScalar distance, in compute_quad_segs() argument
215 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex); in compute_quad_segs()
216 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex); in compute_quad_segs()
219 SkScalar prevD = distance; in compute_quad_segs()
220 distance += d; in compute_quad_segs()
221 if (distance > prevD) { in compute_quad_segs()
[all …]
|
| /third_party/flutter/skia/src/core/ |
| D | SkContourMeasure.cpp | 170 SkScalar SkContourMeasureIter::compute_quad_segs(const SkPoint pts[3], SkScalar distance, in compute_quad_segs() argument
177 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex); in compute_quad_segs()
178 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex); in compute_quad_segs()
181 SkScalar prevD = distance; in compute_quad_segs()
182 distance += d; in compute_quad_segs()
183 if (distance > prevD) { in compute_quad_segs()
186 seg->fDistance = distance; in compute_quad_segs()
192 return distance; in compute_quad_segs()
195 SkScalar SkContourMeasureIter::compute_conic_segs(const SkConic& conic, SkScalar distance, in compute_conic_segs() argument
202 return distance; in compute_conic_segs()
[all …]
|
| /third_party/boost/boost/geometry/algorithms/detail/distance/ |
| D | backward_compatibility.hpp | 44 namespace detail { namespace distance namespace
51 static inline typename strategy::distance::services::return_type
59 typename detail::distance::default_ps_strategy in apply()
87 struct distance struct
92 > : detail::distance::point_to_segment<Point, Segment, Strategy>
98 struct distance struct
106 static inline typename strategy::distance::services::return_type
114 typedef typename detail::distance::default_ps_strategy in apply()
121 return detail::distance::point_to_range in apply()
131 struct distance struct
[all …]
|
| D | point_to_geometry.hpp | 57 namespace detail { namespace distance namespace
65 typename strategy::distance::services::return_type<Strategy, P1, P2>::type
84 typedef typename strategy::distance::services::comparable_type
95 typedef typename strategy::distance::services::return_type
112 namespace sds = strategy::distance::services; in apply()
154 typedef typename strategy::distance::services::return_type
188 typedef typename strategy::distance::services::return_type
273 typedef typename strategy::distance::services::return_type
286 namespace sds = strategy::distance::services; in apply()
310 dispatch::distance in apply()
[all …]
|
| D | interface.hpp | 61 struct distance struct
67 : distance<Geometry2, Geometry1, Strategy, Tag2, Tag1, StrategyTag, false>
69 typedef typename strategy::distance::services::return_type
81 return distance in apply()
99 struct distance struct
107 return dispatch::distance in apply()
115 struct distance<default_strategy> struct
124 typedef typename detail::distance::default_strategy in apply()
129 return dispatch::distance in apply()
144 struct distance struct
[all …]
|
| D | multipoint_to_geometry.hpp | 34 namespace detail { namespace distance namespace
41 typedef typename strategy::distance::services::return_type
82 typedef typename strategy::distance::services::return_type
93 return detail::distance::point_or_segment_range_to_geometry_rtree in apply()
135 typedef typename strategy::distance::services::return_type
161 return detail::distance::point_or_segment_range_to_geometry_rtree in apply()
194 struct distance struct
199 > : detail::distance::multipoint_to_multipoint
207 struct distance struct
211 > : detail::distance::multipoint_to_linear<MultiPoint, Linear, Strategy>
[all …]
|
| D | geometry_to_segment_or_box.hpp | 46 namespace detail { namespace distance namespace
86 typedef typename strategy::distance::services::comparable_type
101 typedef typename strategy::distance::services::return_type
192 typedef typename strategy::distance::services::return_type
225 strategy::distance::services::get_comparable in apply()
309 return dispatch::distance in apply()
349 typedef typename strategy::distance::services::return_type
360 namespace sds = strategy::distance::services; in apply()
384 dispatch::distance in apply()
406 struct distance struct
[all …]
|
| /third_party/boost/libs/geometry/test/algorithms/ |
| D | test_simplify.hpp | 81 DistanceMeasure const& distance) in apply()
86 std::back_inserter(simplified), distance); in apply()
94 …typedef typename bg::strategy::distance::detail::projected_point_ax<>::template result_type<point_… in apply()
95 … typedef bg::strategy::distance::detail::projected_point_ax_less<distance_type> less_comparator; in apply()
97 distance_type max_distance(distance); in apply()
103 bg::strategy::distance::detail::projected_point_ax<>, in apply()
120 DistanceMeasure const& distance) in check_geometry() argument
123 bg::simplify(geometry, simplified, distance); in check_geometry()
130 DistanceMeasure const& distance, in check_geometry() argument
134 bg::simplify(geometry, simplified, distance, strategy); in check_geometry()
[all …]
|
| /third_party/boost/libs/geometry/test/strategies/ |
| D | distance_cross_track.cpp | 73 …double distance = bg::strategy::distance::detail::geographic_cross_track<bg::strategy::vincenty, S… in test_all() local
75 check_result(distance, results.vincenty_bisection, results.reference, errors[0]); in test_all()
77 …distance = bg::strategy::distance::geographic_cross_track<bg::strategy::vincenty, Spheroid, double… in test_all()
79 check_result(distance, results.vincenty, results.reference, errors[0]); in test_all()
82 …distance = bg::strategy::distance::detail::geographic_cross_track<bg::strategy::thomas, Spheroid, … in test_all()
84 check_result(distance, results.thomas_bisection, results.reference, errors[1]); in test_all()
86 …distance = bg::strategy::distance::geographic_cross_track<bg::strategy::thomas, Spheroid, double>(… in test_all()
88 check_result(distance, results.thomas, results.reference, errors[1]); in test_all()
91 …distance = bg::strategy::distance::detail::geographic_cross_track<bg::strategy::andoyer, Spheroid,… in test_all()
93 check_result(distance, results.andoyer_bisection, results.reference, errors[2]); in test_all()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | test_direction.hpp | 37 BOOST_ASSERT(distance(outs[0]) == 0); in test_outdirected_graph()
38 BOOST_ASSERT(distance(outs[1]) == 1); in test_outdirected_graph()
39 BOOST_ASSERT(distance(outs[2]) == 1); in test_outdirected_graph()
40 BOOST_ASSERT(distance(outs[3]) == 2); in test_outdirected_graph()
41 BOOST_ASSERT(distance(outs[4]) == 2); in test_outdirected_graph()
42 BOOST_ASSERT(distance(outs[5]) == 1); in test_outdirected_graph()
84 BOOST_ASSERT(distance(ins[0]) == 2); in test_indirected_graph()
85 BOOST_ASSERT(distance(ins[1]) == 2); in test_indirected_graph()
86 BOOST_ASSERT(distance(ins[2]) == 1); in test_indirected_graph()
87 BOOST_ASSERT(distance(ins[3]) == 1); in test_indirected_graph()
[all …]
|
| D | bfs.cpp | 35 : current_distance(0), distance(d), parent(p), color(c), src(s) in bfs_testing_visitor()
47 BOOST_TEST(distance[u] == current_distance in examine_vertex()
48 || distance[u] == current_distance + 1); in examine_vertex()
49 if (distance[u] == current_distance + 1) // new level in examine_vertex()
62 BOOST_TEST(distance[u] == current_distance + 1); in discover_vertex()
63 BOOST_TEST(distance[u] == distance[parent[u]] + 1); in discover_vertex()
74 BOOST_TEST(distance[u] == current_distance); in tree_edge()
76 distance[v] = distance[u] + 1; in tree_edge()
84 BOOST_TEST(distance[target(e, g)] <= distance[source(e, g)] + 1); in non_tree_edge()
88 BOOST_TEST(distance[target(e, g)] == distance[source(e, g)] in non_tree_edge()
[all …]
|
| /third_party/icu/icu4c/source/common/ |
| D | locdistance.cpp | 127 int32_t distance = desLangDistance; in getBestIndexAndDistance() local
128 if (distance >= 0) { in getBestIndexAndDistance()
129 U_ASSERT((distance & DISTANCE_IS_FINAL) == 0); in getBestIndexAndDistance()
133 distance = trieNext(iter, supported.language, true); in getBestIndexAndDistance()
140 if (distance >= 0) { in getBestIndexAndDistance()
141 flags = distance & DISTANCE_IS_FINAL_OR_SKIP_SCRIPT; in getBestIndexAndDistance()
142 distance &= ~DISTANCE_IS_FINAL_OR_SKIP_SCRIPT; in getBestIndexAndDistance()
145 distance = 0; in getBestIndexAndDistance()
147 distance = defaultLanguageDistance; in getBestIndexAndDistance()
152 U_ASSERT(0 <= distance && distance <= 100); in getBestIndexAndDistance()
[all …]
|
| /third_party/node/deps/icu-small/source/common/ |
| D | locdistance.cpp | 127 int32_t distance = desLangDistance; in getBestIndexAndDistance() local
128 if (distance >= 0) { in getBestIndexAndDistance()
129 U_ASSERT((distance & DISTANCE_IS_FINAL) == 0); in getBestIndexAndDistance()
133 distance = trieNext(iter, supported.language, true); in getBestIndexAndDistance()
140 if (distance >= 0) { in getBestIndexAndDistance()
141 flags = distance & DISTANCE_IS_FINAL_OR_SKIP_SCRIPT; in getBestIndexAndDistance()
142 distance &= ~DISTANCE_IS_FINAL_OR_SKIP_SCRIPT; in getBestIndexAndDistance()
145 distance = 0; in getBestIndexAndDistance()
147 distance = defaultLanguageDistance; in getBestIndexAndDistance()
152 U_ASSERT(0 <= distance && distance <= 100); in getBestIndexAndDistance()
[all …]
|
| /third_party/skia/third_party/externals/icu/source/common/ |
| D | locdistance.cpp | 127 int32_t distance = desLangDistance; in getBestIndexAndDistance() local
128 if (distance >= 0) { in getBestIndexAndDistance()
129 U_ASSERT((distance & DISTANCE_IS_FINAL) == 0); in getBestIndexAndDistance()
133 distance = trieNext(iter, supported.language, true); in getBestIndexAndDistance()
140 if (distance >= 0) { in getBestIndexAndDistance()
141 flags = distance & DISTANCE_IS_FINAL_OR_SKIP_SCRIPT; in getBestIndexAndDistance()
142 distance &= ~DISTANCE_IS_FINAL_OR_SKIP_SCRIPT; in getBestIndexAndDistance()
145 distance = 0; in getBestIndexAndDistance()
147 distance = defaultLanguageDistance; in getBestIndexAndDistance()
152 U_ASSERT(0 <= distance && distance <= 100); in getBestIndexAndDistance()
[all …]
|
| /third_party/skia/third_party/externals/libwebp/src/dsp/ |
| D | lossless_common.h | 99 static WEBP_INLINE void VP8LPrefixEncodeBitsNoLUT(int distance, int* const code, in VP8LPrefixEncodeBitsNoLUT() argument
101 const int highest_bit = BitsLog2Floor(--distance); in VP8LPrefixEncodeBitsNoLUT()
102 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1; in VP8LPrefixEncodeBitsNoLUT()
107 static WEBP_INLINE void VP8LPrefixEncodeNoLUT(int distance, int* const code, in VP8LPrefixEncodeNoLUT() argument
110 const int highest_bit = BitsLog2Floor(--distance); in VP8LPrefixEncodeNoLUT()
111 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1; in VP8LPrefixEncodeNoLUT()
113 *extra_bits_value = distance & ((1 << *extra_bits) - 1); in VP8LPrefixEncodeNoLUT()
126 static WEBP_INLINE void VP8LPrefixEncodeBits(int distance, int* const code, in VP8LPrefixEncodeBits() argument
128 if (distance < PREFIX_LOOKUP_IDX_MAX) { in VP8LPrefixEncodeBits()
129 const VP8LPrefixCode prefix_code = kPrefixEncodeCode[distance]; in VP8LPrefixEncodeBits()
[all …]
|
| /third_party/json/test/src/ |
| D | unit-capacity.cpp | 241 CHECK(std::distance(j.begin(), j.end()) == j.size());
242 CHECK(std::distance(j_const.begin(), j_const.end()) == j_const.size());
243 CHECK(std::distance(j.rbegin(), j.rend()) == j.size());
244 CHECK(std::distance(j_const.crbegin(), j_const.crend()) == j_const.size());
261 CHECK(std::distance(j.begin(), j.end()) == j.size());
262 CHECK(std::distance(j_const.begin(), j_const.end()) == j_const.size());
263 CHECK(std::distance(j.rbegin(), j.rend()) == j.size());
264 CHECK(std::distance(j_const.crbegin(), j_const.crend()) == j_const.size());
283 CHECK(std::distance(j.begin(), j.end()) == j.size());
284 CHECK(std::distance(j_const.begin(), j_const.end()) == j_const.size());
[all …]
|
| /third_party/flutter/skia/third_party/externals/libwebp/src/dsp/ |
| D | lossless_common.h | 99 static WEBP_INLINE void VP8LPrefixEncodeBitsNoLUT(int distance, int* const code, in VP8LPrefixEncodeBitsNoLUT() argument
101 const int highest_bit = BitsLog2Floor(--distance); in VP8LPrefixEncodeBitsNoLUT()
102 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1; in VP8LPrefixEncodeBitsNoLUT()
107 static WEBP_INLINE void VP8LPrefixEncodeNoLUT(int distance, int* const code, in VP8LPrefixEncodeNoLUT() argument
110 const int highest_bit = BitsLog2Floor(--distance); in VP8LPrefixEncodeNoLUT()
111 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1; in VP8LPrefixEncodeNoLUT()
113 *extra_bits_value = distance & ((1 << *extra_bits) - 1); in VP8LPrefixEncodeNoLUT()
126 static WEBP_INLINE void VP8LPrefixEncodeBits(int distance, int* const code, in VP8LPrefixEncodeBits() argument
128 if (distance < PREFIX_LOOKUP_IDX_MAX) { in VP8LPrefixEncodeBits()
129 const VP8LPrefixCode prefix_code = kPrefixEncodeCode[distance]; in VP8LPrefixEncodeBits()
[all …]
|
| /third_party/uboot/u-boot-2020.01/fs/jffs2/ |
| D | mini_inflate.c | 53 stream->distance.bits = 16; in init_stream()
54 stream->distance.num_symbols = 32; in init_stream()
55 stream->distance.lengths = stream->distance_lengths; in init_stream()
56 stream->distance.symbols = stream->distance_symbols; in init_stream()
57 stream->distance.count = stream->distance_count; in init_stream()
58 stream->distance.first = stream->distance_first; in init_stream()
59 stream->distance.pos = stream->distance_pos; in init_stream()
142 struct huffman_set *distance = &(stream->distance); in decompress_huffman() local
164 if ((symbol = read_symbol(stream, distance)) < 0) in decompress_huffman()
226 struct huffman_set *distance = &(stream->distance); in decompress_dynamic() local
[all …]
|
| /third_party/boost/libs/geometry/test/algorithms/distance/ |
| D | test_distance_geo_common.hpp | 51 typedef bg::strategy::distance::haversine<double> spherical_pp;
55 typedef bg::strategy::distance::andoyer<stype> andoyer_pp;
56 typedef bg::strategy::distance::thomas<stype> thomas_pp;
57 typedef bg::strategy::distance::vincenty<stype> vincenty_pp;
61 typedef bg::strategy::distance::cross_track<> spherical_ps;
65 typedef bg::strategy::distance::geographic_cross_track<bg::strategy::andoyer, stype, double>
68 typedef bg::strategy::distance::geographic_cross_track<bg::strategy::thomas, stype, double>
71 typedef bg::strategy::distance::geographic_cross_track<bg::strategy::vincenty, stype, double>
74 typedef bg::strategy::distance::detail::geographic_cross_track<bg::strategy::vincenty, stype, doubl…
79 typedef bg::strategy::distance::cross_track_point_box<> spherical_pb;
[all …]
|
| D | distance.cpp | 54 namespace services = bg::strategy::distance::services; in test_distance_point()
67 return_type d = bg::distance(p1, p2); in test_distance_point()
76 d = bg::distance(p1, p2, strategy); in test_distance_point()
87 cab_return_type d = bg::distance(p1, p2, tcd); in test_distance_point()
126 return_type d1 = bg::distance(p1, seg); in test_distance_segment()
127 return_type d2 = bg::distance(p2, seg); in test_distance_segment()
128 return_type d3 = bg::distance(p3, seg); in test_distance_segment()
129 return_type d4 = bg::distance(p4, seg); in test_distance_segment()
130 return_type d5 = bg::distance(p5, seg); in test_distance_segment()
139 return_type dr1 = bg::distance(seg, p1); in test_distance_segment()
[all …]
|
| /third_party/skia/third_party/externals/opengl-registry/extensions/NV/ |
| D | NV_fog_distance.txt | 40 Ideally, the fog distance (used to compute the fog factor as
42 Euclidean distance to the fragment center from the eye. In practice,
44 distance from the eye to each fragment center by abs(ze). Further,
49 OpenGL computes the distance used in computing the fog factor.
51 The extension supports three fog distance modes: "eye plane absolute",
52 where the fog distance is the absolute planar distance from the eye
54 "eye plane", where the fog distance is the signed planar distance
55 from the eye plane; and "eye radial", where the fog distance is
56 computed as a Euclidean distance. In the case of the eye radial
57 fog distance mode, the distance may be computed per-vertex and then
[all …]
|
| /third_party/openGLES/extensions/NV/ |
| D | NV_fog_distance.txt | 40 Ideally, the fog distance (used to compute the fog factor as
42 Euclidean distance to the fragment center from the eye. In practice,
44 distance from the eye to each fragment center by abs(ze). Further,
49 OpenGL computes the distance used in computing the fog factor.
51 The extension supports three fog distance modes: "eye plane absolute",
52 where the fog distance is the absolute planar distance from the eye
54 "eye plane", where the fog distance is the signed planar distance
55 from the eye plane; and "eye radial", where the fog distance is
56 computed as a Euclidean distance. In the case of the eye radial
57 fog distance mode, the distance may be computed per-vertex and then
[all …]
|
| /third_party/grpc/examples/python/cancellation/ |
| D | search.py | 34 distance = 0
37 distance += 1
38 return distance
56 distance = _get_hamming_distance(candidate[i:i + len(target)].lower(),
58 if min_distance is None or distance < min_distance:
59 min_distance = distance
132 distance = _get_substring_hamming_distance(candidate_hash, target)
133 if interesting_hamming_distance is not None and distance <= interesting_hamming_distance:
138 hamming_distance=distance)
139 elif distance <= ideal_distance:
[all …]
|