@proposit/proposit-core 0.12.3 → 1.0.0

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 (125) hide show
  1. package/README.md +104 -93
  2. package/dist/cli/commands/premises.d.ts.map +1 -1
  3. package/dist/cli/commands/premises.js +28 -24
  4. package/dist/cli/commands/premises.js.map +1 -1
  5. package/dist/cli/commands/repair.d.ts.map +1 -1
  6. package/dist/cli/commands/repair.js +4 -2
  7. package/dist/cli/commands/repair.js.map +1 -1
  8. package/dist/cli/commands/validate.d.ts.map +1 -1
  9. package/dist/cli/commands/validate.js +7 -1
  10. package/dist/cli/commands/validate.js.map +1 -1
  11. package/dist/cli/engine.d.ts.map +1 -1
  12. package/dist/cli/engine.js +7 -25
  13. package/dist/cli/engine.js.map +1 -1
  14. package/dist/cli/import.d.ts.map +1 -1
  15. package/dist/cli/import.js +66 -28
  16. package/dist/cli/import.js.map +1 -1
  17. package/dist/lib/core/argument-engine.d.ts +275 -10
  18. package/dist/lib/core/argument-engine.d.ts.map +1 -1
  19. package/dist/lib/core/argument-engine.js +442 -82
  20. package/dist/lib/core/argument-engine.js.map +1 -1
  21. package/dist/lib/core/argument-library.d.ts +5 -1
  22. package/dist/lib/core/argument-library.d.ts.map +1 -1
  23. package/dist/lib/core/argument-library.js +7 -3
  24. package/dist/lib/core/argument-library.js.map +1 -1
  25. package/dist/lib/core/expression-manager.d.ts +68 -73
  26. package/dist/lib/core/expression-manager.d.ts.map +1 -1
  27. package/dist/lib/core/expression-manager.js +242 -762
  28. package/dist/lib/core/expression-manager.js.map +1 -1
  29. package/dist/lib/core/fork.d.ts +5 -1
  30. package/dist/lib/core/fork.d.ts.map +1 -1
  31. package/dist/lib/core/fork.js +16 -6
  32. package/dist/lib/core/fork.js.map +1 -1
  33. package/dist/lib/core/interfaces/argument-engine.interfaces.d.ts +68 -7
  34. package/dist/lib/core/interfaces/argument-engine.interfaces.d.ts.map +1 -1
  35. package/dist/lib/core/interfaces/library.interfaces.d.ts +8 -3
  36. package/dist/lib/core/interfaces/library.interfaces.d.ts.map +1 -1
  37. package/dist/lib/core/interfaces/premise-engine.interfaces.d.ts +50 -47
  38. package/dist/lib/core/interfaces/premise-engine.interfaces.d.ts.map +1 -1
  39. package/dist/lib/core/premise-engine.d.ts +80 -11
  40. package/dist/lib/core/premise-engine.d.ts.map +1 -1
  41. package/dist/lib/core/premise-engine.js +232 -80
  42. package/dist/lib/core/premise-engine.js.map +1 -1
  43. package/dist/lib/core/proposit-core.d.ts.map +1 -1
  44. package/dist/lib/core/proposit-core.js +13 -3
  45. package/dist/lib/core/proposit-core.js.map +1 -1
  46. package/dist/lib/grammar/an-rules.d.ts +158 -0
  47. package/dist/lib/grammar/an-rules.d.ts.map +1 -0
  48. package/dist/lib/grammar/an-rules.js +778 -0
  49. package/dist/lib/grammar/an-rules.js.map +1 -0
  50. package/dist/lib/grammar/auto-normalize.d.ts +14 -0
  51. package/dist/lib/grammar/auto-normalize.d.ts.map +1 -0
  52. package/dist/lib/grammar/auto-normalize.js +35 -0
  53. package/dist/lib/grammar/auto-normalize.js.map +1 -0
  54. package/dist/lib/grammar/bounded-subtree.d.ts +30 -0
  55. package/dist/lib/grammar/bounded-subtree.d.ts.map +1 -0
  56. package/dist/lib/grammar/bounded-subtree.js +74 -0
  57. package/dist/lib/grammar/bounded-subtree.js.map +1 -0
  58. package/dist/lib/grammar/naked-q.d.ts +20 -0
  59. package/dist/lib/grammar/naked-q.d.ts.map +1 -0
  60. package/dist/lib/grammar/naked-q.js +58 -0
  61. package/dist/lib/grammar/naked-q.js.map +1 -0
  62. package/dist/lib/grammar/normalize.d.ts +12 -0
  63. package/dist/lib/grammar/normalize.d.ts.map +1 -0
  64. package/dist/lib/grammar/normalize.js +45 -0
  65. package/dist/lib/grammar/normalize.js.map +1 -0
  66. package/dist/lib/grammar/populate-from.d.ts +25 -0
  67. package/dist/lib/grammar/populate-from.d.ts.map +1 -0
  68. package/dist/lib/grammar/populate-from.js +252 -0
  69. package/dist/lib/grammar/populate-from.js.map +1 -0
  70. package/dist/lib/grammar/repair.d.ts +65 -0
  71. package/dist/lib/grammar/repair.d.ts.map +1 -0
  72. package/dist/lib/grammar/repair.js +251 -0
  73. package/dist/lib/grammar/repair.js.map +1 -0
  74. package/dist/lib/grammar/types.d.ts +17 -0
  75. package/dist/lib/grammar/types.d.ts.map +1 -0
  76. package/dist/lib/grammar/types.js +82 -0
  77. package/dist/lib/grammar/types.js.map +1 -0
  78. package/dist/lib/grammar/validate.d.ts +4 -0
  79. package/dist/lib/grammar/validate.d.ts.map +1 -0
  80. package/dist/lib/grammar/validate.js +28 -0
  81. package/dist/lib/grammar/validate.js.map +1 -0
  82. package/dist/lib/grammar/validators/context.d.ts +11 -0
  83. package/dist/lib/grammar/validators/context.d.ts.map +1 -0
  84. package/dist/lib/grammar/validators/context.js +5 -0
  85. package/dist/lib/grammar/validators/context.js.map +1 -0
  86. package/dist/lib/grammar/validators/derivable.d.ts +63 -0
  87. package/dist/lib/grammar/validators/derivable.d.ts.map +1 -0
  88. package/dist/lib/grammar/validators/derivable.js +502 -0
  89. package/dist/lib/grammar/validators/derivable.js.map +1 -0
  90. package/dist/lib/grammar/validators/evaluable.d.ts +48 -0
  91. package/dist/lib/grammar/validators/evaluable.d.ts.map +1 -0
  92. package/dist/lib/grammar/validators/evaluable.js +226 -0
  93. package/dist/lib/grammar/validators/evaluable.js.map +1 -0
  94. package/dist/lib/grammar/validators/presentable.d.ts +45 -0
  95. package/dist/lib/grammar/validators/presentable.d.ts.map +1 -0
  96. package/dist/lib/grammar/validators/presentable.js +231 -0
  97. package/dist/lib/grammar/validators/presentable.js.map +1 -0
  98. package/dist/lib/grammar/validators/structural.d.ts +103 -0
  99. package/dist/lib/grammar/validators/structural.d.ts.map +1 -0
  100. package/dist/lib/grammar/validators/structural.js +602 -0
  101. package/dist/lib/grammar/validators/structural.js.map +1 -0
  102. package/dist/lib/index.d.ts +4 -3
  103. package/dist/lib/index.d.ts.map +1 -1
  104. package/dist/lib/index.js +2 -2
  105. package/dist/lib/index.js.map +1 -1
  106. package/dist/lib/parsing/argument-parser.d.ts.map +1 -1
  107. package/dist/lib/parsing/argument-parser.js +52 -10
  108. package/dist/lib/parsing/argument-parser.js.map +1 -1
  109. package/dist/lib/types/evaluation.d.ts +1 -1
  110. package/dist/lib/types/evaluation.d.ts.map +1 -1
  111. package/dist/lib/types/fork.d.ts +12 -3
  112. package/dist/lib/types/fork.d.ts.map +1 -1
  113. package/dist/lib/types/validation.d.ts +0 -6
  114. package/dist/lib/types/validation.d.ts.map +1 -1
  115. package/dist/lib/types/validation.js +23 -6
  116. package/dist/lib/types/validation.js.map +1 -1
  117. package/package.json +1 -1
  118. package/dist/lib/core/managed-derivation-premise-engine.d.ts +0 -172
  119. package/dist/lib/core/managed-derivation-premise-engine.d.ts.map +0 -1
  120. package/dist/lib/core/managed-derivation-premise-engine.js +0 -550
  121. package/dist/lib/core/managed-derivation-premise-engine.js.map +0 -1
  122. package/dist/lib/types/grammar.d.ts +0 -83
  123. package/dist/lib/types/grammar.d.ts.map +0 -1
  124. package/dist/lib/types/grammar.js +0 -24
  125. package/dist/lib/types/grammar.js.map +0 -1
