-
Notifications
You must be signed in to change notification settings - Fork 5
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
The most expensive operation of cruft is the filtering of the existing paths with the configured filters and excludes. Perform that task in parallel by using C++17 parallel algorithms. One downside is, since the standard library does not implement this functionality itself, this requires linking against tbb (Threading Building Blocks). Sequenced: Benchmark 1: ./cruft -E ./explain/ -F ./rules/ -I ./ignore -R ./ruleset Time (mean ± σ): 7.179 s ± 0.079 s [User: 6.366 s, System: 2.519 s] Range (min … max): 7.060 s … 7.291 s 10 runs Parallel: Benchmark 1: ./cruft -E ./explain/ -F ./rules/ -I ./ignore -R ./ruleset Time (mean ± σ): 4.762 s ± 0.058 s [User: 6.659 s, System: 2.414 s] Range (min … max): 4.682 s … 4.849 s 10 runs
- Loading branch information
Showing
3 changed files
with
57 additions
and
26 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters