#include "linear_chain.hpp"#include <taskflow/taskflow.hpp>// binary_tree_taskflowvoid linear_chain_taskflow(size_t length, unsigned num_threads) {size_t counter {0};std::vector<tf::Task> tasks(length);tf::Executor executor(num_threads);tf::Taskflow taskflow;for(size_t i=0; i<length; ++i) {tasks[i] = taskflow.emplace([&] () { counter++; });}taskflow.linearize(tasks);executor.run(taskflow).get();assert(counter == tasks.size());}std::chrono::microseconds measure_time_taskflow(size_t length,unsigned num_threads) {auto beg = std::chrono::high_resolution_clock::now();linear_chain_taskflow(length, num_threads);auto end = std::chrono::high_resolution_clock::now();return std::chrono::duration_cast<std::chrono::microseconds>(end - beg);}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。