docs/ParallelScan.html · sam1003/cpp-taskflow

代码拉取完成,页面将自动刷新

扫描微信二维码支付

取消

支付完成

richgiteeai

Watch

不关注关注所有动态仅关注版本发行动态关注但不提醒动态

1 Star 0 Fork 37

sam1003/cpp-taskflow

forked from Gitee 极速下载/cpp-taskflow

代码 Wiki 统计流水线

服务

加入 Gitee

与超过 1400万开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)

免费加入

已有帐号? 立即登录

文件

master

分支 (6)

标签 (17)

管理

master

dev

semaphore_refactor

dev-defer-new

dev-defer

cpp14

v3.6.0

v3.5.0

v3.4.0

v3.3.0

v3.2.0

v3.1.0

v3.0.0

v2.7.0

v2.6.0

v2.5.0

2.5.0

v2.4.0

v2.3.1

v2.3.0

v2.2.0

v2.1.0

v2.0.0

克隆/下载

HTTPS SSH SVN SVN+SSH 下载ZIP

提示

下载代码请复制以下命令到终端执行

为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置

git config --global user.name userName 
git config --global user.email userEmail

初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置

1 生成 RSA 密钥

2 获取 RSA 公钥内容,并配置到 SSH公钥中

在 Gitee 上使用 SVN,请访问使用指南

使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议配置并使用私人令牌替代登录密码进行克隆、推送等操作

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # 私人令牌

分支 6

标签 17

cpp-taskflow

docs

ParallelScan.html

ParallelScan.html 29.29 KB

<!DOCTYPE html>
<html lang="en">
<head>
 <meta charset="UTF-8" />
 <title>Taskflow Algorithms &raquo; Parallel Scan | 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">
 
 <a href="https://taskflow.github.io"><img src="taskflow_logo.png" alt="" />Taskflow</a> | <a href="index.html" class="m-thin">QuickStart</a>
 
 <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>
 <a href="Algorithms.html">Taskflow Algorithms</a> &raquo;
 Parallel Scan
 </h1>
 <nav class="m-block m-default">
 <h3>Contents</h3>
 <ul>
 <li><a href="#ParallelScanInclude">Include the Header</a></li>
 <li><a href="#WhatIsAScanOperation">What is a Scan Operation?</a></li>
 <li><a href="#CreateAParallelInclusiveScanTask">Create a Parallel Inclusive Scan Task</a></li>
 <li><a href="#CreateAParallelTransformInclusiveScanTask">Create a Parallel Transform-Inclusive Scan Task</a></li>
 <li><a href="#CreateAParallelExclusiveScanTask">Create a Parallel Exclusive Scan Task</a></li>
 <li><a href="#CreateAParallelTransformExclusiveScanTask">Create a Parallel Transform-Exclusive Scan Task</a></li>
 </ul>
 </nav>
