同步操作将从 Gitee 极速下载/cpp-taskflow 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
<!DOCTYPE html><html lang="en"><head><meta charset="UTF-8" /><title>Taskflow Algorithms » Module Algorithm | Taskflow QuickStart</title><link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Source+Sans+Pro:400,400i,600,600i%7CSource+Code+Pro:400,400i,600" /><link rel="stylesheet" href="m-dark+documentation.compiled.css" /><link rel="icon" href="favicon.ico" type="image/x-icon" /><meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="theme-color" content="#22272e" /></head><body><header><nav id="navigation"><div class="m-container"><div class="m-row"><span id="m-navbar-brand" class="m-col-t-8 m-col-m-none m-left-m"><a href="https://taskflow.github.io"><img src="taskflow_logo.png" alt="" />Taskflow</a> <span class="m-breadcrumb">|</span> <a href="index.html" class="m-thin">QuickStart</a></span><div class="m-col-t-4 m-hide-m m-text-right m-nopadr"><a href="#search" class="m-doc-search-icon" title="Search" onclick="return showSearch()"><svg style="height: 0.9rem;" viewBox="0 0 16 16"><path id="m-doc-search-icon-path" d="m6 0c-3.31 0-6 2.69-6 6 0 3.31 2.69 6 6 6 1.49 0 2.85-0.541 3.89-1.44-0.0164 0.338 0.147 0.759 0.5 1.15l3.22 3.79c0.552 0.614 1.45 0.665 2 0.115 0.55-0.55 0.499-1.45-0.115-2l-3.79-3.22c-0.392-0.353-0.812-0.515-1.15-0.5 0.895-1.05 1.44-2.41 1.44-3.89 0-3.31-2.69-6-6-6zm0 1.56a4.44 4.44 0 0 1 4.44 4.44 4.44 4.44 0 0 1-4.44 4.44 4.44 4.44 0 0 1-4.44-4.44 4.44 4.44 0 0 1 4.44-4.44z"/></svg></a><a id="m-navbar-show" href="#navigation" title="Show navigation"></a><a id="m-navbar-hide" href="#" title="Hide navigation"></a></div><div id="m-navbar-collapse" class="m-col-t-12 m-show-m m-col-m-none m-right-m"><div class="m-row"><ol class="m-col-t-6 m-col-m-none"><li><a href="pages.html">Handbook</a></li><li><a href="namespaces.html">Namespaces</a></li></ol><ol class="m-col-t-6 m-col-m-none" start="3"><li><a href="annotated.html">Classes</a></li><li><a href="files.html">Files</a></li><li class="m-show-m"><a href="#search" class="m-doc-search-icon" title="Search" onclick="return showSearch()"><svg style="height: 0.9rem;" viewBox="0 0 16 16"><use href="#m-doc-search-icon-path" /></svg></a></li></ol></div></div></div></div></nav></header><main><article><div class="m-container m-container-inflatable"><div class="m-row"><div class="m-col-l-10 m-push-l-1"><h1><span class="m-breadcrumb"><a href="Algorithms.html">Taskflow Algorithms</a> »</span>Module Algorithm</h1><nav class="m-block m-default"><h3>Contents</h3><ul><li><a href="#ModuleAlgorithmInclude">Include the Header</a></li><li><a href="#WhatIsAModuleTask">What is a Module Task</a></li><li><a href="#CreateAModuleTaskOverACustomGraph">Create a Module Task over a Custom Graph</a></li></ul></nav><p>Taskflow provides template methods that let users create reusable building blocks called <em>modules</em>. Users can connect modules together to build more complex parallel algorithms.</p><section id="ModuleAlgorithmInclude"><h2><a href="#ModuleAlgorithmInclude">Include the Header</a></h2><p>You need to include the header file, <code><a href="module_8hpp_source.html" class="m-doc">taskflow/<wbr />algorithm/<wbr />module.hpp</a></code>, for creating a module task over a schedulable graph target.</p><pre class="m-code"><span class="cp">#include</span><span class="w"> </span><span class="cpf"><taskflow/algorithm/module.hpp></span></pre></section><section id="WhatIsAModuleTask"><h2><a href="#WhatIsAModuleTask">What is a Module Task</a></h2><p>Similar to <a href="ComposableTasking.html" class="m-doc">Composable Tasking</a>, but in a more general setting, the template function <a href="namespacetf.html#ad13f8d0b6628d895792570515497139c" class="m-doc">tf::<wbr />make_module_task</a> allows you to create a task over a <a href="classtf_1_1Taskflow.html" class="m-doc">Taskflow</a> graph that can be executed by an executor. This provides a flexible mechanism to encapsulate and reuse complex task logic within your Taskflow applications. The following example demonstrates how to create and launch multiple <a href="classtf_1_1Taskflow.html" class="m-doc">Taskflow</a> graphs in parallel using asynchronous tasking:</p><pre class="m-code"><span class="cp">#include</span><span class="w"> </span><span class="cpf"><taskflow/taskflow.hpp></span><span class="cp">#include</span><span class="w"> </span><span class="cpf"><taskflow/algorithm/module.hpp></span><span class="kt">int</span><span class="w"> </span><span class="nf">main</span><span class="p">()</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">tf</span><span class="o">::</span><span class="n">Executor</span><span class="w"> </span><span class="n">executor</span><span class="p">;</span><span class="w"> </span><span class="w"> </span><span class="n">tf</span><span class="o">::</span><span class="n">Taskflow</span><span class="w"> </span><span class="n">A</span><span class="p">;</span><span class="w"> </span><span class="n">tf</span><span class="o">::</span><span class="n">Taskflow</span><span class="w"> </span><span class="n">B</span><span class="p">;</span><span class="w"> </span><span class="n">tf</span><span class="o">::</span><span class="n">Taskflow</span><span class="w"> </span><span class="n">C</span><span class="p">;</span><span class="w"> </span><span class="n">tf</span><span class="o">::</span><span class="n">Taskflow</span><span class="w"> </span><span class="n">D</span><span class="p">;</span><span class="w"> </span><span class="w"> </span><span class="n">A</span><span class="p">.</span><span class="n">emplace</span><span class="p">([](){</span><span class="w"> </span><span class="n">printf</span><span class="p">(</span><span class="s">"Taskflow A</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span><span class="w"> </span><span class="p">});</span><span class="w"> </span><span class="w"> </span><span class="n">B</span><span class="p">.</span><span class="n">emplace</span><span class="p">([](){</span><span class="w"> </span><span class="n">printf</span><span class="p">(</span><span class="s">"Taskflow B</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span><span class="w"> </span><span class="p">});</span><span class="w"> </span><span class="w"> </span><span class="n">C</span><span class="p">.</span><span class="n">emplace</span><span class="p">([](){</span><span class="w"> </span><span class="n">printf</span><span class="p">(</span><span class="s">"Taskflow C</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span><span class="w"> </span><span class="p">});</span><span class="w"> </span><span class="w"> </span><span class="n">D</span><span class="p">.</span><span class="n">emplace</span><span class="p">([](){</span><span class="w"> </span><span class="n">printf</span><span class="p">(</span><span class="s">"Taskflow D</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span><span class="w"> </span><span class="p">});</span><span class="w"> </span><span class="w"> </span><span class="w"> </span><span class="c1">// launch the four taskflows using asynchronous tasking</span><span class="w"> </span><span class="n">executor</span><span class="p">.</span><span class="n">async</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">make_module_task</span><span class="p">(</span><span class="n">A</span><span class="p">));</span><span class="w"> </span><span class="n">executor</span><span class="p">.</span><span class="n">async</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">make_module_task</span><span class="p">(</span><span class="n">B</span><span class="p">));</span><span class="w"> </span><span class="n">executor</span><span class="p">.</span><span class="n">async</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">make_module_task</span><span class="p">(</span><span class="n">C</span><span class="p">));</span><span class="w"> </span><span class="n">executor</span><span class="p">.</span><span class="n">async</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">make_module_task</span><span class="p">(</span><span class="n">D</span><span class="p">));</span><span class="w"> </span><span class="n">executor</span><span class="p">.</span><span class="n">wait_for_all</span><span class="p">();</span><span class="w"> </span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="p">}</span></pre><div class="m-graph"><svg style="width: 27.800rem; height: 4.400rem;" viewBox="0.00 0.00 278.00 44.00"><g transform="scale(1 1) rotate(0) translate(4 40)"><title>Taskflow</title><g class="m-node m-flat"><title>A</title><ellipse cx="27" cy="-18" rx="27" ry="18"/><text text-anchor="middle" x="27" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">A</text></g><g class="m-node m-flat"><title>B</title><ellipse cx="99" cy="-18" rx="27" ry="18"/><text text-anchor="middle" x="99" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">B</text></g><g class="m-node m-flat"><title>C</title><ellipse cx="171" cy="-18" rx="27" ry="18"/><text text-anchor="middle" x="171" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">C</text></g><g class="m-node m-flat"><title>D</title><ellipse cx="243" cy="-18" rx="27" ry="18"/><text text-anchor="middle" x="243" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">D</text></g></g></svg></div><p>Since the four taskflows are launched asynchronously without any dependencies between them, we can observe any order of the output message:</p><pre class="m-code"><span class="c1"># one possible output</span>Taskflow<span class="w"> </span>BTaskflow<span class="w"> </span>CTaskflow<span class="w"> </span>ATaskflow<span class="w"> </span>D<span class="c1"># another possible output</span>Taskflow<span class="w"> </span>DTaskflow<span class="w"> </span>ATaskflow<span class="w"> </span>BTaskflow<span class="w"> </span>C</pre><p>If you need to enforce dependencies among these four taskflows, you can use dependent-async tasks. The example below launches the four taskflows one by one in sequential:</p><pre class="m-code"><span class="n">tf</span><span class="o">::</span><span class="n">Executor</span><span class="w"> </span><span class="n">executor</span><span class="p">;</span><span class="n">tf</span><span class="o">::</span><span class="n">Taskflow</span><span class="w"> </span><span class="n">A</span><span class="p">;</span><span class="n">tf</span><span class="o">::</span><span class="n">Taskflow</span><span class="w"> </span><span class="n">B</span><span class="p">;</span><span class="n">tf</span><span class="o">::</span><span class="n">Taskflow</span><span class="w"> </span><span class="n">C</span><span class="p">;</span><span class="n">tf</span><span class="o">::</span><span class="n">Taskflow</span><span class="w"> </span><span class="n">D</span><span class="p">;</span><span class="n">A</span><span class="p">.</span><span class="n">emplace</span><span class="p">([](){</span><span class="w"> </span><span class="n">printf</span><span class="p">(</span><span class="s">"Taskflow A</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span><span class="w"> </span><span class="p">});</span><span class="w"> </span><span class="n">B</span><span class="p">.</span><span class="n">emplace</span><span class="p">([](){</span><span class="w"> </span><span class="n">printf</span><span class="p">(</span><span class="s">"Taskflow B</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span><span class="w"> </span><span class="p">});</span><span class="w"> </span><span class="n">C</span><span class="p">.</span><span class="n">emplace</span><span class="p">([](){</span><span class="w"> </span><span class="n">printf</span><span class="p">(</span><span class="s">"Taskflow C</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span><span class="w"> </span><span class="p">});</span><span class="w"> </span><span class="n">D</span><span class="p">.</span><span class="n">emplace</span><span class="p">([](){</span><span class="w"> </span><span class="n">printf</span><span class="p">(</span><span class="s">"Taskflow D</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span><span class="w"> </span><span class="p">});</span><span class="w"> </span><span class="k">auto</span><span class="w"> </span><span class="n">TA</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">executor</span><span class="p">.</span><span class="n">silent_dependent_async</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">make_module_task</span><span class="p">(</span><span class="n">A</span><span class="p">));</span><span class="k">auto</span><span class="w"> </span><span class="n">TB</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">executor</span><span class="p">.</span><span class="n">silent_dependent_async</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">make_module_task</span><span class="p">(</span><span class="n">B</span><span class="p">),</span><span class="w"> </span><span class="n">TA</span><span class="p">);</span><span class="k">auto</span><span class="w"> </span><span class="n">TC</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">executor</span><span class="p">.</span><span class="n">silent_dependent_async</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">make_module_task</span><span class="p">(</span><span class="n">C</span><span class="p">),</span><span class="w"> </span><span class="n">TB</span><span class="p">);</span><span class="k">auto</span><span class="w"> </span><span class="p">[</span><span class="n">TD</span><span class="p">,</span><span class="w"> </span><span class="n">FD</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">executor</span><span class="p">.</span><span class="n">dependent_async</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">make_module_task</span><span class="p">(</span><span class="n">D</span><span class="p">),</span><span class="w"> </span><span class="n">TC</span><span class="p">);</span><span class="n">FD</span><span class="p">.</span><span class="n">get</span><span class="p">();</span></pre><div class="m-graph"><svg style="width: 33.200rem; height: 4.400rem;" viewBox="0.00 0.00 332.00 44.00"><g transform="scale(1 1) rotate(0) translate(4 40)"><title>Taskflow</title><g class="m-node m-flat"><title>A</title><ellipse cx="27" cy="-18" rx="27" ry="18"/><text text-anchor="middle" x="27" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">A</text></g><g class="m-node m-flat"><title>B</title><ellipse cx="117" cy="-18" rx="27" ry="18"/><text text-anchor="middle" x="117" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">B</text></g><g class="m-edge"><title>A->B</title><path d="M54.4,-18C61.89,-18 70.18,-18 78.2,-18"/><polygon points="78.1,-21.5 88.1,-18 78.1,-14.5 78.1,-21.5"/></g><g class="m-node m-flat"><title>C</title><ellipse cx="207" cy="-18" rx="27" ry="18"/><text text-anchor="middle" x="207" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">C</text></g><g class="m-edge"><title>B->C</title><path d="M144.4,-18C151.89,-18 160.18,-18 168.2,-18"/><polygon points="168.1,-21.5 178.1,-18 168.1,-14.5 168.1,-21.5"/></g><g class="m-node m-flat"><title>D</title><ellipse cx="297" cy="-18" rx="27" ry="18"/><text text-anchor="middle" x="297" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">D</text></g><g class="m-edge"><title>C->D</title><path d="M234.4,-18C241.89,-18 250.18,-18 258.2,-18"/><polygon points="258.1,-21.5 268.1,-18 258.1,-14.5 258.1,-21.5"/></g></g></svg></div><pre class="m-code"><span class="c1"># dependent-async tasks enforce a sequential execution of the four taskflows</span>Taskflow<span class="w"> </span>ATaskflow<span class="w"> </span>BTaskflow<span class="w"> </span>CTaskflow<span class="w"> </span>D</pre><p>The module task maker, <a href="namespacetf.html#ad13f8d0b6628d895792570515497139c" class="m-doc">tf::<wbr />make_module_task</a>, operates similarly to <a href="classtf_1_1FlowBuilder.html#ac6f22228d4c2ea2e643c4b0d42c0e92a" class="m-doc">tf::<wbr />Taskflow::<wbr />composed_of</a>, but provides a more general interface that can be used beyond Taskflow. Specifically, the following two approaches achieve equivalent functionality:</p><pre class="m-code"><span class="c1">// approach 1: composition using composed_of</span><span class="n">tf</span><span class="o">::</span><span class="n">Task</span><span class="w"> </span><span class="n">m1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">taskflow1</span><span class="p">.</span><span class="n">composed_of</span><span class="p">(</span><span class="n">taskflow2</span><span class="p">);</span><span class="c1">// approach 2: composition using make_module_task</span><span class="n">tf</span><span class="o">::</span><span class="n">Task</span><span class="w"> </span><span class="n">m1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">taskflow1</span><span class="p">.</span><span class="n">emplace</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">make_module_task</span><span class="p">(</span><span class="n">taskflow2</span><span class="p">));</span></pre><aside class="m-note m-warning"><h4>Attention</h4><p>Similar to <a href="classtf_1_1FlowBuilder.html#ac6f22228d4c2ea2e643c4b0d42c0e92a" class="m-doc">tf::<wbr />Taskflow::<wbr />composed_of</a>, <a href="namespacetf.html#ad13f8d0b6628d895792570515497139c" class="m-doc">tf::<wbr />make_module_task</a> does not assume ownership of the provided taskflow but a soft reference. You are responsible for ensuring that the encapsulated taskflow remains valid throughout its execution.</p></aside></section><section id="CreateAModuleTaskOverACustomGraph"><h2><a href="#CreateAModuleTaskOverACustomGraph">Create a Module Task over a Custom Graph</a></h2><p>In addition to encapsulate taskflow graphs, you can create a module task to schedule a custom graph target. A schedulable target (of type <code>T</code>) must define the method <code>T::graph()</code> that returns a reference to the <a href="classtf_1_1Graph.html" class="m-doc">tf::<wbr />Graph</a> object managed by <code>T</code>. The following example defines a custom graph that can be scheduled through making module tasks:</p><pre class="m-code"><span class="k">struct</span><span class="w"> </span><span class="nc">CustomGraph</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">tf</span><span class="o">::</span><span class="n">Graph</span><span class="w"> </span><span class="n">graph</span><span class="p">;</span><span class="w"> </span><span class="n">CustomGraph</span><span class="p">()</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="c1">// use flow builder to inherit all task creation methods in tf::Taskflow</span><span class="w"> </span><span class="n">tf</span><span class="o">::</span><span class="n">FlowBuilder</span><span class="w"> </span><span class="nf">builder</span><span class="p">(</span><span class="n">graph</span><span class="p">);</span><span class="w"> </span><span class="n">tf</span><span class="o">::</span><span class="n">Task</span><span class="w"> </span><span class="n">task</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">builder</span><span class="p">.</span><span class="n">emplace</span><span class="p">([](){</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">cout</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="s">"a task</span><span class="se">\n</span><span class="s">"</span><span class="p">;</span><span class="w"> </span><span class="c1">// static task</span><span class="w"> </span><span class="p">});</span><span class="w"> </span><span class="p">}</span><span class="w"> </span><span class="c1">// returns a reference to the graph for taskflow composition</span><span class="w"> </span><span class="n">Graph</span><span class="o">&</span><span class="w"> </span><span class="n">graph</span><span class="p">()</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">graph</span><span class="p">;</span><span class="w"> </span><span class="p">}</span><span class="p">};</span><span class="n">CustomGraph</span><span class="w"> </span><span class="n">target</span><span class="p">;</span><span class="n">executor</span><span class="p">.</span><span class="n">async</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">make_module_task</span><span class="p">(</span><span class="n">target</span><span class="p">));</span></pre><aside class="m-note m-warning"><h4>Attention</h4><p>Users are responsible for ensuring the given custom graph remains valid throughout its execution. The executor does not assume ownership of the custom graph.</p></aside></section></div></div></div></article></main><div class="m-doc-search" id="search"><a href="#!" onclick="return hideSearch()"></a><div class="m-container"><div class="m-row"><div class="m-col-m-8 m-push-m-2"><div class="m-doc-search-header m-text m-small"><div><span class="m-label m-default">Tab</span> / <span class="m-label m-default">T</span> to search, <span class="m-label m-default">Esc</span> to close</div><div id="search-symbolcount">…</div></div><div class="m-doc-search-content"><form><input type="search" name="q" id="search-input" placeholder="Loading …" disabled="disabled" autofocus="autofocus" autocomplete="off" spellcheck="false" /></form><noscript class="m-text m-danger m-text-center">Unlike everything else in the docs, the search functionality <em>requires</em> JavaScript.</noscript><div id="search-help" class="m-text m-dim m-text-center"><p class="m-noindent">Search for symbols, directories, files, pages ormodules. You can omit any prefix from the symbol or file path; adding a<code>:</code> or <code>/</code> suffix lists all members of given symbol ordirectory.</p><p class="m-noindent">Use <span class="m-label m-dim">↓</span>/ <span class="m-label m-dim">↑</span> to navigate through the list,<span class="m-label m-dim">Enter</span> to go.<span class="m-label m-dim">Tab</span> autocompletes common prefix, you cancopy a link to the result using <span class="m-label m-dim">⌘</span><span class="m-label m-dim">L</span> while <span class="m-label m-dim">⌘</span><span class="m-label m-dim">M</span> produces a Markdown link.</p></div><div id="search-notfound" class="m-text m-warning m-text-center">Sorry, nothing was found.</div><ul id="search-results"></ul></div></div></div></div></div><script src="search-v2.js"></script><script src="searchdata-v2.js" async="async"></script><footer><nav><div class="m-container"><div class="m-row"><div class="m-col-l-10 m-push-l-1"><p>Taskflow handbook is part of the <a href="https://taskflow.github.io">Taskflow project</a>, copyright © <a href="https://tsung-wei-huang.github.io/">Dr. Tsung-Wei Huang</a>, 2018–2025.<br />Generated by <a href="https://doxygen.org/">Doxygen</a> 1.12.0 and <a href="https://mcss.mosra.cz/">m.css</a>.</p></div></div></div></nav></footer></body></html>
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。