Searched refs:lambda (Results 1 – 13 of 13) sorted by relevance
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Lambda_Expressions.rst | 7 C++11 lambda expressions make the |full_name| 8 ``parallel_for`` much easier to use. A lambda expression lets 12 Below is the example from the previous section, rewritten with a lambda 13 expression. The lambda expression, replaces both the declaration and construction of function objec… 36 The [=] introduces the lambda expression. The expression creates a 38 ``a`` and ``n`` are declared outside the lambda expression, but used 43 compiler documentation says more about lambda expressions and other 45 descriptions of lambda expressions than can fit here, because lambda
|
| H A D | std_invoke.rst | 81 // Define a lambda function as the body of the parallel_for loop 92 An additional lambda function ``pfor_body`` was also required. This lambda function invoked the ``r… 165 …on_node`` in the Flow Graph required the body to be a Function Object. A lambda function was requi… 189 // Use the number_processor lambda function as the body
|
| H A D | Mapping_Nodes2Tasks.rst | 10 three calls to try_put spawn three tasks; each one applies the lambda 44 Likewise, the body tasks execute the lambda expressions and then put
|
| H A D | Nodes.rst | 45 …- User defined function object, or lambda expression, that is applied to the incoming messa… 53 invocation of the node to occur concurrently. The body is a lambda 146 The library spawns three tasks, each one applying n's lambda expression
|
| H A D | Dependence_Graph.rst | 72 function object or lambda expression. Unlike a function_node, a 130 lambda expressions and then put a continue_msg to all successor nodes,
|
| H A D | use_nested_algorithms.rst | 20 is connected to ``n1_sink``, and ``n2`` is connected to ``n2_sink``. In the lambda
|
| H A D | Cancellation_and_Nested_Parallelism.rst | 87 to the algorithm explicitly. The example uses C++11 lambda expressions for brevity.
|
| H A D | Data_Flow_Graph.rst | 117 The body is a function object, or lambda expression, that contains a
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Design_Patterns.rst | 39 For brevity, some of the code examples use C++11 lambda expressions. It 40 is straightforward, albeit sometimes tedious, to translate such lambda
|
| H A D | Non-Preemptive_Priorities.rst | 84 …The functor may be the result of a lambda expression. ``EnqueueWork`` packages ``f`` as a ``WorkIt…
|
| /oneTBB/test/conformance/ |
| H A D | conformance_input_node.cpp | 37 auto lambda = [](tbb::flow_control&) { return 42; }; in test_deduction_guides() local 41 input_node s1(g, lambda); in test_deduction_guides() 57 input_node s5(precedes(bc), lambda); in test_deduction_guides()
|
| /oneTBB/doc/main/tbb_userguide/Migration_Guide/ |
| H A D | Task_API.rst | 57 The code looks more concise now. It also enables lambda functions and does not require you to
|
| /oneTBB/test/common/ |
| H A D | doctest.h | 1903 explicit ContextScope(const L &lambda) : lambda_(lambda) {} 1904 explicit ContextScope(L&& lambda) : lambda_(static_cast<L&&>(lambda)) { } 1961 ContextScope<L> MakeContextScope(const L &lambda) { 1962 return ContextScope<L>(lambda);
|