forked from taskflow/taskflow
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathclasstf_1_1TaskQueue.html
More file actions
328 lines (327 loc) · 24.3 KB
/
Copy pathclasstf_1_1TaskQueue.html
File metadata and controls
328 lines (327 loc) · 24.3 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
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<title>tf::TaskQueue class | 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/vnd.microsoft.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>
<div class="m-doc-template">template<typename T, unsigned TF_MAX_PRIORITY = static_cast<unsigned>(<a href="namespacetf.html#ac9f4add8f716ed323b0bdbbc1d89346fa26a4b44a837bf97b972628509912b4a5" class="m-doc">TaskPriority::<wbr />MAX</a>)></div>
<span class="m-breadcrumb"><a href="namespacetf.html">tf</a>::<wbr/></span>TaskQueue <span class="m-thin">class</span>
</h1>
<p>class to create a lock-free unbounded single-producer multiple-consumer queue</p>
<table class="m-table m-fullwidth m-flat">
<thead>
<tr><th colspan="2">Template parameters</th></tr>
</thead>
<tbody>
<tr>
<td style="width: 1%">T</td>
<td>data type (must be a pointer type)</td>
</tr>
<tr>
<td>TF_MAX_PRIORITY</td>
<td>maximum level of the priority</td>
</tr>
</tbody>
</table>
<nav class="m-block m-default">
<h3>Contents</h3>
<ul>
<li>
Reference
<ul>
<li><a href="#typeless-methods">Constructors, destructors, conversion operators</a></li>
<li><a href="#pub-methods">Public functions</a></li>
</ul>
</li>
</ul>
</nav>
<p>This class implements the work-stealing queue described in the paper, <a href="https://www.di.ens.fr/~zappa/readings/ppopp13.pdf">Correct and Efficient Work-Stealing for Weak Memory Models</a>, and extends it to include priority.</p><p>Only the queue owner can perform pop and push operations, while others can steal data from the queue simultaneously. Priority starts from zero (highest priority) to the template value <code>TF_MAX_PRIORITY-1</code> (lowest priority). All operations are associated with priority values to indicate the corresponding queues to which an operation is applied.</p><p>The default template value, <code>TF_MAX_PRIORITY</code>, is <code><a href="namespacetf.html#ac9f4add8f716ed323b0bdbbc1d89346fa26a4b44a837bf97b972628509912b4a5" class="m-doc">TaskPriority::<wbr />MAX</a></code> which applies only three priority levels to the task queue.</p><pre class="m-code"><span class="k">auto</span><span class="w"> </span><span class="p">[</span><span class="n">A</span><span class="p">,</span><span class="w"> </span><span class="n">B</span><span class="p">,</span><span class="w"> </span><span class="n">C</span><span class="p">,</span><span class="w"> </span><span class="n">D</span><span class="p">,</span><span class="w"> </span><span class="n">E</span><span class="p">]</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="w"> </span><span class="p">[]</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">},</span><span class="w"></span>
<span class="w"> </span><span class="p">[</span><span class="o">&</span><span class="p">]</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">{</span><span class="w"> </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">"Task B: "</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n">counter</span><span class="o">++</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="c1">// 0</span>
<span class="w"> </span><span class="p">},</span><span class="w"></span>
<span class="w"> </span><span class="p">[</span><span class="o">&</span><span class="p">]</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">{</span><span class="w"> </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">"Task C: "</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n">counter</span><span class="o">++</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="c1">// 2</span>
<span class="w"> </span><span class="p">},</span><span class="w"></span>
<span class="w"> </span><span class="p">[</span><span class="o">&</span><span class="p">]</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">{</span><span class="w"> </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">"Task D: "</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n">counter</span><span class="o">++</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="c1">// 1</span>
<span class="w"> </span><span class="p">},</span><span class="w"></span>
<span class="w"> </span><span class="p">[]</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
<span class="p">);</span><span class="w"></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="w"> </span><span class="n">C</span><span class="p">,</span><span class="w"> </span><span class="n">D</span><span class="p">);</span><span class="w"> </span>
<span class="n">E</span><span class="p">.</span><span class="n">succeed</span><span class="p">(</span><span class="n">B</span><span class="p">,</span><span class="w"> </span><span class="n">C</span><span class="p">,</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">B</span><span class="p">.</span><span class="n">priority</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">TaskPriority</span><span class="o">::</span><span class="n">HIGH</span><span class="p">);</span><span class="w"></span>
<span class="n">C</span><span class="p">.</span><span class="n">priority</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">TaskPriority</span><span class="o">::</span><span class="n">LOW</span><span class="p">);</span><span class="w"></span>
<span class="n">D</span><span class="p">.</span><span class="n">priority</span><span class="p">(</span><span class="n">tf</span><span class="o">::</span><span class="n">TaskPriority</span><span class="o">::</span><span class="n">NORMAL</span><span class="p">);</span><span class="w"></span>
<span class="w"> </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><span class="w"></span></pre><p>In the above example, we have a task graph of five tasks, <code>A</code>, <code>B</code>, <code>C</code>, <code>D</code>, and <code>E</code>, in which <code>B</code>, <code>C</code>, and <code>D</code> can run in simultaneously when <code>A</code> finishes. Since we only uses one worker thread in the executor, we can deterministically run <code>B</code> first, then <code>D</code>, and <code>C</code> in order of their priority values. The output is as follows:</p><pre class="m-console"><span class="go">Task B: 0</span>
<span class="go">Task D: 1</span>
<span class="go">Task C: 2</span></pre>
<section id="typeless-methods">
<h2><a href="#typeless-methods">Constructors, destructors, conversion operators</a></h2>
<dl class="m-doc">
<dt>
<span class="m-doc-wrap-bumper"><a href="#a715574f55d3a05ec4040fc390bfcd632" class="m-doc">TaskQueue</a>(</span><span class="m-doc-wrap">int64_t capacity = 512) <span class="m-label m-flat m-info">explicit</span> </span>
</dt>
<dd>constructs the queue with a given capacity</dd>
<dt id="a15d5b45f482cba7383512a9c5bcbd7cf">
<span class="m-doc-wrap-bumper"><a href="#a15d5b45f482cba7383512a9c5bcbd7cf" class="m-doc-self">~TaskQueue</a>(</span><span class="m-doc-wrap">)</span>
</dt>
<dd>destructs the queue</dd>
</dl>
</section>
<section id="pub-methods">
<h2><a href="#pub-methods">Public functions</a></h2>
<dl class="m-doc">
<dt id="adfdf70255e24d62c46b31b09c47d78f7">
<span class="m-doc-wrap-bumper">auto <a href="#adfdf70255e24d62c46b31b09c47d78f7" class="m-doc-self">empty</a>(</span><span class="m-doc-wrap">) const -> bool <span class="m-label m-flat m-success">noexcept</span></span>
</dt>
<dd>queries if the queue is empty at the time of this call</dd>
<dt id="af57eb2ebc4d92120d7eaf868ec57b524">
<span class="m-doc-wrap-bumper">auto <a href="#af57eb2ebc4d92120d7eaf868ec57b524" class="m-doc-self">empty</a>(</span><span class="m-doc-wrap">unsigned priority) const -> bool <span class="m-label m-flat m-success">noexcept</span></span>
</dt>
<dd>queries if the queue is empty at a specific priority value</dd>
<dt id="ad598bef2211bf4cc99d66d80a12ebb6a">
<span class="m-doc-wrap-bumper">auto <a href="#ad598bef2211bf4cc99d66d80a12ebb6a" class="m-doc-self">size</a>(</span><span class="m-doc-wrap">) const -> size_t <span class="m-label m-flat m-success">noexcept</span></span>
</dt>
<dd>queries the number of items at the time of this call</dd>
<dt id="a0386ad90ced931025d14ea955ce40d8c">
<span class="m-doc-wrap-bumper">auto <a href="#a0386ad90ced931025d14ea955ce40d8c" class="m-doc-self">size</a>(</span><span class="m-doc-wrap">unsigned priority) const -> size_t <span class="m-label m-flat m-success">noexcept</span></span>
</dt>
<dd>queries the number of items with the given priority at the time of this call</dd>
<dt id="ad47b2671aa5270bcd05605c4063280ff">
<span class="m-doc-wrap-bumper">auto <a href="#ad47b2671aa5270bcd05605c4063280ff" class="m-doc-self">capacity</a>(</span><span class="m-doc-wrap">) const -> int64_t <span class="m-label m-flat m-success">noexcept</span></span>
</dt>
<dd>queries the capacity of the queue</dd>
<dt id="ab868d17013212547d750267710037877">
<span class="m-doc-wrap-bumper">auto <a href="#ab868d17013212547d750267710037877" class="m-doc-self">capacity</a>(</span><span class="m-doc-wrap">unsigned priority) const -> int64_t <span class="m-label m-flat m-success">noexcept</span></span>
</dt>
<dd>queries the capacity of the queue at a specific priority value</dd>
<dt>
<span class="m-doc-wrap-bumper">auto <a href="#ab90cef7de0b45650b67971db0ccbef76" class="m-doc">push</a>(</span><span class="m-doc-wrap">T item,
unsigned priority) -> TF_FORCE_INLINE void</span>
</dt>
<dd>inserts an item to the queue</dd>
<dt>
<span class="m-doc-wrap-bumper">auto <a href="#a3df0b3554e814385d23ee603941391df" class="m-doc">pop</a>(</span><span class="m-doc-wrap">) -> T</span>
</dt>
<dd>pops out an item from the queue</dd>
<dt>
<span class="m-doc-wrap-bumper">auto <a href="#ab486c2b496bc5ebc84122924921e5632" class="m-doc">pop</a>(</span><span class="m-doc-wrap">unsigned priority) -> TF_FORCE_INLINE T</span>
</dt>
<dd>pops out an item with a specific priority value from the queue</dd>
<dt>
<span class="m-doc-wrap-bumper">auto <a href="#a23e13cb9f98316b26c00ce494aa2f0c6" class="m-doc">steal</a>(</span><span class="m-doc-wrap">) -> T</span>
</dt>
<dd>steals an item from the queue</dd>
<dt>
<span class="m-doc-wrap-bumper">auto <a href="#aca896b5d59a78a018aeb313760ca735a" class="m-doc">steal</a>(</span><span class="m-doc-wrap">unsigned priority) -> T</span>
</dt>
<dd>steals an item with a specific priority value from the queue</dd>
</dl>
</section>
<section>
<h2>Function documentation</h2>
<section class="m-doc-details" id="a715574f55d3a05ec4040fc390bfcd632"><div>
<h3>
<div class="m-doc-template">
template<typename T, unsigned TF_MAX_PRIORITY>
</div>
<span class="m-doc-wrap-bumper"> tf::<wbr />TaskQueue<T, TF_MAX_PRIORITY>::<wbr /></span><span class="m-doc-wrap"><span class="m-doc-wrap-bumper"><a href="#a715574f55d3a05ec4040fc390bfcd632" class="m-doc-self">TaskQueue</a>(</span><span class="m-doc-wrap">int64_t capacity = 512) <span class="m-label m-info">explicit</span> </span></span>
</h3>
<p>constructs the queue with a given capacity</p>
<table class="m-table m-fullwidth m-flat">
<thead>
<tr><th colspan="2">Parameters</th></tr>
</thead>
<tbody>
<tr>
<td style="width: 1%">capacity</td>
<td>the capacity of the queue (must be power of 2)</td>
</tr>
</tbody>
</table>
</div></section>
<section class="m-doc-details" id="ab90cef7de0b45650b67971db0ccbef76"><div>
<h3>
<div class="m-doc-template">
template<typename T, unsigned TF_MAX_PRIORITY>
</div>
<span class="m-doc-wrap-bumper">TF_FORCE_INLINE void tf::<wbr />TaskQueue<T, TF_MAX_PRIORITY>::<wbr /></span><span class="m-doc-wrap"><span class="m-doc-wrap-bumper"><a href="#ab90cef7de0b45650b67971db0ccbef76" class="m-doc-self">push</a>(</span><span class="m-doc-wrap">T item,
unsigned priority)</span></span>
</h3>
<p>inserts an item to the queue</p>
<table class="m-table m-fullwidth m-flat">
<thead>
<tr><th colspan="2">Parameters</th></tr>
</thead>
<tbody>
<tr>
<td style="width: 1%">item</td>
<td>the item to push to the queue</td>
</tr>
<tr>
<td>priority</td>
<td>priority value of the item to push (default = 0)</td>
</tr>
</tbody>
</table>
<p>Only the owner thread can insert an item to the queue. The operation can trigger the queue to resize its capacity if more space is required.</p>
</div></section>
<section class="m-doc-details" id="a3df0b3554e814385d23ee603941391df"><div>
<h3>
<div class="m-doc-template">
template<typename T, unsigned TF_MAX_PRIORITY>
</div>
<span class="m-doc-wrap-bumper">T tf::<wbr />TaskQueue<T, TF_MAX_PRIORITY>::<wbr /></span><span class="m-doc-wrap"><span class="m-doc-wrap-bumper"><a href="#a3df0b3554e814385d23ee603941391df" class="m-doc-self">pop</a>(</span><span class="m-doc-wrap">)</span></span>
</h3>
<p>pops out an item from the queue</p>
<p>Only the owner thread can pop out an item from the queue. The return can be a <code>nullptr</code> if this operation failed (empty queue).</p>
</div></section>
<section class="m-doc-details" id="ab486c2b496bc5ebc84122924921e5632"><div>
<h3>
<div class="m-doc-template">
template<typename T, unsigned TF_MAX_PRIORITY>
</div>
<span class="m-doc-wrap-bumper">TF_FORCE_INLINE T tf::<wbr />TaskQueue<T, TF_MAX_PRIORITY>::<wbr /></span><span class="m-doc-wrap"><span class="m-doc-wrap-bumper"><a href="#ab486c2b496bc5ebc84122924921e5632" class="m-doc-self">pop</a>(</span><span class="m-doc-wrap">unsigned priority)</span></span>
</h3>
<p>pops out an item with a specific priority value from the queue</p>
<table class="m-table m-fullwidth m-flat">
<thead>
<tr><th colspan="2">Parameters</th></tr>
</thead>
<tbody>
<tr>
<td style="width: 1%">priority</td>
<td>priority of the item to pop</td>
</tr>
</tbody>
</table>
<p>Only the owner thread can pop out an item from the queue. The return can be a <code>nullptr</code> if this operation failed (empty queue).</p>
</div></section>
<section class="m-doc-details" id="a23e13cb9f98316b26c00ce494aa2f0c6"><div>
<h3>
<div class="m-doc-template">
template<typename T, unsigned TF_MAX_PRIORITY>
</div>
<span class="m-doc-wrap-bumper">T tf::<wbr />TaskQueue<T, TF_MAX_PRIORITY>::<wbr /></span><span class="m-doc-wrap"><span class="m-doc-wrap-bumper"><a href="#a23e13cb9f98316b26c00ce494aa2f0c6" class="m-doc-self">steal</a>(</span><span class="m-doc-wrap">)</span></span>
</h3>
<p>steals an item from the queue</p>
<p>Any threads can try to steal an item from the queue. The return can be a <code>nullptr</code> if this operation failed (not necessary empty).</p>
</div></section>
<section class="m-doc-details" id="aca896b5d59a78a018aeb313760ca735a"><div>
<h3>
<div class="m-doc-template">
template<typename T, unsigned TF_MAX_PRIORITY>
</div>
<span class="m-doc-wrap-bumper">T tf::<wbr />TaskQueue<T, TF_MAX_PRIORITY>::<wbr /></span><span class="m-doc-wrap"><span class="m-doc-wrap-bumper"><a href="#aca896b5d59a78a018aeb313760ca735a" class="m-doc-self">steal</a>(</span><span class="m-doc-wrap">unsigned priority)</span></span>
</h3>
<p>steals an item with a specific priority value from the queue</p>
<table class="m-table m-fullwidth m-flat">
<thead>
<tr><th colspan="2">Parameters</th></tr>
</thead>
<tbody>
<tr>
<td style="width: 1%">priority</td>
<td>priority of the item to steal</td>
</tr>
</tbody>
</table>
<p>Any threads can try to steal an item from the queue. The return can be a <code>nullptr</code> if this operation failed (not necessary empty).</p>
</div></section>
</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–2023.<br />Generated by <a href="https://doxygen.org/">Doxygen</a> 1.8.14 and <a href="https://mcss.mosra.cz/">m.css</a>.</p>
</div>
</div>
</div>
</nav></footer>
</body>
</html>