Taskflow provide template methods that construct tasks to perform parallel scan over a range of items.<section id="ParallelScanInclude"><h2><a href="#ParallelScanInclude">Include the Header</a></h2>You need to include the header file, <code>taskflow/algorithm/scan.hpp</code>, for creating a parallel-scan task.<pre class="m-code">#include &lt;taskflow/algorithm/scan.hpp&gt;</pre></section><section id="WhatIsAScanOperation"><h2><a href="#WhatIsAScanOperation">What is a Scan Operation?</a></h2>A parallel scan task performs the cumulative sum, also known as prefix sum or scan, of the input range and writes the result to the output range. Each element of the output range contains the running total of all earlier elements using the given binary operator for summation.<img class="m-image" src="scan.png" alt="Image" /></section><section id="CreateAParallelInclusiveScanTask"><h2><a href="#CreateAParallelInclusiveScanTask">Create a Parallel Inclusive Scan Task</a></h2><a href="classtf_1_1FlowBuilder.html#a1c2ace9290d83c2a006614a4d66ad588" class="m-doc">tf::Taskflow::inclusive_scan(B first, E last, D d_first, BOP bop)</a> generates an inclusive scan, meaning that the N-th element of the output range is the sum of the first N input elements, so the N-th input element is included. For example, the code below performs an inclusive scan over five elements:<pre class="m-code">std::vector&lt;int&gt; input = {1, 2, 3, 4, 5};
std::vector&lt;int&gt; output(input.size())
taskflow.inclusive_scan(
 input.begin(), input.end(), output.begin(), std::plus&lt;int&gt;{}
);
executor.run(taskflow).wait();
// output is {1, 3, 6, 10, 15}</pre>The output range may be the same as the input range, in which the scan operation is in-place with results written to the input range. For example, the code below performs an in-place inclusive scan over five elements:<pre class="m-code">std::vector&lt;int&gt; input = {1, 2, 3, 4, 5};
taskflow.inclusive_scan(
 input.begin(), input.end(), input.begin(), std::plus&lt;int&gt;{}
);
executor.run(taskflow).wait();
// input is {1, 3, 6, 10, 15}</pre>Similar to <a href="classtf_1_1FlowBuilder.html#a1c2ace9290d83c2a006614a4d66ad588" class="m-doc">tf::Taskflow::inclusive_scan(B first, E last, D d_first, BOP bop)</a>, <a href="classtf_1_1FlowBuilder.html#a0b589a5bbf9b18e6484fa9e554d39a39" class="m-doc">tf::Taskflow::inclusive_scan(B first, E last, D d_first, BOP bop, T init)</a> performs an inclusive scan but with an additional initial value <code>init</code>. For example, the code below performs an inclusive scan over five elements plus an initial value:<pre class="m-code">std::vector&lt;int&gt; input = {1, 2, 3, 4, 5};
std::vector&lt;int&gt; output(input.size());
// performs inclusive scan with an initial value
taskflow.inclusive_scan(
 input.begin(), input.end(), output.begin(), std::plus&lt;int&gt;{}, -1
);
executor.run(taskflow).wait();
// output is {0, 2, 5, 9, 14}</pre></section><section id="CreateAParallelTransformInclusiveScanTask"><h2><a href="#CreateAParallelTransformInclusiveScanTask">Create a Parallel Transform-Inclusive Scan Task</a></h2>You can transform elements in the input range before running inclusive scan using <a href="classtf_1_1FlowBuilder.html#a82f3c3f49a2d52cd52f6eac07a659e9c" class="m-doc">tf::Taskflow::transform_inclusive_scan(B first, E last, D d_first, BOP bop, UOP uop)</a> and <a href="classtf_1_1FlowBuilder.html#a49f7e17d02c708035b9134d8c6c89f90" class="m-doc">tf::Taskflow::transform_inclusive_scan(B first, E last, D d_first, BOP bop, UOP uop, T init)</a>. For example, the code below performs an inclusive scan over five transformed elements:<pre class="m-code">std::vector&lt;int&gt; input = {1, 2, 3, 4, 5};
std::vector&lt;int&gt; output(input.size());
taskflow.transform_inclusive_scan(
 input.begin(), input.end(), output.begin(), std::plus&lt;int&gt;{}, 
 [] (int item) { return -item; }
);
executor.run(taskflow).wait();
// output is {-1, -3, -6, -10, -15}</pre>You can also associate the transform-inclusive scan with an initial value using <a href="classtf_1_1FlowBuilder.html#a49f7e17d02c708035b9134d8c6c89f90" class="m-doc">tf::Taskflow::transform_inclusive_scan(B first, E last, D d_first, BOP bop, UOP uop, T init)</a>. Only elements in the input range will be transformed using <code>uop</code>, i.e., the initial value <code>init</code> does not participate in <code>uop</code>.<pre class="m-code">std::vector&lt;int&gt; input = {1, 2, 3, 4, 5};
std::vector&lt;int&gt; output(input.size());
taskflow.transform_inclusive_scan(
 input.begin(), input.end(), output.begin(), std::plus&lt;int&gt;{}, 
 [] (int item) { return -item; },
 -1
);
executor.run(taskflow).wait();
// output is {-2, -4, -7, -11, -16}</pre></section><section id="CreateAParallelExclusiveScanTask"><h2><a href="#CreateAParallelExclusiveScanTask">Create a Parallel Exclusive Scan Task</a></h2><a href="classtf_1_1FlowBuilder.html#a4e0d618d8eb0b3b2e5e00443a10bf512" class="m-doc">tf::Taskflow::exclusive_scan(B first, E last, D d_first, T init, BOP bop)</a> generates an exclusive scan with the given initial value. The N-th element of the output range is the sum of the first N-1 input elements, so the N-th input element is included. For example, the code below performs an exclusive scan over five elements with an initial value -1:<pre class="m-code">std::vector&lt;int&gt; input = {1, 2, 3, 4, 5};
std::vector&lt;int&gt; output(input.size())
taskflow.exclusive_scan(
 input.begin(), input.end(), output.begin(), -1, std::plus&lt;int&gt;{}
);
executor.run(taskflow).wait();
// output is {-1, 0, 2, 5, 9}</pre>The output range may be the same as the input range, in which the scan operation is in-place with results written to the input range. For example, the code below performs an in-place exclusive scan over five elements with an initial -1:<pre class="m-code">std::vector&lt;int&gt; input = {1, 2, 3, 4, 5};
std::vector&lt;int&gt; output(input.size());
taskflow.exclusive_scan(
 input.begin(), input.end(), output.begin(), -1, std::plus&lt;int&gt;{}
);
executor.run(taskflow).wait();
// output is {-1, 0, 2, 5, 9}</pre></section><section id="CreateAParallelTransformExclusiveScanTask"><h2><a href="#CreateAParallelTransformExclusiveScanTask">Create a Parallel Transform-Exclusive Scan Task</a></h2>You can transform elements in the input range before running exclusive scan using <a href="classtf_1_1FlowBuilder.html#a8549478ef819699b30f8daf88f04d577" class="m-doc">tf::Taskflow::transform_exclusive_scan(B first, E last, D d_first, T init, BOP bop, UOP uop)</a>. For example, the code below performs an exclusive scan over five transformed elements:<pre class="m-code">std::vector&lt;int&gt; input = {1, 2, 3, 4, 5};
std::vector&lt;int&gt; output(input.size());
taskflow.transform_exclusive_scan(
 input.begin(), input.end(), input.begin(), -1, std::plus&lt;int&gt;{},
 [](int item) { return -item; }
);
executor.run(taskflow).wait();
// output is {-1, -2, -4, -7, -11}</pre></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>Tab / T to search, Esc to close</div>
 <div id="search-symbolcount">&hellip;</div>
 </div>
 <div class="m-doc-search-content">
 <form>
 <input type="search" name="q" id="search-input" placeholder="Loading &hellip;" 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 requires JavaScript.</noscript>
 <div id="search-help" class="m-text m-dim m-text-center">
 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.
 Use &darr;
 / &uarr; to navigate through the list,
 Enter to go.
 Tab autocompletes common prefix, you can
 copy a link to the result using ⌘
 L while ⌘
 M produces a Markdown link.
 </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">
 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&ndash;2023. Generated by <a href="https://doxygen.org/">Doxygen</a> 1.9.1 and <a href="https://mcss.mosra.cz/">m.css</a>.
 </div>
 </div>
 </div>
