You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.
Dismiss alert
<trclass="memdesc:a4d52a7fe2814b264846a2085e931652c"><tdclass="mdescLeft"> </td><tdclass="mdescRight">creates a task from a given callable object <ahref="#a4d52a7fe2814b264846a2085e931652c">More...</a><br/></td></tr>
<trclass="memdesc:a1f6118326ad434f6c839007a1a79fe1b"><tdclass="mdescLeft"> </td><tdclass="mdescRight">creates multiple tasks from a list of callable objects at one time <ahref="#a1f6118326ad434f6c839007a1a79fe1b">More...</a><br/></td></tr>
<trclass="memdesc:abf3da84e99b67248d6d8fdba48267caf"><tdclass="mdescLeft"> </td><tdclass="mdescRight">the same as <aclass="el" href="classtf_1_1FlowBuilder.html#a4d52a7fe2814b264846a2085e931652c" title="creates a task from a given callable object ">tf::FlowBuilder::emplace</a> (starting at 2.1.0) <br/></td></tr>
<trclass="memdesc:acf423e2775a25c2b8be4dce7dae8880a"><tdclass="mdescLeft"> </td><tdclass="mdescRight">the same as <aclass="el" href="classtf_1_1FlowBuilder.html#a4d52a7fe2814b264846a2085e931652c" title="creates a task from a given callable object ">tf::FlowBuilder::emplace</a> (starting at 2.1.0) <br/></td></tr>
<trclass="memitem:a644d7ff0f19ca155a2e7d56b1cdb3a0b"><tdclass="memTemplParams" colspan="2">template<typename I , typename C > </td></tr>
<trclass="memitem:a644d7ff0f19ca155a2e7d56b1cdb3a0b"><tdclass="memTemplItemLeft" align="right" valign="top"><aclass="elRef" doxygen="/home/tsung-wei/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< <aclass="el" href="classtf_1_1Task.html">Task</a>, <aclass="el" href="classtf_1_1Task.html">Task</a> > </td><tdclass="memTemplItemRight" valign="bottom"><aclass="el" href="classtf_1_1FlowBuilder.html#a644d7ff0f19ca155a2e7d56b1cdb3a0b">parallel_for</a> (I beg, I end, C &&callable, size_t partitions=0)</td></tr>
<trclass="memdesc:a644d7ff0f19ca155a2e7d56b1cdb3a0b"><tdclass="mdescLeft"> </td><tdclass="mdescRight">constructs a task dependency graph of range-based parallel_for <ahref="#a644d7ff0f19ca155a2e7d56b1cdb3a0b">More...</a><br/></td></tr>
<trclass="memitem:acfce9d2800a097202bdd4047f205dacf"><tdclass="memTemplParams" colspan="2">template<typename I , typename C , std::enable_if_t< std::is_arithmetic_v< I >, void > * = nullptr> </td></tr>
<trclass="memitem:acfce9d2800a097202bdd4047f205dacf"><tdclass="memTemplItemLeft" align="right" valign="top"><aclass="elRef" doxygen="/home/tsung-wei/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< <aclass="el" href="classtf_1_1Task.html">Task</a>, <aclass="el" href="classtf_1_1Task.html">Task</a> > </td><tdclass="memTemplItemRight" valign="bottom"><aclass="el" href="classtf_1_1FlowBuilder.html#acfce9d2800a097202bdd4047f205dacf">parallel_for</a> (I beg, I end, I step, C &&callable, size_t partitions=0)</td></tr>
<trclass="memdesc:acfce9d2800a097202bdd4047f205dacf"><tdclass="mdescLeft"> </td><tdclass="mdescRight">constructs a task dependency graph of index-based parallel_for <ahref="#acfce9d2800a097202bdd4047f205dacf">More...</a><br/></td></tr>
<trclass="memitem:a06b06b57f8ec8bb060951fc71dd375fb"><tdclass="memTemplParams" colspan="2">template<typename I , typename T , typename B > </td></tr>
<trclass="memitem:a06b06b57f8ec8bb060951fc71dd375fb"><tdclass="memTemplItemLeft" align="right" valign="top"><aclass="elRef" doxygen="/home/tsung-wei/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< <aclass="el" href="classtf_1_1Task.html">Task</a>, <aclass="el" href="classtf_1_1Task.html">Task</a> > </td><tdclass="memTemplItemRight" valign="bottom"><aclass="el" href="classtf_1_1FlowBuilder.html#a06b06b57f8ec8bb060951fc71dd375fb">reduce</a> (I beg, I end, T &result, B &&bop)</td></tr>
<trclass="memdesc:a06b06b57f8ec8bb060951fc71dd375fb"><tdclass="mdescLeft"> </td><tdclass="mdescRight">construct a task dependency graph of parallel reduction <ahref="#a06b06b57f8ec8bb060951fc71dd375fb">More...</a><br/></td></tr>
<trclass="memitem:ae10e34cf00f7128d23e24c524c18d970"><tdclass="memTemplParams" colspan="2">template<typename I , typename T > </td></tr>
<trclass="memitem:ae10e34cf00f7128d23e24c524c18d970"><tdclass="memTemplItemLeft" align="right" valign="top"><aclass="elRef" doxygen="/home/tsung-wei/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< <aclass="el" href="classtf_1_1Task.html">Task</a>, <aclass="el" href="classtf_1_1Task.html">Task</a> > </td><tdclass="memTemplItemRight" valign="bottom"><aclass="el" href="classtf_1_1FlowBuilder.html#ae10e34cf00f7128d23e24c524c18d970">reduce_min</a> (I beg, I end, T &result)</td></tr>
<trclass="memdesc:ae10e34cf00f7128d23e24c524c18d970"><tdclass="mdescLeft"> </td><tdclass="mdescRight">constructs a task dependency graph of parallel reduction through <ahref="https://en.cppreference.com/w/cpp/algorithm/min">std::min</a><ahref="#ae10e34cf00f7128d23e24c524c18d970">More...</a><br/></td></tr>
<trclass="memitem:a076fa5b55e0ef6eba3c962e85727f218"><tdclass="memTemplParams" colspan="2">template<typename I , typename T > </td></tr>
<trclass="memitem:a076fa5b55e0ef6eba3c962e85727f218"><tdclass="memTemplItemLeft" align="right" valign="top"><aclass="elRef" doxygen="/home/tsung-wei/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< <aclass="el" href="classtf_1_1Task.html">Task</a>, <aclass="el" href="classtf_1_1Task.html">Task</a> > </td><tdclass="memTemplItemRight" valign="bottom"><aclass="el" href="classtf_1_1FlowBuilder.html#a076fa5b55e0ef6eba3c962e85727f218">reduce_max</a> (I beg, I end, T &result)</td></tr>
<trclass="memdesc:a076fa5b55e0ef6eba3c962e85727f218"><tdclass="mdescLeft"> </td><tdclass="mdescRight">constructs a task dependency graph of parallel reduction through <ahref="https://en.cppreference.com/w/cpp/algorithm/max">std::max</a><ahref="#a076fa5b55e0ef6eba3c962e85727f218">More...</a><br/></td></tr>
<trclass="memitem:a08d669f2286cb90fd5ba7dade1e93fef"><tdclass="memTemplParams" colspan="2">template<typename I , typename T , typename B , typename U > </td></tr>
<trclass="memitem:a08d669f2286cb90fd5ba7dade1e93fef"><tdclass="memTemplItemLeft" align="right" valign="top"><aclass="elRef" doxygen="/home/tsung-wei/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< <aclass="el" href="classtf_1_1Task.html">Task</a>, <aclass="el" href="classtf_1_1Task.html">Task</a> > </td><tdclass="memTemplItemRight" valign="bottom"><aclass="el" href="classtf_1_1FlowBuilder.html#a08d669f2286cb90fd5ba7dade1e93fef">transform_reduce</a> (I beg, I end, T &result, B &&bop, U &&uop)</td></tr>
<trclass="memdesc:a08d669f2286cb90fd5ba7dade1e93fef"><tdclass="mdescLeft"> </td><tdclass="mdescRight">constructs a task dependency graph of parallel transformation and reduction <ahref="#a08d669f2286cb90fd5ba7dade1e93fef">More...</a><br/></td></tr>
<trclass="memitem:a9b81ad3b206a63adff8b8bc423f8c425"><tdclass="memTemplParams" colspan="2">template<typename I , typename T , typename B , typename P , typename U > </td></tr>
<trclass="memitem:a9b81ad3b206a63adff8b8bc423f8c425"><tdclass="memTemplItemLeft" align="right" valign="top"><aclass="elRef" doxygen="/home/tsung-wei/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< <aclass="el" href="classtf_1_1Task.html">Task</a>, <aclass="el" href="classtf_1_1Task.html">Task</a> > </td><tdclass="memTemplItemRight" valign="bottom"><aclass="el" href="classtf_1_1FlowBuilder.html#a9b81ad3b206a63adff8b8bc423f8c425">transform_reduce</a> (I beg, I end, T &result, B &&bop1, P &&bop2, U &&uop)</td></tr>
<trclass="memdesc:a9b81ad3b206a63adff8b8bc423f8c425"><tdclass="mdescLeft"> </td><tdclass="mdescRight">constructs a task dependency graph of parallel transformation and reduction <ahref="#a9b81ad3b206a63adff8b8bc423f8c425">More...</a><br/></td></tr>
<trclass="memdesc:acab0b4ac82260f47fdb36a3244ee3aaf"><tdclass="mdescLeft"> </td><tdclass="mdescRight">creates an empty task <ahref="#acab0b4ac82260f47fdb36a3244ee3aaf">More...</a><br/></td></tr>
<trclass="memdesc:af7c4a5d732d49bd63d554a92cd240f3f"><tdclass="mdescLeft"> </td><tdclass="mdescRight">adds a dependency link from task A to task B <ahref="#af7c4a5d732d49bd63d554a92cd240f3f">More...</a><br/></td></tr>
<trclass="memdesc:a90f3d9b9d6fcf4df8e7d7878dfdd130d"><tdclass="mdescLeft"> </td><tdclass="mdescRight">adds adjacent dependency links to a linear list of tasks <ahref="#a90f3d9b9d6fcf4df8e7d7878dfdd130d">More...</a><br/></td></tr>
<trclass="memdesc:a4ec89b554d15ad5fb96f4fdb10dbbb16"><tdclass="mdescLeft"> </td><tdclass="mdescRight">adds adjacent dependency links to a linear list of tasks <ahref="#a4ec89b554d15ad5fb96f4fdb10dbbb16">More...</a><br/></td></tr>
<trclass="memdesc:a3be7d982efad780eb6adbd1cf11a3d97"><tdclass="mdescLeft"> </td><tdclass="mdescRight">adds dependency links from one task A to many tasks <ahref="#a3be7d982efad780eb6adbd1cf11a3d97">More...</a><br/></td></tr>
<trclass="memdesc:add973c333ea0d51dcefd5ebaef71cff8"><tdclass="mdescLeft"> </td><tdclass="mdescRight">adds dependency links from one task A to many tasks <ahref="#add973c333ea0d51dcefd5ebaef71cff8">More...</a><br/></td></tr>
<trclass="memdesc:a8871a9277dad477a69fb3a323d9c7bdb"><tdclass="mdescLeft"> </td><tdclass="mdescRight">adds dependency links from many tasks to one task A <ahref="#a8871a9277dad477a69fb3a323d9c7bdb">More...</a><br/></td></tr>
<trclass="memdesc:ae62feb52131f930695357dca68ea2acb"><tdclass="mdescLeft"> </td><tdclass="mdescRight">adds dependency links from many tasks to one task A <ahref="#ae62feb52131f930695357dca68ea2acb">More...</a><br/></td></tr>
<tr><tdclass="paramname">callable</td><td>a callable object acceptable to <aclass="elRef" doxygen="/home/tsung-wei/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd><aclass="el" href="classtf_1_1Task.html" title="Handle to modify and access a task. ">Task</a> handle </dd></dl>
<tr><tdclass="paramname">callables</td><td>one or multiple callable objects acceptable to <aclass="elRef" doxygen="/home/tsung-wei/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd>a <aclass="el" href="classtf_1_1Task.html" title="Handle to modify and access a task. ">Task</a> handle </dd></dl>
<tr><tdclass="paramname">beg</td><td>iterator to the beginning (inclusive) </td></tr>
<tr><tdclass="paramname">end</td><td>iterator to the end (exclusive) </td></tr>
<tr><tdclass="paramname">callable</td><td>a callable object to be applied to </td></tr>
<tr><tdclass="paramname">partitions</td><td>number of partitions</td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd>a pair of <aclass="el" href="classtf_1_1Task.html" title="Handle to modify and access a task. ">Task</a> handles to the beginning and the end of the graph </dd></dl>
<tr><tdclass="paramname">callable</td><td>a callable object to be applied to </td></tr>
<tr><tdclass="paramname">partitions</td><td>number of partitions</td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd>a pair of <aclass="el" href="classtf_1_1Task.html" title="Handle to modify and access a task. ">Task</a> handles to the beginning and the end of the graph </dd></dl>
<dlclass="section return"><dt>Returns</dt><dd>a <aclass="el" href="classtf_1_1Task.html" title="Handle to modify and access a task. ">Task</a> handle </dd></dl>
<tr><tdclass="paramname">beg</td><td>iterator to the beginning (inclusive) </td></tr>
<tr><tdclass="paramname">end</td><td>iterator to the end (exclusive) </td></tr>
<tr><tdclass="paramname">result</td><td>reference variable to store the final result </td></tr>
<tr><tdclass="paramname">bop</td><td>binary operator that will be applied in unspecified order to the result of dereferencing the input iterator</td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd>a pair of <aclass="el" href="classtf_1_1Task.html" title="Handle to modify and access a task. ">Task</a> handles to the beginning and the end of the graph </dd></dl>
<p>constructs a task dependency graph of parallel reduction through <ahref="https://en.cppreference.com/w/cpp/algorithm/max">std::max</a></p>
<p>The task dependency graph applies a parallel reduction to find the maximum item in the range [beg, end) through <ahref="https://en.cppreference.com/w/cpp/algorithm/max">std::max</a> reduction.</p>
<tr><tdclass="paramname">beg</td><td>iterator to the beginning (inclusive) </td></tr>
<tr><tdclass="paramname">end</td><td>iterator to the end (exclusive) </td></tr>
<tr><tdclass="paramname">result</td><td>reference variable to store the final result</td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd>a pair of <aclass="el" href="classtf_1_1Task.html" title="Handle to modify and access a task. ">Task</a> handles to the beginning and the end of the graph </dd></dl>
<p>constructs a task dependency graph of parallel reduction through <ahref="https://en.cppreference.com/w/cpp/algorithm/min">std::min</a></p>
<p>The task dependency graph applies a parallel reduction to find the minimum item in the range [beg, end) through <ahref="https://en.cppreference.com/w/cpp/algorithm/min">std::min</a> reduction.</p>
<tr><tdclass="paramname">beg</td><td>iterator to the beginning (inclusive) </td></tr>
<tr><tdclass="paramname">end</td><td>iterator to the end (exclusive) </td></tr>
<tr><tdclass="paramname">result</td><td>reference variable to store the final result</td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd>a pair of <aclass="el" href="classtf_1_1Task.html" title="Handle to modify and access a task. ">Task</a> handles to the beginning and the end of the graph </dd></dl>
<tr><tdclass="paramname">beg</td><td>iterator to the beginning (inclusive) </td></tr>
<tr><tdclass="paramname">end</td><td>iterator to the end (exclusive) </td></tr>
<tr><tdclass="paramname">result</td><td>reference variable to store the final result </td></tr>
<tr><tdclass="paramname">bop</td><td>binary function object that will be applied in unspecified order to the results of <code>uop</code>; the return type must be <code>T</code></td></tr>
<tr><tdclass="paramname">uop</td><td>unary function object that transforms each element in the input range; the return type must be acceptable as input to <code>bop</code></td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd>a pair of <aclass="el" href="classtf_1_1Task.html" title="Handle to modify and access a task. ">Task</a> handles to the beginning and the end of the graph </dd></dl>