Skip to content

Commit 9ce0d6f

Browse files
updated readme
1 parent f567e4e commit 9ce0d6f

4 files changed

Lines changed: 11 additions & 9 deletions

File tree

README.md

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -520,8 +520,7 @@ auto [S, T] = tf.parallel_for(
520520
v.end(), // end of range
521521
[] (int i) {
522522
std::cout << "parallel in " << i << '\n';
523-
},
524-
1 // execute one task at a time
523+
}
525524
);
526525
// add dependencies via S and T.
527526
```
@@ -545,6 +544,9 @@ auto [S, T] = tf.parallel_for(
545544
);
546545
```
547546

547+
By default, taskflow performs an even partition over worker threads
548+
if the group size is not specified.
549+
548550
### *reduce/transform_reduce*
549551

550552
The method `reduce` creates a subgraph that applies a binary operator to a range of items.

example/parallel_for.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,7 @@ void taskflow(int N) {
3232
tf::Taskflow tf;
3333
tf.parallel_for(range, [&] (const int i) {
3434
printf("fib[%d]=%d\n", i, fib(i));
35-
});
35+
}, 1);
3636
tf.wait_for_all();
3737

3838
auto tend = std::chrono::steady_clock::now();

example/simple.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
#include <taskflow/taskflow.hpp> // the only include you need
77

88
int main(){
9-
9+
1010
tf::Taskflow tf(std::thread::hardware_concurrency());
1111

1212
auto [A, B, C, D] = tf.silent_emplace( // the taskflow graph

taskflow/taskflow.hpp

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -625,10 +625,10 @@ class BasicFlowBuilder {
625625
auto silent_emplace(C&&...);
626626

627627
template <typename I, typename C>
628-
auto parallel_for(I, I, C&&, size_t = 1);
628+
auto parallel_for(I, I, C&&, size_t = 0);
629629

630630
template <typename T, typename C, std::enable_if_t<is_iterable_v<T>, void>* = nullptr>
631-
auto parallel_for(T&, C&&, size_t = 1);
631+
auto parallel_for(T&, C&&, size_t = 0);
632632

633633
template <typename I, typename T, typename B>
634634
auto reduce(I, I, T&, B&&);
@@ -854,7 +854,7 @@ template <typename I, typename C>
854854
auto BasicFlowBuilder<NodeType>::parallel_for(I beg, I end, C&& c, size_t g) {
855855

856856
using category = typename std::iterator_traits<I>::iterator_category;
857-
857+
858858
if(g == 0) {
859859
auto d = std::distance(beg, end);
860860
auto w = std::max(size_t{1}, _num_workers);
@@ -1208,10 +1208,10 @@ class BasicTaskflow {
12081208
auto silent_emplace(C&&...);
12091209

12101210
template <typename I, typename C>
1211-
auto parallel_for(I, I, C&&, size_t = 1);
1211+
auto parallel_for(I, I, C&&, size_t = 0);
12121212

12131213
template <typename T, typename C, std::enable_if_t<is_iterable_v<T>, void>* = nullptr>
1214-
auto parallel_for(T&, C&&, size_t = 1);
1214+
auto parallel_for(T&, C&&, size_t = 0);
12151215

12161216
template <typename I, typename T, typename B>
12171217
auto reduce(I, I, T&, B&&);

0 commit comments

Comments
 (0)