@stevenvo780/st-lang 4.2.0 → 4.3.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 (293) hide show
  1. package/dist/index.d.ts +4 -0
  2. package/dist/index.d.ts.map +1 -1
  3. package/dist/index.js +36 -1
  4. package/dist/index.js.map +1 -1
  5. package/dist/lambda-calc/church.d.ts +8 -0
  6. package/dist/lambda-calc/church.d.ts.map +1 -0
  7. package/dist/lambda-calc/church.js +67 -0
  8. package/dist/lambda-calc/church.js.map +1 -0
  9. package/dist/lambda-calc/combinators.d.ts +8 -0
  10. package/dist/lambda-calc/combinators.d.ts.map +1 -0
  11. package/dist/lambda-calc/combinators.js +24 -0
  12. package/dist/lambda-calc/combinators.js.map +1 -0
  13. package/dist/lambda-calc/index.d.ts +8 -0
  14. package/dist/lambda-calc/index.d.ts.map +1 -0
  15. package/dist/lambda-calc/index.js +48 -0
  16. package/dist/lambda-calc/index.js.map +1 -0
  17. package/dist/lambda-calc/reduce.d.ts +18 -0
  18. package/dist/lambda-calc/reduce.d.ts.map +1 -0
  19. package/dist/lambda-calc/reduce.js +174 -0
  20. package/dist/lambda-calc/reduce.js.map +1 -0
  21. package/dist/lambda-calc/substitution.d.ts +6 -0
  22. package/dist/lambda-calc/substitution.d.ts.map +1 -0
  23. package/dist/lambda-calc/substitution.js +120 -0
  24. package/dist/lambda-calc/substitution.js.map +1 -0
  25. package/dist/lambda-calc/types.d.ts +19 -0
  26. package/dist/lambda-calc/types.d.ts.map +1 -0
  27. package/dist/lambda-calc/types.js +72 -0
  28. package/dist/lambda-calc/types.js.map +1 -0
  29. package/dist/profiles/intuitionistic-nj/formula.d.ts +19 -0
  30. package/dist/profiles/intuitionistic-nj/formula.d.ts.map +1 -0
  31. package/dist/profiles/intuitionistic-nj/formula.js +99 -0
  32. package/dist/profiles/intuitionistic-nj/formula.js.map +1 -0
  33. package/dist/profiles/intuitionistic-nj/index.d.ts +5 -0
  34. package/dist/profiles/intuitionistic-nj/index.d.ts.map +1 -0
  35. package/dist/profiles/intuitionistic-nj/index.js +24 -0
  36. package/dist/profiles/intuitionistic-nj/index.js.map +1 -0
  37. package/dist/profiles/intuitionistic-nj/kripke.d.ts +17 -0
  38. package/dist/profiles/intuitionistic-nj/kripke.d.ts.map +1 -0
  39. package/dist/profiles/intuitionistic-nj/kripke.js +206 -0
  40. package/dist/profiles/intuitionistic-nj/kripke.js.map +1 -0
  41. package/dist/profiles/intuitionistic-nj/prover.d.ts +13 -0
  42. package/dist/profiles/intuitionistic-nj/prover.d.ts.map +1 -0
  43. package/dist/profiles/intuitionistic-nj/prover.js +418 -0
  44. package/dist/profiles/intuitionistic-nj/prover.js.map +1 -0
  45. package/dist/profiles/intuitionistic-nj/types.d.ts +55 -0
  46. package/dist/profiles/intuitionistic-nj/types.d.ts.map +1 -0
  47. package/dist/profiles/intuitionistic-nj/types.js +21 -0
  48. package/dist/profiles/intuitionistic-nj/types.js.map +1 -0
  49. package/dist/profiles/many-valued/index.d.ts +39 -0
  50. package/dist/profiles/many-valued/index.d.ts.map +1 -0
  51. package/dist/profiles/many-valued/index.js +250 -0
  52. package/dist/profiles/many-valued/index.js.map +1 -0
  53. package/dist/profiles/modal-frame-axioms/formula.d.ts +23 -0
  54. package/dist/profiles/modal-frame-axioms/formula.d.ts.map +1 -0
  55. package/dist/profiles/modal-frame-axioms/formula.js +158 -0
  56. package/dist/profiles/modal-frame-axioms/formula.js.map +1 -0
  57. package/dist/profiles/modal-frame-axioms/index.d.ts +6 -0
  58. package/dist/profiles/modal-frame-axioms/index.d.ts.map +1 -0
  59. package/dist/profiles/modal-frame-axioms/index.js +41 -0
  60. package/dist/profiles/modal-frame-axioms/index.js.map +1 -0
  61. package/dist/profiles/modal-frame-axioms/systems.d.ts +29 -0
  62. package/dist/profiles/modal-frame-axioms/systems.d.ts.map +1 -0
  63. package/dist/profiles/modal-frame-axioms/systems.js +96 -0
  64. package/dist/profiles/modal-frame-axioms/systems.js.map +1 -0
  65. package/dist/profiles/modal-frame-axioms/tableau.d.ts +12 -0
  66. package/dist/profiles/modal-frame-axioms/tableau.d.ts.map +1 -0
  67. package/dist/profiles/modal-frame-axioms/tableau.js +299 -0
  68. package/dist/profiles/modal-frame-axioms/tableau.js.map +1 -0
  69. package/dist/profiles/modal-frame-axioms/types.d.ts +61 -0
  70. package/dist/profiles/modal-frame-axioms/types.d.ts.map +1 -0
  71. package/dist/profiles/modal-frame-axioms/types.js +27 -0
  72. package/dist/profiles/modal-frame-axioms/types.js.map +1 -0
  73. package/dist/profiles/substructural/index.d.ts +4 -0
  74. package/dist/profiles/substructural/index.d.ts.map +1 -0
  75. package/dist/profiles/substructural/index.js +22 -0
  76. package/dist/profiles/substructural/index.js.map +1 -0
  77. package/dist/profiles/substructural/prover.d.ts +13 -0
  78. package/dist/profiles/substructural/prover.d.ts.map +1 -0
  79. package/dist/profiles/substructural/prover.js +481 -0
  80. package/dist/profiles/substructural/prover.js.map +1 -0
  81. package/dist/profiles/substructural/types.d.ts +72 -0
  82. package/dist/profiles/substructural/types.d.ts.map +1 -0
  83. package/dist/profiles/substructural/types.js +27 -0
  84. package/dist/profiles/substructural/types.js.map +1 -0
  85. package/dist/runtime/abduction/entails.d.ts +21 -0
  86. package/dist/runtime/abduction/entails.d.ts.map +1 -0
  87. package/dist/runtime/abduction/entails.js +308 -0
  88. package/dist/runtime/abduction/entails.js.map +1 -0
  89. package/dist/runtime/abduction/find.d.ts +18 -0
  90. package/dist/runtime/abduction/find.d.ts.map +1 -0
  91. package/dist/runtime/abduction/find.js +202 -0
  92. package/dist/runtime/abduction/find.js.map +1 -0
  93. package/dist/runtime/abduction/index.d.ts +4 -0
  94. package/dist/runtime/abduction/index.d.ts.map +1 -0
  95. package/dist/runtime/abduction/index.js +26 -0
  96. package/dist/runtime/abduction/index.js.map +1 -0
  97. package/dist/runtime/abduction/types.d.ts +78 -0
  98. package/dist/runtime/abduction/types.d.ts.map +1 -0
  99. package/dist/runtime/abduction/types.js +23 -0
  100. package/dist/runtime/abduction/types.js.map +1 -0
  101. package/dist/runtime/bayesian/factor.d.ts +22 -0
  102. package/dist/runtime/bayesian/factor.d.ts.map +1 -0
  103. package/dist/runtime/bayesian/factor.js +249 -0
  104. package/dist/runtime/bayesian/factor.js.map +1 -0
  105. package/dist/runtime/bayesian/index.d.ts +3 -0
  106. package/dist/runtime/bayesian/index.d.ts.map +1 -0
  107. package/dist/runtime/bayesian/index.js +25 -0
  108. package/dist/runtime/bayesian/index.js.map +1 -0
  109. package/dist/runtime/bayesian/inference.d.ts +6 -0
  110. package/dist/runtime/bayesian/inference.d.ts.map +1 -0
  111. package/dist/runtime/bayesian/inference.js +260 -0
  112. package/dist/runtime/bayesian/inference.js.map +1 -0
  113. package/dist/runtime/bayesian/types.d.ts +19 -0
  114. package/dist/runtime/bayesian/types.d.ts.map +1 -0
  115. package/dist/runtime/bayesian/types.js +9 -0
  116. package/dist/runtime/bayesian/types.js.map +1 -0
  117. package/dist/runtime/bisimulation/index.d.ts +4 -0
  118. package/dist/runtime/bisimulation/index.d.ts.map +1 -0
  119. package/dist/runtime/bisimulation/index.js +21 -0
  120. package/dist/runtime/bisimulation/index.js.map +1 -0
  121. package/dist/runtime/bisimulation/operations.d.ts +40 -0
  122. package/dist/runtime/bisimulation/operations.d.ts.map +1 -0
  123. package/dist/runtime/bisimulation/operations.js +219 -0
  124. package/dist/runtime/bisimulation/operations.js.map +1 -0
  125. package/dist/runtime/bisimulation/paige-tarjan.d.ts +8 -0
  126. package/dist/runtime/bisimulation/paige-tarjan.d.ts.map +1 -0
  127. package/dist/runtime/bisimulation/paige-tarjan.js +199 -0
  128. package/dist/runtime/bisimulation/paige-tarjan.js.map +1 -0
  129. package/dist/runtime/bisimulation/types.d.ts +26 -0
  130. package/dist/runtime/bisimulation/types.d.ts.map +1 -0
  131. package/dist/runtime/bisimulation/types.js +22 -0
  132. package/dist/runtime/bisimulation/types.js.map +1 -0
  133. package/dist/runtime/fca/context.d.ts +46 -0
  134. package/dist/runtime/fca/context.d.ts.map +1 -0
  135. package/dist/runtime/fca/context.js +155 -0
  136. package/dist/runtime/fca/context.js.map +1 -0
  137. package/dist/runtime/fca/implications.d.ts +10 -0
  138. package/dist/runtime/fca/implications.d.ts.map +1 -0
  139. package/dist/runtime/fca/implications.js +33 -0
  140. package/dist/runtime/fca/implications.js.map +1 -0
  141. package/dist/runtime/fca/index.d.ts +6 -0
  142. package/dist/runtime/fca/index.d.ts.map +1 -0
  143. package/dist/runtime/fca/index.js +39 -0
  144. package/dist/runtime/fca/index.js.map +1 -0
  145. package/dist/runtime/fca/lattice.d.ts +10 -0
  146. package/dist/runtime/fca/lattice.d.ts.map +1 -0
  147. package/dist/runtime/fca/lattice.js +86 -0
  148. package/dist/runtime/fca/lattice.js.map +1 -0
  149. package/dist/runtime/fca/next-closure.d.ts +12 -0
  150. package/dist/runtime/fca/next-closure.d.ts.map +1 -0
  151. package/dist/runtime/fca/next-closure.js +99 -0
  152. package/dist/runtime/fca/next-closure.js.map +1 -0
  153. package/dist/runtime/fca/types.d.ts +31 -0
  154. package/dist/runtime/fca/types.d.ts.map +1 -0
  155. package/dist/runtime/fca/types.js +30 -0
  156. package/dist/runtime/fca/types.js.map +1 -0
  157. package/dist/runtime/proof-minify/index.d.ts +3 -0
  158. package/dist/runtime/proof-minify/index.d.ts.map +1 -0
  159. package/dist/runtime/proof-minify/index.js +13 -0
  160. package/dist/runtime/proof-minify/index.js.map +1 -0
  161. package/dist/runtime/proof-minify/minify.d.ts +13 -0
  162. package/dist/runtime/proof-minify/minify.d.ts.map +1 -0
  163. package/dist/runtime/proof-minify/minify.js +540 -0
  164. package/dist/runtime/proof-minify/minify.js.map +1 -0
  165. package/dist/runtime/proof-minify/types.d.ts +89 -0
  166. package/dist/runtime/proof-minify/types.d.ts.map +1 -0
  167. package/dist/runtime/proof-minify/types.js +16 -0
  168. package/dist/runtime/proof-minify/types.js.map +1 -0
  169. package/dist/runtime/symbolic-diff/constructors.d.ts +16 -0
  170. package/dist/runtime/symbolic-diff/constructors.d.ts.map +1 -0
  171. package/dist/runtime/symbolic-diff/constructors.js +75 -0
  172. package/dist/runtime/symbolic-diff/constructors.js.map +1 -0
  173. package/dist/runtime/symbolic-diff/differentiate.d.ts +22 -0
  174. package/dist/runtime/symbolic-diff/differentiate.d.ts.map +1 -0
  175. package/dist/runtime/symbolic-diff/differentiate.js +107 -0
  176. package/dist/runtime/symbolic-diff/differentiate.js.map +1 -0
  177. package/dist/runtime/symbolic-diff/evaluate.d.ts +3 -0
  178. package/dist/runtime/symbolic-diff/evaluate.d.ts.map +1 -0
  179. package/dist/runtime/symbolic-diff/evaluate.js +47 -0
  180. package/dist/runtime/symbolic-diff/evaluate.js.map +1 -0
  181. package/dist/runtime/symbolic-diff/index.d.ts +9 -0
  182. package/dist/runtime/symbolic-diff/index.d.ts.map +1 -0
  183. package/dist/runtime/symbolic-diff/index.js +34 -0
  184. package/dist/runtime/symbolic-diff/index.js.map +1 -0
  185. package/dist/runtime/symbolic-diff/parse.d.ts +16 -0
  186. package/dist/runtime/symbolic-diff/parse.d.ts.map +1 -0
  187. package/dist/runtime/symbolic-diff/parse.js +206 -0
  188. package/dist/runtime/symbolic-diff/parse.js.map +1 -0
  189. package/dist/runtime/symbolic-diff/simplify.d.ts +11 -0
  190. package/dist/runtime/symbolic-diff/simplify.d.ts.map +1 -0
  191. package/dist/runtime/symbolic-diff/simplify.js +214 -0
  192. package/dist/runtime/symbolic-diff/simplify.js.map +1 -0
  193. package/dist/runtime/symbolic-diff/stringify.d.ts +3 -0
  194. package/dist/runtime/symbolic-diff/stringify.d.ts.map +1 -0
  195. package/dist/runtime/symbolic-diff/stringify.js +69 -0
  196. package/dist/runtime/symbolic-diff/stringify.js.map +1 -0
  197. package/dist/runtime/symbolic-diff/types.d.ts +35 -0
  198. package/dist/runtime/symbolic-diff/types.d.ts.map +1 -0
  199. package/dist/runtime/symbolic-diff/types.js +9 -0
  200. package/dist/runtime/symbolic-diff/types.js.map +1 -0
  201. package/dist/runtime/term-rewriting/critical-pairs.d.ts +38 -0
  202. package/dist/runtime/term-rewriting/critical-pairs.d.ts.map +1 -0
  203. package/dist/runtime/term-rewriting/critical-pairs.js +109 -0
  204. package/dist/runtime/term-rewriting/critical-pairs.js.map +1 -0
  205. package/dist/runtime/term-rewriting/index.d.ts +9 -0
  206. package/dist/runtime/term-rewriting/index.d.ts.map +1 -0
  207. package/dist/runtime/term-rewriting/index.js +38 -0
  208. package/dist/runtime/term-rewriting/index.js.map +1 -0
  209. package/dist/runtime/term-rewriting/knuth-bendix.d.ts +29 -0
  210. package/dist/runtime/term-rewriting/knuth-bendix.d.ts.map +1 -0
  211. package/dist/runtime/term-rewriting/knuth-bendix.js +196 -0
  212. package/dist/runtime/term-rewriting/knuth-bendix.js.map +1 -0
  213. package/dist/runtime/term-rewriting/lpo.d.ts +17 -0
  214. package/dist/runtime/term-rewriting/lpo.d.ts.map +1 -0
  215. package/dist/runtime/term-rewriting/lpo.js +158 -0
  216. package/dist/runtime/term-rewriting/lpo.js.map +1 -0
  217. package/dist/runtime/term-rewriting/rewrite.d.ts +44 -0
  218. package/dist/runtime/term-rewriting/rewrite.d.ts.map +1 -0
  219. package/dist/runtime/term-rewriting/rewrite.js +189 -0
  220. package/dist/runtime/term-rewriting/rewrite.js.map +1 -0
  221. package/dist/runtime/term-rewriting/term-utils.d.ts +64 -0
  222. package/dist/runtime/term-rewriting/term-utils.d.ts.map +1 -0
  223. package/dist/runtime/term-rewriting/term-utils.js +360 -0
  224. package/dist/runtime/term-rewriting/term-utils.js.map +1 -0
  225. package/dist/runtime/term-rewriting/types.d.ts +66 -0
  226. package/dist/runtime/term-rewriting/types.d.ts.map +1 -0
  227. package/dist/runtime/term-rewriting/types.js +21 -0
  228. package/dist/runtime/term-rewriting/types.js.map +1 -0
  229. package/dist/tests/abduction/abduction.test.d.ts +2 -0
  230. package/dist/tests/abduction/abduction.test.d.ts.map +1 -0
  231. package/dist/tests/abduction/abduction.test.js +380 -0
  232. package/dist/tests/abduction/abduction.test.js.map +1 -0
  233. package/dist/tests/bayesian/bayesian.test.d.ts +2 -0
  234. package/dist/tests/bayesian/bayesian.test.d.ts.map +1 -0
  235. package/dist/tests/bayesian/bayesian.test.js +328 -0
  236. package/dist/tests/bayesian/bayesian.test.js.map +1 -0
  237. package/dist/tests/bisimulation/paige-tarjan.test.d.ts +2 -0
  238. package/dist/tests/bisimulation/paige-tarjan.test.d.ts.map +1 -0
  239. package/dist/tests/bisimulation/paige-tarjan.test.js +254 -0
  240. package/dist/tests/bisimulation/paige-tarjan.test.js.map +1 -0
  241. package/dist/tests/fca/fca.test.d.ts +2 -0
  242. package/dist/tests/fca/fca.test.d.ts.map +1 -0
  243. package/dist/tests/fca/fca.test.js +317 -0
  244. package/dist/tests/fca/fca.test.js.map +1 -0
  245. package/dist/tests/intuitionistic-nj/nj.test.d.ts +2 -0
  246. package/dist/tests/intuitionistic-nj/nj.test.d.ts.map +1 -0
  247. package/dist/tests/intuitionistic-nj/nj.test.js +216 -0
  248. package/dist/tests/intuitionistic-nj/nj.test.js.map +1 -0
  249. package/dist/tests/lambda-calc/lambda-calc.test.d.ts +2 -0
  250. package/dist/tests/lambda-calc/lambda-calc.test.d.ts.map +1 -0
  251. package/dist/tests/lambda-calc/lambda-calc.test.js +164 -0
  252. package/dist/tests/lambda-calc/lambda-calc.test.js.map +1 -0
  253. package/dist/tests/many-valued/many-valued.test.d.ts +2 -0
  254. package/dist/tests/many-valued/many-valued.test.d.ts.map +1 -0
  255. package/dist/tests/many-valued/many-valued.test.js +150 -0
  256. package/dist/tests/many-valued/many-valued.test.js.map +1 -0
  257. package/dist/tests/modal-frame-axioms/frame-axioms.test.d.ts +2 -0
  258. package/dist/tests/modal-frame-axioms/frame-axioms.test.d.ts.map +1 -0
  259. package/dist/tests/modal-frame-axioms/frame-axioms.test.js +236 -0
  260. package/dist/tests/modal-frame-axioms/frame-axioms.test.js.map +1 -0
  261. package/dist/tests/proof-minify/minify.test.d.ts +2 -0
  262. package/dist/tests/proof-minify/minify.test.d.ts.map +1 -0
  263. package/dist/tests/proof-minify/minify.test.js +281 -0
  264. package/dist/tests/proof-minify/minify.test.js.map +1 -0
  265. package/dist/tests/substructural/prover.test.d.ts +2 -0
  266. package/dist/tests/substructural/prover.test.d.ts.map +1 -0
  267. package/dist/tests/substructural/prover.test.js +271 -0
  268. package/dist/tests/substructural/prover.test.js.map +1 -0
  269. package/dist/tests/symbolic-diff/symbolic-diff.test.d.ts +2 -0
  270. package/dist/tests/symbolic-diff/symbolic-diff.test.d.ts.map +1 -0
  271. package/dist/tests/symbolic-diff/symbolic-diff.test.js +278 -0
  272. package/dist/tests/symbolic-diff/symbolic-diff.test.js.map +1 -0
  273. package/dist/tests/term-rewriting/critical-pairs.test.d.ts +2 -0
  274. package/dist/tests/term-rewriting/critical-pairs.test.d.ts.map +1 -0
  275. package/dist/tests/term-rewriting/critical-pairs.test.js +34 -0
  276. package/dist/tests/term-rewriting/critical-pairs.test.js.map +1 -0
  277. package/dist/tests/term-rewriting/knuth-bendix.test.d.ts +2 -0
  278. package/dist/tests/term-rewriting/knuth-bendix.test.d.ts.map +1 -0
  279. package/dist/tests/term-rewriting/knuth-bendix.test.js +94 -0
  280. package/dist/tests/term-rewriting/knuth-bendix.test.js.map +1 -0
  281. package/dist/tests/term-rewriting/lpo.test.d.ts +2 -0
  282. package/dist/tests/term-rewriting/lpo.test.d.ts.map +1 -0
  283. package/dist/tests/term-rewriting/lpo.test.js +57 -0
  284. package/dist/tests/term-rewriting/lpo.test.js.map +1 -0
  285. package/dist/tests/term-rewriting/rewrite.test.d.ts +2 -0
  286. package/dist/tests/term-rewriting/rewrite.test.d.ts.map +1 -0
  287. package/dist/tests/term-rewriting/rewrite.test.js +56 -0
  288. package/dist/tests/term-rewriting/rewrite.test.js.map +1 -0
  289. package/dist/tests/term-rewriting/term-utils.test.d.ts +2 -0
  290. package/dist/tests/term-rewriting/term-utils.test.d.ts.map +1 -0
  291. package/dist/tests/term-rewriting/term-utils.test.js +58 -0
  292. package/dist/tests/term-rewriting/term-utils.test.js.map +1 -0
  293. package/package.json +1 -1
