... | ... | @@ -8,14 +8,23 @@ As a simple introduction, we will implement an architecture which counts all fil |
|
|
In order to work with TeeTime you need to make sure it is added to your project. Further assistance on doing so can be found in the download section.
|
|
|
|
|
|
|
|
|
### Logic Segregation
|
|
|
### Logic segregation
|
|
|
|
|
|
The Pipe&Filter architecture is well known for its capability to divide work into disjoint steps.
|
|
|
As - for example - a car manufacturer which divides the assembly of a new car into different steps to increase efficiency and throughput, we will also follow this guideline in our work with TeeTime.
|
|
|
As a first step, we need to find out which steps are run by a "File Counter". // Can be expressed in a better way
|
|
|
|
|
|
|
|
|
At first, we look recursively for all nested directories and pass each one of them to the next step.
|
|
|
The second step is to read the given directory and pass all containing files one by one to the next processing step.
|
|
|
We count all files by incrementing a counter upon each sent file.
|
|
|
The last stage will save or print the number. |
|
|
At first, we look recursively for all nested directories, read each directory and pass all containing files one by one to the next processing step.
|
|
|
Next, we count all files by incrementing a counter upon each sent file.
|
|
|
The last stage will save or print the resulting number.
|
|
|
|
|
|
|
|
|
Our mission is to implement those four stages as seperate filter and connect them.
|
|
|
In the following we will learn how to implement a stage.
|
|
|
|
|
|
### Implementing a stage
|
|
|
|
|
|
This section will explain the implementation of those exact stages.
|
|
|
If you want to dig deeper into the implementation mechanisms of the TeeTime framework, we recommend to take a look at [INSERT LINK](#).
|
|
|
|