Searched refs:buffered (Results 1 – 8 of 8) sorted by relevance
| /oneTBB/examples/parallel_reduce/convex_hull/ |
| H A D | convex_hull_bench.cpp | 526 void divide_and_conquer(const pointVec_t &P, pointVec_t &H, point_t p1, point_t p2, bool buffered) { in divide_and_conquer() argument 532 if (buffered) { in divide_and_conquer() 548 divide_and_conquer(P_reduced, H1, p1, p_far, buffered); in divide_and_conquer() 549 divide_and_conquer(P_reduced, H2, p_far, p2, buffered); in divide_and_conquer() 561 void quickhull(const pointVec_t &points, pointVec_t &hull, bool buffered) { in quickhull() argument 576 divide_and_conquer(points, hull, p_maxx, p_minx, buffered); in quickhull() 577 divide_and_conquer(points, H, p_minx, p_maxx, buffered); in quickhull()
|
| H A D | README.md | 12 - `convex_hull_bench` - build version of the example that compares serial and parallel buffered and…
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | broadcast_or_send.rst | 67 In the above example, each message buffered by the priority_queue_node 73 all, nodes accept a message? Should the message be buffered until all
|
| H A D | Nodes.rst | 103 buffered in the node. When it is legal, based on concurrency limits, a 104 task will be spawned to process the next buffered message.
|
| H A D | use_concurrency_limits.rst | 77 simultaneously, three in the ``function_node`` and one buffered in the
|
| H A D | use_limiter_node.rst | 86 buffered in the ``input_node``.
|
| H A D | create_token_based_system.rst | 114 buffered in the ``input_node``, awaiting a token to be paired with.
|
| H A D | Predefined_Node_Types.rst | 27 …Otherwise, the previous output is temporarily buffered until it is accepted downstream and then th…
|