lopesivan
diff --git a/‎doc/QuickStart.dox‎
Lines changed: 5 additions & 5 deletions b/‎doc/QuickStart.dox‎
Lines changed: 5 additions & 5 deletions
diff --git a/‎doc/cookbook/Chapter1.dox‎
Lines changed: 32 additions & 36 deletions b/‎doc/cookbook/Chapter1.dox‎
Lines changed: 32 additions & 36 deletions
@@ -20,7 +20,7 @@ See a quick <a href="https://cpp-taskflow.github.io/">presentation</a> and visit
 @section HowToInstallCppTaskflow How to Install Cpp-Taskflow?
 
 Cpp-Taskflow is *header-only* and there is no need for installation.
-Simply download the source and copy the headers under the `taskflow` subdirectory to your project.
+Simply download the source and copy the headers under the @c taskflow subdirectory to your project.
 
 @code{.sh}
 ~$ git clone https://github.com/cpp-taskflow/cpp-taskflow.git
@@ -37,9 +37,9 @@ Here is a rather simple program to get you started.
 
 int main(){
 
-  tf::Taskflow tf;
+  tf::Taskflow taskflow;
 
-  auto [A, B, C, D] = tf.silent_emplace(
+  auto [A, B, C, D] = taskflow.silent_emplace(
     [] () { std::cout << "TaskA\n"; },               //  task dependency graph
     [] () { std::cout << "TaskB\n"; },               // 
     [] () { std::cout << "TaskC\n"; },               //          +---+          
@@ -51,7 +51,7 @@ int main(){
   B.precede(D);  // B runs before D                  //    |     +---+     |    
   C.precede(D);  // C runs before D                  //    +---->| C |-----+    
                                                      //          +---+          
-  tf.wait_for_all();  // block until finish
+  taskflow.wait_for_all();  // block until finish
 
   return 0;
 }
@@ -76,7 +76,7 @@ TaskB
 TaskD
 @endcode
 
-The execution order of B and C might differ as they can run concurrencly.
+The execution order of B and C might differ as they can run concurrently.
 
 @section SupportedCompilers Supported Compilers
 
 
@@ -3,7 +3,7 @@ namespace tf {
 /** @page chapter1 C1: Understand the %Task
 
 In this chapter, we demonstrate the basic construct of 
-a task dependency graph - tf::Task.
+a task dependency graph - Task.
 
 @section WhatIsATask What is a Task?
 
@@ -17,30 +17,28 @@ Taskflow::silent_emplace, and
 Taskflow::emplace to create a task.
 
 @code{.cpp}
-1: tf::Taskflow tf;
-2: auto A = tf.placeholder();
-3: auto B = tf.silent_emplace([] () {});
-4: auto [C, FuC] = tf.emplace([] () { return 1; });
+1: auto A = taskflow.placeholder();
+2: auto B = taskflow.silent_emplace([] () {});
+3: auto [C, FuC] = taskflow.emplace([] () { return 1; });
 @endcode
 
 Debrief:
-@li Line 1 creates a taskflow object
-@li Line 2 creates an empty task 
-@li Line 3 creates a task from a given callable object and returns a task handle
-@li Line 4 creates a task from a given callable object and returns, in addition to a task handle, a @std_future object to access the result
+@li Line 1 creates an empty task 
+@li Line 2 creates a task from a given callable object and returns a task handle
+@li Line 3 creates a task from a given callable object and returns, in addition to a task handle, a @std_future object to access the result
 
 Each time you create a task, including an empty one, 
 the taskflow object adds a node to the present graph
-and returns a task handle of type tf::Task.
+and returns a task handle of type Task.
 A task handle is a lightweight object
 that wraps up a particular node in a graph
 and provides a set of methods for you to assign different attributes to the task
 such as adding dependencies, naming, and assigning a new work.
 
 @code{.cpp}
- 1: tf::Taskflow tf;
- 2: auto A = tf.silent_emplace([] () { std::cout << "create a task A\n"; });
- 3: auto B = tf.silent_emplace([] () { std::cout << "create a task B\n"; });
+ 1: tf::Taskflow taskflow;
+ 2: auto A = taskflow.silent_emplace([] () { std::cout << "create a task A\n"; });
+ 3: auto B = taskflow.silent_emplace([] () { std::cout << "create a task B\n"; });
  4:
  5: A.name("TaskA");
  6: A.work([] () { std::cout << "reassign A to a new task\n"; });
@@ -74,9 +72,8 @@ the associated task finishes.
 This is particularly useful when you would like to pass data between tasks.
 
 @code{.cpp}
-tf::Taskflow tf;
-auto [A, FuA] = tf.emplace([](){ return 1; });
-tf.wait_for_all();
+auto [A, FuA] = taskflow.emplace([](){ return 1; });
+taskflow.wait_for_all();
 std::cout << FuA.get() << std::endl;   // 1
 @endcode
 
@@ -86,10 +83,9 @@ The execution does not start until you dispatch the graph.
 For example, the following code will block and never finish:
 
 @code{.cpp}
-tf::Taskflow tf;
-auto [A, FuA] = tf.emplace([](){ return 1; });
+auto [A, FuA] = taskflow.emplace([](){ return 1; });
 std::cout << FuA.get() << std::endl;   // block
-tf.wait_for_all();                     // never enter this line
+taskflow.wait_for_all();                     // never enter this line
 @endcode
 
 @section CreateMultipleTasksAtOneTime Create Multiple Tasks at One Time
@@ -100,7 +96,7 @@ Both Taskflow::silent_emplace and Taskflow::emplace can accept arbitrary numbers
 and create multiple tasks at one time.
 
 @code{.cpp}
-auto [A, B, C] = tf.silent_emplace(  // create three tasks in one call
+auto [A, B, C] = taskflow.silent_emplace(  // create three tasks in one call
   [](){ std::cout << "Task A\n"; },
   [](){ std::cout << "Task B\n"; },
   [](){ std::cout << "Task C\n"; }
@@ -129,36 +125,36 @@ task dependency graphs.
  2:
  3: int main() {
  4: 
- 5:   tf::Taskflow tf;
+ 5:   tf::Taskflow taskflow;
  6:
  7:   // create a task dependency graph
  8:   std::array<tf::Task, 4> tasks {
- 9:     tf.silent_emplace([] () { std::cout << "Task A\n"; }),
-10:     tf.silent_emplace([] () { std::cout << "Task B\n"; }),
-11:     tf.silent_emplace([] () { std::cout << "Task C\n"; }),
-12:     tf.silent_emplace([] () { std::cout << "Task D\n"; })
+ 9:     taskflow.silent_emplace([] () { std::cout << "Task A\n"; }),
+10:     taskflow.silent_emplace([] () { std::cout << "Task B\n"; }),
+11:     taskflow.silent_emplace([] () { std::cout << "Task C\n"; }),
+12:     taskflow.silent_emplace([] () { std::cout << "Task D\n"; })
 13:   };
 14:
 15:   tasks[0].precede(tasks[1]); 
 16:   tasks[0].precede(tasks[2]);
 17:   tasks[1].precede(tasks[3]);
 18:   tasks[2].precede(tasks[3]);
 19:
-20:   tf.wait_for_all();
+20:   taskflow.wait_for_all();
 21:
 22:   // create another task dependency graph
 23:   tasks = {
-24:     tf.silent_emplace([] () { std::cout << "New Task A\n"; }),
-25:     tf.silent_emplace([] () { std::cout << "New Task B\n"; }),
-26:     tf.silent_emplace([] () { std::cout << "New Task C\n"; }),
-27:     tf.silent_emplace([] () { std::cout << "New Task D\n"; })
+24:     taskflow.silent_emplace([] () { std::cout << "New Task A\n"; }),
+25:     taskflow.silent_emplace([] () { std::cout << "New Task B\n"; }),
+26:     taskflow.silent_emplace([] () { std::cout << "New Task C\n"; }),
+27:     taskflow.silent_emplace([] () { std::cout << "New Task D\n"; })
 28:   };
 29:
 30:   tasks[3].precede(tasks[2]);
 31:   tasks[2].precede(tasks[1]);
 32:   tasks[1].precede(tasks[0]);
 33:
-34:   tf.wait_for_all();
+34:   taskflow.wait_for_all();
 35:
 36:   return 0;
 37: }
@@ -189,11 +185,11 @@ the task handler.
  2:
  3: int main() {
  4:
- 5:   tf::Taskflow tf;
+ 5:   tf::Taskflow taskflow;
  6:
  7:   std::vector<tf::Task> tasks = { 
- 8:     tf.placeholder(),         // create a task with no work
- 9:     tf.placeholder()          // create a task with no work
+ 8:     taskflow.placeholder(),         // create a task with no work
+ 9:     taskflow.placeholder()          // create a task with no work
 10:   };
 11:
 12:   tasks[0].name("This is Task 0");
@@ -206,12 +202,12 @@ the task handler.
 19:               << "num_successors=" << task.num_successors() << '\n';
 20:   }
 21:
-22:   tf.dump(std::cout);         // dump the taskflow graph
+22:   taskflow.dump(std::cout);         // dump the taskflow graph
 23:
 24:   tasks[0].work([](){ std::cout << "got a new work!\n"; });
 25:   tasks[1].work([](){ std::cout << "got a new work!\n"; });
 26:
-27:   tf.wait_for_all();
+27:   taskflow.wait_for_all();
 28:
 29:   return 0;
 30: }