| /third_party/boost/libs/geometry/test/algorithms/distance/ |
| D | distance_brute_force.hpp | 102 >::type distance_type; in apply() typedef
105 distance_type d_min(0); in apply()
108 distance_type d = Policy::apply(geometry, *it, strategy); in apply()
216 >::type distance_type; typedef
218 static inline distance_type apply(Point const& point, in apply()
247 >::type distance_type; typedef
249 static inline distance_type apply(Point const& point, in apply()
293 >::type distance_type; typedef
295 static inline distance_type apply(Point const& point, in apply()
331 >::type distance_type; typedef
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | eager_dijkstra_shortest_paths.hpp | 87 typedef typename property_traits<DistanceMap>::value_type distance_type; typedef
92 distance_type zero) in parallel_dijkstra_bfs_visitor()
117 distance_type old_distance = get(c_dist, target(e, g)); in examine_edge()
146 distance_type m_zero;
181 typedef typename property_traits<DistanceMap>::value_type distance_type; typedef in boost::graph::distributed::detail::lookahead_dijkstra_queue
203 distance_type lookahead) in lookahead_dijkstra_queue()
273 distance_type local_distance = in do_synchronize()
274 queue.empty()? (std::numeric_limits<distance_type>::max)() in do_synchronize()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
[all …]
|
| D | crauser_et_al_shortest_paths.hpp | 182 typedef typename property_traits<DistanceMap>::value_type distance_type; typedef in boost::graph::distributed::detail::crauser_et_al_dijkstra_queue
310 distance_type local_distances[2]; in do_synchronize()
312 dist_queue.empty()? (std::numeric_limits<distance_type>::max)() in do_synchronize()
316 out_queue.empty()? (std::numeric_limits<distance_type>::max)() in do_synchronize()
320 distance_type distances[2]; in do_synchronize()
322 distances, minimum<distance_type>()); in do_synchronize()
337 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
367 distance_type distance) in receive_update()
394 std::pair<distance_type, vertex_descriptor> p) in receive_update() argument
412 distance_type min_distance;
[all …]
|
| /third_party/boost/boost/geometry/strategies/agnostic/ |
| D | simplify_douglas_peucker.hpp | 103 >::type distance_type; typedef in boost::geometry::strategy::simplify::detail::douglas_peucker
124 distance_type const& max_dist, in consider()
157 distance_type md(-1.0); // any value < 0 in consider()
161 distance_type dist = ps_distance_strategy.apply(it->p, begin->p, last->p); in consider()
199 distance_type max_distance) const in apply()
277 >::distance_type distance_type; typedef in boost::geometry::strategy::simplify::douglas_peucker
282 distance_type const& max_distance) in apply()
|
| /third_party/boost/boost/graph/ |
| D | geodesic_distance.hpp | 22 typedef typename base_type::distance_type distance_type; typedef
25 result_type operator()(distance_type d, const Graph& g) in operator ()()
71 typedef typename base_type::distance_type distance_type; typedef
74 inline result_type operator()(distance_type d, const Graph& g) in operator ()()
105 typedef typename Measure::distance_type Distance; in mean_geodesic()
116 typedef typename Measure::distance_type Distance; in mean_geodesic()
|
| D | closeness_centrality.hpp | 22 typedef typename base_type::distance_type distance_type; typedef
25 result_type operator()(distance_type d, const Graph&) in operator ()()
|
| /third_party/boost/boost/geometry/strategies/cartesian/ |
| D | centroid_weighted_length.hpp | 77 >::type distance_type; typedef in boost::geometry::strategy::centroid::weighted_length
82 distance_type,
89 distance_type const d = geometry::distance(p1, p2); in apply()
102 distance_type const zero = distance_type(); in result()
|
| D | line_interpolate.hpp | 57 typedef typename distance_pp_strategy::type distance_type; in get_distance_pp_strategy() typedef
58 return distance_type(); in get_distance_pp_strategy()
|
| /third_party/boost/boost/graph/distributed/detail/ |
| D | dijkstra_shortest_paths.hpp | 26 typedef typename property_traits<DistanceMap>::value_type distance_type; typedef in boost::graph::distributed::detail::dijkstra_msg_value
31 typedef std::pair<distance_type, predecessor_type> type;
33 static type create(distance_type dist, predecessor_type pred) in create()
|
| /third_party/boost/libs/geometry/test/algorithms/ |
| D | test_simplify.hpp | 94 …ce::detail::projected_point_ax<>::template result_type<point_type, point_type>::type distance_type; in apply() typedef
95 … typedef bg::strategy::distance::detail::projected_point_ax_less<distance_type> less_comparator; in apply()
97 distance_type max_distance(distance); in apply()
187 …ce::detail::projected_point_ax<>::template result_type<point_type, point_type>::type distance_type; in test_geometry() typedef
188 typedef bg::strategy::distance::detail::projected_point_ax_less<distance_type> less_comparator; in test_geometry()
190 distance_type const max_distance(distance); in test_geometry()
|
| D | comparable_distance.cpp | 41 typedef typename bg::default_distance_result<P, P>::type distance_type; in test_distance_result() typedef
47 distance_type dr12 = bg::comparable_distance(p1, p2); in test_distance_result()
48 distance_type dr13 = bg::comparable_distance(p1, p3); in test_distance_result()
49 distance_type dr23 = bg::comparable_distance(p2, p3); in test_distance_result()
|
| /third_party/boost/boost/graph/detail/ |
| D | d_ary_heap.hpp | 202 distance_type; typedef in boost::d_ary_heap_indirect
257 distance_type currently_being_moved_dist in preserve_heap_property_up()
301 distance_type currently_being_moved_dist in preserve_heap_property_down()
312 distance_type smallest_child_dist in preserve_heap_property_down()
320 distance_type i_dist = get(distance, i_value); in preserve_heap_property_down()
332 distance_type i_dist = get(distance, child_base_ptr[i]); in preserve_heap_property_down()
|
| D | geodesic.hpp | 115 typedef DistanceType distance_type; typedef
119 typedef numeric_values< distance_type > distance_values;
122 static inline distance_type infinite_distance() in infinite_distance()
|
| /third_party/boost/boost/geometry/strategies/geographic/ |
| D | distance_segment_box.hpp | 69 typedef typename distance_pp_strategy::type distance_type; in get_distance_pp_strategy() typedef
70 return distance_type(m_spheroid); in get_distance_pp_strategy()
85 typedef typename distance_ps_strategy::type distance_type; in get_distance_ps_strategy() typedef
86 return distance_type(m_spheroid); in get_distance_ps_strategy()
|
| D | line_interpolate.hpp | 68 typedef typename distance_pp_strategy::type distance_type; in get_distance_pp_strategy() typedef
69 return distance_type(m_spheroid); in get_distance_pp_strategy()
|
| /third_party/boost/libs/graph/example/ |
| D | inclusive_mean_geodesic.cpp | 27 typedef DistanceType distance_type; typedef
30 result_type operator()(distance_type d, const Graph& g) in operator ()()
32 if (d == numeric_values< distance_type >::infinity()) in operator ()()
|
| /third_party/boost/boost/geometry/index/detail/rtree/visitors/ |
| D | distance_query.hpp | 26 typedef DistanceType distance_type; typedef in boost::geometry::index::detail::rtree::visitors::distance_query_result
36 inline void store(Value const& val, distance_type const& curr_comp_dist) in store()
62 inline distance_type greatest_comparable_distance() const in greatest_comparable_distance()
69 ? (std::numeric_limits<distance_type>::max)() in greatest_comparable_distance()
75 …typedef typename std::vector< std::pair<distance_type, Value> >::const_iterator neighbors_iterator; in finish()
84 std::pair<distance_type, Value> const& p1, in neighbors_less() argument
85 std::pair<distance_type, Value> const& p2) in neighbors_less()
93 std::vector< std::pair<distance_type, Value> > m_neighbors;
|
| /third_party/boost/boost/pending/ |
| D | is_heap.hpp | 34 return __is_heap(first, last, distance_type(first)); in is_heap()
59 return __is_heap(first, last, comp, distance_type(first)); in is_heap()
|
| /third_party/boost/libs/geometry/test/strategies/ |
| D | pythagoras.cpp | 249 >::type distance_type; in test_integer() typedef
256 distance_type distance = pythagoras.apply(p1, p2); in test_integer()
263 distance_type distance2 = sqrt(distance_type(cdistance)); in test_integer()
268 BOOST_CHECK((boost::is_same<distance_type, double>::type::value)); in test_integer()
|
| D | pythagoras_point_box.cpp | 347 >::type distance_type; in test_integer() typedef
354 distance_type distance = pythagoras.apply(p, b); in test_integer()
361 distance_type distance2 = sqrt(distance_type(cdistance)); in test_integer()
366 BOOST_CHECK((boost::is_same<distance_type, double>::type::value)); in test_integer()
|
| /third_party/boost/libs/geometry/doc/generated/ |
| D | simplify_douglas_peucker.qbk | 43 OutputIterator apply(Range const & range, OutputIterator out, distance_type const & max_distance)``
49 [* distance_type const &]: ['max_distance]:
|
| /third_party/boost/boost/spirit/home/support/iterators/detail/ |
| D | split_functor_input_policy.hpp | 66 typedef std::ptrdiff_t distance_type; typedef in boost::spirit::iterator_policies::split_functor_input::unique
135 typedef std::ptrdiff_t distance_type; typedef in boost::spirit::iterator_policies::split_functor_input::unique
|
| D | lex_input_policy.hpp | 31 typedef std::ptrdiff_t distance_type; typedef in boost::spirit::iterator_policies::lex_input::unique
|
| /third_party/boost/boost/spirit/home/support/iterators/ |
| D | multi_pass.hpp | 48 typedef typename iterator_type::distance_type distance_type; typedef in boost::spirit::multi_pass
|
| /third_party/boost/libs/graph/test/ |
| D | floyd_warshall_test.cpp | 74 boost::vertex_distance_t >::type distance_type; in acceptance_test() typedef
75 distance_type distance_row = boost::get(boost::vertex_distance, g); in acceptance_test()
270 boost::vertex_distance_t >::type distance_type; in acceptance_test2() typedef
271 distance_type distance_row = boost::get(boost::vertex_distance, g); in acceptance_test2()
|