1696b92bb8
Sprints 46-58 implement the cross-language porting foundation: language-to-IR adapters, equivalence checking, gate validation, legacy ingestion, managed/dynamic families, low-level/logic-actor semantics, debug workflow tooling, AST-native family tools, Rust/CPP raising tools, system-level orchestration, query family, and porting gates. Sprint 59 adds the governance layer (policy packs, review boards, waiver packets, ambiguity triage, decision ledger) with the whetstone_review_porting_decision MCP tool. Also includes: sprint plans 46-130, MCP taskitem pipeline scripts, CLAUDE.md, docs, and full test matrix (steps 689-828). Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
20 lines
1.7 KiB
C++
20 lines
1.7 KiB
C++
// Step 813: Review queue generator (10 tests)
|
|
#include "legacy_ingestion/ReviewQueueGenerator.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(queue_length);auto q=ReviewQueueGenerator::build({"a","b"});C(q.size()==2,"len");P();}
|
|
void t2(){T(levels_high_medium);auto q=ReviewQueueGenerator::build({"a","b"});C(q[0].level=="high"&&q[1].level=="medium","levels");P();}
|
|
void t3(){T(urgent_true);auto q=ReviewQueueGenerator::build({"a"});C(q[0].urgent,"urgent");P();}
|
|
void t4(){T(json_shape);auto j=ReviewQueueGenerator::toJson(ReviewQueueGenerator::build({"a"})[0]);C(j.contains("id")&&j.contains("level"),"shape");P();}
|
|
void t5(){T(machine_readable);auto j=ReviewQueueGenerator::toJson(ReviewQueueGenerator::build({"a"})[0]);C(j.is_object(),"obj");P();}
|
|
void t6(){T(deterministic);auto a=ReviewQueueGenerator::toJson(ReviewQueueGenerator::build({"a"})[0]).dump();auto b=ReviewQueueGenerator::toJson(ReviewQueueGenerator::build({"a"})[0]).dump();C(a==b,"det");P();}
|
|
void t7(){T(id_from_input);auto q=ReviewQueueGenerator::build({"test"});C(q[0].id=="test","id");P();}
|
|
void t8(){T(order_preserved);auto q=ReviewQueueGenerator::build({"x","y"});C(q[0].id=="x","order");P();}
|
|
void t9(){T(level_cycle);auto q=ReviewQueueGenerator::build({"x","y","z"});C(q[2].level=="high","level");P();}
|
|
void t10(){T(queue_nonempty_for_single);auto q=ReviewQueueGenerator::build({"x"});C(!q.empty(),"queue");P();}
|
|
int main(){std::cout<<"Step 813: ReviewQueueGenerator\n";t1();t2();t3();t4();t5();t6();t7();t8();t9();t10();std::cout<<"\nResults: "<<p<<"/"<<(p+f)<<" passed\n";return f?1:0;}
|