@@ -0,0 +1 @@
1
+ {"version":3,"file":"an-rules.js","sourceRoot":"","sources":["../../../src/lib/grammar/an-rules.ts"],"names":[],"mappings":"AAAA,sDAAsD;AACtD,EAAE;AACF,uEAAuE;AACvE,iBAAiB;AACjB,EAAE;AACF,oEAAoE;AACpE,2DAA2D;AAC3D,qEAAqE;AACrE,wEAAwE;AACxE,mEAAmE;AACnE,oDAAoD;AACpD,sEAAsE;AACtE,eAAe;AACf,EAAE;AACF,uEAAuE;AACvE,0DAA0D;AAC1D,wEAAwE;AACxE,wEAAwE;AACxE,mEAAmE;AACnE,sEAAsE;AACtE,+BAA+B;AAC/B,EAAE;AACF,8DAA8D;AAC9D,+DAA+D;AAC/D,sEAAsE;AACtE,kEAAkE;AAClE,qEAAqE;AACrE,oEAAoE;AACpE,mEAAmE;AACnE,2DAA2D;AAC3D,oEAAoE;AACpE,kDAAkD;AAClD,8DAA8D;AAC9D,qEAAqE;AACrE,uEAAuE;AACvE,cAAc;AACd,EAAE;AACF,oEAAoE;AACpE,uEAAuE;AACvE,gEAAgE;AAChE,sEAAsE;AACtE,wEAAwE;AACxE,wEAAwE;AACxE,iEAAiE;AACjE,sEAAsE;AACtE,oEAAoE;AACpE,+BAA+B;AAC/B,EAAE;AACF,uEAAuE;AACvE,oEAAoE;AACpE,kEAAkE;AAClE,oEAAoE;AACpE,WAAW;AAWX,OAAO,EAAE,iCAAiC,EAAE,MAAM,sBAAsB,CAAA;AAExE;;;;;;;GAOG;AACH,MAAM,iBAAiB,GAAG,EAAE,CAAA;AAE5B;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,QAAQ,CAMtB,MAA2D;IACzD,IAAI,UAAU,GAAG,KAAK,CAAA;IACtB,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,YAAY,EAAE,EAAE,CAAC;QACrC,gEAAgE;QAChE,+DAA+D;QAC/D,mDAAmD;QACnD,6BAA6B;QAC7B,IAAI,cAAc,GAAG,IAAI,CAAA;QACzB,OAAO,cAAc,EAAE,CAAC;YACpB,cAAc,GAAG,kCAAkC,CAAC,EAAE,CAAC,CAAA;YACvD,IAAI,cAAc;gBAAE,UAAU,GAAG,IAAI,CAAA;QACzC,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,kCAAkC,CAKzC,EAA8C;IAC5C,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK;YAAE,SAAQ;QACjE,MAAM,QAAQ,GAAG,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAChD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QACnC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;QAEzB,oCAAoC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;YACxD,MAAM,aAAa,GAAG,EAAE,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;YACtD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAQ;YACxC,uDAAuD;YACvD,0DAA0D;YAC1D,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;YACpC,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;YACnC,OAAO,IAAI,CAAA;QACf,CAAC;QAED,gDAAgD;QAChD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,eAAe,GAAG,EAAE,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;YACxD,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAQ;YAC1C,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAA;YACnC,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU,IAAI,QAAQ,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;gBAC9D,SAAQ;YACZ,CAAC;YACD,MAAM,aAAa,GAAG,EAAE,CAAC,mBAAmB,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;YACzD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAQ;YACxC,yDAAyD;YACzD,kDAAkD;YAClD,kDAAkD;YAClD,sDAAsD;YACtD,4CAA4C;YAC5C,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;YACvC,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;YACnC,OAAO,IAAI,CAAA;QACf,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAA;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,UAAU,QAAQ,CAMtB,MAA2D;IACzD,IAAI,UAAU,GAAG,KAAK,CAAA;IACtB,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,YAAY,EAAE,EAAE,CAAC;QACrC,IAAI,cAAc,GAAG,IAAI,CAAA;QACzB,OAAO,cAAc,EAAE,CAAC;YACpB,cAAc,GAAG,uBAAuB,CAAC,EAAE,CAAC,CAAA;YAC5C,IAAI,cAAc;gBAAE,UAAU,GAAG,IAAI,CAAA;QACzC,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,uBAAuB,CAK9B,EAA8C;IAC5C,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC;QACrC,qCAAqC;QACrC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAChD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,uCAAuC;gBACvC,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;gBACnC,OAAO,IAAI,CAAA;YACf,CAAC;YACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;gBACnD,mDAAmD;gBACnD,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;gBACnC,OAAO,IAAI,CAAA;YACf,CAAC;YACD,SAAQ;QACZ,CAAC;QAED,oCAAoC;QACpC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAChD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,sCAAsC;gBACtC,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;gBACnC,OAAO,IAAI,CAAA;YACf,CAAC;YACD,IACI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBACrB,CAAC,iCAAiC,CAC9B,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EACd,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,mBAAmB,CAAC,EAAE,CAAC,EAClC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,CAC/B,EACH,CAAC;gBACC,qDAAqD;gBACrD,mCAAmC;gBACnC,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;gBACnC,OAAO,IAAI,CAAA;YACf,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAA;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,MAAM,UAAU,QAAQ,CAMtB,MAA2D;IACzD,IAAI,UAAU,GAAG,KAAK,CAAA;IACtB,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,YAAY,EAAE,EAAE,CAAC;QACrC,IAAI,cAAc,GAAG,IAAI,CAAA;QACzB,OAAO,cAAc,EAAE,CAAC;YACpB,cAAc,GAAG,8BAA8B,CAAC,EAAE,CAAC,CAAA;YACnD,IAAI,cAAc;gBAAE,UAAU,GAAG,IAAI,CAAA;QACzC,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,8BAA8B,CAKrC,EAA8C;IAC5C,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC;QACtC,+DAA+D;QAC/D,mDAAmD;QACnD,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QACvC,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK,IAAI,KAAK,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAQ;QAEjE,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAA;QAChC,IAAI,SAAS,KAAK,IAAI;YAAE,SAAQ;QAChC,MAAM,OAAO,GAAG,EAAE,CAAC,aAAa,CAAC,SAAS,CAAC,CAAA;QAC3C,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;YAAE,SAAQ;QAEpD,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAA;QAChC,IAAI,OAAO,KAAK,IAAI;YAAE,SAAQ;QAC9B,MAAM,KAAK,GAAG,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;QACvC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QACjD,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ;YAAE,SAAQ;QAE/C,4BAA4B;QAC5B,uBAAuB,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,SAAS,EAAE,OAAO,CAAC,CAAA;QACzD,OAAO,IAAI,CAAA;IACf,CAAC;IACD,OAAO,KAAK,CAAA;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,uBAAuB,CAM5B,EAA8C,EAC9C,OAAe,EACf,SAAiB,EACjB,OAAe;IAEf,MAAM,cAAc,GAAG,EAAE,CAAC,iBAAiB,EAAE,CAAA;IAE7C,iEAAiE;IACjE,2DAA2D;IAC3D,+DAA+D;IAC/D,mCAAmC;IACnC,MAAM,aAAa,GAAG,EAAE,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAA;IACrD,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAA;IAElC,iEAAiE;IACjE,MAAM,aAAa,GAAG,EAAE,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAA;IACrD,MAAM,UAAU,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAA;IACrE,MAAM,OAAO,GACT,UAAU,GAAG,CAAC;QACV,CAAC,CAAC,aAAa,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,QAAQ;QACxC,CAAC,CAAC,cAAc,CAAC,GAAG,CAAA;IAC5B,MAAM,QAAQ,GACV,UAAU,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC;QACjC,CAAC,CAAC,aAAa,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,QAAQ;QACxC,CAAC,CAAC,cAAc,CAAC,GAAG,CAAA;IAE5B,mEAAmE;IACnE,gEAAgE;IAChE,kEAAkE;IAClE,kDAAkD;IAClD,MAAM,GAAG,GAAG,QAAQ,GAAG,OAAO,CAAA;IAC9B,IAAI,gBAAgB,GAAG,OAAO,CAAA;IAC9B,IAAI,iBAAiB,GAAG,QAAQ,CAAA;IAChC,IAAI,GAAG,IAAI,KAAK,EAAE,CAAC;QACf,0BAA0B,CAAC,EAAE,EAAE,OAAO,EAAE,cAAc,CAAC,CAAA;QACvD,MAAM,cAAc,GAAG,EAAE,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAA;QACtD,MAAM,mBAAmB,GAAG,cAAc,CAAC,SAAS,CAChD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAC5B,CAAA;QACD,gBAAgB;YACZ,mBAAmB,GAAG,CAAC;gBACnB,CAAC,CAAC,cAAc,CAAC,mBAAmB,GAAG,CAAC,CAAC,CAAC,QAAQ;gBAClD,CAAC,CAAC,cAAc,CAAC,GAAG,CAAA;QAC5B,iBAAiB;YACb,mBAAmB,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC;gBAC3C,CAAC,CAAC,cAAc,CAAC,mBAAmB,GAAG,CAAC,CAAC,CAAC,QAAQ;gBAClD,CAAC,CAAC,cAAc,CAAC,GAAG,CAAA;IAChC,CAAC;IAED,2DAA2D;IAC3D,2DAA2D;IAC3D,gEAAgE;IAChE,wBAAwB;IACxB,EAAE;IACF,4DAA4D;IAC5D,gEAAgE;IAChE,0DAA0D;IAC1D,EAAE;IACF,iEAAiE;IACjE,+DAA+D;IAC/D,2CAA2C;IAC3C,+DAA+D;IAC/D,kEAAkE;IAClE,8DAA8D;IAC9D,iEAAiE;IACjE,+DAA+D;IAC/D,iBAAiB;IACjB,EAAE;IACF,8DAA8D;IAC9D,8DAA8D;IAC9D,8DAA8D;IAC9D,gEAAgE;IAChE,iDAAiD;IACjD,EAAE;IACF,iEAAiE;IACjE,4DAA4D;IAC5D,6DAA6D;IAC7D,6DAA6D;IAC7D,yDAAyD;IACzD,iEAAiE;IACjE,gEAAgE;IAChE,0DAA0D;IAC1D,8DAA8D;IAC9D,UAAU;IACV,MAAM,gBAAgB,GAAG,EAAE,CAAC,aAAa,CAAC,SAAS,CAAC,CAAA;IACpD,MAAM,sBAAsB,GAAG,gBAAgB;QAC3C,CAAC,CAAC,gBAAgB,CAAC,QAAQ;QAC3B,CAAC,CAAC,IAAI,CAAA;IACV,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;IACnC,IAAI,sBAAsB,KAAK,IAAI,EAAE,CAAC;QAClC,SAAS,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAA;IACzC,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAC1B,gBAAgB;YACZ,CAAC,CAAC,iBAAiB,GAAG,gBAAgB,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CACvE,CAAA;QACD,IAAI,MAAM,GAAG,WAAW,CAAA;QACxB,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,wDAAwD;YACxD,2DAA2D;YAC3D,yDAAyD;YACzD,wDAAwD;YACxD,kDAAkD;YAClD,wDAAwD;YACxD,wCAAwC;YACxC,MAAM,SAAS,GAAG,iBAAiB,GAAG,gBAAgB,CAAA;YACtD,IAAI,KAAK,GAAG,KAAK,CAAA;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,MAAM,IAAI,GAAG,WAAW,GAAG,CAAC,CAAA;gBAC5B,IAAI,IAAI,GAAG,gBAAgB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClD,MAAM,GAAG,IAAI,CAAA;oBACb,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACT,CAAC;gBACD,MAAM,EAAE,GAAG,WAAW,GAAG,CAAC,CAAA;gBAC1B,IAAI,EAAE,GAAG,iBAAiB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC/C,MAAM,GAAG,EAAE,CAAA;oBACX,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACT,CAAC;YACL,CAAC;YACD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACT,MAAM,eAAe,GAAG,CAAC,GAAG,SAAS,CAAC;qBACjC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;qBACrB,IAAI,CAAC,IAAI,CAAC,CAAA;gBACf,MAAM,IAAI,KAAK,CACX,oDAAoD;oBAChD,IAAI,gBAAgB,KAAK,iBAAiB,QAAQ;oBAClD,gBAAgB,CAAC,QAAQ,OAAO,YAAY,OAAO,IAAI;oBACvD,gBAAgB,eAAe,MAAM;oBACrC,iDAAiD;oBACjD,8CAA8C,CACrD,CAAA;YACL,CAAC;QACL,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACrB,EAAE,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC,CAAA;IAC/D,CAAC;IAED,iEAAiE;IACjE,uCAAuC;IACvC,EAAE,CAAC,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;IAElC,iEAAiE;IACjE,wDAAwD;IACxD,+DAA+D;IAC/D,6DAA6D;IAC7D,EAAE,CAAC,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAA;AACzC,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,SAAS,0BAA0B,CAM/B,EAA8C,EAC9C,QAAgB,EAChB,cAAuD;IAEvD,MAAM,QAAQ,GAAG,EAAE,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAA;IACjD,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAA;IAC7B,IAAI,KAAK,KAAK,CAAC;QAAE,OAAM;IAEvB,MAAM,GAAG,GAAG,cAAc,CAAC,GAAG,CAAA;IAC9B,MAAM,GAAG,GAAG,cAAc,CAAC,GAAG,CAAA;IAC9B,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,CAAA;IAEvB,qDAAqD;IACrD,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACnE,CAAC;IAED,yDAAyD;IACzD,2DAA2D;IAC3D,uDAAuD;IACvD,EAAE;IACF,8DAA8D;IAC9D,+DAA+D;IAC/D,8DAA8D;IAC9D,gCAAgC;IAChC,EAAE;IACF,iEAAiE;IACjE,gEAAgE;IAChE,wDAAwD;IACxD,iEAAiE;IACjE,kDAAkD;IAClD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;IACnC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACvB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAA;IAC7B,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACtB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACpB,CAAC;IAED,6DAA6D;IAC7D,gEAAgE;IAChE,4DAA4D;IAC5D,+DAA+D;IAC/D,kEAAkE;IAClE,gEAAgE;IAChE,iEAAiE;IACjE,0DAA0D;IAC1D,uCAAuC;IACvC,kEAAkE;IAClE,MAAM,SAAS,GAAc,EAAE,CAAA;IAC/B,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;QACjD,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACrB,IAAI,KAAK;YAAE,WAAW,EAAE,CAAA;IAC5B,CAAC;IAED,4DAA4D;IAC5D,+DAA+D;IAC/D,gEAAgE;IAChE,gEAAgE;IAChE,+DAA+D;IAC/D,OAAO;IACP,MAAM,SAAS,GAAa,EAAE,CAAA;IAC9B,IAAI,MAAM,GAAG,GAAG,CAAA;IAChB,OAAO,SAAS,CAAC,MAAM,GAAG,WAAW,IAAI,MAAM,IAAI,GAAG,EAAE,CAAC;QACrD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC1B,CAAC;QACD,MAAM,EAAE,CAAA;IACZ,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,GAAG,WAAW,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CACX,gDAAgD,WAAW,GAAG;YAC1D,kCAAkC,GAAG,KAAK,GAAG,QAAQ;YACrD,WAAW,QAAQ,+BAA+B,SAAS,CAAC,IAAI,IAAI,CAC3E,CAAA;IACL,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAA;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YAAE,SAAQ;QAC3B,EAAE,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,CAAC,UAAU,EAAE,CAAC,CAAC,CAAA;IAC5E,CAAC;IAED,iEAAiE;IACjE,kEAAkE;IAClE,iEAAiE;IACjE,gCAAgC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YAAE,SAAQ;QAC3B,EAAE,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;IAC/D,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,UAAU,QAAQ,CAMtB,MAA2D;IACzD,IAAI,UAAU,GAAG,KAAK,CAAA;IACtB,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAA;IAC9B,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,YAAY,EAAE,EAAE,CAAC;QACrC,IAAI,cAAc,GAAG,IAAI,CAAA;QACzB,OAAO,cAAc,EAAE,CAAC;YACpB,cAAc,GAAG,+BAA+B,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;YACzD,IAAI,cAAc;gBAAE,UAAU,GAAG,IAAI,CAAA;QACzC,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,+BAA+B,CAKtC,EAA8C,EAAE,GAAiB;IAC/D,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC;QACrC,8DAA8D;QAC9D,oBAAoB;QACpB,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QACtC,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK;YAAE,SAAQ;QACrC,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAQ;QAEpC,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC9C,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QAEnD,8DAA8D;QAC9D,+DAA+D;QAC/D,uBAAuB;QACvB,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;QAChC,OAAO,IAAI,CAAA;IACf,CAAC;IACD,OAAO,KAAK,CAAA;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,mBAAmB,CAMjC,MAA2D;IACzD,8DAA8D;IAC9D,4DAA4D;IAC5D,6DAA6D;IAC7D,0DAA0D;IAC1D,yDAAyD;IACzD,EAAE;IACF,6CAA6C;IAC7C,qDAAqD;IACrD,iEAAiE;IACjE,kEAAkE;IAClE,8DAA8D;IAC9D,gEAAgE;IAChE,oDAAoD;IACpD,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;QAAE,OAAM;IAClC,IAAI,CAAC;QACD,yBAAyB,CAAC,MAAM,CAAC,CAAA;IACrC,CAAC;YAAS,CAAC;QACP,MAAM,CAAC,UAAU,EAAE,CAAA;IACvB,CAAC;AACL,CAAC;AAED,SAAS,yBAAyB,CAMhC,MAA2D;IACzD,IAAI,eAAe,GAA6C,IAAI,CAAA;IACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,yDAAyD;QACzD,yDAAyD;QACzD,yDAAyD;QACzD,mCAAmC;QACnC,EAAE;QACF,yDAAyD;QACzD,yDAAyD;QACzD,yDAAyD;QACzD,wDAAwD;QACxD,4DAA4D;QAC5D,2DAA2D;QAC3D,qDAAqD;QACrD,yDAAyD;QACzD,0DAA0D;QAC1D,0DAA0D;QAC1D,uDAAuD;QACvD,oDAAoD;QACpD,kDAAkD;QAClD,qDAAqD;QACrD,mCAAmC;QACnC,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACnB,eAAe,GAAG,MAAM,CAAA;YACxB,OAAO,GAAG,IAAI,CAAA;QAClB,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACnB,eAAe,GAAG,MAAM,CAAA;YACxB,OAAO,GAAG,IAAI,CAAA;QAClB,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACnB,eAAe,GAAG,MAAM,CAAA;YACxB,OAAO,GAAG,IAAI,CAAA;QAClB,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACnB,eAAe,GAAG,MAAM,CAAA;YACxB,OAAO,GAAG,IAAI,CAAA;QAClB,CAAC;QACD,IAAI,CAAC,OAAO;YAAE,OAAM;IACxB,CAAC;IACD,0DAA0D;IAC1D,6DAA6D;IAC7D,6DAA6D;IAC7D,4DAA4D;IAC5D,6DAA6D;IAC7D,2DAA2D;IAC3D,4CAA4C;IAC5C,MAAM,QAAQ,GAAG,MAAM,CAAC,YAAY,EAAE,CAAA;IACtC,MAAM,uBAAuB,GACzB,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,eAAe,CAAA;IAC/D,MAAM,IAAI,KAAK,CACX,+BAA+B,iBAAiB,eAAe;QAC3D,sBAAsB,eAAe,IAAI,QAAQ,IAAI;QACrD,2BAA2B,uBAAuB,KAAK;QACvD,oDAAoD;QACpD,gCAAgC,CACvC,CAAA;AACL,CAAC;AAED,qEAAqE;AACrE,uEAAuE;AACvE,oEAAoE;AACpE,gEAAgE;AAChE,qEAAqE;AACrE,uEAAuE;AACvE,gEAAgE;AAChE,0DAA0D;AAC1D,qEAAqE;AACrE,uEAAuE;AACvE,wBAAwB"}
@@ -0,0 +1,14 @@
1
+ import type { ArgumentEngine } from "../core/argument-engine.js";
2
+ import type { TCoreArgument, TCorePremise, TCorePropositionalExpression, TCorePropositionalVariable, TCoreClaim } from "../schemata/index.js";
3
+ /**
4
+ * Run the AN rule set globally on `engine` if it is in `'assistive'`
5
+ * behavior. No-op when the engine is in `'permissive'`.
6
+ *
7
+ * Convergence: typically ≤ 3 iterations because the rules are local and
8
+ * idempotent in combination. Implementation routes through
9
+ * `applyANToFixedPoint` in `src/lib/grammar/an-rules.ts`.
10
+ *
11
+ * @since 1.0.0
12
+ */
13
+ export declare function runAssistiveNormalization<TArg extends TCoreArgument = TCoreArgument, TPremise extends TCorePremise = TCorePremise, TExpr extends TCorePropositionalExpression = TCorePropositionalExpression, TVar extends TCorePropositionalVariable = TCorePropositionalVariable, TClaim extends TCoreClaim = TCoreClaim>(engine: ArgumentEngine<TArg, TPremise, TExpr, TVar, TClaim>): void;
14
+ //# sourceMappingURL=auto-normalize.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"auto-normalize.d.ts","sourceRoot":"","sources":["../../../src/lib/grammar/auto-normalize.ts"],"names":[],"mappings":"AAmBA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAA;AAChE,OAAO,KAAK,EACR,aAAa,EACb,YAAY,EACZ,4BAA4B,EAC5B,0BAA0B,EAC1B,UAAU,EACb,MAAM,sBAAsB,CAAA;AAG7B;;;;;;;;;GASG;AACH,wBAAgB,yBAAyB,CACrC,IAAI,SAAS,aAAa,GAAG,aAAa,EAC1C,QAAQ,SAAS,YAAY,GAAG,YAAY,EAC5C,KAAK,SAAS,4BAA4B,GAAG,4BAA4B,EACzE,IAAI,SAAS,0BAA0B,GAAG,0BAA0B,EACpE,MAAM,SAAS,UAAU,GAAG,UAAU,EACxC,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,IAAI,CAGnE"}
@@ -0,0 +1,35 @@
1
+ // Auto-normalization (AN) post-hook for the four-tier grammar model.
2
+ //
3
+ // Per spec §5.1, the AN rule set consists of four local cleanup rules:
4
+ //
5
+ // AN-1 Insert formula buffer when a non-`not` operator becomes a direct
6
+ // child of another operator. Preserves P-1.
7
+ // AN-2 Collapse double negation (NOT(NOT(x)) → x). Preserves P-2.
8
+ // AN-3 Collapse 0-child operator/formula; promote single child where the
9
+ // parent is non-meaningful. Preserves P-3 and P-4 (incidentally E-1).
10
+ // AN-4 Absorb same-operator adjacency through a formula. Preserves P-5.
11
+ //
12
+ // This module exports `runAssistiveNormalization(engine)` — the
13
+ // uniform AN post-hook for `assistive` mode. As of D2 all four AN
14
+ // rules are native single-rule passes routed through
15
+ // `applyANToFixedPoint` in `src/lib/grammar/an-rules.ts`; the legacy
16
+ // per-flag `grammarConfig` machinery + the 11 P-1 throw sites are
17
+ // gone, so this bridge is unconditional delegation gated only on
18
+ // `engine.behavior`.
19
+ import { applyANToFixedPoint } from "./an-rules.js";
20
+ /**
21
+ * Run the AN rule set globally on `engine` if it is in `'assistive'`
22
+ * behavior. No-op when the engine is in `'permissive'`.
23
+ *
24
+ * Convergence: typically ≤ 3 iterations because the rules are local and
25
+ * idempotent in combination. Implementation routes through
26
+ * `applyANToFixedPoint` in `src/lib/grammar/an-rules.ts`.
27
+ *
28
+ * @since 1.0.0
29
+ */
30
+ export function runAssistiveNormalization(engine) {
31
+ if (engine.behavior !== "assistive")
32
+ return;
33
+ applyANToFixedPoint(engine);
34
+ }
35
+ //# sourceMappingURL=auto-normalize.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"auto-normalize.js","sourceRoot":"","sources":["../../../src/lib/grammar/auto-normalize.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,EAAE;AACF,uEAAuE;AACvE,EAAE;AACF,2EAA2E;AAC3E,oDAAoD;AACpD,qEAAqE;AACrE,4EAA4E;AAC5E,8EAA8E;AAC9E,2EAA2E;AAC3E,EAAE;AACF,gEAAgE;AAChE,kEAAkE;AAClE,qDAAqD;AACrD,qEAAqE;AACrE,kEAAkE;AAClE,iEAAiE;AACjE,qBAAqB;AAUrB,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAA;AAEnD;;;;;;;;;GASG;AACH,MAAM,UAAU,yBAAyB,CAMvC,MAA2D;IACzD,IAAI,MAAM,CAAC,QAAQ,KAAK,WAAW;QAAE,OAAM;IAC3C,mBAAmB,CAAC,MAAM,CAAC,CAAA;AAC/B,CAAC"}
@@ -0,0 +1,30 @@
1
+ import type { TCorePropositionalExpression } from "../schemata/index.js";
2
+ /**
3
+ * Returns `true` iff the subtree rooted at `expressionId` contains a
4
+ * binary operator (`and` or `or`). Traversal stops at nested formulas
5
+ * (each formula starts a new P-3 scope).
6
+ *
7
+ * The starting node itself counts: if the caller asks "does formula
8
+ * F's bounded subtree contain a binary operator?", they pass F's
9
+ * **child** (not F itself) — because traversal stops at the first
10
+ * nested formula encountered, and starting at F would immediately
11
+ * stop. (Equivalently: callers may iterate F's children and call this
12
+ * helper on each child, or pass F's only child for the typical
13
+ * `formula(x)` case.)
14
+ *
15
+ * Note: `implies` and `iff` are intentionally excluded from the binary-
16
+ * operator check. S-5 restricts both to premise roots, so they cannot
17
+ * appear as formula descendants in a Structural-valid tree.
18
+ *
19
+ * @param expressionId Subtree root id.
20
+ * @param lookup `(id) => children` — must return live children at
21
+ * call time. Typical bindings: a closure over a
22
+ * pre-built `TChildMap` for validator use, or
23
+ * `pe.getChildExpressions.bind(pe)` for AN-pass use.
24
+ * @param getExpression `(id) => TCorePropositionalExpression | undefined`
25
+ * — resolve the starting node by id; the lookup function
26
+ * returns descendants by id but doesn't include the
27
+ * start node itself.
28
+ */
29
+ export declare function hasBinaryOperatorInBoundedSubtree(expressionId: string, lookup: (id: string) => readonly TCorePropositionalExpression[], getExpression: (id: string) => TCorePropositionalExpression | undefined): boolean;
30
+ //# sourceMappingURL=bounded-subtree.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"bounded-subtree.d.ts","sourceRoot":"","sources":["../../../src/lib/grammar/bounded-subtree.ts"],"names":[],"mappings":"AAwBA,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,sBAAsB,CAAA;AAExE;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,iCAAiC,CAC7C,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,SAAS,4BAA4B,EAAE,EAC/D,aAAa,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,4BAA4B,GAAG,SAAS,GACxE,OAAO,CAsBT"}
@@ -0,0 +1,74 @@
1
+ // Shared helper for "formula bounded subtree" traversal.
2
+ //
3
+ // P-3 justifies a formula iff its bounded subtree contains a binary
4
+ // operator (`and` or `or`). The traversal stops at any *nested* formula
5
+ // — each formula is its own P-3 scope.
6
+ //
7
+ // Two consumers need this check at different points in the engine's
8
+ // lifecycle:
9
+ //
10
+ // - `src/lib/grammar/validators/presentable.ts` (P-3 validator):
11
+ // reads from a `TChildMap` snapshot built once from the engine's
12
+ // expression list. Stale-snapshot reads don't matter because
13
+ // `validate(tier)` is a pure query against a settled tree.
14
+ // - `src/lib/grammar/an-rules.ts` (native AN-3): reads from
15
+ // `pe.getChildExpressions(id)` so it sees the live tree mid-AN
16
+ // pass. A `TChildMap` snapshot from before the pass would be stale
17
+ // and produce wrong answers for already-collapsed subtrees.
18
+ //
19
+ // This module factors the traversal out behind a `(id) => readonly TExpr[]`
20
+ // lookup-function parameter so both consumers can share one
21
+ // implementation while binding the lookup to their own freshness story.
22
+ // The dual-review syntheses (D0a P2 #3, D0d P2 #3) called out the
23
+ // pre-D0e duplication; this is the shared landing place.
24
+ /**
25
+ * Returns `true` iff the subtree rooted at `expressionId` contains a
26
+ * binary operator (`and` or `or`). Traversal stops at nested formulas
27
+ * (each formula starts a new P-3 scope).
28
+ *
29
+ * The starting node itself counts: if the caller asks "does formula
30
+ * F's bounded subtree contain a binary operator?", they pass F's
31
+ * **child** (not F itself) — because traversal stops at the first
32
+ * nested formula encountered, and starting at F would immediately
33
+ * stop. (Equivalently: callers may iterate F's children and call this
34
+ * helper on each child, or pass F's only child for the typical
35
+ * `formula(x)` case.)
36
+ *
37
+ * Note: `implies` and `iff` are intentionally excluded from the binary-
38
+ * operator check. S-5 restricts both to premise roots, so they cannot
39
+ * appear as formula descendants in a Structural-valid tree.
40
+ *
41
+ * @param expressionId Subtree root id.
42
+ * @param lookup `(id) => children` — must return live children at
43
+ * call time. Typical bindings: a closure over a
44
+ * pre-built `TChildMap` for validator use, or
45
+ * `pe.getChildExpressions.bind(pe)` for AN-pass use.
46
+ * @param getExpression `(id) => TCorePropositionalExpression | undefined`
47
+ * — resolve the starting node by id; the lookup function
48
+ * returns descendants by id but doesn't include the
49
+ * start node itself.
50
+ */
51
+ export function hasBinaryOperatorInBoundedSubtree(expressionId, lookup, getExpression) {
52
+ const root = getExpression(expressionId);
53
+ if (!root)
54
+ return false;
55
+ const stack = [root];
56
+ while (stack.length > 0) {
57
+ const cursor = stack.pop();
58
+ if (cursor.type === "operator" &&
59
+ (cursor.operator === "and" || cursor.operator === "or")) {
60
+ return true;
61
+ }
62
+ // Stop at nested formulas — each formula is its own P-3 scope.
63
+ // The starting node is not treated as a nested formula even if
64
+ // it happens to be one (the caller is asking about *its*
65
+ // subtree).
66
+ if (cursor.id !== expressionId && cursor.type === "formula")
67
+ continue;
68
+ for (const child of lookup(cursor.id)) {
69
+ stack.push(child);
70
+ }
71
+ }
72
+ return false;
73
+ }
74
+ //# sourceMappingURL=bounded-subtree.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"bounded-subtree.js","sourceRoot":"","sources":["../../../src/lib/grammar/bounded-subtree.ts"],"names":[],"mappings":"AAAA,yDAAyD;AACzD,EAAE;AACF,oEAAoE;AACpE,wEAAwE;AACxE,uCAAuC;AACvC,EAAE;AACF,oEAAoE;AACpE,aAAa;AACb,EAAE;AACF,mEAAmE;AACnE,qEAAqE;AACrE,iEAAiE;AACjE,+DAA+D;AAC/D,8DAA8D;AAC9D,mEAAmE;AACnE,uEAAuE;AACvE,gEAAgE;AAChE,EAAE;AACF,4EAA4E;AAC5E,4DAA4D;AAC5D,wEAAwE;AACxE,kEAAkE;AAClE,yDAAyD;AAIzD;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,UAAU,iCAAiC,CAC7C,YAAoB,EACpB,MAA+D,EAC/D,aAAuE;IAEvE,MAAM,IAAI,GAAG,aAAa,CAAC,YAAY,CAAC,CAAA;IACxC,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAA;IACvB,MAAM,KAAK,GAAmC,CAAC,IAAI,CAAC,CAAA;IACpD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;QAC3B,IACI,MAAM,CAAC,IAAI,KAAK,UAAU;YAC1B,CAAC,MAAM,CAAC,QAAQ,KAAK,KAAK,IAAI,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,EACzD,CAAC;YACC,OAAO,IAAI,CAAA;QACf,CAAC;QACD,+DAA+D;QAC/D,+DAA+D;QAC/D,yDAAyD;QACzD,YAAY;QACZ,IAAI,MAAM,CAAC,EAAE,KAAK,YAAY,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS;YAAE,SAAQ;QACrE,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YACpC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACrB,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAA;AAChB,CAAC"}
@@ -0,0 +1,20 @@
1
+ import type { PremiseEngine } from "../core/premise-engine.js";
2
+ import type { TCoreArgument, TCorePremise, TCorePropositionalExpression, TCorePropositionalVariable } from "../schemata/index.js";
3
+ /**
4
+ * Return `true` iff `pe`'s expression tree is exactly one expression at
5
+ * the root and that expression is of type `variable`. Does NOT inspect
6
+ * the premise type — caller is responsible for any `type === 'derivation'`
7
+ * check.
8
+ *
9
+ * @since 1.0.0
10
+ */
11
+ export declare function isNakedQTree<TArg extends TCoreArgument, TPremise extends TCorePremise, TExpr extends TCorePropositionalExpression, TVar extends TCorePropositionalVariable>(pe: PremiseEngine<TArg, TPremise, TExpr, TVar>): boolean;
12
+ /**
13
+ * Return `true` iff `pe` is a derivation-typed premise (`type ===
14
+ * 'derivation'`) AND its expression tree is in naked-Q form per
15
+ * `isNakedQTree`.
16
+ *
17
+ * @since 1.0.0
18
+ */
19
+ export declare function isNakedQDerivationPremise<TArg extends TCoreArgument, TPremise extends TCorePremise, TExpr extends TCorePropositionalExpression, TVar extends TCorePropositionalVariable>(pe: PremiseEngine<TArg, TPremise, TExpr, TVar>): boolean;
20
+ //# sourceMappingURL=naked-q.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"naked-q.d.ts","sourceRoot":"","sources":["../../../src/lib/grammar/naked-q.ts"],"names":[],"mappings":"AA4BA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAA;AAC9D,OAAO,KAAK,EACR,aAAa,EACb,YAAY,EACZ,4BAA4B,EAC5B,0BAA0B,EAC7B,MAAM,sBAAsB,CAAA;AAE7B;;;;;;;GAOG;AACH,wBAAgB,YAAY,CACxB,IAAI,SAAS,aAAa,EAC1B,QAAQ,SAAS,YAAY,EAC7B,KAAK,SAAS,4BAA4B,EAC1C,IAAI,SAAS,0BAA0B,EACzC,EAAE,EAAE,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,OAAO,CAMzD;AAED;;;;;;GAMG;AACH,wBAAgB,yBAAyB,CACrC,IAAI,SAAS,aAAa,EAC1B,QAAQ,SAAS,YAAY,EAC7B,KAAK,SAAS,4BAA4B,EAC1C,IAAI,SAAS,0BAA0B,EACzC,EAAE,EAAE,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,OAAO,CAIzD"}
@@ -0,0 +1,58 @@
1
+ // Shared naked-Q predicates.
2
+ //
3
+ // A derivation premise is in **naked-Q form** when its expression tree is
4
+ // exactly one expression at the root and that expression is of type
5
+ // `variable`. Naked-Q is the canonical post-creation state for a
6
+ // derivation premise — it represents "no support given yet" and is a
7
+ // valid Derivable state (D-1 admits it; D-2/D-3 govern populated forms).
8
+ //
9
+ // Two predicates are exported because two callers have slightly different
10
+ // preconditions:
11
+ //
12
+ // - `isNakedQTree(pe)` — checks tree shape only (`exprs.length === 1`
13
+ // and `root.type === 'variable'`). Used by callers that already know
14
+ // the premise is `type='derivation'`, e.g.
15
+ // `populateFromGrounding` inside the C6 factory after the derivation
16
+ // premise has been located by `derivedClaimId`.
17
+ //
18
+ // - `isNakedQDerivationPremise(pe)` — additionally checks the
19
+ // premise's `type === 'derivation'`. Used by the evaluator's C8 skip
20
+ // filter, which scans all premises (any type) and must reject
21
+ // non-derivation premises before checking the tree shape.
22
+ //
23
+ // The two share a single tree-shape helper; the second composes the
24
+ // derivation-type check on top. Consolidates the duplicated predicates
25
+ // that existed in `populate-from.ts` (`isNakedQ`, local to the factory)
26
+ // and `argument-engine.ts` (`isNakedQDerivation`, local to
27
+ // `asEvaluationContext`).
28
+ /**
29
+ * Return `true` iff `pe`'s expression tree is exactly one expression at
30
+ * the root and that expression is of type `variable`. Does NOT inspect
31
+ * the premise type — caller is responsible for any `type === 'derivation'`
32
+ * check.
33
+ *
34
+ * @since 1.0.0
35
+ */
36
+ export function isNakedQTree(pe) {
37
+ const exprs = pe.getExpressions();
38
+ if (exprs.length !== 1)
39
+ return false;
40
+ const root = pe.getRootExpression();
41
+ if (root === undefined)
42
+ return false;
43
+ return root.type === "variable";
44
+ }
45
+ /**
46
+ * Return `true` iff `pe` is a derivation-typed premise (`type ===
47
+ * 'derivation'`) AND its expression tree is in naked-Q form per
48
+ * `isNakedQTree`.
49
+ *
50
+ * @since 1.0.0
51
+ */
52
+ export function isNakedQDerivationPremise(pe) {
53
+ // `TPremise extends TCorePremise`, so `.type` is in-scope without a cast.
54
+ if (pe.toPremiseData().type !== "derivation")
55
+ return false;
56
+ return isNakedQTree(pe);
57
+ }
58
+ //# sourceMappingURL=naked-q.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"naked-q.js","sourceRoot":"","sources":["../../../src/lib/grammar/naked-q.ts"],"names":[],"mappings":"AAAA,6BAA6B;AAC7B,EAAE;AACF,0EAA0E;AAC1E,oEAAoE;AACpE,iEAAiE;AACjE,qEAAqE;AACrE,yEAAyE;AACzE,EAAE;AACF,0EAA0E;AAC1E,iBAAiB;AACjB,EAAE;AACF,wEAAwE;AACxE,yEAAyE;AACzE,+CAA+C;AAC/C,yEAAyE;AACzE,oDAAoD;AACpD,EAAE;AACF,gEAAgE;AAChE,yEAAyE;AACzE,kEAAkE;AAClE,8DAA8D;AAC9D,EAAE;AACF,oEAAoE;AACpE,uEAAuE;AACvE,wEAAwE;AACxE,2DAA2D;AAC3D,0BAA0B;AAU1B;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAK1B,EAA8C;IAC5C,MAAM,KAAK,GAAG,EAAE,CAAC,cAAc,EAAE,CAAA;IACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAA;IACpC,MAAM,IAAI,GAAG,EAAE,CAAC,iBAAiB,EAAE,CAAA;IACnC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,KAAK,CAAA;IACpC,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,CAAA;AACnC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,yBAAyB,CAKvC,EAA8C;IAC5C,0EAA0E;IAC1E,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC,IAAI,KAAK,YAAY;QAAE,OAAO,KAAK,CAAA;IAC1D,OAAO,YAAY,CAAC,EAAE,CAAC,CAAA;AAC3B,CAAC"}
@@ -0,0 +1,12 @@
1
+ import type { ArgumentEngine } from "../core/argument-engine.js";
2
+ import type { TCoreArgument, TCorePremise, TCorePropositionalExpression, TCorePropositionalVariable, TCoreClaim } from "../schemata/index.js";
3
+ import type { TGrammarTier } from "./types.js";
4
+ /**
5
+ * Run the AN rule set globally on `engine`, converging the argument
6
+ * toward `tier` (default `'presentable'`). See module header for the
7
+ * semantics + non-destructiveness contract.
8
+ *
9
+ * @since 1.0.0
10
+ */
11
+ export declare function normalizeArgument<TArg extends TCoreArgument = TCoreArgument, TPremise extends TCorePremise = TCorePremise, TExpr extends TCorePropositionalExpression = TCorePropositionalExpression, TVar extends TCorePropositionalVariable = TCorePropositionalVariable, TClaim extends TCoreClaim = TCoreClaim>(engine: ArgumentEngine<TArg, TPremise, TExpr, TVar, TClaim>, tier?: TGrammarTier): void;
12
+ //# sourceMappingURL=normalize.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["../../../src/lib/grammar/normalize.ts"],"names":[],"mappings":"AA0BA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAA;AAChE,OAAO,KAAK,EACR,aAAa,EACb,YAAY,EACZ,4BAA4B,EAC5B,0BAA0B,EAC1B,UAAU,EACb,MAAM,sBAAsB,CAAA;AAE7B,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAE9C;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC7B,IAAI,SAAS,aAAa,GAAG,aAAa,EAC1C,QAAQ,SAAS,YAAY,GAAG,YAAY,EAC5C,KAAK,SAAS,4BAA4B,GAAG,4BAA4B,EACzE,IAAI,SAAS,0BAA0B,GAAG,0BAA0B,EACpE,MAAM,SAAS,UAAU,GAAG,UAAU,EAEtC,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,EAC3D,IAAI,GAAE,YAA4B,GACnC,IAAI,CAUN"}
@@ -0,0 +1,45 @@
1
+ // Global normalize() pass per spec §6.
2
+ //
3
+ // `normalizeArgument(engine, tier)` is the engine-facing implementation
4
+ // behind `ArgumentEngine.normalize(tier?)`. It runs the AN rule set
5
+ // (AN-1..AN-4) globally across every owned premise, converging the
6
+ // argument toward the requested tier (default `'presentable'`).
7
+ //
8
+ // Forward-compat: in v1.0 every AN rule targets a Presentable invariant,
9
+ // so calls with `tier` ∈ {`structural`, `evaluable`, `derivable`} are
10
+ // effectively no-ops. The parameter exists so a future submit/finalize
11
+ // gate can introduce lower-tier AN rules without an API break.
12
+ //
13
+ // `normalizeArgument` is **non-destructive in the logical-meaning sense**:
14
+ // it only inserts buffers, collapses redundant nodes, and absorbs same-
15
+ // operator children. It never deletes a variable, changes a claim
16
+ // reference, or modifies an operator's semantics — even for Evaluable
17
+ // or Derivable violations. Recovery from those requires user intent and
18
+ // is exposed via the repair primitives (Phase C4).
19
+ //
20
+ // Bypasses `engine.behavior`. `normalize()` is user-initiated (the UI
21
+ // calls it after the user confirms a Tidy / Normalize action), so it
22
+ // must do its job even when `behavior === 'permissive'`. D2 deleted
23
+ // the legacy per-flag config + the 11 P-1 throw sites + the PERMISSIVE
24
+ // swap that worked around them, so this bridge is now a tier-gate +
25
+ // unconditional delegation.
26
+ import { applyANToFixedPoint } from "./an-rules.js";
27
+ /**
28
+ * Run the AN rule set globally on `engine`, converging the argument
29
+ * toward `tier` (default `'presentable'`). See module header for the
30
+ * semantics + non-destructiveness contract.
31
+ *
32
+ * @since 1.0.0
33
+ */
34
+ export function normalizeArgument(engine, tier = "presentable") {
35
+ // v1.0 forward-compat: every AN rule targets Presentable. Lower-tier
36
+ // requests are no-ops.
37
+ if (tier !== "presentable")
38
+ return;
39
+ // `normalize()` is user-initiated and runs regardless of
40
+ // `engine.behavior`; `applyANToFixedPoint` does not consult
41
+ // `behavior`, so this delegation is a clean bypass of the
42
+ // permissive-mode gate.
43
+ applyANToFixedPoint(engine);
44
+ }
45
+ //# sourceMappingURL=normalize.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"normalize.js","sourceRoot":"","sources":["../../../src/lib/grammar/normalize.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,EAAE;AACF,wEAAwE;AACxE,oEAAoE;AACpE,mEAAmE;AACnE,gEAAgE;AAChE,EAAE;AACF,yEAAyE;AACzE,sEAAsE;AACtE,uEAAuE;AACvE,+DAA+D;AAC/D,EAAE;AACF,2EAA2E;AAC3E,wEAAwE;AACxE,kEAAkE;AAClE,sEAAsE;AACtE,wEAAwE;AACxE,mDAAmD;AACnD,EAAE;AACF,sEAAsE;AACtE,qEAAqE;AACrE,oEAAoE;AACpE,uEAAuE;AACvE,oEAAoE;AACpE,4BAA4B;AAU5B,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAA;AAGnD;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAO7B,MAA2D,EAC3D,OAAqB,aAAa;IAElC,qEAAqE;IACrE,uBAAuB;IACvB,IAAI,IAAI,KAAK,aAAa;QAAE,OAAM;IAElC,yDAAyD;IACzD,4DAA4D;IAC5D,0DAA0D;IAC1D,wBAAwB;IACxB,mBAAmB,CAAC,MAAM,CAAC,CAAA;AAC/B,CAAC"}
@@ -0,0 +1,25 @@
1
+ import type { ArgumentEngine } from "../core/argument-engine.js";
2
+ import type { TClaimConnectionLookup } from "../core/interfaces/library.interfaces.js";
3
+ import type { TCoreClaimConnection } from "../schemata/claim-connection.js";
4
+ import type { TCoreArgument, TCorePremise, TCoreDerivationPremise, TCorePropositionalExpression, TCorePropositionalVariable, TCoreClaim } from "../schemata/index.js";
5
+ import type { TViolation } from "./types.js";
6
+ /**
7
+ * Result returned by a `populateFrom*` factory. `kind === 'populated'`
8
+ * means the factory built a new antecedent; `kind === 'no-op'` means
9
+ * the factory did not act (either zero connections, or the target
10
+ * premise was already populated).
11
+ */
12
+ export type TPopulateResult<TDerivationPremise extends TCoreDerivationPremise = TCoreDerivationPremise> = {
13
+ kind: "populated" | "no-op";
14
+ state: TDerivationPremise;
15
+ resolved?: readonly TViolation[];
16
+ };
17
+ /**
18
+ * Run the factory for one grounding kind. Shared by
19
+ * `populateFromCitations` / `populateFromAxioms` — the only difference
20
+ * between them is which lookup is queried.
21
+ *
22
+ * @since 1.0.0
23
+ */
24
+ export declare function populateFromGrounding<TArg extends TCoreArgument = TCoreArgument, TPremise extends TCorePremise = TCorePremise, TExpr extends TCorePropositionalExpression = TCorePropositionalExpression, TVar extends TCorePropositionalVariable = TCorePropositionalVariable, TClaim extends TCoreClaim = TCoreClaim, TConn extends TCoreClaimConnection = TCoreClaimConnection>(engine: ArgumentEngine<TArg, TPremise, TExpr, TVar, TClaim>, derivedClaimId: string, lookup: TClaimConnectionLookup<TConn>): TPopulateResult;
25
+ //# sourceMappingURL=populate-from.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"populate-from.d.ts","sourceRoot":"","sources":["../../../src/lib/grammar/populate-from.ts"],"names":[],"mappings":"AAiDA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAA;AAEhE,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0CAA0C,CAAA;AACtF,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAA;AAC3E,OAAO,KAAK,EACR,aAAa,EACb,YAAY,EACZ,sBAAsB,EACtB,4BAA4B,EAC5B,0BAA0B,EAC1B,UAAU,EAEb,MAAM,sBAAsB,CAAA;AAE7B,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAA;AAE5C;;;;;GAKG;AACH,MAAM,MAAM,eAAe,CACvB,kBAAkB,SAAS,sBAAsB,GAAG,sBAAsB,IAC1E;IACA,IAAI,EAAE,WAAW,GAAG,OAAO,CAAA;IAC3B,KAAK,EAAE,kBAAkB,CAAA;IACzB,QAAQ,CAAC,EAAE,SAAS,UAAU,EAAE,CAAA;CACnC,CAAA;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACjC,IAAI,SAAS,aAAa,GAAG,aAAa,EAC1C,QAAQ,SAAS,YAAY,GAAG,YAAY,EAC5C,KAAK,SAAS,4BAA4B,GAAG,4BAA4B,EACzE,IAAI,SAAS,0BAA0B,GAAG,0BAA0B,EACpE,MAAM,SAAS,UAAU,GAAG,UAAU,EACtC,KAAK,SAAS,oBAAoB,GAAG,oBAAoB,EAEzD,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,EAC3D,cAAc,EAAE,MAAM,EACtB,MAAM,EAAE,sBAAsB,CAAC,KAAK,CAAC,GACtC,eAAe,CA4LjB"}