| /third_party/boost/libs/graph/test/ |
| D | mas_test.cpp | 33 typedef boost::property_traits< weight_map_type >::value_type weight_type; typedef
65 typedef typename KeyedUpdatablePriorityQueue::key_type weight_type; typedef in mas_edge_connectivity_visitor
77 , m_reach_weight(new weight_type(0)) in mas_edge_connectivity_visitor()
102 weight_type reach_weight() const { return *m_reach_weight; } in reach_weight()
107 boost::shared_ptr< weight_type > m_reach_weight;
123 weight_type ws[] = { 2, 3, 4, 3, 2, 2, 2, 2, 2, 3, 1, 3 }; in BOOST_AUTO_TEST_CASE()
133 typedef boost::shared_array_property_map< weight_type, in BOOST_AUTO_TEST_CASE()
138 num_vertices(g), weight_type(0), get(boost::vertex_index, g)); in BOOST_AUTO_TEST_CASE()
147 distances_type, std::greater< weight_type > > in BOOST_AUTO_TEST_CASE()
152 distances_type, std::greater< weight_type > > > in BOOST_AUTO_TEST_CASE()
[all …]
|
| D | stoer_wagner_test.cpp | 31 typedef boost::property_traits< weight_map_type >::value_type weight_type; typedef
62 weight_type ws[] = { 2, 3, 4, 3, 2, 2, 2, 2, 2, 3, 1, 3 }; in BOOST_AUTO_TEST_CASE()
97 weight_type ws[] = { 3, 1, 1, 1 }; in BOOST_AUTO_TEST_CASE()
122 weight_type ws[] = { 1, 3, 4, 6, 4, 1, 2, 5, 2 }; in BOOST_AUTO_TEST_CASE()
146 weight_type ws[] = { 0, 3, 1, 3, 1, 2, 6, 1, 8, 1, 1, 80, 2, 1, 1, 4 }; in BOOST_AUTO_TEST_CASE()
186 boost::make_constant_property< edge_descriptor >(weight_type(1)), in BOOST_AUTO_TEST_CASE()
231 typedef boost::shared_array_property_map< weight_type, in BOOST_AUTO_TEST_CASE()
236 num_vertices(g), weight_type(0), get(boost::vertex_index, g)); in BOOST_AUTO_TEST_CASE()
245 distances_type, std::greater< weight_type > > in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/boost/graph/ |
| D | stoer_wagner_min_cut.hpp | 37 weight_type; typedef in boost::detail::mas_min_cut_visitor
42 weight_type& cutweight, const WeightMap& weight_map, in mas_min_cut_visitor()
52 m_bestWeight = (std::numeric_limits< weight_type >::max)(); in mas_min_cut_visitor()
71 weight_type w = get(m_weightMap, e); in examine_edge()
107 m_bestWeight = (std::numeric_limits< weight_type >::max)(); in clear()
115 weight_type& m_bestWeight;
116 weight_type m_cutweight;
158 weight_type; in stoer_wagner_min_cut() typedef
162 weight_type bestW = (std::numeric_limits< weight_type >::max)(); in stoer_wagner_min_cut()
163 weight_type bestThisTime = (std::numeric_limits< weight_type >::max)(); in stoer_wagner_min_cut()
[all …]
|
| D | kamada_kawai_spring_layout.hpp | 158 typename property_traits< WeightMap >::value_type weight_type; typedef
171 weight_type spring_constant, VertexIndexMap index, in kamada_kawai_spring_layout_impl()
202 weight_type dist = topology.norm(diff); in compute_partial_derivative()
240 g, distance, index, weight, weight_type(0))) in run()
244 weight_type edge_length = detail::graph::compute_edge_length( in run()
250 const weight_type K = spring_constant; in run()
258 weight_type dij in run()
260 if (dij == (std::numeric_limits< weight_type >::max)()) in run()
275 weight_type delta_p(0); in run()
283 weight_type delta = topology.norm(deriv); in run()
[all …]
|
| D | maximum_adjacency_search.hpp | 125 weight_type; in maximum_adjacency_search() typedef
140 put(keys, v, weight_type(0)); in maximum_adjacency_search()
268 typedef typename WeightMap::value_type weight_type; in apply() typedef
272 weight_type, vertex_descriptor, in apply()
273 std::greater< weight_type > > in apply()
278 weight_type(0))); in apply()
319 typedef typename WeightMap::value_type weight_type; in apply() typedef
323 weight_type, vertex_descriptor, in apply()
324 std::greater< weight_type > > in apply()
329 weight_type(0))); in apply()
|
| D | random.hpp | 97 typedef typename property_traits< WeightMap >::value_type weight_type; in weighted_random_out_edge() typedef
98 weight_type weight_sum(0); in weighted_random_out_edge()
103 weight_type chosen_weight = variate(); in weighted_random_out_edge()
106 weight_type w = get(weight, e); in weighted_random_out_edge()
|
| D | bellman_ford_shortest_paths.hpp | 150 typedef typename property_traits< WeightMap >::value_type weight_type; in bellman_dispatch2() typedef
155 put(distance, *v, (std::numeric_limits< weight_type >::max)()); in bellman_dispatch2()
158 put(distance, s, weight_type(0)); in bellman_dispatch2()
|
| /third_party/boost/libs/histogram/test/ |
| D | detail_accumulator_traits_test.cpp | 16 using boost::histogram::weight_type; in main()
35 void operator()(weight_type<int>); in main()
43 void operator()(weight_type<int>, int, double, char); in main()
51 void operator()(const weight_type<int>, int); in main()
58 void operator()(const weight_type<int>&, const int); in main()
65 void operator()(weight_type<int>&&, int&&); in main()
|
| D | histogram_fail2.cpp | 15 void operator()(weight_type<double>, double) {} in main()
|
| /third_party/boost/boost/histogram/ |
| D | weight.hpp | 22 struct weight_type { struct
28 operator weight_type<U>() const { in operator weight_type<U>() argument
29 return weight_type<U>{static_cast<U>(value)}; in operator weight_type<U>()
39 return weight_type<T>{std::forward<T>(t)}; in weight()
|
| D | histogram.hpp | 246 void fill(const Iterable& args, const weight_type<T>& weights) { in fill()
265 void fill(const weight_type<T>& weights, const Iterable& args) { in fill()
304 void fill(const Iterable& args, const weight_type<T>& weights, in fill()
327 void fill(const sample_type<T>& samples, const weight_type<U>& weights, in fill()
333 void fill(const weight_type<T>& weights, const sample_type<U>& samples, in fill()
340 const weight_type<U>& weights) { in fill()
|
| D | fwd.hpp | 87 struct weight_type;
|
| /third_party/boost/boost/histogram/detail/ |
| D | accumulator_traits.hpp | 35 R (T::*)(boost::histogram::weight_type<U>, Ts...));
39 R (T::*)(boost::histogram::weight_type<U>&, Ts...));
43 R (T::*)(boost::histogram::weight_type<U>&&, Ts...));
47 R (T::*)(const boost::histogram::weight_type<U>&, Ts...));
|
| D | argument_traits.hpp | 24 struct is_weight_impl<weight_type<T>> : mp11::mp_true {};
|
| /third_party/boost/libs/graph/example/ |
| D | stoer_wagner.cpp | 34 typedef boost::property_traits< weight_map_type >::value_type weight_type; in main() typedef
44 weight_type ws[] = { 0, 3, 1, 3, 1, 2, 6, 1, 8, 1, 1, 80, 2, 1, 1, 4 }; in main()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_shortest_paths_test.cpp | 136 typedef int weight_type; typedef
139 WeightedEdge(weight_type weight = 0) : weight(weight) { } in WeightedEdge()
141 weight_type weight;
|
| D | distributed_betweenness_centrality_test.cpp | 96 typedef int weight_type; typedef
99 WeightedEdge(weight_type weight = 0) : weight(weight) { } in WeightedEdge()
101 weight_type weight;
|
| D | distributed_csr_algorithm_test.cpp | 187 typedef int weight_type; typedef
190 WeightedEdge(weight_type weight = 0) : weight(weight) { } in WeightedEdge()
192 weight_type weight;
|
| D | ssca.cpp | 555 typedef typename property_traits<EdgeWeightMap>::value_type weight_type; typedef
561 return (get(m_weight, e) & ((std::numeric_limits<weight_type>::max)() - 7)) != get(m_weight, e); in operator ()()
571 typedef int weight_type; typedef
574 WeightedEdge(weight_type weight = 0) : weight(weight) { } in WeightedEdge()
576 weight_type weight;
674 typedef weight_type weight_t; in run_non_distributed_graph_tests()
698 typedef property_map<seqGraph, weight_type WeightedEdge::*>::type seqEdgeWeightMap; in run_non_distributed_graph_tests()
946 typedef weight_type weight_t; in run_distributed_graph_tests()
972 typedef typename property_map<Graph, weight_type WeightedEdge::*>::type EdgeWeightMap; in run_distributed_graph_tests()
|
| /third_party/boost/boost/graph/distributed/ |
| D | crauser_et_al_shortest_paths.hpp | 511 typedef typename property_traits<WeightMap>::value_type weight_type; in initialize_min_out_weights() typedef
520 if (get(min_out_weight, v) < weight_type(0)) in initialize_min_out_weights()
552 typedef typename property_traits<WeightMap>::value_type weight_type; in crauser_et_al_shortest_paths() typedef
553 typedef iterator_property_map<weight_type*, IndexMap> MinOutWeightMap; in crauser_et_al_shortest_paths()
554 std::vector<weight_type> min_out_weights_vec(num_vertices(g), inf); in crauser_et_al_shortest_paths()
566 std::vector<weight_type> in crauser_et_al_shortest_paths()
|
| D | dehne_gotz_min_spanning_tree.hpp | 161 weight_type; in boruvka_merge_step() typedef
163 weight_type> w_edge; in boruvka_merge_step()
168 weight_type inf = (std::numeric_limits<weight_type>::max)(); in boruvka_merge_step()
178 weight_type w = get(weight_map, *ei); in boruvka_merge_step()
447 typedef typename property_traits<WeightMap>::value_type weight_type; in merge_local_minimum_spanning_trees_step() typedef
470 typedef std::pair<edge_descriptor, weight_type> w_edge; in merge_local_minimum_spanning_trees_step()
473 indirect_cmp<WeightMap, std::less<weight_type> > cmp_edge_weight(weight); in merge_local_minimum_spanning_trees_step()
|
| /third_party/mindspore/mindspore/nn/probability/bnn_layers/ |
| D | conv_variational.py | 122 weight_type = self.weight_posterior("get_dist_type")
125 kl = self.weight_prior("kl_loss", weight_type, *weight_args_list)
|
| D | dense_variational.py | 100 weight_type = self.weight_posterior("get_dist_type")
102 kl = self.weight_prior("kl_loss", weight_type, *weight_args_list)
|
| /third_party/boost/libs/histogram/examples/ |
| D | guide_custom_accumulators_3.cpp | 28 void operator()(weight_type<double> w, double x, double y) { in main()
|
| D | guide_custom_accumulators_advanced.cpp | 28 void operator()(weight_type<double> w, double x, double y) { in main()
|