34 lines
1.8 KiB
C++
34 lines
1.8 KiB
C++
|
// Step 673: Sprint 42 integration summary (8 tests)
|
||
|
|
|
||
|
|
#include "Sprint42IntegrationSummary.h"
|
||
|
|
#include <iostream>
|
||
|
|
|
||
|
|
static int p = 0, f = 0;
|
||
|
|
#define T(n) { std::cout << " " << #n << "... "; }
|
||
|
|
#define P() { std::cout << "PASS\n"; ++p; }
|
||
|
|
#define F(m) { std::cout << "FAIL: " << m << "\n"; ++f; }
|
||
|
|
#define C(c,m) if (!(c)) { F(m); return; }
|
||
|
|
|
||
|
|
void t1() { T(summary_constructable); auto r = Sprint42IntegrationSummary::run(); C(r.success || !r.success, "not constructable"); P(); }
|
||
|
|
void t2() { T(generate_project_wired); auto r = Sprint42IntegrationSummary::run(); C(r.generateProjectWired, "generate_project not wired"); P(); }
|
||
|
|
void t3() { T(generate_inference_job_wired); auto r = Sprint42IntegrationSummary::run(); C(r.generateInferenceJobWired, "generate_inference_job not wired"); P(); }
|
||
|
|
void t4() { T(tool_count_before_is_84); auto r = Sprint42IntegrationSummary::run(); C(r.toolCountBefore == 84, "expected 84"); P(); }
|
||
|
|
void t5() { T(tool_count_after_is_86); auto r = Sprint42IntegrationSummary::run(); C(r.toolCountAfter == 86, "expected 86"); P(); }
|
||
|
|
void t6() { T(steps_completed_is_5); auto r = Sprint42IntegrationSummary::run(); C(r.stepsCompleted == 5, "expected 5"); P(); }
|
||
|
|
void t7() {
|
||
|
|
T(files_added_contains_register_modeling_tools);
|
||
|
|
auto r = Sprint42IntegrationSummary::run();
|
||
|
|
bool found = false;
|
||
|
|
for (const auto& s : r.filesAdded) if (s.find("RegisterModelingTools") != std::string::npos) { found = true; break; }
|
||
|
|
C(found, "RegisterModelingTools.h missing from filesAdded");
|
||
|
|
P();
|
||
|
|
}
|
||
|
|
void t8() { T(overall_success); auto r = Sprint42IntegrationSummary::run(); C(r.success, "integration failed"); P(); }
|
||
|
|
|
||
|
|
int main() {
|
||
|
|
std::cout << "Step 673: Sprint 42 integration summary\n";
|
||
|
|
t1(); t2(); t3(); t4(); t5(); t6(); t7(); t8();
|
||
|
|
std::cout << "\nResults: " << p << "/" << (p + f) << " passed\n";
|
||
|
|
return f ? 1 : 0;
|
||
|
|
}
|