Searched refs:divide (Results 1 – 4 of 4) sorted by relevance
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Divide_and_Conquer.rst | 13 Parallelize a divide and conquer algorithm.
46 There are several ways to implement divide and conquer in
64 Quicksort is a classic divide-and-conquer algorithm. It divides a
|
| H A D | Reduction.rst | 159 // Do parallel divide-and-conquer reduction
|
| /oneTBB/examples/parallel_reduce/convex_hull/ |
| H A D | convex_hull_bench.cpp | 107 point_t divide(const pointVec_t &P, pointVec_t &P_reduced, const point_t &p1, const point_t &p2) { in divide() function
127 point_t p_far = divide(P, P_reduced, p1, p2); in divide_and_conquer()
508 point_t divide(const pointVec_t &P, pointVec_t &P_reduced, const point_t &p1, const point_t &p2) { in divide() function
533 p_far = divide<SplitByCP_buf>(P, P_reduced, p1, p2); in divide_and_conquer()
536 p_far = divide<SplitByCP>(P, P_reduced, p1, p2); in divide_and_conquer()
|
| H A D | convex_hull_sample.cpp | 210 point_t divide(const pointVec_t &P, pointVec_t &P_reduced, const point_t &p1, const point_t &p2) { in divide() function
232 point_t p_far = divide(P, P_reduced, p1, p2); in divide_and_conquer()
|