std::atomic<int>& counter,

const int max_depth,

int depth,

tf::Subflow& subflow

) {

if(depth < max_depth) {

for(int i=0; i<2; i++) {

auto A = subflow.emplace([&](){ counter++; });

auto B = subflow.emplace(

[&, max_depth, depth=depth+1](tf::Subflow& subflow){

conditional_spawn(counter, max_depth, depth, subflow);

});

auto C = subflow.emplace(

[&, max_depth, depth=depth+1](tf::Subflow& subflow){

conditional_spawn(counter, max_depth, depth, subflow);

}

);

auto cond = subflow.emplace([depth](){

if(depth%2) return 1;

else return 0;

}).precede(B, C);

A.precede(cond);

}

}

tf::Executor executor(w);

tf::Taskflow taskflow;

int counter = -1;

int state = 0;

auto A = taskflow.emplace([&] () { counter = 0; });

auto B = taskflow.emplace([&] () mutable {

REQUIRE((++counter % 100) == (++state % 100));

return counter < 100 ? 0 : 1;

});

auto C = taskflow.emplace(

[&] () {

REQUIRE(counter == 100);

counter = 0;

});

A.precede(B);

B.precede(B, C);

REQUIRE(A.num_strong_dependents() == 0);

REQUIRE(A.num_weak_dependents() == 0);

REQUIRE(A.num_dependents() == 0);

REQUIRE(B.num_strong_dependents() == 1);

REQUIRE(B.num_weak_dependents() == 1);

REQUIRE(B.num_dependents() == 2);

executor.run(taskflow).wait();

REQUIRE(counter == 0);

REQUIRE(state == 100);

executor.run(taskflow);

executor.run(taskflow);

executor.run(taskflow);

executor.run(taskflow);

executor.run_n(taskflow, 10);

executor.wait_for_all();

REQUIRE(state == 1500);

tf::Taskflow taskflow;

size_t rounds = 10000;

size_t steps = 0;

size_t total_steps = 0;

double average_steps = 0.0;

auto A = taskflow.emplace( [&](){ steps = 0; } );

auto B = taskflow.emplace( [&](){ ++steps; return std::rand()%2; } );

auto C = taskflow.emplace( [&](){ return std::rand()%2; } );

auto D = taskflow.emplace( [&](){ return std::rand()%2; } );

auto E = taskflow.emplace( [&](){ return std::rand()%2; } );

auto F = taskflow.emplace( [&](){ return std::rand()%2; } );

auto G = taskflow.emplace( [&]() mutable {

//++N; // a new round

total_steps += steps;

//avg = (double)accu/N;

//std::cout << "round " << N << ": steps=" << steps

// << " accumulated_steps=" << accu

// << " average_steps=" << avg << '\n';

}

);

A.precede(B).name("init");

B.precede(C, B).name("flip-coin-1");

C.precede(D, B).name("flip-coin-2");

D.precede(E, B).name("flip-coin-3");

E.precede(F, B).name("flip-coin-4");

F.precede(G, B).name("flip-coin-5");

//taskflow.dump(std::cout);

tf::Executor executor(w);

executor.run_n(taskflow, rounds).wait();

average_steps = total_steps / (double)rounds;

REQUIRE(std::fabs(average_steps-32.0)<1.0);

//taskflow.dump(std::cout);

tf::Executor executor(w);

// ____________________

// | |

// v |

// S -> A -> Branch -> many branches -> T

//

// Make sure each branch will be passed through exactly once

// and the T (target) node will also be passed

tf::Taskflow flow;

auto S = flow.emplace([](){});

int num_iterations = 0;

const int total_iteration = 1000;

auto A = flow.emplace([&](){ num_iterations ++; });

S.precede(A);

int sel = 0;

bool pass_T = false;

std::vector<bool> pass(total_iteration, false);

auto T = flow.emplace([&](){

REQUIRE(num_iterations == total_iteration); pass_T=true; }

);

auto branch = flow.emplace([&](){ return sel++; });

A.precede(branch);

for(size_t i=0; i<total_iteration; i++) {

auto t = flow.emplace([&, i](){

if(num_iterations < total_iteration) {

REQUIRE(!pass[i]);

pass[i] = true;

return 0;

}

// The last node will come to here (last iteration)

REQUIRE(!pass[i]);

pass[i] = true;

return 1;

});

branch.precede(t);

t.precede(A);

t.precede(T);

}

executor.run(flow).get();

REQUIRE(pass_T);

for(size_t i=0; i<pass.size(); i++) {

REQUIRE(pass[i]);

}

const int outer_loop = 3;

const int mid_loop = 4;

const int inner_loop = 5;

int counter {0};

tf::Taskflow flow;

auto S = flow.emplace([](){});

auto A = flow.emplace([&] (tf::Subflow& subflow) mutable {

// ___________

// | |

// v |

// S -> A -> B -> cond

auto S = subflow.emplace([](){ });

auto A = subflow.emplace([](){ }).succeed(S);

auto B = subflow.emplace([&](tf::Subflow& subflow){

// ___________

// | |

// v |

// S -> A -> B -> cond

// |

// -----> C

// -----> D

// -----> E

auto S = subflow.emplace([](){});

auto A = subflow.emplace([](){}).succeed(S);

auto B = subflow.emplace([&](){ counter++; }).succeed(A);

subflow.emplace([&, repeat=0]() mutable {

if(repeat ++ < inner_loop)

return 0;

repeat = 0;

return 1;

}).succeed(B).precede(A).name("cond");

// Those are redundant tasks

subflow.emplace([](){}).succeed(A).name("C");

subflow.emplace([](){}).succeed(A).name("D");

subflow.emplace([](){}).succeed(A).name("E");

}).succeed(A);

subflow.emplace([&, repeat=0]() mutable {

if(repeat ++ < mid_loop)

return 0;

repeat = 0;

return 1;

}).succeed(B).precede(A).name("cond");

}).succeed(S);

flow.emplace(

[&, repeat=0]() mutable {

if(repeat ++ < outer_loop) {

return 0;

}

repeat = 0;

return 1;

}

).succeed(A).precede(A);

tf::Executor executor(w);

const int repeat = 10;

executor.run_n(flow, repeat).get();

REQUIRE(counter == (inner_loop+1)*(mid_loop+1)*(outer_loop+1)*repeat);

const int repeat = 10;

tf::Taskflow flow;

int num_visit_A {0};

int num_visit_C1 {0};

int num_visit_C2 {0};

int iteration_C1 {0};

int iteration_C2 {0};

auto S = flow.emplace([](){});

auto A = flow.emplace([&](){ num_visit_A++; }).succeed(S);

auto cond1 = flow.emplace([&]() mutable {

num_visit_C1++;

iteration_C1++;

if(iteration_C1 == 1) return 0;

return 1;

}).succeed(A).precede(A);

auto cond2 = flow.emplace([&]() mutable {

num_visit_C2 ++;

return iteration_C2++;

}).succeed(cond1).precede(cond1, A);

flow.emplace([](){ REQUIRE(false); }).succeed(cond1).name("B");

flow.emplace([&](){

iteration_C1 = 0;

iteration_C2 = 0;

}).succeed(cond2).name("D");

tf::Executor executor(w);

executor.run_n(flow, repeat).get();

REQUIRE(num_visit_A == 3*repeat);

REQUIRE(num_visit_C1 == 4*repeat);

REQUIRE(num_visit_C2 == 3*repeat);

tf::Executor executor(w);

tf::Taskflow tf0("c0");

tf::Taskflow tf1("c1");

tf::Taskflow tf2("c2");

tf::Taskflow tf3("top");

int c1, c2, c2_repeat;

auto c1A = tf1.emplace( [&](){ c1=0; } );

auto c1B = tf1.emplace( [&, state=0] () mutable {

REQUIRE(state++ % 100 == c1 % 100);

});

auto c1C = tf1.emplace( [&](){ return (++c1 < 100) ? 0 : 1; });

c1A.precede(c1B);

c1B.precede(c1C);

c1C.precede(c1B);

c1A.name("c1A");

c1B.name("c1B");

c1C.name("c1C");

auto c2A = tf2.emplace( [&](){ REQUIRE(c2 == 100); c2 = 0; } );

auto c2B = tf2.emplace( [&, state=0] () mutable {

REQUIRE((state++ % 100) == (c2 % 100));

});

auto c2C = tf2.emplace( [&](){ return (++c2 < 100) ? 0 : 1; });

c2A.precede(c2B);

c2B.precede(c2C);

c2C.precede(c2B);

c2A.name("c2A");

c2B.name("c2B");

c2C.name("c2C");

auto init = tf3.emplace([&](){

c1=c2=c2_repeat=0;

}).name("init");

auto loop1 = tf3.emplace([&](){

return (++c2 < 100) ? 0 : 1;

}).name("loop1");

auto loop2 = tf3.emplace([&](){

c2 = 0;

return ++c2_repeat < 100 ? 0 : 1;

}).name("loop2");

auto sync = tf3.emplace([&](){

REQUIRE(c2==0);

REQUIRE(c2_repeat==100);

c2_repeat = 0;

}).name("sync");

auto grab = tf3.emplace([&](){

REQUIRE(c1 == 100);

REQUIRE(c2 == 0);

REQUIRE(c2_repeat == 0);

}).name("grab");

auto mod0 = tf3.composed_of(tf0).name("module0");

auto mod1 = tf3.composed_of(tf1).name("module1");

auto sbf1 = tf3.emplace([&](tf::Subflow& sbf){

auto sbf1_1 = sbf.emplace([](){}).name("sbf1_1");

auto module1 = sbf.composed_of(tf1).name("module1");

auto sbf1_2 = sbf.emplace([](){}).name("sbf1_2");

sbf1_1.precede(module1);

module1.precede(sbf1_2);

sbf.join();

}).name("sbf1");

auto mod2 = tf3.composed_of(tf2).name("module2");

init.precede(mod0, sbf1, loop1);

loop1.precede(loop1, mod2);

loop2.succeed(mod2).precede(loop1, sync);

mod0.precede(grab);

sbf1.precede(mod1);

mod1.precede(grab);

sync.precede(grab);

executor.run(tf3);

executor.run_n(tf3, 10);

executor.wait_for_all();

//tf3.dump(std::cout);

tf::Taskflow taskflow;

tf::Executor executor(W);

const size_t I = 1000;

std::vector<size_t> data(I);

size_t i;

auto init = taskflow.emplace([&](){ i = 0; }).name("init");

auto subflow = taskflow.emplace([&](tf::Subflow& sf){

sf.emplace([&, i](){

REQUIRE(i<I);

data[i] = i*(i+1)/2*123;;

}).name(std::to_string(i));

sf.detach();

}).name("subflow");

auto cond = taskflow.emplace([&](){

if(++i < I) return 0;

return 1;

}).name("cond");

auto stop = taskflow.emplace([](){}).name("stop");

init.precede(subflow);

subflow.precede(cond);

cond.precede(subflow, stop);

executor.run(taskflow).wait();

REQUIRE(taskflow.num_tasks() == 4 + I);

for(size_t i=0; i<data.size(); ++i) {

REQUIRE(data[i] == i*(i+1)/2*123);

data[i] = 0;

}

executor.run_n(taskflow, 1);

executor.run_n(taskflow, 10);

executor.run_n(taskflow, 100);

executor.wait_for_all();

REQUIRE(taskflow.num_tasks() == 4 + I*100);

for(size_t i=0; i<data.size(); ++i) {

REQUIRE(data[i] == i*(i+1)/2*123);

}

tf::Executor executor(W);

tf::Taskflow taskflow;

std::atomic<int> counter{0};

auto A = taskflow.placeholder();

for(int i=0; i<100; i++) {

auto X = taskflow.emplace([&](){ counter.fetch_add(1, std::memory_order_relaxed); });

auto Y = taskflow.emplace([&](){ counter.fetch_add(1, std::memory_order_relaxed); });

X.precede(Y);

A.precede(X);

}

int ans = 0;

tf::SmallVector<int> conds;

for(int i=-10; i<=110; i++) {

if(::rand() % 10 == 0) {

conds.push_back(i);

if(0<=i && i<100) {

ans++;

}

}

}

A.work([&]() { return conds; });

executor.run(taskflow).wait();

REQUIRE(2*ans == counter);

tf::Executor executor(W);

tf::Taskflow taskflow;

std::atomic<int> counter{0};

auto A = taskflow.emplace([](){});

auto B = taskflow.emplace([&, i=bool{true}, c = int(0)]() mutable -> tf::SmallVector<int> {

if(i) {

i = false;

return {0, 1};

}

else {

counter.fetch_add(1, std::memory_order_relaxed);

return {++c < 10 ? 0 : -1};

}

});

auto C = taskflow.emplace([&, i=bool{true}, c = int(0)]() mutable -> tf::SmallVector<int> {

if(i) {

i = false;

return {0, 1};

}

else {

counter.fetch_add(1, std::memory_order_relaxed);

return {++c < 10 ? 0 : -1};

}

});

auto D = taskflow.emplace([&, i=bool{true}, c = int(0)]() mutable -> tf::SmallVector<int> {

if(i) {

i = false;

return {0, 1};

}

else {

counter.fetch_add(1, std::memory_order_relaxed);

return {++c < 10 ? 0 : -1};

}

});

auto E = taskflow.emplace([&, i=bool{true}, c = int(0)]() mutable -> tf::SmallVector<int> {

if(i) {

i = false;

return {0, 1};

}

else {

counter.fetch_add(1, std::memory_order_relaxed);

return {++c < 10 ? 0 : -1};

}

});

A.precede(B);

B.precede(B, C);

C.precede(C, D);

D.precede(D, E);

E.precede(E);

executor.run(taskflow).wait();

//taskflow.dump(std::cout);

REQUIRE(counter == 40);

const int N = 10;

tf::Taskflow taskflow;

tf::Executor executor(w);

std::atomic<int> counter{0};

std::vector<tf::Task> tasks;

for(int i=1; i<(1<<N); i++) {

tasks.emplace_back(taskflow.emplace([&counter]() -> tf::SmallVector<int>{

counter.fetch_add(1, std::memory_order_relaxed);

return {0, 1};

}));

}

for(size_t i=0; i<tasks.size(); i++) {

size_t l = i*2+1;

size_t r = l + 1;

if(l < tasks.size()) tasks[i].precede(tasks[l]);

if(r < tasks.size()) tasks[i].precede(tasks[r]);

}

executor.run_n(taskflow, N).wait();

REQUIRE(((1<<N)-1)*N == counter);