</nav></footer>
</body>
</html>

一键复制编辑原始数据按行查看历史

TSUNG-WEI HUANG 提交于 2023年09月13日 04:58 +08:00 . fixed compilation error in cuda examples

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

<!DOCTYPE html>
<html lang="en">
<head>
 <meta charset="UTF-8" />
 <title>Taskflow Algorithms &raquo; Parallel Scan | 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>
 <span class="m-breadcrumb"><a href="Algorithms.html">Taskflow Algorithms</a> &raquo;</span>
 Parallel Scan
 </h1>
 <nav class="m-block m-default">
 <h3>Contents</h3>
 <ul>
 <li><a href="#ParallelScanInclude">Include the Header</a></li>
 <li><a href="#WhatIsAScanOperation">What is a Scan Operation?</a></li>
 <li><a href="#CreateAParallelInclusiveScanTask">Create a Parallel Inclusive Scan Task</a></li>
 <li><a href="#CreateAParallelTransformInclusiveScanTask">Create a Parallel Transform-Inclusive Scan Task</a></li>
 <li><a href="#CreateAParallelExclusiveScanTask">Create a Parallel Exclusive Scan Task</a></li>
 <li><a href="#CreateAParallelTransformExclusiveScanTask">Create a Parallel Transform-Exclusive Scan Task</a></li>
 </ul>
 </nav>
