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
2.1 KiB
C++
20 lines
2.1 KiB
C++
// Step 754: Dynamic strictness policy engine (10 tests)
|
|
#include "dynamic/DynamicStrictnessPolicy.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(lenient_mode);auto policy=DynamicStrictnessPolicyEngine::forMode("lenient");C(policy.mode=="lenient","mode");P();}
|
|
void t2(){T(lenient_allows_any);auto policy=DynamicStrictnessPolicyEngine::forMode("lenient");C(policy.allowImplicitAny,"any");P();}
|
|
void t3(){T(strict_mode);auto policy=DynamicStrictnessPolicyEngine::forMode("strict");C(policy.mode=="strict","mode");P();}
|
|
void t4(){T(strict_disallows_any);auto policy=DynamicStrictnessPolicyEngine::forMode("strict");C(!policy.allowImplicitAny,"any");P();}
|
|
void t5(){T(balanced_default);auto policy=DynamicStrictnessPolicyEngine::forMode("other");C(policy.mode=="balanced","mode");P();}
|
|
void t6(){T(review_required_in_strict);auto policy=DynamicStrictnessPolicyEngine::forMode("strict");C(policy.requireReviewOnDynamicDispatch,"rev");P();}
|
|
void t7(){T(json_shape);auto j=DynamicStrictnessPolicyEngine::toJson(DynamicStrictnessPolicyEngine::forMode("strict"));C(j.contains("mode")&&j.contains("allow_implicit_any")&&j.contains("require_review_on_dynamic_dispatch"),"shape");P();}
|
|
void t8(){T(machine_readable);auto j=DynamicStrictnessPolicyEngine::toJson(DynamicStrictnessPolicyEngine::forMode("strict"));C(j.is_object(),"obj");P();}
|
|
void t9(){T(deterministic);auto a=DynamicStrictnessPolicyEngine::toJson(DynamicStrictnessPolicyEngine::forMode("balanced")).dump();auto b=DynamicStrictnessPolicyEngine::toJson(DynamicStrictnessPolicyEngine::forMode("balanced")).dump();C(a==b,"det");P();}
|
|
void t10(){T(lenient_review_optional);auto policy=DynamicStrictnessPolicyEngine::forMode("lenient");C(!policy.requireReviewOnDynamicDispatch,"rev");P();}
|
|
int main(){std::cout<<"Step 754: DynamicStrictnessPolicyEngine\n";t1();t2();t3();t4();t5();t6();t7();t8();t9();t10();std::cout<<"\nResults: "<<p<<"/"<<(p+f)<<" passed\n";return f?1:0;}
|