forked from taskflow/taskflow
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAsyncTasking.html
More file actions
263 lines (252 loc) · 25.6 KB
/
Copy pathAsyncTasking.html
File metadata and controls
263 lines (252 loc) · 25.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<title>Cookbook » Asynchronous Tasking | 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="Cookbook.html">Cookbook</a> »</span>
Asynchronous Tasking
</h1>
<nav class="m-block m-default">
<h3>Contents</h3>
<ul>
<li><a href="#LaunchAsynchronousTasksFromAnExecutor">Launch Asynchronous Tasks from an Executor</a></li>
<li><a href="#LaunchAsynchronousTasksFromARuntime">Launch Asynchronous Tasks from a Runtime</a></li>
<li><a href="#LaunchAsynchronousTasksRecursivelyFromARuntime">Launch Asynchronous Tasks Recursively from a Runtime</a></li>
</ul>
</nav>
<p>This chapters discusses how to launch tasks asynchronously so that you can incorporate independent, dynamic parallelism in your taskflows.</p><section id="LaunchAsynchronousTasksFromAnExecutor"><h2><a href="#LaunchAsynchronousTasksFromAnExecutor">Launch Asynchronous Tasks from an Executor</a></h2><p>Taskflow's executor provides an STL-style method, <a href="classtf_1_1Executor.html#af960048056f7c6b5bc71f4f526f05df7" class="m-doc">tf::<wbr />Executor::<wbr />async</a>, that allows you to run a callable object asynchronously. This method returns a <a href="http://en.cppreference.com/w/cpp/thread/future.html" class="m-doc-external">std::<wbr />future</a> which will eventually hold the result of the function call.</p><pre class="m-code"><span class="n">std</span><span class="o">::</span><span class="n">future</span><span class="o"><</span><span class="kt">int</span><span class="o">></span><span class="w"> </span><span class="n">future</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">async</span><span class="p">([](){</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span><span class="w"> </span><span class="p">});</span>
<span class="n">assert</span><span class="p">(</span><span class="n">future</span><span class="p">.</span><span class="n">get</span><span class="p">()</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">1</span><span class="p">);</span></pre><p>If you do not need the return value or do not require a <a href="http://en.cppreference.com/w/cpp/thread/future.html" class="m-doc-external">std::<wbr />future</a> for synchronization, you should use <a href="classtf_1_1Executor.html#a0461cb2c459c9f9473c72af06af9c701" class="m-doc">tf::<wbr />Executor::<wbr />silent_async</a>. This method returns nothing and incurs less overhead than <a href="classtf_1_1Executor.html#af960048056f7c6b5bc71f4f526f05df7" class="m-doc">tf::<wbr />Executor::<wbr />async</a>, as it avoids the cost of managing a shared state for <a href="http://en.cppreference.com/w/cpp/thread/future.html" class="m-doc-external">std::<wbr />future</a>.</p><pre class="m-code"><span class="n">executor</span><span class="p">.</span><span class="n">silent_async</span><span class="p">([](){});</span></pre><p>Launching asynchronous tasks from an executor is <em>thread-safe</em> and can be invoked from multiple threads, including both worker threads inside the executor and external threads outside of it. The scheduler automatically detects the source of the submission and employs work-stealing to schedule the task efficiently, ensuring balanced workload distribution across workers.</p><pre class="m-code"><span class="n">tf</span><span class="o">::</span><span class="n">Task</span><span class="w"> </span><span class="n">my_task</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">taskflow</span><span class="p">.</span><span class="n">emplace</span><span class="p">([</span><span class="o">&</span><span class="p">](){</span>
<span class="w"> </span><span class="c1">// launch an asynchronous task from my_task</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="o">&</span><span class="p">](){</span>
<span class="w"> </span><span class="c1">// launch another asynchronous task that may be run by another worker</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="o">&</span><span class="p">](){});</span>
<span class="w"> </span><span class="p">})</span>
<span class="p">});</span>
<span class="n">executor</span><span class="p">.</span><span class="n">run</span><span class="p">(</span><span class="n">taskflow</span><span class="p">);</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="c1">// wait for all tasks to finish</span></pre><aside class="m-note m-warning"><h4>Attention</h4><p>Asynchronous tasks created from an executor do not belong to any taskflow. Their lifetime is automatically managed by the executor that created them.</p></aside></section><section id="LaunchAsynchronousTasksFromARuntime"><h2><a href="#LaunchAsynchronousTasksFromARuntime">Launch Asynchronous Tasks from a Runtime</a></h2><p>You can launch asynchronous tasks from a runtime object (<a href="classtf_1_1Runtime.html" class="m-doc">tf::<wbr />Runtime</a>) using <a href="classtf_1_1Runtime.html#a5688b13034f179c4a8b2b0ebbb215051" class="m-doc">tf::<wbr />Runtime::<wbr />async</a> or <a href="classtf_1_1Runtime.html#a0ce29efa2106c8c5a1432e4a55ab2e05" class="m-doc">tf::<wbr />Runtime::<wbr />silent_async</a>. Unlike creating asynchronous tasks from an executor, tasks created from a runtime object belong to that runtime and are implicitly joined at the end of the runtime's scope. For example, the code below creates 100 asynchronous tasks from a runtime, and these 100 tasks are guaranteed to finish before the runtime completes.</p><pre class="m-code"><span class="n">tf</span><span class="o">::</span><span class="n">Taskflow</span><span class="w"> </span><span class="n">taskflow</span><span class="p">;</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="n">std</span><span class="o">::</span><span class="n">atomic</span><span class="o"><</span><span class="kt">int</span><span class="o">></span><span class="w"> </span><span class="n">counter</span><span class="p">{</span><span class="mi">0</span><span class="p">};</span>
<span class="n">tf</span><span class="o">::</span><span class="n">Task</span><span class="w"> </span><span class="n">A</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">taskflow</span><span class="p">.</span><span class="n">emplace</span><span class="p">([</span><span class="o">&</span><span class="p">]</span><span class="w"> </span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">Runtime</span><span class="o">&</span><span class="w"> </span><span class="n">rt</span><span class="p">){</span>
<span class="w"> </span><span class="k">for</span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="o"><</span><span class="mi">100</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="n">rt</span><span class="p">.</span><span class="n">silent_async</span><span class="p">([</span><span class="o">&</span><span class="p">](){</span><span class="w"> </span><span class="o">++</span><span class="n">counter</span><span class="p">;</span><span class="w"> </span><span class="p">}));</span>
<span class="w"> </span><span class="p">}</span>
<span class="p">});</span><span class="w"> </span><span class="c1">// implicit join at the end of the runtime's scope</span>
<span class="n">tf</span><span class="o">::</span><span class="n">Task</span><span class="w"> </span><span class="n">B</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">taskflow</span><span class="p">.</span><span class="n">emplace</span><span class="p">([](){</span>
<span class="w"> </span><span class="n">assert</span><span class="p">(</span><span class="n">counter</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">100</span><span class="p">);</span>
<span class="p">});</span>
<span class="n">A</span><span class="p">.</span><span class="n">precede</span><span class="p">(</span><span class="n">B</span><span class="p">);</span>
<span class="n">executor</span><span class="p">.</span><span class="n">run</span><span class="p">(</span><span class="n">taskflow</span><span class="p">).</span><span class="n">wait</span><span class="p">();</span></pre><p>Creating asynchronous tasks from a runtime enables efficient implementation of recursive parallel algorithms, such as parallel iteration, reduction, and sorting, that require dynamic task creation at runtime.</p></section><section id="LaunchAsynchronousTasksRecursivelyFromARuntime"><h2><a href="#LaunchAsynchronousTasksRecursivelyFromARuntime">Launch Asynchronous Tasks Recursively from a Runtime</a></h2><p>Asynchronous tasks can also leverage runtime tasking, allowing them to recursively launch additional asynchronous tasks. Combined with <a href="classtf_1_1Runtime.html#aba54a7cacffb54f5eb133730d256a7c4" class="m-doc">tf::<wbr />Runtime::<wbr />corun</a>, this enables the implementation of various recursive parallelism patterns, including parallel sort, divide-and-conquer algorithms, and the <a href="https://en.wikipedia.org/wiki/Fork%E2%80%93join_model">fork-join model</a>. For instance, the example below demonstrates a parallel recursive implementation of Fibonacci numbers using recursive asynchronous tasking from <a href="classtf_1_1Runtime.html" class="m-doc">tf::<wbr />Runtime</a>:</p><pre class="m-code"><span class="cp">#include</span><span class="w"> </span><span class="cpf"><taskflow/taskflow.hpp></span>
<span class="kt">size_t</span><span class="w"> </span><span class="nf">fibonacci</span><span class="p">(</span><span class="kt">size_t</span><span class="w"> </span><span class="n">N</span><span class="p">,</span><span class="w"> </span><span class="n">tf</span><span class="o">::</span><span class="n">Runtime</span><span class="o">&</span><span class="w"> </span><span class="n">rt</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="k">if</span><span class="p">(</span><span class="n">N</span><span class="w"> </span><span class="o"><</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">N</span><span class="p">;</span><span class="w"> </span>
<span class="w"> </span><span class="kt">size_t</span><span class="w"> </span><span class="n">res1</span><span class="p">,</span><span class="w"> </span><span class="n">res2</span><span class="p">;</span>
<span class="w"> </span><span class="n">rt</span><span class="p">.</span><span class="n">silent_async</span><span class="p">([</span><span class="n">N</span><span class="p">,</span><span class="w"> </span><span class="o">&</span><span class="n">res1</span><span class="p">](</span><span class="n">tf</span><span class="o">::</span><span class="n">Runtime</span><span class="o">&</span><span class="w"> </span><span class="n">rt1</span><span class="p">){</span><span class="w"> </span><span class="n">res1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">fibonacci</span><span class="p">(</span><span class="n">N</span><span class="mi">-1</span><span class="p">,</span><span class="w"> </span><span class="n">rt1</span><span class="p">);</span><span class="w"> </span><span class="p">});</span>
<span class="w"> </span>
<span class="w"> </span><span class="c1">// tail optimization for the right child</span>
<span class="w"> </span><span class="n">res2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">fibonacci</span><span class="p">(</span><span class="n">N</span><span class="mi">-2</span><span class="p">,</span><span class="w"> </span><span class="n">rt</span><span class="p">);</span>
<span class="w"> </span><span class="c1">// use corun to avoid blocking the worker from waiting the two children tasks </span>
<span class="w"> </span><span class="c1">// to finish</span>
<span class="w"> </span><span class="n">rt</span><span class="p">.</span><span class="n">corun</span><span class="p">();</span>
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">res1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">res2</span><span class="p">;</span>
<span class="p">}</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="kt">size_t</span><span class="w"> </span><span class="n">N</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">5</span><span class="p">,</span><span class="w"> </span><span class="n">res</span><span class="p">;</span>
<span class="w"> </span><span class="n">executor</span><span class="p">.</span><span class="n">silent_async</span><span class="p">([</span><span class="n">N</span><span class="p">,</span><span class="w"> </span><span class="o">&</span><span class="n">res</span><span class="p">](</span><span class="n">tf</span><span class="o">::</span><span class="n">Runtime</span><span class="o">&</span><span class="w"> </span><span class="n">rt</span><span class="p">){</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">fibonacci</span><span class="p">(</span><span class="n">N</span><span class="p">,</span><span class="w"> </span><span class="n">rt</span><span class="p">);</span><span class="w"> </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="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="n">N</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="s">"-th Fibonacci number is "</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="sc">'\n'</span><span class="p">;</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><p>The figure below shows the execution diagram, where the suffix *_1 represent the left child spawned by its parent runtime.</p><div class="m-graph"><svg style="width: 36.800rem; height: 26.000rem;" viewBox="0.00 0.00 368.25 260.00">
<g transform="scale(1 1) rotate(0) translate(4 256)">
<title>Fibonacci</title>
<g class="m-node m-flat">
<title>F4</title>
<polygon points="234.25,-252 168,-252 168,-216 234.25,-216 234.25,-252"/>
<text text-anchor="middle" x="201.12" y="-235.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci(4)</text>
<text text-anchor="middle" x="201.12" y="-224.5" font-family="Helvetica,sans-Serif" font-size="10.00">[rt]</text>
</g>
<g class="m-node m-flat">
<title>F3_1</title>
<polygon points="192.25,-180 126,-180 126,-144 192.25,-144 192.25,-180"/>
<text text-anchor="middle" x="159.12" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci(3)</text>
<text text-anchor="middle" x="159.12" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">[rt1]</text>
</g>
<g class="m-edge">
<title>F4->F3_1</title>
<path d="M190.74,-215.7C186.06,-207.9 180.43,-198.51 175.22,-189.83"/>
<polygon points="178.31,-188.18 170.17,-181.4 172.31,-191.78 178.31,-188.18"/>
</g>
<g class="m-node m-flat">
<title>F2_2</title>
<polygon points="276.25,-180 210,-180 210,-144 276.25,-144 276.25,-180"/>
<text text-anchor="middle" x="243.12" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci(2)</text>
<text text-anchor="middle" x="243.12" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">[rt]</text>
</g>
<g class="m-edge">
<title>F4->F2_2</title>
<path d="M211.51,-215.7C216.19,-207.9 221.82,-198.51 227.03,-189.83"/>
<polygon points="229.94,-191.78 232.08,-181.4 223.94,-188.18 229.94,-191.78"/>
</g>
<g class="m-node m-flat">
<title>F2_1</title>
<polygon points="108.25,-108 42,-108 42,-72 108.25,-72 108.25,-108"/>
<text text-anchor="middle" x="75.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci(2)</text>
<text text-anchor="middle" x="75.12" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">[rt1_1]</text>
</g>
<g class="m-edge">
<title>F3_1->F2_1</title>
<path d="M138.36,-143.7C128.16,-135.2 115.7,-124.81 104.54,-115.51"/>
<polygon points="107.03,-113.03 97.1,-109.32 102.55,-118.41 107.03,-113.03"/>
</g>
<g class="m-node m-flat">
<title>F1_2</title>
<polygon points="192.25,-108 126,-108 126,-72 192.25,-72 192.25,-108"/>
<text text-anchor="middle" x="159.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci(1)</text>
<text text-anchor="middle" x="159.12" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">[rt1]</text>
</g>
<g class="m-edge">
<title>F3_1->F1_2</title>
<path d="M159.12,-143.7C159.12,-136.41 159.12,-127.73 159.12,-119.54"/>
<polygon points="162.63,-119.62 159.13,-109.62 155.63,-119.62 162.63,-119.62"/>
</g>
<g class="m-node m-flat">
<title>F1_1</title>
<polygon points="66.25,-36 0,-36 0,0 66.25,0 66.25,-36"/>
<text text-anchor="middle" x="33.12" y="-19.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci(1)</text>
<text text-anchor="middle" x="33.12" y="-8.5" font-family="Helvetica,sans-Serif" font-size="10.00">[rt1_1_1]</text>
</g>
<g class="m-edge">
<title>F2_1->F1_1</title>
<path d="M64.74,-71.7C60.06,-63.9 54.43,-54.51 49.22,-45.83"/>
<polygon points="52.31,-44.18 44.17,-37.4 46.31,-47.78 52.31,-44.18"/>
</g>
<g class="m-node m-flat">
<title>F0_1</title>
<polygon points="150.25,-36 84,-36 84,0 150.25,0 150.25,-36"/>
<text text-anchor="middle" x="117.12" y="-19.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci(0)</text>
<text text-anchor="middle" x="117.12" y="-8.5" font-family="Helvetica,sans-Serif" font-size="10.00">[rt1_1]</text>
</g>
<g class="m-edge">
<title>F2_1->F0_1</title>
<path d="M85.51,-71.7C90.19,-63.9 95.82,-54.51 101.03,-45.83"/>
<polygon points="103.94,-47.78 106.08,-37.4 97.94,-44.18 103.94,-47.78"/>
</g>
<g class="m-node m-flat">
<title>F1_3</title>
<polygon points="276.25,-108 210,-108 210,-72 276.25,-72 276.25,-108"/>
<text text-anchor="middle" x="243.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci(1)</text>
<text text-anchor="middle" x="243.12" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">[rt1]</text>
</g>
<g class="m-edge">
<title>F2_2->F1_3</title>
<path d="M243.12,-143.7C243.12,-136.41 243.12,-127.73 243.12,-119.54"/>
<polygon points="246.63,-119.62 243.13,-109.62 239.63,-119.62 246.63,-119.62"/>
</g>
<g class="m-node m-flat">
<title>F0_2</title>
<polygon points="360.25,-108 294,-108 294,-72 360.25,-72 360.25,-108"/>
<text text-anchor="middle" x="327.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci(0)</text>
<text text-anchor="middle" x="327.12" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">[rt]</text>
</g>
<g class="m-edge">
<title>F2_2->F0_2</title>
<path d="M263.89,-143.7C274.09,-135.2 286.55,-124.81 297.71,-115.51"/>
<polygon points="299.7,-118.41 305.15,-109.32 295.22,-113.03 299.7,-118.41"/>
</g>
</g>
</svg>
</div></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 or
modules. 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 or
directory.</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 can
copy 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>