groundswell 0.0.1 → 0.0.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (242) hide show
  1. package/.claude/commands/subtask-planning/prp-base-create.md +120 -0
  2. package/.claude/commands/subtask-planning/prp-base-execute.md +65 -0
  3. package/.claude/commands/task-breakdown.md +94 -0
  4. package/.claude/system_prompts/task-breakdown.md +1 -0
  5. package/CHANGELOG.md +188 -0
  6. package/PRD.md +543 -0
  7. package/README.md +99 -5
  8. package/examples/README.md +15 -1
  9. package/examples/examples/11-reparenting-workflows.ts +269 -0
  10. package/examples/index.ts +4 -0
  11. package/package-lock.json +2398 -0
  12. package/package.json +3 -1
  13. package/plan/001_d3bb02af4886/TEST_RESULTS.md +259 -0
  14. package/plan/001_d3bb02af4886/bug_fix_tasks.json +484 -0
  15. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M1T1S1/PRP.md +488 -0
  16. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M1T1S2/PRP.md +581 -0
  17. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M1T1S3/PRP.md +687 -0
  18. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T1S1/PRP.md +492 -0
  19. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T1S3/PRP.md +932 -0
  20. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T1S3/research/concurrent_error_testing_patterns.md +1109 -0
  21. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T1S3/research/vitest_concurrent_testing.md +802 -0
  22. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T1S3/research/workflow_engine_test_references.md +603 -0
  23. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T2S1/PRP.md +564 -0
  24. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T2S3/PRP.md +518 -0
  25. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T2S4/PRP.md +1252 -0
  26. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T3S1/PRP.md +364 -0
  27. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T3S1/research/CODEBASE_INVENTORY.md +114 -0
  28. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T3S1/research/DECORATOR_DOCUMENTATION_PATTERNS.md +205 -0
  29. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T3S1/research/PRD_LOCATION_ANALYSIS.md +199 -0
  30. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M2T3S1/research/ULTRATHINK_PRP_PLAN.md +134 -0
  31. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T1S1/PRP.md +495 -0
  32. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T1S1/research/console_error_inventory.md +435 -0
  33. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T1S2/PRP.md +506 -0
  34. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T1S3/PRP.md +612 -0
  35. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T2S2/PRP.md +558 -0
  36. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T2S2/research/external_research.md +788 -0
  37. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T3S2/PRP.md +460 -0
  38. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T3S3/PRP.md +454 -0
  39. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T4S1/PRP.md +520 -0
  40. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T4S1/RECOMMENDATION.md +417 -0
  41. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T4S1/research/external_workflow_engines_research.md +760 -0
  42. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T4S1/research/security_implications_analysis.md +245 -0
  43. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M3T4S2/PRP.md +792 -0
  44. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M4T1S1/PRP.md +535 -0
  45. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M4T1S1/TEST_EXECUTION_REPORT.md +190 -0
  46. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M4T1S2/PRP.md +654 -0
  47. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M4T1S2/TEST_FIX_REPORT.md +227 -0
  48. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M4T1S2/research/KEY_FINDINGS.md +345 -0
  49. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M4T1S2/research/QUICK_REFERENCE.md +193 -0
  50. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M4T1S2/research/test_maintenance_research.md +1323 -0
  51. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M4T3S1/BREAKING_CHANGES_AUDIT.md +1011 -0
  52. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M4T3S1/PRP.md +927 -0
  53. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/P1M4T3S2/PRP.md +505 -0
  54. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/architecture/logger_child_signature_analysis.md +401 -0
  55. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M1T1S3/child_implementation_research.md +142 -0
  56. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M1T1S3/test_patterns_research.md +112 -0
  57. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M1T1S3/vitest_patterns_research.md +159 -0
  58. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M1T1S4/PRP.md +549 -0
  59. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M1T1S4/VERIFICATION_REPORT.md +368 -0
  60. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M1T1S4/edge_case_analysis.md +172 -0
  61. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M1T1S4/usage_inventory.md +175 -0
  62. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T1S2/PRP.md +696 -0
  63. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T1S4/PRP.md +860 -0
  64. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/PRP.md +1066 -0
  65. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/01-testing-aggregated-errors.md +1103 -0
  66. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/01_typescript_error_aggregation_patterns.md +789 -0
  67. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/02-error-merge-strategy-testing-guide.md +1098 -0
  68. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/02_aggregate_error_patterns.md +1037 -0
  69. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/03-promise-allsettled-testing-patterns.md +916 -0
  70. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/03_error_merging_strategies.md +1045 -0
  71. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/04_github_stackoverflow_examples.md +890 -0
  72. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/05_comprehensive_summary.md +822 -0
  73. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/INDEX.md +668 -0
  74. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/QUICK_REFERENCE.md +706 -0
  75. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/README.md +265 -0
  76. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S2/research/RESEARCH_REPORT.md +655 -0
  77. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T2S4/research/vitest_testing_patterns.md +1103 -0
  78. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M2T3S2/PRP.md +426 -0
  79. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T1S2/PRP.md +506 -0
  80. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T1S2/research/QUICK_REFERENCE.md +114 -0
  81. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T1S2/research/RESEARCH_SUMMARY.md +316 -0
  82. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T1S2/research/vitest_observer_error_logging_best_practices.md +754 -0
  83. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T1S3/PRP.md +612 -0
  84. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T2S1/PRP.md +719 -0
  85. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T2S1/README.md +215 -0
  86. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T2S1/analysis.md +765 -0
  87. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T2S3/PRP.md +718 -0
  88. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T3S1/DECISION.md +149 -0
  89. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T3S1/PRP.md +470 -0
  90. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T3S1/research/ULTRATHINK_PLAN.md +332 -0
  91. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T3S1/research/codebase_workflow_name_analysis.md +167 -0
  92. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T3S1/research/external_best_practices.md +265 -0
  93. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T3S1/research/validation_patterns.md +273 -0
  94. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T4S1/workflow_engine_ancestry_api_research.md +760 -0
  95. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M3T4S3-PRP.md +434 -0
  96. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M4T2S1/PRP.md +717 -0
  97. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M4T2S2/PRP.md +472 -0
  98. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M4T2S2/VALIDATION_REPORT.md +125 -0
  99. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/P1M4T2S2/research/ULTRATHINK_PRP_PLAN.md +301 -0
  100. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/error-logging-best-practices.md +1170 -0
  101. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/research_typescript_partial_and_overloads.md +940 -0
  102. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/vitest-quick-reference.md +151 -0
  103. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/docs/vitest-research.md +650 -0
  104. package/plan/001_d3bb02af4886/bugfix/001_e8e04329daf3/prd_snapshot.md +259 -0
  105. package/plan/001_d3bb02af4886/bugfix/P1M1T1S1/PRP.md +457 -0
  106. package/plan/001_d3bb02af4886/bugfix/RESEARCH_SUMMARY.md +346 -0
  107. package/plan/001_d3bb02af4886/bugfix/architecture/codebase_structure.md +311 -0
  108. package/plan/001_d3bb02af4886/bugfix/architecture/concurrent_execution_best_practices.md +1565 -0
  109. package/plan/001_d3bb02af4886/bugfix/architecture/error_handling_patterns.md +288 -0
  110. package/plan/001_d3bb02af4886/bugfix/architecture/promise_all_analysis.md +741 -0
  111. package/plan/001_d3bb02af4886/docs/PRP/P1M1T1S4-functional-workflow-error-state-capture-test.md +652 -0
  112. package/plan/001_d3bb02af4886/docs/PRP/PRP.md +527 -0
  113. package/plan/001_d3bb02af4886/docs/PRP/bugfix/P1M1T2S1-PRP.md +415 -0
  114. package/plan/001_d3bb02af4886/docs/PRP/bugfix/P1M1T2S2-PRP.md +378 -0
  115. package/plan/001_d3bb02af4886/docs/PRP/bugfix/P1M1T2S4-PRP.md +713 -0
  116. package/plan/001_d3bb02af4886/docs/PRP/bugfix/P1M2T1S4-PRP.md +370 -0
  117. package/plan/001_d3bb02af4886/docs/PRP_P1M3T1S3.md +499 -0
  118. package/plan/001_d3bb02af4886/docs/TEST_RESULTS.md +230 -0
  119. package/plan/001_d3bb02af4886/docs/bugfix/ANALYSIS_PRD_VS_IMPLEMENTATION.md +1134 -0
  120. package/plan/001_d3bb02af4886/docs/bugfix/GAP_ANALYSIS_SUMMARY.md +179 -0
  121. package/plan/001_d3bb02af4886/docs/bugfix/P1M4T2S1/PRP.md +629 -0
  122. package/plan/001_d3bb02af4886/docs/bugfix/P1M4T2S1/validation-report.md +214 -0
  123. package/plan/001_d3bb02af4886/docs/bugfix/PRP_P1M4T2S3.md +629 -0
  124. package/plan/001_d3bb02af4886/docs/bugfix/bugfix_PRP.md +529 -0
  125. package/plan/001_d3bb02af4886/docs/bugfix/bugfix_QUICK_REFERENCE.md +142 -0
  126. package/plan/001_d3bb02af4886/docs/bugfix/bugfix_README.md +304 -0
  127. package/plan/001_d3bb02af4886/docs/bugfix/bugfix_TEST_RESULTS.md +558 -0
  128. package/plan/001_d3bb02af4886/docs/bugfix/bugfix_VALIDATION_SUMMARY.md +256 -0
  129. package/plan/001_d3bb02af4886/docs/bugfix/system_context.md +346 -0
  130. package/plan/001_d3bb02af4886/docs/bugfix-architecture/bug_analysis.md +415 -0
  131. package/plan/001_d3bb02af4886/docs/bugfix-architecture/implementation_patterns.md +489 -0
  132. package/plan/001_d3bb02af4886/docs/bugfix-architecture/system_context.md +218 -0
  133. package/plan/001_d3bb02af4886/docs/bugfix_INITIATION_SUMMARY.md +380 -0
  134. package/plan/001_d3bb02af4886/docs/research/CYCLE_DETECTION_PATTERNS.md +1923 -0
  135. package/plan/001_d3bb02af4886/docs/research/CYCLE_DETECTION_QUICK_REF.md +319 -0
  136. package/plan/001_d3bb02af4886/docs/research/P1M1T2S1/codebase-context.md +115 -0
  137. package/plan/001_d3bb02af4886/docs/research/P1M1T2S1/cycle-detection-algorithms.md +134 -0
  138. package/plan/001_d3bb02af4886/docs/research/P1M1T2S1/test-patterns.md +153 -0
  139. package/plan/001_d3bb02af4886/docs/research/P1M1T2S1/workflow-class.md +132 -0
  140. package/plan/001_d3bb02af4886/docs/research/P1M2T1S4/DECORATOR_DOCUMENTATION_BEST_PRACTICES.md +716 -0
  141. package/plan/001_d3bb02af4886/docs/research/P1M2T1S4/DECORATOR_DOCUMENTATION_QUICK_REF.md +186 -0
  142. package/plan/001_d3bb02af4886/docs/research/P1M2T1S4/GROUNDSWELL_DECORATOR_EXAMPLES.md +604 -0
  143. package/plan/001_d3bb02af4886/docs/research/P1M2T1S4/INDEX.md +213 -0
  144. package/plan/001_d3bb02af4886/docs/research/P1M2T1S4/codebase_structure.md +30 -0
  145. package/plan/001_d3bb02af4886/docs/research/P1M2T1S4/existing_test_pattern.md +56 -0
  146. package/plan/001_d3bb02af4886/docs/research/P1M2T1S4/getRootObservers_implementation.md +53 -0
  147. package/plan/001_d3bb02af4886/docs/research/P1M2T1S4/test_conventions.md +49 -0
  148. package/plan/001_d3bb02af4886/docs/research/P1M3T1S4/PRP.md +958 -0
  149. package/plan/001_d3bb02af4886/docs/research/P1M3T1S4/QUICK_REFERENCE.md +339 -0
  150. package/plan/001_d3bb02af4886/docs/research/P1M3T1S4/README.md +305 -0
  151. package/plan/001_d3bb02af4886/docs/research/P1M3T1S4/SUMMARY.md +433 -0
  152. package/plan/001_d3bb02af4886/docs/research/P1M3T1S4/bidirectional-tree-consistency-testing.md +1574 -0
  153. package/plan/001_d3bb02af4886/docs/research/P1M3T1S4/test-pattern-examples.md +1014 -0
  154. package/plan/001_d3bb02af4886/docs/research/PROMISE_ALLSETTLED_QUICK_REF.md +376 -0
  155. package/plan/001_d3bb02af4886/docs/research/PROMISE_ALLSETTLED_RESEARCH.md +1507 -0
  156. package/plan/001_d3bb02af4886/docs/research/bugfix_typescript_patterns.md +949 -0
  157. package/plan/001_d3bb02af4886/docs/research/error-testing-research.md +619 -0
  158. package/plan/001_d3bb02af4886/docs/research/error_handling_patterns.md +723 -0
  159. package/plan/{research → 001_d3bb02af4886/docs/research/general}/introspection-security-guide.md +56 -0
  160. package/plan/001_d3bb02af4886/docs/research/incremental-tree-map-updates/PRP_TEMPLATE.md +460 -0
  161. package/plan/001_d3bb02af4886/docs/research/incremental-tree-map-updates/QUICK_REFERENCE.md +324 -0
  162. package/plan/001_d3bb02af4886/docs/research/incremental-tree-map-updates/README.md +175 -0
  163. package/plan/001_d3bb02af4886/docs/research/incremental-tree-map-updates/RESEARCH_REPORT.md +499 -0
  164. package/plan/001_d3bb02af4886/docs/research/incremental-tree-map-updates/SUMMARY.md +163 -0
  165. package/plan/bugfix/BUG_FIX_SUMMARY.md +961 -0
  166. package/src/__tests__/adversarial/attachChild-performance.test.ts +216 -0
  167. package/src/__tests__/adversarial/circular-reference.test.ts +101 -0
  168. package/src/__tests__/adversarial/complex-circular-reference.test.ts +139 -0
  169. package/src/__tests__/adversarial/concurrent-task-failures.test.ts +571 -0
  170. package/src/__tests__/adversarial/deep-analysis.test.ts +729 -0
  171. package/src/__tests__/adversarial/deep-hierarchy-stress.test.ts +213 -0
  172. package/src/__tests__/adversarial/e2e-prd-validation.test.ts +448 -0
  173. package/src/__tests__/adversarial/edge-case.test.ts +703 -0
  174. package/src/__tests__/adversarial/error-merge-strategy.test.ts +760 -0
  175. package/src/__tests__/adversarial/incremental-performance.test.ts +140 -0
  176. package/src/__tests__/adversarial/node-map-update-benchmarks.test.ts +457 -0
  177. package/src/__tests__/adversarial/observer-propagation.test.ts +487 -0
  178. package/src/__tests__/adversarial/parent-validation.test.ts +143 -0
  179. package/src/__tests__/adversarial/prd-12-2-compliance.test.ts +611 -0
  180. package/src/__tests__/adversarial/prd-compliance.test.ts +731 -0
  181. package/src/__tests__/compatibility/backward-compatibility.test.ts +1572 -0
  182. package/src/__tests__/helpers/index.ts +18 -0
  183. package/src/__tests__/helpers/tree-verification.ts +257 -0
  184. package/src/__tests__/integration/bidirectional-consistency.test.ts +847 -0
  185. package/src/__tests__/integration/observer-logging.test.ts +643 -0
  186. package/src/__tests__/integration/tree-mirroring.test.ts +37 -0
  187. package/src/__tests__/integration/workflow-reparenting.test.ts +303 -0
  188. package/src/__tests__/unit/context.test.ts +79 -0
  189. package/src/__tests__/unit/logger.test.ts +293 -0
  190. package/src/__tests__/unit/observable.test.ts +321 -0
  191. package/src/__tests__/unit/tree-debugger-incremental.test.ts +170 -0
  192. package/src/__tests__/unit/utils/workflow-error-utils.test.ts +209 -0
  193. package/src/__tests__/unit/workflow-detachChild.test.ts +100 -0
  194. package/src/__tests__/unit/workflow-emitEvent-childDetached.test.ts +153 -0
  195. package/src/__tests__/unit/workflow-isDescendantOf.test.ts +180 -0
  196. package/src/__tests__/unit/workflow.test.ts +277 -1
  197. package/src/core/agent.ts +21 -1
  198. package/src/core/logger.ts +27 -2
  199. package/src/core/workflow-context.ts +6 -4
  200. package/src/core/workflow.ts +252 -14
  201. package/src/debugger/tree-debugger.ts +52 -7
  202. package/src/decorators/task.ts +65 -2
  203. package/src/index.ts +4 -2
  204. package/src/types/decorators.ts +8 -1
  205. package/src/types/events.ts +1 -0
  206. package/src/utils/index.ts +1 -0
  207. package/src/utils/observable.ts +32 -3
  208. package/src/utils/workflow-error-utils.ts +56 -0
  209. package/tsconfig.json +1 -1
  210. package/llms_full.txt +0 -5890
  211. package/tasks.json +0 -0
  212. /package/plan/{backlog.json → 001_d3bb02af4886/backlog.json} +0 -0
  213. /package/plan/{P1P2/PRP.md → 001_d3bb02af4886/docs/PRP/P1P2-PRP.md} +0 -0
  214. /package/plan/{P3P4/PRP.md → 001_d3bb02af4886/docs/PRP/P3P4-PRP.md} +0 -0
  215. /package/plan/{P4P5/PRP.md → 001_d3bb02af4886/docs/PRP/P4P5-PRP.md} +0 -0
  216. /package/plan/{architecture → 001_d3bb02af4886/docs/architecture}/external_deps.md +0 -0
  217. /package/plan/{architecture → 001_d3bb02af4886/docs/architecture}/system_context.md +0 -0
  218. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/LRU_CACHE_BEST_PRACTICES.md +0 -0
  219. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/LRU_CACHE_CODE_PATTERNS.md +0 -0
  220. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/LRU_CACHE_INTEGRATION_GUIDE.md +0 -0
  221. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/LRU_CACHE_RESEARCH_INDEX.md +0 -0
  222. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/REFLECTION_INDEX.md +0 -0
  223. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/REFLECTION_RESEARCH_REPORT.md +0 -0
  224. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/RESEARCH_SUMMARY.md +0 -0
  225. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/anthropic-sdk.md +0 -0
  226. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/async-local-storage.md +0 -0
  227. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/reflection-code-patterns.md +0 -0
  228. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/reflection-decision-matrix.md +0 -0
  229. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/reflection-implementation-guide.md +0 -0
  230. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/reflection-integration-guide.md +0 -0
  231. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/reflection-patterns.md +0 -0
  232. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/reflection-quick-reference.md +0 -0
  233. /package/plan/{P1P2/research → 001_d3bb02af4886/docs/research/P1P2}/zod-schema.md +0 -0
  234. /package/plan/{P3P4/research → 001_d3bb02af4886/docs/research/P3P4}/caching-lru.md +0 -0
  235. /package/plan/{P3P4/research → 001_d3bb02af4886/docs/research/P3P4}/introspection-tools.md +0 -0
  236. /package/plan/{P3P4/research → 001_d3bb02af4886/docs/research/P3P4}/reflection-patterns.md +0 -0
  237. /package/plan/{P4P5/research → 001_d3bb02af4886/docs/research/P4P5}/RESEARCH_SUMMARY.md +0 -0
  238. /package/plan/{research → 001_d3bb02af4886/docs/research/general}/INTROSPECTION_RESEARCH_SUMMARY.md +0 -0
  239. /package/plan/{research → 001_d3bb02af4886/docs/research/general}/README-INTROSPECTION.md +0 -0
  240. /package/plan/{research → 001_d3bb02af4886/docs/research/general}/agent-introspection-patterns.md +0 -0
  241. /package/plan/{research → 001_d3bb02af4886/docs/research/general}/introspection-tool-examples.md +0 -0
  242. /package/{PRPs/PRDs/001-hierarchical-workflow-engine.md → plan/001_d3bb02af4886/prd_snapshot.md} +0 -0