@@ -0,0 +1,380 @@
1
+ "use strict";
2
+ // ============================================================
3
+ // ST Abduction — Tests
4
+ // ============================================================
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ const vitest_1 = require("vitest");
7
+ const abduction_1 = require("../../runtime/abduction");
8
+ // ── Helpers para tests con oráculo custom ────────────────────
9
+ //
10
+ // Un oráculo "set-based" trivial: las premisas son tratadas como un
11
+ // set de strings; entails sii target ∈ closure(premises) bajo un set
12
+ // de reglas dadas como pares (lhs[]) → rhs.
13
+ function makeRuleEntails(rules) {
14
+ return (premises, target) => {
15
+ const facts = new Set(premises);
16
+ let changed = true;
17
+ let iter = 0;
18
+ while (changed && iter < 1000) {
19
+ changed = false;
20
+ iter++;
21
+ for (const r of rules) {
22
+ if (r.premises.every((p) => facts.has(p)) && !facts.has(r.conclusion)) {
23
+ facts.add(r.conclusion);
24
+ changed = true;
25
+ }
26
+ }
27
+ }
28
+ return facts.has(target);
29
+ };
30
+ }
31
+ // ── Test 1: caso canónico bird(x) → fly(x), observe fly(tweety) ──
32
+ (0, vitest_1.describe)('abduction — caso canónico bird→fly', () => {
33
+ (0, vitest_1.it)('bird(tweety) explica fly(tweety)', () => {
34
+ const problem = {
35
+ kb: ['bird(x) → fly(x)'],
36
+ observation: 'fly(tweety)',
37
+ abducibles: ['bird(tweety)'],
38
+ };
39
+ const expls = (0, abduction_1.findExplanations)(problem);
40
+ (0, vitest_1.expect)(expls).toHaveLength(1);
41
+ const e0 = expls[0];
42
+ (0, vitest_1.expect)(e0).toBeDefined();
43
+ if (!e0)
44
+ return;
45
+ (0, vitest_1.expect)(e0.hypotheses).toEqual(['bird(tweety)']);
46
+ (0, vitest_1.expect)(e0.size).toBe(1);
47
+ (0, vitest_1.expect)(e0.parsimonious).toBe(true);
48
+ });
49
+ (0, vitest_1.it)('bestExplanation devuelve la única solución', () => {
50
+ const problem = {
51
+ kb: ['bird(x) → fly(x)'],
52
+ observation: 'fly(tweety)',
53
+ abducibles: ['bird(tweety)', 'sparrow(tweety)'],
54
+ };
55
+ const best = (0, abduction_1.bestExplanation)(problem);
56
+ (0, vitest_1.expect)(best).not.toBeNull();
57
+ (0, vitest_1.expect)(best?.hypotheses).toEqual(['bird(tweety)']);
58
+ });
59
+ });
60
+ // ── Test 2: múltiples explicaciones, preferencia minimum-cardinality ──
61
+ (0, vitest_1.describe)('abduction — preferencia minimum-cardinality', () => {
62
+ // KB:
63
+ // has_cough ∧ has_fever → flu
64
+ // flu_short → flu (un único hecho ya basta)
65
+ // Observation: flu
66
+ // Abducibles: [has_cough, has_fever, flu_short]
67
+ //
68
+ // Explicaciones: {flu_short} (size 1), {has_cough, has_fever} (size 2).
69
+ // minimum-cardinality debe devolver solo {flu_short}.
70
+ const kb = ['has_cough ∧ has_fever → flu', 'flu_short → flu'];
71
+ const abducibles = ['has_cough', 'has_fever', 'flu_short'];
72
+ const problem = { kb, observation: 'flu', abducibles };
73
+ (0, vitest_1.it)('preferred=all devuelve todas (incluye supersets)', () => {
74
+ const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'all' });
75
+ // Hay al menos las dos minimal: {flu_short} y {has_cough, has_fever}.
76
+ const minimal = expls.filter((e) => e.parsimonious);
77
+ const minimalSizes = minimal.map((e) => e.size).sort();
78
+ (0, vitest_1.expect)(minimalSizes).toEqual([1, 2]);
79
+ // El total puede incluir supersets no parsimoniosos.
80
+ (0, vitest_1.expect)(expls.length).toBeGreaterThanOrEqual(2);
81
+ });
82
+ (0, vitest_1.it)('preferred=minimal filtra a las dos parsimoniosas', () => {
83
+ const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'minimal' });
84
+ const sizes = expls.map((e) => e.size).sort();
85
+ (0, vitest_1.expect)(sizes).toEqual([1, 2]);
86
+ (0, vitest_1.expect)(expls.every((e) => e.parsimonious)).toBe(true);
87
+ });
88
+ (0, vitest_1.it)('preferred=minimum-cardinality devuelve la pequeña', () => {
89
+ const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'minimum-cardinality' });
90
+ (0, vitest_1.expect)(expls).toHaveLength(1);
91
+ const e0 = expls[0];
92
+ if (!e0)
93
+ return;
94
+ (0, vitest_1.expect)(e0.hypotheses).toEqual(['flu_short']);
95
+ (0, vitest_1.expect)(e0.size).toBe(1);
96
+ });
97
+ });
98
+ // ── Test 3: costFunction define preferencia ──────────────────
99
+ (0, vitest_1.describe)('abduction — preferencia minimum-cost', () => {
100
+ // Dos explicaciones de igual tamaño con costos distintos.
101
+ // KB: cause_a → symptom; cause_b → symptom.
102
+ // Abducibles: [cause_a, cause_b]
103
+ // Costs: cause_a = 5, cause_b = 1
104
+ // → minimum-cost debe preferir cause_b.
105
+ const kb = ['cause_a → symptom', 'cause_b → symptom'];
106
+ const abducibles = ['cause_a', 'cause_b'];
107
+ const problem = { kb, observation: 'symptom', abducibles };
108
+ const costFunction = (h) => (h === 'cause_a' ? 5 : 1);
109
+ (0, vitest_1.it)('minimum-cost selecciona cause_b', () => {
110
+ const expls = (0, abduction_1.findExplanations)(problem, {
111
+ costFunction,
112
+ preferred: 'minimum-cost',
113
+ });
114
+ (0, vitest_1.expect)(expls).toHaveLength(1);
115
+ const e0 = expls[0];
116
+ if (!e0)
117
+ return;
118
+ (0, vitest_1.expect)(e0.hypotheses).toEqual(['cause_b']);
119
+ (0, vitest_1.expect)(e0.costScore).toBe(1);
120
+ });
121
+ (0, vitest_1.it)('bestExplanation con costFunction usa minimum-cost por default', () => {
122
+ const best = (0, abduction_1.bestExplanation)(problem, { costFunction });
123
+ (0, vitest_1.expect)(best?.hypotheses).toEqual(['cause_b']);
124
+ (0, vitest_1.expect)(best?.costScore).toBe(1);
125
+ });
126
+ });
127
+ // ── Test 4: hipótesis inconsistente rechazada ────────────────
128
+ (0, vitest_1.describe)('abduction — rechaza hipótesis inconsistente', () => {
129
+ (0, vitest_1.it)('no devuelve H que contradice KB', () => {
130
+ // KB: ¬p (de hecho fijo). Abducible: p. Observación: q.
131
+ // {p} es inconsistente con KB → no debe ser explicación.
132
+ // Como no hay forma de explicar q, no hay explicaciones.
133
+ const problem = {
134
+ kb: ['¬p'],
135
+ observation: 'q',
136
+ abducibles: ['p'],
137
+ };
138
+ const expls = (0, abduction_1.findExplanations)(problem);
139
+ (0, vitest_1.expect)(expls).toHaveLength(0);
140
+ });
141
+ (0, vitest_1.it)('elige H consistente cuando hay otra opción', () => {
142
+ // KB: ¬p, q_via_r → q
143
+ // Abducibles: p, q_via_r
144
+ // {q_via_r} consistent y entails q → única explicación.
145
+ const problem = {
146
+ kb: ['¬p', 'q_via_r → q'],
147
+ observation: 'q',
148
+ abducibles: ['p', 'q_via_r'],
149
+ };
150
+ const expls = (0, abduction_1.findExplanations)(problem);
151
+ (0, vitest_1.expect)(expls).toHaveLength(1);
152
+ const e0 = expls[0];
153
+ if (!e0)
154
+ return;
155
+ (0, vitest_1.expect)(e0.hypotheses).toEqual(['q_via_r']);
156
+ });
157
+ });
158
+ // ── Test 5: observación ya implicada por KB ──────────────────
159
+ (0, vitest_1.describe)('abduction — KB ya implica O', () => {
160
+ (0, vitest_1.it)('devuelve explicación vacía cuando KB ⊨ O', () => {
161
+ // KB ya contiene la observación como hecho.
162
+ const problem = {
163
+ kb: ['daylight'],
164
+ observation: 'daylight',
165
+ abducibles: ['sun_up'],
166
+ };
167
+ const expls = (0, abduction_1.findExplanations)(problem);
168
+ (0, vitest_1.expect)(expls.length).toBeGreaterThan(0);
169
+ const empty = expls.find((e) => e.size === 0);
170
+ (0, vitest_1.expect)(empty).toBeDefined();
171
+ (0, vitest_1.expect)(empty?.parsimonious).toBe(true);
172
+ });
173
+ });
174
+ // ── Test 6: sin explicación posible ──────────────────────────
175
+ (0, vitest_1.describe)('abduction — sin explicación', () => {
176
+ (0, vitest_1.it)('devuelve [] cuando ningún subset explica O', () => {
177
+ // KB no conecta abducibles con la observación.
178
+ const problem = {
179
+ kb: ['a → b'],
180
+ observation: 'unrelated',
181
+ abducibles: ['a', 'b', 'c'],
182
+ };
183
+ const expls = (0, abduction_1.findExplanations)(problem);
184
+ (0, vitest_1.expect)(expls).toHaveLength(0);
185
+ (0, vitest_1.expect)((0, abduction_1.bestExplanation)(problem)).toBeNull();
186
+ });
187
+ });
188
+ // ── Test 7: parsimony — supersets no son parsimoniosos ───────
189
+ (0, vitest_1.describe)('abduction — parsimony por inclusión', () => {
190
+ (0, vitest_1.it)('preferred=all marca correctamente parsimonious', () => {
191
+ // KB: a → o
192
+ // Abducibles: [a, b]
193
+ // Explicaciones: {a} y {a,b}. {a,b} no es parsimoniosa (⊃ {a}).
194
+ const problem = {
195
+ kb: ['a → o'],
196
+ observation: 'o',
197
+ abducibles: ['a', 'b'],
198
+ };
199
+ const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'all' });
200
+ const singleA = expls.find((e) => e.hypotheses.length === 1 && e.hypotheses[0] === 'a');
201
+ const pair = expls.find((e) => e.hypotheses.length === 2);
202
+ (0, vitest_1.expect)(singleA?.parsimonious).toBe(true);
203
+ (0, vitest_1.expect)(pair?.parsimonious).toBe(false);
204
+ });
205
+ (0, vitest_1.it)('preferred=minimal filtra los no parsimoniosos', () => {
206
+ const problem = {
207
+ kb: ['a → o'],
208
+ observation: 'o',
209
+ abducibles: ['a', 'b'],
210
+ };
211
+ const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'minimal' });
212
+ (0, vitest_1.expect)(expls).toHaveLength(1);
213
+ const e0 = expls[0];
214
+ if (!e0)
215
+ return;
216
+ (0, vitest_1.expect)(e0.hypotheses).toEqual(['a']);
217
+ });
218
+ });
219
+ // ── Test 8: cadena de implicación profunda ───────────────────
220
+ (0, vitest_1.describe)('abduction — cadenas de implicaciones', () => {
221
+ (0, vitest_1.it)('explica a través de cadena Horn de profundidad 3', () => {
222
+ // a → b, b → c, c → d. Observation: d. Abducible: a.
223
+ const problem = {
224
+ kb: ['a → b', 'b → c', 'c → d'],
225
+ observation: 'd',
226
+ abducibles: ['a'],
227
+ };
228
+ const expls = (0, abduction_1.findExplanations)(problem);
229
+ (0, vitest_1.expect)(expls).toHaveLength(1);
230
+ const e0 = expls[0];
231
+ if (!e0)
232
+ return;
233
+ (0, vitest_1.expect)(e0.hypotheses).toEqual(['a']);
234
+ });
235
+ });
236
+ // ── Test 9: maxSize acota el espacio ─────────────────────────
237
+ (0, vitest_1.describe)('abduction — maxSize cap', () => {
238
+ (0, vitest_1.it)('respeta maxSize=1 y no encuentra explicaciones de tamaño 2', () => {
239
+ // Solo {a,b} conjuntos explica o; ningún singleton lo logra.
240
+ const problem = {
241
+ kb: ['a ∧ b → o'],
242
+ observation: 'o',
243
+ abducibles: ['a', 'b'],
244
+ };
245
+ // Sin cap: encuentra {a,b}.
246
+ const all = (0, abduction_1.findExplanations)(problem);
247
+ (0, vitest_1.expect)(all).toHaveLength(1);
248
+ // Con maxSize=1: nada.
249
+ const capped = (0, abduction_1.findExplanations)(problem, { maxSize: 1 });
250
+ (0, vitest_1.expect)(capped).toHaveLength(0);
251
+ });
252
+ });
253
+ // ── Test 10: oráculo custom (independencia del default) ─────
254
+ (0, vitest_1.describe)('abduction — oráculo de entailment custom', () => {
255
+ (0, vitest_1.it)('soporta oráculo set-based externo', () => {
256
+ const entails = makeRuleEntails([
257
+ { premises: ['rain'], conclusion: 'wet_ground' },
258
+ { premises: ['sprinkler'], conclusion: 'wet_ground' },
259
+ ]);
260
+ const problem = {
261
+ kb: [],
262
+ observation: 'wet_ground',
263
+ abducibles: ['rain', 'sprinkler'],
264
+ };
265
+ const expls = (0, abduction_1.findExplanations)(problem, {
266
+ entails,
267
+ consistent: () => true,
268
+ preferred: 'all',
269
+ });
270
+ const sizes = expls.map((e) => e.size).sort();
271
+ (0, vitest_1.expect)(sizes).toEqual([1, 1, 2]); // {rain}, {sprinkler}, {rain,sprinkler}
272
+ const minimal = expls.filter((e) => e.parsimonious);
273
+ (0, vitest_1.expect)(minimal).toHaveLength(2); // {rain} y {sprinkler}
274
+ });
275
+ (0, vitest_1.it)('multiple minimal explanations con minimum-cardinality', () => {
276
+ const entails = makeRuleEntails([
277
+ { premises: ['rain'], conclusion: 'wet_ground' },
278
+ { premises: ['sprinkler'], conclusion: 'wet_ground' },
279
+ ]);
280
+ const problem = {
281
+ kb: [],
282
+ observation: 'wet_ground',
283
+ abducibles: ['rain', 'sprinkler'],
284
+ };
285
+ const expls = (0, abduction_1.findExplanations)(problem, {
286
+ entails,
287
+ consistent: () => true,
288
+ preferred: 'minimum-cardinality',
289
+ });
290
+ (0, vitest_1.expect)(expls).toHaveLength(2);
291
+ (0, vitest_1.expect)(expls.every((e) => e.size === 1)).toBe(true);
292
+ });
293
+ });
294
+ // ── Test 11: bestExplanation tiebreak determinista ───────────
295
+ (0, vitest_1.describe)('abduction — bestExplanation determinismo', () => {
296
+ (0, vitest_1.it)('dos corridas devuelven el mismo resultado', () => {
297
+ const problem = {
298
+ kb: ['a → o', 'b → o', 'c → o'],
299
+ observation: 'o',
300
+ abducibles: ['a', 'b', 'c'],
301
+ };
302
+ const b1 = (0, abduction_1.bestExplanation)(problem);
303
+ const b2 = (0, abduction_1.bestExplanation)(problem);
304
+ (0, vitest_1.expect)(b1?.hypotheses).toEqual(b2?.hypotheses);
305
+ });
306
+ });
307
+ // ── Test 12: oráculo de consistencia rechaza ⊥ ──────────────
308
+ (0, vitest_1.describe)('abduction — defaultConsistent detecta ¬p ∧ p', () => {
309
+ (0, vitest_1.it)('KB con p y ¬p reporta inconsistente', () => {
310
+ const consistent = (0, abduction_1.defaultConsistent)();
311
+ (0, vitest_1.expect)(consistent(['p', '¬p'])).toBe(false);
312
+ (0, vitest_1.expect)(consistent(['p', 'q'])).toBe(true);
313
+ });
314
+ (0, vitest_1.it)('inconsistencia derivada por forward-chaining', () => {
315
+ const consistent = (0, abduction_1.defaultConsistent)();
316
+ // p, p → ¬q, q ⇒ ¬q ∧ q.
317
+ (0, vitest_1.expect)(consistent(['p', 'p → ¬q', 'q'])).toBe(false);
318
+ });
319
+ });
320
+ // ── Test 13: defaultEntails con cadenas y unificación ───────
321
+ (0, vitest_1.describe)('abduction — defaultEntails básico', () => {
322
+ (0, vitest_1.it)('forward-chaining sin variables', () => {
323
+ const entails = (0, abduction_1.defaultEntails)();
324
+ (0, vitest_1.expect)(entails(['a', 'a → b'], 'b')).toBe(true);
325
+ (0, vitest_1.expect)(entails(['a → b'], 'b')).toBe(false);
326
+ });
327
+ (0, vitest_1.it)('forward-chaining con variable única', () => {
328
+ const entails = (0, abduction_1.defaultEntails)();
329
+ (0, vitest_1.expect)(entails(['p(alice)', 'p(x) → q(x)'], 'q(alice)')).toBe(true);
330
+ (0, vitest_1.expect)(entails(['p(alice)', 'p(x) → q(x)'], 'q(bob)')).toBe(false);
331
+ });
332
+ (0, vitest_1.it)('forward-chaining con dos variables', () => {
333
+ const entails = (0, abduction_1.defaultEntails)();
334
+ (0, vitest_1.expect)(entails(['parent(alice, bob)', 'parent(x, y) → ancestor(x, y)'], 'ancestor(alice, bob)')).toBe(true);
335
+ });
336
+ });
337
+ // ── Test 14: maxHypotheses limita el tamaño del output ──────
338
+ (0, vitest_1.describe)('abduction — maxHypotheses cap', () => {
339
+ (0, vitest_1.it)('no devuelve más explicaciones que maxHypotheses', () => {
340
+ // Muchas hipótesis posibles individuales.
341
+ const kb = ['a → o', 'b → o', 'c → o', 'd → o'];
342
+ const abducibles = ['a', 'b', 'c', 'd'];
343
+ const problem = { kb, observation: 'o', abducibles };
344
+ const expls = (0, abduction_1.findExplanations)(problem, { maxHypotheses: 2, preferred: 'all' });
345
+ (0, vitest_1.expect)(expls.length).toBeLessThanOrEqual(2);
346
+ });
347
+ });
348
+ // ── Test 15: diagnóstico con costos asimétricos ─────────────
349
+ (0, vitest_1.describe)('abduction — diagnóstico médico de juguete', () => {
350
+ // KB:
351
+ // flu → fever
352
+ // covid → fever
353
+ // covid → cough
354
+ // bacterial → fever
355
+ // Observación: fever.
356
+ // Abducibles: flu, covid, bacterial.
357
+ // Sin cost: las tres son explicaciones single-element parsimoniosas.
358
+ // Con cost: flu=1, bacterial=2, covid=10 → flu es la best.
359
+ const kb = ['flu → fever', 'covid → fever', 'covid → cough', 'bacterial → fever'];
360
+ const abducibles = ['flu', 'covid', 'bacterial'];
361
+ (0, vitest_1.it)('sin cost, 3 minimal explanations', () => {
362
+ const problem = { kb, observation: 'fever', abducibles };
363
+ const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'minimum-cardinality' });
364
+ (0, vitest_1.expect)(expls).toHaveLength(3);
365
+ (0, vitest_1.expect)(expls.every((e) => e.size === 1)).toBe(true);
366
+ });
367
+ (0, vitest_1.it)('con cost, flu gana', () => {
368
+ const problem = { kb, observation: 'fever', abducibles };
369
+ const cost = (h) => {
370
+ if (h === 'flu')
371
+ return 1;
372
+ if (h === 'bacterial')
373
+ return 2;
374
+ return 10;
375
+ };
376
+ const best = (0, abduction_1.bestExplanation)(problem, { costFunction: cost });
377
+ (0, vitest_1.expect)(best?.hypotheses).toEqual(['flu']);
378
+ });
379
+ });
380
+ //# sourceMappingURL=abduction.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"abduction.test.js","sourceRoot":"","sources":["../../../src/tests/abduction/abduction.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uBAAuB;AACvB,+DAA+D;;AAE/D,mCAA8C;AAC9C,uDAQiC;AAEjC,gEAAgE;AAChE,EAAE;AACF,oEAAoE;AACpE,qEAAqE;AACrE,4CAA4C;AAE5C,SAAS,eAAe,CACtB,KAAgE;IAEhE,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE;QAC1B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;QACxC,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,OAAO,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;YAC9B,OAAO,GAAG,KAAK,CAAC;YAChB,IAAI,EAAE,CAAC;YACP,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;oBACtE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;oBACxB,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3B,CAAC,CAAC;AACJ,CAAC;AAED,oEAAoE;AAEpE,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,kBAAkB,CAAC;YACxB,WAAW,EAAE,aAAa;YAC1B,UAAU,EAAE,CAAC,cAAc,CAAC;SAC7B,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QACzB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,EAAE,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,kBAAkB,CAAC;YACxB,WAAW,EAAE,aAAa;YAC1B,UAAU,EAAE,CAAC,cAAc,EAAE,iBAAiB,CAAC;SAChD,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,OAAO,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAI,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,yEAAyE;AAEzE,IAAA,iBAAQ,EAAC,6CAA6C,EAAE,GAAG,EAAE;IAC3D,MAAM;IACN,gCAAgC;IAChC,6DAA6D;IAC7D,mBAAmB;IACnB,gDAAgD;IAChD,EAAE;IACF,wEAAwE;IACxE,sDAAsD;IACtD,MAAM,EAAE,GAAG,CAAC,6BAA6B,EAAE,iBAAiB,CAAC,CAAC;IAC9D,MAAM,UAAU,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;IAC3D,MAAM,OAAO,GAAqB,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAEzE,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9D,sEAAsE;QACtE,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QACpD,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACvD,IAAA,eAAM,EAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,qDAAqD;QACrD,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,qBAAqB,EAAE,CAAC,CAAC;QAC9E,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,0DAA0D;IAC1D,4CAA4C;IAC5C,iCAAiC;IACjC,kCAAkC;IAClC,wCAAwC;IACxC,MAAM,EAAE,GAAG,CAAC,mBAAmB,EAAE,mBAAmB,CAAC,CAAC;IACtD,MAAM,UAAU,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAqB,EAAE,EAAE,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;IAE7E,MAAM,YAAY,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvE,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE;YACtC,YAAY;YACZ,SAAS,EAAE,cAAc;SAC1B,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,EAAE,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,OAAO,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,IAAI,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAI,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,6CAA6C,EAAE,GAAG,EAAE;IAC3D,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,wDAAwD;QACxD,yDAAyD;QACzD,yDAAyD;QACzD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,IAAI,CAAC;YACV,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,CAAC;SAClB,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,sBAAsB;QACtB,yBAAyB;QACzB,wDAAwD;QACxD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,IAAI,EAAE,aAAa,CAAC;YACzB,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,EAAE,SAAS,CAAC;SAC7B,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,4CAA4C;QAC5C,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,UAAU,CAAC;YAChB,WAAW,EAAE,UAAU;YACvB,UAAU,EAAE,CAAC,QAAQ,CAAC;SACvB,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5B,IAAA,eAAM,EAAC,KAAK,EAAE,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,+CAA+C;QAC/C,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,OAAO,CAAC;YACb,WAAW,EAAE,WAAW;YACxB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;SAC5B,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,2BAAe,EAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,YAAY;QACZ,qBAAqB;QACrB,gEAAgE;QAChE,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,OAAO,CAAC;YACb,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;SACvB,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QACxF,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,OAAO,EAAE,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAI,EAAE,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,OAAO,CAAC;YACb,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;SACvB,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,qDAAqD;QACrD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC;YAC/B,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,CAAC;SAClB,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,6DAA6D;QAC7D,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,WAAW,CAAC;YACjB,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;SACvB,CAAC;QACF,4BAA4B;QAC5B,MAAM,GAAG,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,uBAAuB;QACvB,MAAM,MAAM,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,OAAO,GAAG,eAAe,CAAC;YAC9B,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE;YAChD,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE;SACtD,CAAC,CAAC;QACH,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,EAAE;YACN,WAAW,EAAE,YAAY;YACzB,UAAU,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;SAClC,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE;YACtC,OAAO;YACP,UAAU,EAAE,GAAG,EAAE,CAAC,IAAI;YACtB,SAAS,EAAE,KAAK;SACjB,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,wCAAwC;QAC1E,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB;IAC1D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,OAAO,GAAG,eAAe,CAAC;YAC9B,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE;YAChD,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE;SACtD,CAAC,CAAC;QACH,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,EAAE;YACN,WAAW,EAAE,YAAY;YACzB,UAAU,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;SAClC,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE;YACtC,OAAO;YACP,UAAU,EAAE,GAAG,EAAE,CAAC,IAAI;YACtB,SAAS,EAAE,qBAAqB;SACjC,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC;YAC/B,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;SAC5B,CAAC;QACF,MAAM,EAAE,GAAG,IAAA,2BAAe,EAAC,OAAO,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,IAAA,2BAAe,EAAC,OAAO,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,EAAE,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,UAAU,GAAG,IAAA,6BAAiB,GAAE,CAAC;QACvC,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,UAAU,GAAG,IAAA,6BAAiB,GAAE,CAAC;QACvC,2BAA2B;QAC3B,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,OAAO,GAAG,IAAA,0BAAc,GAAE,CAAC;QACjC,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG,IAAA,0BAAc,GAAE,CAAC;QACjC,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,UAAU,EAAE,aAAa,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,UAAU,EAAE,aAAa,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,OAAO,GAAG,IAAA,0BAAc,GAAE,CAAC;QACjC,IAAA,eAAM,EACJ,OAAO,CAAC,CAAC,oBAAoB,EAAE,+BAA+B,CAAC,EAAE,sBAAsB,CAAC,CACzF,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,0CAA0C;QAC1C,MAAM,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACxC,MAAM,OAAO,GAAqB,EAAE,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC;QACvE,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;QAChF,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,MAAM;IACN,gBAAgB;IAChB,kBAAkB;IAClB,kBAAkB;IAClB,sBAAsB;IACtB,sBAAsB;IACtB,qCAAqC;IACrC,qEAAqE;IACrE,2DAA2D;IAC3D,MAAM,EAAE,GAAG,CAAC,aAAa,EAAE,eAAe,EAAE,eAAe,EAAE,mBAAmB,CAAC,CAAC;IAClF,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;IAEjD,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,OAAO,GAAqB,EAAE,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;QAC3E,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,qBAAqB,EAAE,CAAC,CAAC;QAC9E,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,MAAM,OAAO,GAAqB,EAAE,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;QAC3E,MAAM,IAAI,GAAG,CAAC,CAAU,EAAU,EAAE;YAClC,IAAI,CAAC,KAAK,KAAK;gBAAE,OAAO,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,WAAW;gBAAE,OAAO,CAAC,CAAC;YAChC,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,OAAO,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,IAAI,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
@@ -0,0 +1,2 @@
1
+ export {};
2
+ //# sourceMappingURL=bayesian.test.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"bayesian.test.d.ts","sourceRoot":"","sources":["../../../src/tests/bayesian/bayesian.test.ts"],"names":[],"mappings":""}