Home
last modified time | relevance | path

Searched refs:random (Results 1 – 8 of 8) sorted by relevance

/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull.hpp102 point<T> GenerateRNDPoint(std::size_t& count, rng_functor_type random, std::size_t rand_max) { in GenerateRNDPoint() argument
106 T x = random() * 2.0 / (double)rand_max - 1; in GenerateRNDPoint()
107 T y = random() * 2.0 / (double)rand_max - 1; in GenerateRNDPoint()
112 if (random() / (double)rand_max > 0.5) in GenerateRNDPoint()
114 if (random() / (double)rand_max > 0.5) in GenerateRNDPoint()
/oneTBB/src/tbb/
H A Dtask_stream.h81 random_lane_selector( FastRandom& random ) : my_random( random ) {} in random_lane_selector()
H A Dtask_dispatcher.h159 execution_data_ext& ed, arena& a, unsigned arena_index, FastRandom& random, in steal_or_get_critical() argument
162 if (d1::task* t = a.steal_task(arena_index, random, ed, isolation)) { in steal_or_get_critical()
/oneTBB/examples/parallel_for/polygon_overlay/
H A DREADME.md25 … above. That is, if we need `N` polygons, then `N` "boxes" are chosen at random, then one-at-a-tim…
51 * `--seed nnn` - initial value of random number generator.
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A DREADME.md4 …t and end node in `[0..N)`. A graph is generated with `N` nodes and some random number of connecti…
/oneTBB/doc/main/tbb_userguide/
H A DCook_Until_Done_parallel_do.rst74 - The iterators can be random-access iterators.
/oneTBB/doc/main/intro/
H A DBenefits.rst71 - Provide random access
/oneTBB/test/tbb/
H A Dtest_task_arena.cpp822 HeavyMixTestBody( tbb::enumerable_thread_specific<utils::FastRandom<>>& random, in HeavyMixTestBody() argument
824 : myRandom( random ), myIsolatedLevel( isolated_level ) in HeavyMixTestBody()
854 tbb::enumerable_thread_specific<utils::FastRandom<>> random( init_random ); in HeavyMixTest() local
857 HeavyMixTestBody b( random, isolated_level, 1 ); in HeavyMixTest()