| /third_party/boost/libs/graph/test/ |
| D | gursoy_atun_layout_test.cpp | 69 boost::minstd_rand edge_weight_gen; in main()
70 boost::uniform_01< boost::minstd_rand > random_edge_weight(edge_weight_gen); in main()
102 minstd_rand gen; in main()
103 graph_type graph(plod_iterator<minstd_rand, graph_type>(gen, n, alpha, beta), in main()
104 plod_iterator<minstd_rand, graph_type>(), in main()
110 minstd_rand gen; in main()
111 graph_type graph(small_world_iterator< minstd_rand >(gen, n, k, p), in main()
112 small_world_iterator< minstd_rand >(n, k), n); in main()
|
| D | bron_kerbosch_all_cliques.cpp | 52 typedef erdos_renyi_iterator< boost::minstd_rand, Graph > er; in test()
59 boost::minstd_rand rng; in test()
|
| D | tiernan_all_cycles.cpp | 46 typedef erdos_renyi_iterator< boost::minstd_rand, Graph > er; in test()
52 boost::minstd_rand rng; in test()
|
| D | cycle_test.hpp | 57 typedef erdos_renyi_iterator< minstd_rand, Graph > er; in test_one()
63 minstd_rand rng; in test_one()
|
| D | dijkstra_heap_performance.cpp | 95 minstd_rand gen(seed); in main()
97 Graph g(erdos_renyi_iterator< minstd_rand, Graph >(gen, n, p), in main()
98 erdos_renyi_iterator< minstd_rand, Graph >(), n); in main()
|
| D | max_flow_test.cpp | 94 minstd_rand gen(seed); in main()
99 typedef variate_generator< minstd_rand, uniform_int< int > > tIntGen; in main()
|
| D | grid_graph_test.cpp | 42 template < unsigned int Dims > void do_test(minstd_rand& generator) in do_test()
234 minstd_rand generator(random_seed); in main()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_strong_components_test.cpp | 78 minstd_rand gen; in test_distributed_strong_components()
87 Graph g(sorted_erdos_renyi_iterator<minstd_rand, Graph>(gen, n, _p/2), in test_distributed_strong_components()
88 sorted_erdos_renyi_iterator<minstd_rand, Graph>(), in test_distributed_strong_components()
91 Graph g(erdos_renyi_iterator<minstd_rand, Graph>(gen, n, _p/2), in test_distributed_strong_components()
92 erdos_renyi_iterator<minstd_rand, Graph>(), in test_distributed_strong_components()
127 Graph2 g2(erdos_renyi_iterator<minstd_rand, Graph>(gen, n, _p/2), in test_distributed_strong_components()
128 erdos_renyi_iterator<minstd_rand, Graph>(), in test_distributed_strong_components()
|
| D | distributed_connected_components_test.cpp | 76 minstd_rand gen; in test_distributed_connected_components()
84 minstd_rand dist_gen; in test_distributed_connected_components()
101 Graph g(sorted_unique_rmat_iterator<minstd_rand, Graph>(gen, n, m, a, b, c, d, true), in test_distributed_connected_components()
102 sorted_unique_rmat_iterator<minstd_rand, Graph>(), in test_distributed_connected_components()
148 Graph2 g2( sorted_unique_rmat_iterator<minstd_rand, Graph>(gen, n, m, a, b, c, d, true), in test_distributed_connected_components()
149 sorted_unique_rmat_iterator<minstd_rand, Graph>(), in test_distributed_connected_components()
|
| D | adjlist_build_test.cpp | 57 minstd_rand gen; in test_main()
58 minstd_rand require_response_gen; in test_main()
69 Graph g1(erdos_renyi_iterator<minstd_rand, Graph>(gen, n, p), in test_main()
70 erdos_renyi_iterator<minstd_rand, Graph>(), in test_main()
87 for (erdos_renyi_iterator<minstd_rand, Graph> first(gen, n, p), last; in test_main()
168 erdos_renyi_iterator<minstd_rand, Graph> first(gen, n, p); in test_main()
|
| D | distributed_graph_coloring_test.cpp | 49 minstd_rand gen; in test_distributed_graph_coloring()
53 Graph g(erdos_renyi_iterator<minstd_rand, Graph>(gen, n, p), in test_distributed_graph_coloring()
54 erdos_renyi_iterator<minstd_rand, Graph>(), in test_distributed_graph_coloring()
|
| D | distributed_shortest_paths_test.cpp | 175 minstd_rand gen; in test_distributed_shortest_paths()
179 Graph g(erdos_renyi_iterator<minstd_rand, Graph>(gen, n, p), in test_distributed_shortest_paths()
180 erdos_renyi_iterator<minstd_rand, Graph>(), in test_distributed_shortest_paths()
|
| D | distributed_csr_test.cpp | 90 typedef sorted_erdos_renyi_iterator<minstd_rand, Digraph> ERIter; in test_main()
95 minstd_rand gen; in test_main()
|
| D | distributed_csr_algorithm_test.cpp | 223 typedef sorted_erdos_renyi_iterator<minstd_rand, Digraph> ERIter; in test_main()
224 typedef small_world_iterator<minstd_rand, Digraph> SWIter; in test_main()
225 typedef sorted_rmat_iterator<minstd_rand, Digraph> RMATIter; in test_main()
238 minstd_rand gen; in test_main()
|
| /third_party/boost/boost/utility/detail/ |
| D | minstd_rand.hpp | 21 class minstd_rand class
31 minstd_rand(): x_( 1 ) in minstd_rand() function in boost::detail::minstd_rand
35 explicit minstd_rand( boost::uint_least32_t x ): x_( x % m ) in minstd_rand() function in boost::detail::minstd_rand
|
| /third_party/boost/libs/test/test/test-organization-ts/datasets-test/ |
| D | random-test.cpp | 89 auto ds3 = data::random(data::engine = std::minstd_rand()); in BOOST_AUTO_TEST_CASE()
96 std::minstd_rand>::value )); in BOOST_AUTO_TEST_CASE()
118 auto ds6 = data::random(( data::engine = std::minstd_rand(), in BOOST_AUTO_TEST_CASE()
127 std::minstd_rand>::value )); in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/boost/graph/ |
| D | topology.hpp | 223 template < std::size_t Dims, typename RandomNumberGenerator = minstd_rand >
309 template < typename RandomNumberGenerator = minstd_rand >
323 template < typename RandomNumberGenerator = minstd_rand >
418 template < typename RandomNumberGenerator = minstd_rand >
432 template < std::size_t Dims, typename RandomNumberGenerator = minstd_rand >
525 template < typename RandomNumberGenerator = minstd_rand >
539 template < typename RandomNumberGenerator = minstd_rand >
553 template < typename RandomNumberGenerator = minstd_rand > class heart_topology
|
| /third_party/boost/libs/random/test/ |
| D | test_uniform_int.ipp | 133 boost::minstd_rand mr;
134 boost::variate_generator<boost::minstd_rand, uint_dist> r2(mr,
141 …boost::variate_generator<boost::minstd_rand, BOOST_RANDOM_DISTRIBUTION > x(mr, BOOST_RANDOM_DISTRI…
145 …boost::variate_generator<boost::minstd_rand, BOOST_RANDOM_DISTRIBUTION > y(mr, BOOST_RANDOM_DISTRI…
|
| D | test_minstd_rand.cpp | 15 #define BOOST_RANDOM_URNG boost::random::minstd_rand
|
| /third_party/boost/libs/mpi/test/ |
| D | graph_topology_test.cpp | 66 minstd_rand gen; in BOOST_AUTO_TEST_CASE()
70 sorted_erdos_renyi_iterator<minstd_rand, Graph> in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/libs/random/doc/ |
| D | distribution_performance_windows.qbk | 2 [[\[M rn/sec\]][minstd_rand][kreutzer1986][mt19937][lagged_fibonacci607]]
|
| D | distribution_performance_linux.qbk | 2 [[\[M rn/sec\]][minstd_rand][kreutzer1986][mt19937][lagged_fibonacci607]]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/ |
| D | fast_uniform_bits_test.cc | 322 EXPECT_EQ(2147483646, RangeSize<std::minstd_rand>()); in TEST()
323 EXPECT_EQ(30, IntegerLog2(RangeSize<std::minstd_rand>())); in TEST()
325 std::minstd_rand gen(1); in TEST()
|
| /third_party/abseil-cpp/absl/random/internal/ |
| D | fast_uniform_bits_test.cc | 322 EXPECT_EQ(2147483646, RangeSize<std::minstd_rand>()); in TEST()
323 EXPECT_EQ(30, IntegerLog2(RangeSize<std::minstd_rand>())); in TEST()
325 std::minstd_rand gen(1); in TEST()
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | rmat_generator.rst | 77 typedef boost::rmat_iterator<boost::minstd_rand, Graph> RMATGen;
81 boost::minstd_rand gen;
|