| /third_party/grpc/examples/python/cancellation/ |
| D | search.py | 52 min_distance = None
58 if min_distance is None or distance < min_distance:
59 min_distance = distance
60 return min_distance
|
| /third_party/skia/third_party/externals/brotli/research/ |
| D | draw_histogram.cc | 27 DEFINE_uint64(min_distance, 0, "Minimum distance.");
71 size_t min_distance = FLAGS_min_distance; in BuildHistogram() local
82 double min_dist = min_distance > 0 ? DistanceTransform(min_distance) : 0; in BuildHistogram()
88 if (distance < min_distance || distance >= GetMaxDistance()) continue; in BuildHistogram()
|
| /third_party/gstreamer/gstplugins_bad/ext/opencv/ |
| D | gsthanddetect.cpp | 423 int min_distance, distance; in gst_handdetect_transform_ip() local
432 min_distance = img.size ().width + img.size ().height; in gst_handdetect_transform_ip()
442 if (distance <= min_distance) { in gst_handdetect_transform_ip()
443 min_distance = distance; in gst_handdetect_transform_ip()
509 int min_distance, distance; in gst_handdetect_transform_ip() local
522 min_distance = img.size ().width + img.size ().height; in gst_handdetect_transform_ip()
532 if (distance <= min_distance) { in gst_handdetect_transform_ip()
533 min_distance = distance; in gst_handdetect_transform_ip()
|
| /third_party/boost/libs/math/doc/graphs/ |
| D | plot_1d_errors.cpp | 48 Real max_distance(0), min_distance(0), max_error(0), max_error_location(0); in plot_errors_1d() local
79 if (min_distance > distance) in plot_errors_1d()
80 min_distance = (std::max)(distance, -max_y_scale); in plot_errors_1d()
104 if (min_distance == 0) in plot_errors_1d()
105 min_distance = -1; in plot_errors_1d()
111 ….y_range((int)floor(min_distance), (int)ceil(max_distance)).x_label("x").y_major_interval((double)… in plot_errors_1d()
|
| /third_party/boost/boost/graph/ |
| D | boykov_kolmogorov_max_flow.hpp | 525 tDistanceVal min_distance in adopt() local
543 if (get(m_dist_map, other_node) < min_distance) in adopt()
545 min_distance = get(m_dist_map, other_node); in adopt()
551 if (min_distance in adopt()
555 put(m_dist_map, current_node, min_distance + 1); in adopt()
596 tDistanceVal min_distance in adopt() local
608 if (get(m_dist_map, other_node) < min_distance) in adopt()
610 min_distance = get(m_dist_map, other_node); in adopt()
615 if (min_distance in adopt()
619 put(m_dist_map, current_node, min_distance + 1); in adopt()
|
| D | push_relabel_max_flow.hpp | 386 distance_size_type min_distance = num_vertices(g); in relabel_distance() local
387 put(distance, u, min_distance); in relabel_distance()
397 if (is_residual_edge(a) && get(distance, v) < min_distance) in relabel_distance()
399 min_distance = get(distance, v); in relabel_distance()
403 ++min_distance; in relabel_distance()
404 if (min_distance < n) in relabel_distance()
406 put(distance, u, min_distance); // this is the main action in relabel_distance()
409 min_distance, max_distance); in relabel_distance()
411 return min_distance; in relabel_distance()
|
| D | gursoy_atun_layout.hpp | 168 double min_distance = 0.0; in gursoy_atun_step() local
174 if (min_distance_unset || this_distance < min_distance) in gursoy_atun_step()
176 min_distance = this_distance; in gursoy_atun_step()
|
| /third_party/boost/boost/graph/distributed/ |
| D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| D | crauser_et_al_shortest_paths.hpp | 252 min_distance(0), in crauser_et_al_dijkstra_queue()
323 min_distance = distances[0]; in do_synchronize()
337 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
359 - get(min_in_weight, top_vertex)) <= min_distance; in has_suitable_vertex()
412 distance_type min_distance; member in boost::graph::distributed::detail::crauser_et_al_dijkstra_queue
|
| /third_party/ninja/src/ |
| D | state.cc | 124 int min_distance = kMaxValidEditDistance + 1; in SpellcheckNode() local
129 if (distance < min_distance && i->second) { in SpellcheckNode()
130 min_distance = distance; in SpellcheckNode()
|
| D | util.cc | 398 int min_distance = kMaxValidEditDistance + 1; in SpellcheckStringV() local
404 if (distance < min_distance) { in SpellcheckStringV()
405 min_distance = distance; in SpellcheckStringV()
|
| /third_party/gn/src/gn/ |
| D | string_utils.cc | 333 size_t min_distance = kMaxValidEditDistance + 1u; in SpellcheckString() local
337 if (distance < min_distance) { in SpellcheckString()
338 min_distance = distance; in SpellcheckString()
|
| /third_party/boost/libs/geometry/example/ |
| D | 07_b_graph_route_example.cpp | 178 double min_distance = 1e300; in add_roads_and_connect_cities() local
182 if (dist < min_distance) in add_roads_and_connect_cities()
184 min_distance = dist; in add_roads_and_connect_cities()
|
| D | 07_a_graph_route_example.cpp | 193 double min_distance = 1e300; in add_roads_and_connect_cities() local
197 if (dist < min_distance) in add_roads_and_connect_cities()
199 min_distance = dist; in add_roads_and_connect_cities()
|
| /third_party/boost/libs/detail/test/ |
| D | numeric_traits_test.cpp | 317 difference_type min_distance = complement_traits<difference_type>::min; in signed_test() local
321 const Number n2 = Number(max + min_distance); in signed_test()
330 assert(d2 == min_distance); in signed_test()
|
| /third_party/mindspore/mindspore/lite/tools/converter/quantizer/ |
| D | quantize_util.cc | 483 float min_distance = pow(data[i] - clusters[0], 2); in KMeans() local
485 if (pow(data[i] - clusters[j], 2) < min_distance) { in KMeans()
486 min_distance = pow(data[i] - clusters[j], 2); in KMeans()
|
| /third_party/ffmpeg/libavcodec/ |
| D | g729dec.c | 204 static const uint8_t min_distance[2]={10, 5}; //(2.13) in lsf_decode() local
214 int diff = (quantizer_output[i - 1] - quantizer_output[i] + min_distance[j]) >> 1; in lsf_decode()
|
| /third_party/boost/libs/geometry/index/example/ |
| D | glut_vis.cpp | 625 void draw_knn_area(float min_distance, float max_distance) in draw_knn_area() argument
637 glVertex3f(x + min_distance * ::cos(a), y + min_distance * ::sin(a), z); in draw_knn_area()
|
| /third_party/gstreamer/gstplugins_bad/ext/hls/ |
| D | m3u8.c | 1230 guint min_distance = 0; in gst_m3u8_get_seek_range() local
1243 min_distance = GST_M3U8_LIVE_MIN_FRAGMENT_DISTANCE; in gst_m3u8_get_seek_range()
1247 for (walk = m3u8->files; walk && count > min_distance; walk = walk->next) { in gst_m3u8_get_seek_range()
|
| /third_party/ffmpeg/libavfilter/ |
| D | af_aiir.c | 635 double min_distance = DBL_MAX; in decompose_zp2biquads() local
677 if (distance < min_distance) { in decompose_zp2biquads()
678 min_distance = distance; in decompose_zp2biquads()
|
| /third_party/ffmpeg/libavformat/ |
| D | avformat.h | 817 …int min_distance; /**< Minimum distance between this and the previous keyframe, used to av… member
|
| D | utils.c | 1999 } else if (ie->pos == pos && distance < ie->min_distance) in ff_add_index_entry()
2001 distance = ie->min_distance; in ff_add_index_entry()
2006 ie->min_distance = distance; in ff_add_index_entry()
2175 if (e->timestamp <= target_ts || e->pos == e->min_distance) { in ff_seek_frame_binary()
2192 pos_limit = pos_max - e->min_distance; in ff_seek_frame_binary()
|
| D | mov.c | 3333 ie->min_distance= distance; in add_index_entry()
3721 current->min_distance, flags) == -1) { in mov_fix_index()
3969 e->min_distance = distance; in mov_build_index()
4101 e->min_distance = 0; in mov_build_index()
4984 st->index_entries[index_entry_pos].min_distance= distance; in mov_read_trun()
|