| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #include "AlgorithmSequence.h" | ||
| 2 | |||
| 3 | namespace iguana { | ||
| 4 | |||
| 5 | REGISTER_IGUANA_ALGORITHM(AlgorithmSequence); | ||
| 6 | |||
| 7 | 22 | void AlgorithmSequence::Start(hipo::banklist& banks) | |
| 8 | { | ||
| 9 |
2/2✓ Branch 0 (5→3) taken 36 times.
✓ Branch 1 (5→6) taken 22 times.
|
58 | for(auto const& algo : m_sequence) |
| 10 | 36 | algo->Start(banks); | |
| 11 | 22 | } | |
| 12 | 21100 | void AlgorithmSequence::Run(hipo::banklist& banks) const | |
| 13 | { | ||
| 14 |
2/2✓ Branch 0 (5→3) taken 33300 times.
✓ Branch 1 (5→6) taken 21100 times.
|
54400 | for(auto const& algo : m_sequence) |
| 15 | 33300 | algo->Run(banks); | |
| 16 | 21100 | } | |
| 17 | 13 | void AlgorithmSequence::Stop() | |
| 18 | { | ||
| 19 |
2/2✓ Branch 0 (5→3) taken 19 times.
✓ Branch 1 (5→6) taken 13 times.
|
32 | for(auto const& algo : m_sequence) |
| 20 | 19 | algo->Stop(); | |
| 21 | 13 | } | |
| 22 | |||
| 23 | 36 | void AlgorithmSequence::Add(std::string const& class_name, std::string const& instance_name) | |
| 24 | { | ||
| 25 | 36 | auto algo = AlgorithmFactory::Create(class_name); | |
| 26 |
1/2✗ Branch 0 (3→4) not taken.
✓ Branch 1 (3→11) taken 36 times.
|
36 | if(algo == nullptr) { |
| 27 | ✗ | m_log->Error("algorithm '{}' does not exist", class_name); | |
| 28 | ✗ | throw std::runtime_error("AlgorithmFactory cannot create non-existent algorithm"); | |
| 29 | } | ||
| 30 |
2/4✗ Branch 0 (11→12) not taken.
✓ Branch 1 (11→13) taken 36 times.
✓ Branch 2 (13→14) taken 36 times.
✗ Branch 3 (13→23) not taken.
|
36 | algo->SetName(instance_name == "" ? class_name : instance_name); |
| 31 |
1/2✓ Branch 0 (14→15) taken 36 times.
✗ Branch 1 (14→23) not taken.
|
36 | Add(std::move(algo)); |
| 32 | 36 | } | |
| 33 | |||
| 34 | 36 | void AlgorithmSequence::Add(algo_t&& algo) | |
| 35 | { | ||
| 36 | 36 | auto algoName = algo->GetName(); | |
| 37 |
1/2✓ Branch 0 (6→7) taken 36 times.
✗ Branch 1 (6→33) not taken.
|
36 | m_algo_names.insert({algoName, m_sequence.size()}); |
| 38 | // prepend sequence name to algorithm name | ||
| 39 |
2/4✓ Branch 0 (6→7) taken 36 times.
✗ Branch 1 (6→33) not taken.
✓ Branch 2 (9→10) taken 36 times.
✗ Branch 3 (9→25) not taken.
|
72 | algo->SetName(m_name + "|" + algoName); |
| 40 | // append algorithm to the sequence | ||
| 41 |
1/2✓ Branch 0 (12→13) taken 36 times.
✗ Branch 1 (12→33) not taken.
|
36 | m_sequence.push_back(std::move(algo)); |
| 42 | // check for duplicate algorithm name | ||
| 43 |
1/2✗ Branch 0 (13→14) not taken.
✓ Branch 1 (13→21) taken 36 times.
|
36 | if(m_algo_names.size() < m_sequence.size()) { |
| 44 | ✗ | m_log->Error("Duplicate algorithm name '{}' detected; please make sure all of your algorithms have unique names", algoName); | |
| 45 | ✗ | throw std::runtime_error("cannot Add algorithm"); | |
| 46 | } | ||
| 47 | 36 | } | |
| 48 | |||
| 49 | 12 | void AlgorithmSequence::SetName(std::string_view name) | |
| 50 | { | ||
| 51 | // change the `m_name+"|"` prefix of each algorithm | ||
| 52 |
2/2✓ Branch 0 (27→3) taken 16 times.
✓ Branch 1 (27→28) taken 12 times.
|
28 | for(auto const& algo : m_sequence) { |
| 53 | 16 | auto algoName = algo->GetName(); | |
| 54 |
1/2✓ Branch 0 (4→5) taken 16 times.
✗ Branch 1 (4→14) not taken.
|
16 | if(auto pos{algoName.find("|")}; pos != algoName.npos) |
| 55 |
3/6✓ Branch 0 (5→6) taken 16 times.
✗ Branch 1 (5→42) not taken.
✓ Branch 2 (8→9) taken 16 times.
✗ Branch 3 (8→32) not taken.
✓ Branch 4 (9→10) taken 16 times.
✗ Branch 5 (9→30) not taken.
|
48 | algo->SetName(std::string(name) + algoName.substr(pos)); |
| 56 | else | ||
| 57 | ✗ | algo->SetName(std::string(name) + "|" + algoName); | |
| 58 | } | ||
| 59 | // then change the object name | ||
| 60 | 12 | Algorithm::SetName(name); | |
| 61 | 12 | } | |
| 62 | |||
| 63 | 12 | void AlgorithmSequence::PrintSequence(Logger::Level level) const | |
| 64 | { | ||
| 65 | 12 | m_log->Print(level, "algorithms in this sequence:"); | |
| 66 |
2/2✓ Branch 0 (8→4) taken 16 times.
✓ Branch 1 (8→9) taken 12 times.
|
28 | for(auto const& algo : m_sequence) |
| 67 |
1/2✓ Branch 0 (5→6) taken 16 times.
✗ Branch 1 (5→10) not taken.
|
16 | m_log->Print(level, " - {}", algo->GetName()); |
| 68 | 12 | } | |
| 69 | |||
| 70 | ✗ | void AlgorithmSequence::SetConfigFileForEachAlgorithm(std::string const& name) | |
| 71 | { | ||
| 72 | ✗ | for(auto const& algo : m_sequence) | |
| 73 | ✗ | algo->SetConfigFile(name); | |
| 74 | ✗ | } | |
| 75 | |||
| 76 | ✗ | void AlgorithmSequence::SetConfigDirectoryForEachAlgorithm(std::string const& name) | |
| 77 | { | ||
| 78 | ✗ | for(auto const& algo : m_sequence) | |
| 79 | ✗ | algo->SetConfigDirectory(name); | |
| 80 | ✗ | } | |
| 81 | |||
| 82 | ✗ | void AlgorithmSequence::ForEachAlgorithm(std::function<void(algo_t&)> func) | |
| 83 | { | ||
| 84 | ✗ | for(auto& algo : m_sequence) | |
| 85 | func(algo); | ||
| 86 | ✗ | } | |
| 87 | |||
| 88 | } | ||
| 89 |