SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
A set of benchmarks from some common base directory. More...
#include <BenchmarkSet.h>
Public Member Functions | |
void | add_directory (const std::filesystem::path &dir) |
Recursively find all benchmarks from this directory. More... | |
std::size_t | size () const |
Number of files. More... | |
auto | begin () const |
Begin iterator. More... | |
auto | end () const |
End iterator. More... | |
Private Member Functions | |
void | add_recursive (const std::filesystem::path &path) |
Recursively add all benchmarks from this path. More... | |
Private Attributes | |
std::vector< std::filesystem::path > | mFilesList |
List of files in this benchmark set. More... | |
A set of benchmarks from some common base directory.
Definition at line 12 of file BenchmarkSet.h.
void benchmax::BenchmarkSet::add_directory | ( | const std::filesystem::path & | dir | ) |
Recursively find all benchmarks from this directory.
Definition at line 40 of file BenchmarkSet.cpp.
|
private |
Recursively add all benchmarks from this path.
Definition at line 11 of file BenchmarkSet.cpp.
|
inline |
Begin iterator.
Definition at line 27 of file BenchmarkSet.h.
|
inline |
End iterator.
Definition at line 31 of file BenchmarkSet.h.
|
inline |
Number of files.
Definition at line 23 of file BenchmarkSet.h.
|
private |
List of files in this benchmark set.
Definition at line 15 of file BenchmarkSet.h.