<p>Taskflow provide template methods that construct tasks to perform parallel scan over a range of items.</p><section id="ParallelScanInclude"><h2><a href="#ParallelScanInclude">Include the Header</a></h2><p>You need to include the header file, <code>taskflow/algorithm/scan.hpp</code>, for creating a parallel-scan task.</p><pre class="m-code"><span class="cp">#include</span><span class="w"> </span><span class="cpf">&lt;taskflow/algorithm/scan.hpp&gt;</span><span class="cp"></span></pre></section><section id="WhatIsAScanOperation"><h2><a href="#WhatIsAScanOperation">What is a Scan Operation?</a></h2><p>A parallel scan task performs the cumulative sum, also known as <em>prefix sum</em> or <em>scan</em>, of the input range and writes the result to the output range. Each element of the output range contains the running total of all earlier elements using the given binary operator for summation.</p><img class="m-image" src="scan.png" alt="Image" /></section><section id="CreateAParallelInclusiveScanTask"><h2><a href="#CreateAParallelInclusiveScanTask">Create a Parallel Inclusive Scan Task</a></h2><p><a href="classtf_1_1FlowBuilder.html#a1c2ace9290d83c2a006614a4d66ad588" class="m-doc">tf::<wbr />Taskflow::<wbr />inclusive_scan(B first, E last, D d_first, BOP bop)</a> generates an <em>inclusive</em> scan, meaning that the N-th element of the output range is the sum of the first N input elements, so the N-th input element is included. For example, the code below performs an inclusive scan over five elements:</p><pre class="m-code"><span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">input</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">};</span><span class="w"></span>
<span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">output</span><span class="p">(</span><span class="n">input</span><span class="p">.</span><span class="n">size</span><span class="p">())</span><span class="w"></span>
<span class="n">taskflow</span><span class="p">.</span><span class="n">inclusive_scan</span><span class="p">(</span><span class="w"></span>
<span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span><span class="w"> </span><span class="n">output</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">plus</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</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">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>
<span class="c1">// output is {1, 3, 6, 10, 15}</span></pre><p>The output range may be the same as the input range, in which the scan operation is <em>in-place</em> with results written to the input range. For example, the code below performs an in-place inclusive scan over five elements:</p><pre class="m-code"><span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">input</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">};</span><span class="w"></span>
<span class="n">taskflow</span><span class="p">.</span><span class="n">inclusive_scan</span><span class="p">(</span><span class="w"></span>
<span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span><span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">plus</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</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">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>
<span class="c1">// input is {1, 3, 6, 10, 15}</span></pre><p>Similar to <a href="classtf_1_1FlowBuilder.html#a1c2ace9290d83c2a006614a4d66ad588" class="m-doc">tf::<wbr />Taskflow::<wbr />inclusive_scan(B first, E last, D d_first, BOP bop)</a>, <a href="classtf_1_1FlowBuilder.html#a0b589a5bbf9b18e6484fa9e554d39a39" class="m-doc">tf::<wbr />Taskflow::<wbr />inclusive_scan(B first, E last, D d_first, BOP bop, T init)</a> performs an inclusive scan but with an additional initial value <code>init</code>. For example, the code below performs an inclusive scan over five elements plus an initial value:</p><pre class="m-code"><span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">input</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">};</span><span class="w"></span>
<span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">output</span><span class="p">(</span><span class="n">input</span><span class="p">.</span><span class="n">size</span><span class="p">());</span><span class="w"></span>
<span class="c1">// performs inclusive scan with an initial value</span>
<span class="n">taskflow</span><span class="p">.</span><span class="n">inclusive_scan</span><span class="p">(</span><span class="w"></span>
<span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span><span class="w"> </span><span class="n">output</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">plus</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="p">{},</span><span class="w"> </span><span class="mi">-1</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">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>
<span class="c1">// output is {0, 2, 5, 9, 14}</span></pre></section><section id="CreateAParallelTransformInclusiveScanTask"><h2><a href="#CreateAParallelTransformInclusiveScanTask">Create a Parallel Transform-Inclusive Scan Task</a></h2><p>You can transform elements in the input range before running inclusive scan using <a href="classtf_1_1FlowBuilder.html#a82f3c3f49a2d52cd52f6eac07a659e9c" class="m-doc">tf::<wbr />Taskflow::<wbr />transform_inclusive_scan(B first, E last, D d_first, BOP bop, UOP uop)</a> and <a href="classtf_1_1FlowBuilder.html#a49f7e17d02c708035b9134d8c6c89f90" class="m-doc">tf::<wbr />Taskflow::<wbr />transform_inclusive_scan(B first, E last, D d_first, BOP bop, UOP uop, T init)</a>. For example, the code below performs an inclusive scan over five transformed elements:</p><pre class="m-code"><span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">input</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">};</span><span class="w"></span>
<span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">output</span><span class="p">(</span><span class="n">input</span><span class="p">.</span><span class="n">size</span><span class="p">());</span><span class="w"></span>
<span class="n">taskflow</span><span class="p">.</span><span class="n">transform_inclusive_scan</span><span class="p">(</span><span class="w"></span>
<span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span><span class="w"> </span><span class="n">output</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">plus</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</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="kt">int</span><span class="w"> </span><span class="n">item</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="o">-</span><span class="n">item</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">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>
<span class="c1">// output is {-1, -3, -6, -10, -15}</span></pre><p>You can also associate the transform-inclusive scan with an initial value using <a href="classtf_1_1FlowBuilder.html#a49f7e17d02c708035b9134d8c6c89f90" class="m-doc">tf::<wbr />Taskflow::<wbr />transform_inclusive_scan(B first, E last, D d_first, BOP bop, UOP uop, T init)</a>. Only elements in the input range will be transformed using <code>uop</code>, i.e., the initial value <code>init</code> does not participate in <code>uop</code>.</p><pre class="m-code"><span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">input</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">};</span><span class="w"></span>
<span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">output</span><span class="p">(</span><span class="n">input</span><span class="p">.</span><span class="n">size</span><span class="p">());</span><span class="w"></span>
<span class="n">taskflow</span><span class="p">.</span><span class="n">transform_inclusive_scan</span><span class="p">(</span><span class="w"></span>
<span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span><span class="w"> </span><span class="n">output</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">plus</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</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="kt">int</span><span class="w"> </span><span class="n">item</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="o">-</span><span class="n">item</span><span class="p">;</span><span class="w"> </span><span class="p">},</span><span class="w"></span>
<span class="w"> </span><span class="mi">-1</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">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>
<span class="c1">// output is {-2, -4, -7, -11, -16}</span></pre></section><section id="CreateAParallelExclusiveScanTask"><h2><a href="#CreateAParallelExclusiveScanTask">Create a Parallel Exclusive Scan Task</a></h2><p><a href="classtf_1_1FlowBuilder.html#a4e0d618d8eb0b3b2e5e00443a10bf512" class="m-doc">tf::<wbr />Taskflow::<wbr />exclusive_scan(B first, E last, D d_first, T init, BOP bop)</a> generates an <em>exclusive</em> scan with the given initial value. The N-th element of the output range is the sum of the first N-1 input elements, so the N-th input element is included. For example, the code below performs an exclusive scan over five elements with an initial value -1:</p><pre class="m-code"><span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">input</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">};</span><span class="w"></span>
<span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">output</span><span class="p">(</span><span class="n">input</span><span class="p">.</span><span class="n">size</span><span class="p">())</span><span class="w"></span>
<span class="n">taskflow</span><span class="p">.</span><span class="n">exclusive_scan</span><span class="p">(</span><span class="w"></span>
<span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span><span class="w"> </span><span class="n">output</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="mi">-1</span><span class="p">,</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">plus</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</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">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>
<span class="c1">// output is {-1, 0, 2, 5, 9}</span></pre><p>The output range may be the same as the input range, in which the scan operation is <em>in-place</em> with results written to the input range. For example, the code below performs an in-place exclusive scan over five elements with an initial -1:</p><pre class="m-code"><span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">input</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">};</span><span class="w"></span>
<span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">output</span><span class="p">(</span><span class="n">input</span><span class="p">.</span><span class="n">size</span><span class="p">());</span><span class="w"></span>
<span class="n">taskflow</span><span class="p">.</span><span class="n">exclusive_scan</span><span class="p">(</span><span class="w"></span>
<span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span><span class="w"> </span><span class="n">output</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="mi">-1</span><span class="p">,</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">plus</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</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">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>
<span class="c1">// output is {-1, 0, 2, 5, 9}</span></pre></section><section id="CreateAParallelTransformExclusiveScanTask"><h2><a href="#CreateAParallelTransformExclusiveScanTask">Create a Parallel Transform-Exclusive Scan Task</a></h2><p>You can transform elements in the input range before running exclusive scan using <a href="classtf_1_1FlowBuilder.html#a8549478ef819699b30f8daf88f04d577" class="m-doc">tf::<wbr />Taskflow::<wbr />transform_exclusive_scan(B first, E last, D d_first, T init, BOP bop, UOP uop)</a>. For example, the code below performs an exclusive scan over five transformed elements:</p><pre class="m-code"><span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">input</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">};</span><span class="w"></span>
<span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">output</span><span class="p">(</span><span class="n">input</span><span class="p">.</span><span class="n">size</span><span class="p">());</span><span class="w"></span>
<span class="n">taskflow</span><span class="p">.</span><span class="n">transform_exclusive_scan</span><span class="p">(</span><span class="w"></span>
<span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span><span class="w"> </span><span class="n">input</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="mi">-1</span><span class="p">,</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">plus</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="p">{},</span><span class="w"></span>
<span class="w"> </span><span class="p">[](</span><span class="kt">int</span><span class="w"> </span><span class="n">item</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="o">-</span><span class="n">item</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">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>
<span class="c1">// output is {-1, -2, -4, -7, -11}</span></pre></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">&hellip;</div>
 </div>
 <div class="m-doc-search-content">
 <form>
 <input type="search" name="q" id="search-input" placeholder="Loading &hellip;" 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">&darr;</span>
 / <span class="m-label m-dim">&uarr;</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&ndash;2023.<br />Generated by <a href="https://doxygen.org/">Doxygen</a> 1.9.1 and <a href="https://mcss.mosra.cz/">m.css</a>.</p>
 </div>
 </div>
 </div>
</nav></footer>
</body>
</html>