@@ -0,0 +1,611 @@
1
+ /**
2
+ * PRD Section 12.2 Compliance Tests
3
+ *
4
+ * PRD Reference: PRPs/PRDs/001-hierarchical-workflow-engine.md, Section 12.2 (lines 311-368)
5
+ *
6
+ * These tests explicitly validate ALL requirements from PRD Section 12.2 for the Workflow Base Class
7
+ * related to parent-child tree structure integrity:
8
+ *
9
+ * PRD Section 12.2 Requirements:
10
+ * 1. Child has exactly one parent
11
+ * 2. child.parent matches parent (bidirectional link)
12
+ * 3. Child appears in only one parent's children array
13
+ * 4. Node tree mirrors workflow tree (1:1 correspondence)
14
+ *
15
+ * Each test includes clear documentation linking assertions to specific PRD requirements.
16
+ *
17
+ * Related: plan/bugfix/P1M3T2S1/PRP.md - PRD compliance validation for attachChild() bug fix
18
+ */
19
+
20
+ import { describe, it, expect, beforeEach, vi } from "vitest";
21
+ import { Workflow } from "../../index.js";
22
+ import {
23
+ verifyBidirectionalLink,
24
+ verifyTreeMirror,
25
+ validateTreeConsistency,
26
+ } from "../helpers/tree-verification.js";
27
+
28
+ /**
29
+ * SimpleWorkflow class for testing
30
+ * Pattern from: src/__tests__/adversarial/parent-validation.test.ts:20-26
31
+ */
32
+ class SimpleWorkflow extends Workflow {
33
+ async run(): Promise<string> {
34
+ this.setStatus("running");
35
+ this.setStatus("completed");
36
+ return "done";
37
+ }
38
+ }
39
+
40
+ // ============================================================================
41
+ // PRD Section 12.2: Workflow Base Class - Tree Integrity Requirements
42
+ // ============================================================================
43
+
44
+ describe("PRD Section 12.2: Workflow Base Class - Tree Integrity Requirements", () => {
45
+ /**
46
+ * Setup: Mock console methods to suppress error output during expected failures
47
+ * Pattern from: src/__tests__/adversarial/parent-validation.test.ts:33-37
48
+ */
49
+ beforeEach(() => {
50
+ vi.spyOn(console, "log").mockImplementation(() => {});
51
+ vi.spyOn(console, "error").mockImplementation(() => {});
52
+ vi.spyOn(console, "warn").mockImplementation(() => {});
53
+ });
54
+
55
+ // ==========================================================================
56
+ // Requirement 1: Child has exactly one parent
57
+ // PRD Section 12.2, lines 316-317: "public parent: Workflow | null = null;"
58
+ // ==========================================================================
59
+
60
+ describe("Requirement 1: Child has exactly one parent", () => {
61
+ it("should set parent when child is attached via constructor", () => {
62
+ // ARRANGE & ACT
63
+ const parent = new SimpleWorkflow("Parent");
64
+ const child = new SimpleWorkflow("Child", parent);
65
+
66
+ // ASSERT - PRD 12.2 Requirement 1: child has exactly one parent
67
+ expect(child.parent).toBe(parent);
68
+ expect(child.parent).not.toBeNull();
69
+
70
+ // Verify using helper
71
+ expect(child.parent).toBeDefined();
72
+ expect(child.parent?.id).toBe(parent.id);
73
+ });
74
+
75
+ it("should set parent when child is attached via attachChild()", () => {
76
+ // ARRANGE
77
+ const parent = new SimpleWorkflow("Parent");
78
+ const child = new SimpleWorkflow("Child");
79
+
80
+ // ACT
81
+ parent.attachChild(child);
82
+
83
+ // ASSERT - PRD 12.2 Requirement 1: child has exactly one parent
84
+ expect(child.parent).toBe(parent);
85
+ expect(child.parent).not.toBeNull();
86
+ });
87
+
88
+ it("should throw when trying to attach child to second parent", () => {
89
+ // ARRANGE
90
+ const parent1 = new SimpleWorkflow("Parent1");
91
+ const parent2 = new SimpleWorkflow("Parent2");
92
+ const child = new SimpleWorkflow("Child", parent1);
93
+
94
+ // Verify initial state - child has parent1 as parent
95
+ expect(child.parent).toBe(parent1);
96
+
97
+ // ACT & ASSERT - PRD 12.2 Requirement 1: child can only have one parent
98
+ // Attempting to attach to second parent should throw
99
+ expect(() => parent2.attachChild(child)).toThrow(/already has a parent/);
100
+ });
101
+
102
+ it("should have null parent when created without parent", () => {
103
+ // ARRANGE & ACT
104
+ const orphan = new SimpleWorkflow("Orphan");
105
+
106
+ // ASSERT - PRD 12.2 Requirement 1: child without parent has null
107
+ expect(orphan.parent).toBeNull();
108
+ });
109
+
110
+ it("should maintain single parent after multiple attachChild calls to same parent", () => {
111
+ // ARRANGE
112
+ const parent = new SimpleWorkflow("Parent");
113
+ const child = new SimpleWorkflow("Child", parent);
114
+
115
+ // ACT - Try to attach again to same parent (should throw, not create second parent)
116
+ expect(() => parent.attachChild(child)).toThrow(
117
+ /already attached to this workflow/,
118
+ );
119
+
120
+ // ASSERT - PRD 12.2 Requirement 1: child still has exactly one parent
121
+ expect(child.parent).toBe(parent);
122
+ expect(parent.children.filter((c) => c === child).length).toBe(1);
123
+ });
124
+ });
125
+
126
+ // ==========================================================================
127
+ // Requirement 2: child.parent matches parent (bidirectional link)
128
+ // PRD Section 12.2, lines 346-349: attachChild() maintains bidirectional link
129
+ // ==========================================================================
130
+
131
+ describe("Requirement 2: child.parent matches parent", () => {
132
+ it("should maintain bidirectional link in workflow tree after constructor attachment", () => {
133
+ // ARRANGE & ACT
134
+ const parent = new SimpleWorkflow("Parent");
135
+ const child = new SimpleWorkflow("Child", parent);
136
+
137
+ // ASSERT - PRD 12.2 Requirement 2: child.parent points to parent
138
+ expect(child.parent).toBe(parent);
139
+ // PRD 12.2 Requirement 2: parent contains child in children array
140
+ expect(parent.children).toContain(child);
141
+
142
+ // Verify using helper
143
+ verifyBidirectionalLink(parent, child);
144
+ });
145
+
146
+ it("should maintain bidirectional link in workflow tree after attachChild()", () => {
147
+ // ARRANGE
148
+ const parent = new SimpleWorkflow("Parent");
149
+ const child = new SimpleWorkflow("Child");
150
+
151
+ // ACT
152
+ parent.attachChild(child);
153
+
154
+ // ASSERT - PRD 12.2 Requirement 2: bidirectional link in workflow tree
155
+ expect(child.parent).toBe(parent);
156
+ expect(parent.children).toContain(child);
157
+ expect(parent.children.indexOf(child)).toBeGreaterThanOrEqual(0);
158
+
159
+ // Verify using helper
160
+ verifyBidirectionalLink(parent, child);
161
+ });
162
+
163
+ it("should maintain bidirectional link in node tree", () => {
164
+ // ARRANGE & ACT
165
+ const parent = new SimpleWorkflow("Parent");
166
+ const child = new SimpleWorkflow("Child", parent);
167
+
168
+ // ASSERT - PRD 12.2 Requirement 2: node tree mirrors workflow tree
169
+ // child.node.parent should equal parent.node
170
+ expect(child.node.parent).toBe(parent.node);
171
+ // parent.node.children should contain child.node
172
+ expect(parent.node.children).toContain(child.node);
173
+
174
+ // Verify using helper (checks both trees)
175
+ verifyBidirectionalLink(parent, child);
176
+ });
177
+
178
+ it("should maintain bidirectional link after detachChild()", () => {
179
+ // ARRANGE
180
+ const parent = new SimpleWorkflow("Parent");
181
+ const child = new SimpleWorkflow("Child", parent);
182
+
183
+ // ACT
184
+ parent.detachChild(child);
185
+
186
+ // ASSERT - PRD 12.2 Requirement 2: bidirectional link broken in both trees
187
+ expect(child.parent).toBeNull();
188
+ expect(parent.children).not.toContain(child);
189
+ expect(child.node.parent).toBeNull();
190
+ expect(parent.node.children).not.toContain(child.node);
191
+ });
192
+ });
193
+
194
+ // ==========================================================================
195
+ // Requirement 3: Child appears in only one parent's children array
196
+ // PRD Section 12.2, lines 316-318: children array must be consistent
197
+ // ==========================================================================
198
+
199
+ describe("Requirement 3: Child appears in only one parent's children array", () => {
200
+ it("should only appear in one parent's children array after attachment", () => {
201
+ // ARRANGE
202
+ const parent1 = new SimpleWorkflow("Parent1");
203
+ const parent2 = new SimpleWorkflow("Parent2");
204
+ const child = new SimpleWorkflow("Child", parent1);
205
+
206
+ // ASSERT - PRD 12.2 Requirement 3: child appears only in parent1.children
207
+ expect(parent1.children).toContain(child);
208
+ expect(parent2.children).not.toContain(child);
209
+
210
+ // Verify exactly one occurrence
211
+ expect(parent1.children.filter((c) => c === child).length).toBe(1);
212
+ });
213
+
214
+ it("should not appear in second parent's children after failed attachment", () => {
215
+ // ARRANGE
216
+ const parent1 = new SimpleWorkflow("Parent1");
217
+ const parent2 = new SimpleWorkflow("Parent2");
218
+ const child = new SimpleWorkflow("Child", parent1);
219
+
220
+ // ACT - Attempting second attachment should fail
221
+ expect(() => parent2.attachChild(child)).toThrow();
222
+
223
+ // ASSERT - PRD 12.2 Requirement 3: child still only in parent1.children
224
+ expect(parent1.children).toContain(child);
225
+ expect(parent2.children).not.toContain(child);
226
+
227
+ // Verify parent1 still has exactly one entry for child
228
+ expect(parent1.children.filter((c) => c === child).length).toBe(1);
229
+ });
230
+
231
+ it("should appear in new parent's children after reparenting", () => {
232
+ // ARRANGE
233
+ const parent1 = new SimpleWorkflow("Parent1");
234
+ const parent2 = new SimpleWorkflow("Parent2");
235
+ const child = new SimpleWorkflow("Child", parent1);
236
+
237
+ // ACT - Reparent using detach/attach pattern
238
+ parent1.detachChild(child);
239
+ parent2.attachChild(child);
240
+
241
+ // ASSERT - PRD 12.2 Requirement 3: child now only in parent2.children
242
+ expect(parent1.children).not.toContain(child);
243
+ expect(parent2.children).toContain(child);
244
+ expect(parent2.children.filter((c) => c === child).length).toBe(1);
245
+ });
246
+
247
+ it("should have no duplicates in parent's children array", () => {
248
+ // ARRANGE
249
+ const parent = new SimpleWorkflow("Parent");
250
+ const child = new SimpleWorkflow("Child", parent);
251
+
252
+ // ACT - Try to attach again (should throw)
253
+ expect(() => parent.attachChild(child)).toThrow();
254
+
255
+ // ASSERT - PRD 12.2 Requirement 3: no duplicates in children array
256
+ const occurrences = parent.children.filter((c) => c === child).length;
257
+ expect(occurrences).toBe(1);
258
+ });
259
+
260
+ it("should only appear in one node tree children array", () => {
261
+ // ARRANGE
262
+ const parent1 = new SimpleWorkflow("Parent1");
263
+ const parent2 = new SimpleWorkflow("Parent2");
264
+ const child = new SimpleWorkflow("Child", parent1);
265
+
266
+ // ASSERT - PRD 12.2 Requirement 3: child.node only in parent1.node.children
267
+ expect(parent1.node.children).toContain(child.node);
268
+ expect(parent2.node.children).not.toContain(child.node);
269
+
270
+ // Verify exactly one occurrence
271
+ expect(parent1.node.children.filter((c) => c === child.node).length).toBe(
272
+ 1,
273
+ );
274
+ });
275
+ });
276
+
277
+ // ==========================================================================
278
+ // Requirement 4: Node tree mirrors workflow tree (1:1 correspondence)
279
+ // PRD Section 12.2, lines 327-336: Dual tree structure must stay synchronized
280
+ // ==========================================================================
281
+
282
+ describe("Requirement 4: Node tree mirrors workflow tree", () => {
283
+ it("should maintain 1:1 correspondence between trees after attachment", () => {
284
+ // ARRANGE & ACT
285
+ const parent = new SimpleWorkflow("Parent");
286
+ const child = new SimpleWorkflow("Child", parent);
287
+
288
+ // ASSERT - PRD 12.2 Requirement 4: workflow tree
289
+ expect(parent.children.length).toBe(1);
290
+ expect(parent.children[0]).toBe(child);
291
+ expect(child.parent).toBe(parent);
292
+
293
+ // ASSERT - PRD 12.2 Requirement 4: node tree mirrors workflow tree exactly
294
+ expect(parent.node.children.length).toBe(1);
295
+ expect(parent.node.children[0]).toBe(child.node);
296
+ expect(child.node.parent).toBe(parent.node);
297
+
298
+ // Use existing helper for comprehensive validation
299
+ verifyTreeMirror(parent);
300
+ });
301
+
302
+ it("should maintain 1:1 correspondence after multiple attachments", () => {
303
+ // ARRANGE
304
+ const root = new SimpleWorkflow("Root");
305
+ const child1 = new SimpleWorkflow("Child1", root);
306
+ const child2 = new SimpleWorkflow("Child2", root);
307
+ const child3 = new SimpleWorkflow("Child3", root);
308
+
309
+ // ASSERT - PRD 12.2 Requirement 4: workflow tree has 3 children
310
+ expect(root.children.length).toBe(3);
311
+ expect(root.children).toEqual([child1, child2, child3]);
312
+
313
+ // ASSERT - PRD 12.2 Requirement 4: node tree has same 3 children
314
+ expect(root.node.children.length).toBe(3);
315
+ expect(root.node.children).toEqual([
316
+ child1.node,
317
+ child2.node,
318
+ child3.node,
319
+ ]);
320
+
321
+ // Verify complete mirror
322
+ verifyTreeMirror(root);
323
+ });
324
+
325
+ it("should maintain mirror after detachment", () => {
326
+ // ARRANGE
327
+ const root = new SimpleWorkflow("Root");
328
+ const child1 = new SimpleWorkflow("Child1", root);
329
+ const child2 = new SimpleWorkflow("Child2", root);
330
+
331
+ // ACT
332
+ root.detachChild(child1);
333
+
334
+ // ASSERT - PRD 12.2 Requirement 4: workflow tree updated
335
+ expect(root.children.length).toBe(1);
336
+ expect(root.children[0]).toBe(child2);
337
+
338
+ // ASSERT - PRD 12.2 Requirement 4: node tree mirrors workflow tree
339
+ expect(root.node.children.length).toBe(1);
340
+ expect(root.node.children[0]).toBe(child2.node);
341
+
342
+ // Verify mirror maintained
343
+ verifyTreeMirror(root);
344
+ });
345
+
346
+ it("should maintain mirror after reparenting", () => {
347
+ // ARRANGE
348
+ const parent1 = new SimpleWorkflow("Parent1");
349
+ const parent2 = new SimpleWorkflow("Parent2");
350
+ const child = new SimpleWorkflow("Child", parent1);
351
+
352
+ // ACT - Reparent
353
+ parent1.detachChild(child);
354
+ parent2.attachChild(child);
355
+
356
+ // ASSERT - PRD 12.2 Requirement 4: Verify new parent in workflow tree
357
+ expect(child.parent).toBe(parent2);
358
+ expect(parent2.children).toContain(child);
359
+
360
+ // ASSERT - PRD 12.2 Requirement 4: Verify new parent in node tree
361
+ expect(child.node.parent).toBe(parent2.node);
362
+ expect(parent2.node.children).toContain(child.node);
363
+
364
+ // ASSERT - PRD 12.2 Requirement 4: Verify old parent no longer has child
365
+ expect(parent1.children).not.toContain(child);
366
+ expect(parent1.node.children).not.toContain(child.node);
367
+
368
+ // Verify complete mirror
369
+ verifyTreeMirror(parent2);
370
+ });
371
+
372
+ it("should maintain mirror with deep hierarchy", () => {
373
+ // ARRANGE - Create 3-level hierarchy
374
+ const root = new SimpleWorkflow("Root");
375
+ const child = new SimpleWorkflow("Child", root);
376
+ const grandchild = new SimpleWorkflow("Grandchild", child);
377
+
378
+ // ASSERT - PRD 12.2 Requirement 4: Verify root level
379
+ expect(root.children.length).toBe(1);
380
+ expect(root.children[0]).toBe(child);
381
+ expect(root.node.children.length).toBe(1);
382
+ expect(root.node.children[0]).toBe(child.node);
383
+
384
+ // ASSERT - PRD 12.2 Requirement 4: Verify child level
385
+ expect(child.children.length).toBe(1);
386
+ expect(child.children[0]).toBe(grandchild);
387
+ expect(child.node.children.length).toBe(1);
388
+ expect(child.node.children[0]).toBe(grandchild.node);
389
+
390
+ // ASSERT - PRD 12.2 Requirement 4: Verify grandchild level (leaf)
391
+ expect(grandchild.children.length).toBe(0);
392
+ expect(grandchild.node.children.length).toBe(0);
393
+
394
+ // Verify complete tree mirror
395
+ verifyTreeMirror(root);
396
+ });
397
+
398
+ it("should maintain mirror for parent relationships in deep hierarchy", () => {
399
+ // ARRANGE - Create 3-level hierarchy
400
+ const root = new SimpleWorkflow("Root");
401
+ const child = new SimpleWorkflow("Child", root);
402
+ const grandchild = new SimpleWorkflow("Grandchild", child);
403
+
404
+ // ASSERT - PRD 12.2 Requirement 4: Verify workflow tree parent chain
405
+ expect(grandchild.parent).toBe(child);
406
+ expect(child.parent).toBe(root);
407
+ expect(root.parent).toBeNull();
408
+
409
+ // ASSERT - PRD 12.2 Requirement 4: Verify node tree parent chain
410
+ expect(grandchild.node.parent).toBe(child.node);
411
+ expect(child.node.parent).toBe(root.node);
412
+ expect(root.node.parent).toBeNull();
413
+
414
+ // Verify complete tree mirror
415
+ verifyTreeMirror(root);
416
+ });
417
+ });
418
+
419
+ // ==========================================================================
420
+ // Comprehensive Integration Tests
421
+ // All requirements validated simultaneously
422
+ // ==========================================================================
423
+
424
+ describe("Comprehensive Integration: All PRD 12.2 Requirements", () => {
425
+ it("should satisfy all requirements with complex multi-level tree", () => {
426
+ // ARRANGE - Create complex tree structure
427
+ const root = new SimpleWorkflow("Root");
428
+ const branch1 = new SimpleWorkflow("Branch1", root);
429
+ const branch2 = new SimpleWorkflow("Branch2", root);
430
+ const leaf1a = new SimpleWorkflow("Leaf1A", branch1);
431
+ const leaf1b = new SimpleWorkflow("Leaf1B", branch1);
432
+ const leaf2a = new SimpleWorkflow("Leaf2A", branch2);
433
+
434
+ // ASSERT - PRD 12.2 Requirement 1: Each node has exactly one parent
435
+ expect(root.parent).toBeNull();
436
+ expect(branch1.parent).toBe(root);
437
+ expect(branch2.parent).toBe(root);
438
+ expect(leaf1a.parent).toBe(branch1);
439
+ expect(leaf1b.parent).toBe(branch1);
440
+ expect(leaf2a.parent).toBe(branch2);
441
+
442
+ // ASSERT - PRD 12.2 Requirement 2: Bidirectional links
443
+ expect(root.children).toContain(branch1);
444
+ expect(branch1.parent).toBe(root);
445
+ expect(branch1.children).toContain(leaf1a);
446
+ expect(leaf1a.parent).toBe(branch1);
447
+
448
+ // ASSERT - PRD 12.2 Requirement 3: Each child appears only once
449
+ expect(root.children.filter((c) => c === branch1).length).toBe(1);
450
+ expect(branch1.children.filter((c) => c === leaf1a).length).toBe(1);
451
+
452
+ // ASSERT - PRD 12.2 Requirement 4: Node tree mirrors workflow tree
453
+ verifyTreeMirror(root);
454
+ expect(validateTreeConsistency(root)).toEqual([]);
455
+ });
456
+
457
+ it("should maintain all requirements during reparenting operation", () => {
458
+ // ARRANGE
459
+ const parent1 = new SimpleWorkflow("Parent1");
460
+ const parent2 = new SimpleWorkflow("Parent2");
461
+ const child = new SimpleWorkflow("Child", parent1);
462
+
463
+ // Verify initial state satisfies all requirements
464
+ expect(child.parent).toBe(parent1); // Req 1
465
+ expect(parent1.children).toContain(child); // Req 2
466
+ expect(parent1.children.filter((c) => c === child).length).toBe(1); // Req 3
467
+ verifyTreeMirror(parent1); // Req 4
468
+
469
+ // ACT - Reparent
470
+ parent1.detachChild(child);
471
+ parent2.attachChild(child);
472
+
473
+ // ASSERT - Verify all requirements still satisfied
474
+ // PRD 12.2 Requirement 1: child has exactly one parent (now parent2)
475
+ expect(child.parent).toBe(parent2);
476
+ expect(child.parent).not.toBe(parent1);
477
+
478
+ // PRD 12.2 Requirement 2: bidirectional link with new parent
479
+ expect(child.parent).toBe(parent2);
480
+ expect(parent2.children).toContain(child);
481
+
482
+ // PRD 12.2 Requirement 3: child appears only in new parent's children
483
+ expect(parent1.children).not.toContain(child);
484
+ expect(parent2.children).toContain(child);
485
+ expect(parent2.children.filter((c) => c === child).length).toBe(1);
486
+
487
+ // PRD 12.2 Requirement 4: node tree mirrors workflow tree
488
+ expect(child.node.parent).toBe(parent2.node);
489
+ expect(parent2.node.children).toContain(child.node);
490
+ expect(parent1.node.children).not.toContain(child.node);
491
+ verifyTreeMirror(parent2);
492
+ expect(validateTreeConsistency(parent2)).toEqual([]);
493
+ });
494
+
495
+ it("should prevent violations when trying to create inconsistent state", () => {
496
+ // ARRANGE
497
+ const parent1 = new SimpleWorkflow("Parent1");
498
+ const parent2 = new SimpleWorkflow("Parent2");
499
+ const child = new SimpleWorkflow("Child", parent1);
500
+
501
+ // ACT & ASSERT - Attempting to violate Requirement 1 (single parent)
502
+ expect(() => parent2.attachChild(child)).toThrow();
503
+
504
+ // Verify requirements still satisfied despite failed attack
505
+ expect(child.parent).toBe(parent1); // Req 1: single parent maintained
506
+ expect(parent1.children).toContain(child); // Req 2: bidirectional link
507
+ expect(parent2.children).not.toContain(child); // Req 3: only in one parent
508
+ verifyTreeMirror(parent1); // Req 4: mirror maintained
509
+ });
510
+
511
+ it("should satisfy all requirements with wide tree (many siblings)", () => {
512
+ // ARRANGE - Create tree with many children
513
+ const parent = new SimpleWorkflow("Parent");
514
+ const children: SimpleWorkflow[] = [];
515
+
516
+ for (let i = 0; i < 10; i++) {
517
+ children.push(new SimpleWorkflow(`Child${i}`, parent));
518
+ }
519
+
520
+ // ASSERT - PRD 12.2 Requirement 1: Each child has exactly one parent
521
+ children.forEach((child) => {
522
+ expect(child.parent).toBe(parent);
523
+ });
524
+
525
+ // ASSERT - PRD 12.2 Requirement 2: All bidirectional links valid
526
+ children.forEach((child) => {
527
+ expect(child.parent).toBe(parent);
528
+ expect(parent.children).toContain(child);
529
+ });
530
+
531
+ // ASSERT - PRD 12.2 Requirement 3: Each child appears exactly once
532
+ children.forEach((child) => {
533
+ expect(parent.children.filter((c) => c === child).length).toBe(1);
534
+ });
535
+
536
+ // ASSERT - PRD 12.2 Requirement 4: Node tree mirrors workflow tree
537
+ expect(parent.children.length).toBe(10);
538
+ expect(parent.node.children.length).toBe(10);
539
+ verifyTreeMirror(parent);
540
+ expect(validateTreeConsistency(parent)).toEqual([]);
541
+ });
542
+ });
543
+
544
+ // ==========================================================================
545
+ // Event Emission Validation (PRD 12.2, line 349)
546
+ // ==========================================================================
547
+
548
+ describe("PRD 12.2 Event Emission: childAttached and childDetached", () => {
549
+ it("should emit childAttached event when attaching via constructor", () => {
550
+ // ARRANGE
551
+ const parent = new SimpleWorkflow("Parent");
552
+ const child = new SimpleWorkflow("Child", parent);
553
+
554
+ // ASSERT - PRD 12.2 line 349: attachChild emits childAttached event
555
+ const attachedEvents = parent.node.events.filter(
556
+ (e) => e.type === "childAttached",
557
+ );
558
+ expect(attachedEvents.length).toBeGreaterThan(0);
559
+
560
+ const lastAttachedEvent = attachedEvents[attachedEvents.length - 1];
561
+ if (lastAttachedEvent.type === "childAttached") {
562
+ expect(lastAttachedEvent.parentId).toBe(parent.id);
563
+ expect(lastAttachedEvent.child).toBe(child.node);
564
+ }
565
+ });
566
+
567
+ it("should emit childAttached event when attaching via attachChild()", () => {
568
+ // ARRANGE
569
+ const parent = new SimpleWorkflow("Parent");
570
+ const child = new SimpleWorkflow("Child");
571
+ const eventCountBefore = parent.node.events.filter(
572
+ (e) => e.type === "childAttached",
573
+ ).length;
574
+
575
+ // ACT
576
+ parent.attachChild(child);
577
+
578
+ // ASSERT - PRD 12.2 line 349: childAttached event emitted
579
+ const eventCountAfter = parent.node.events.filter(
580
+ (e) => e.type === "childAttached",
581
+ ).length;
582
+ expect(eventCountAfter).toBe(eventCountBefore + 1);
583
+ });
584
+
585
+ it("should emit childDetached event when detaching", () => {
586
+ // ARRANGE
587
+ const parent = new SimpleWorkflow("Parent");
588
+ const child = new SimpleWorkflow("Child", parent);
589
+ const eventCountBefore = parent.node.events.filter(
590
+ (e) => e.type === "childDetached",
591
+ ).length;
592
+
593
+ // ACT
594
+ parent.detachChild(child);
595
+
596
+ // ASSERT - childDetached event emitted
597
+ const eventCountAfter = parent.node.events.filter(
598
+ (e) => e.type === "childDetached",
599
+ ).length;
600
+ expect(eventCountAfter).toBe(eventCountBefore + 1);
601
+
602
+ const lastDetachedEvent = parent.node.events
603
+ .filter((e) => e.type === "childDetached")
604
+ .pop();
605
+ if (lastDetachedEvent?.type === "childDetached") {
606
+ expect(lastDetachedEvent.parentId).toBe(parent.id);
607
+ expect(lastDetachedEvent.childId).toBe(child.id);
608
+ }
609
+ });
610
+ });
611
+ });