@stevenvo780/st-lang 4.11.0 → 4.13.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 (273) hide show
  1. package/dist/proof-systems/fol-prover-advanced/index.d.ts +7 -0
  2. package/dist/proof-systems/fol-prover-advanced/index.d.ts.map +1 -0
  3. package/dist/proof-systems/fol-prover-advanced/index.js +34 -0
  4. package/dist/proof-systems/fol-prover-advanced/index.js.map +1 -0
  5. package/dist/proof-systems/fol-prover-advanced/ordering.d.ts +34 -0
  6. package/dist/proof-systems/fol-prover-advanced/ordering.d.ts.map +1 -0
  7. package/dist/proof-systems/fol-prover-advanced/ordering.js +197 -0
  8. package/dist/proof-systems/fol-prover-advanced/ordering.js.map +1 -0
  9. package/dist/proof-systems/fol-prover-advanced/prover.d.ts +22 -0
  10. package/dist/proof-systems/fol-prover-advanced/prover.d.ts.map +1 -0
  11. package/dist/proof-systems/fol-prover-advanced/prover.js +219 -0
  12. package/dist/proof-systems/fol-prover-advanced/prover.js.map +1 -0
  13. package/dist/proof-systems/fol-prover-advanced/resolve.d.ts +43 -0
  14. package/dist/proof-systems/fol-prover-advanced/resolve.d.ts.map +1 -0
  15. package/dist/proof-systems/fol-prover-advanced/resolve.js +297 -0
  16. package/dist/proof-systems/fol-prover-advanced/resolve.js.map +1 -0
  17. package/dist/proof-systems/fol-prover-advanced/subsumption.d.ts +28 -0
  18. package/dist/proof-systems/fol-prover-advanced/subsumption.d.ts.map +1 -0
  19. package/dist/proof-systems/fol-prover-advanced/subsumption.js +172 -0
  20. package/dist/proof-systems/fol-prover-advanced/subsumption.js.map +1 -0
  21. package/dist/proof-systems/fol-prover-advanced/types.d.ts +68 -0
  22. package/dist/proof-systems/fol-prover-advanced/types.d.ts.map +1 -0
  23. package/dist/proof-systems/fol-prover-advanced/types.js +12 -0
  24. package/dist/proof-systems/fol-prover-advanced/types.js.map +1 -0
  25. package/dist/proof-systems/fol-prover-advanced/unify.d.ts +15 -0
  26. package/dist/proof-systems/fol-prover-advanced/unify.d.ts.map +1 -0
  27. package/dist/proof-systems/fol-prover-advanced/unify.js +144 -0
  28. package/dist/proof-systems/fol-prover-advanced/unify.js.map +1 -0
  29. package/dist/reasoning/combinatorics/basic-counts.d.ts +6 -0
  30. package/dist/reasoning/combinatorics/basic-counts.d.ts.map +1 -0
  31. package/dist/reasoning/combinatorics/basic-counts.js +82 -0
  32. package/dist/reasoning/combinatorics/basic-counts.js.map +1 -0
  33. package/dist/reasoning/combinatorics/bigint-helpers.d.ts +5 -0
  34. package/dist/reasoning/combinatorics/bigint-helpers.d.ts.map +1 -0
  35. package/dist/reasoning/combinatorics/bigint-helpers.js +8 -0
  36. package/dist/reasoning/combinatorics/bigint-helpers.js.map +1 -0
  37. package/dist/reasoning/combinatorics/burnside.d.ts +15 -0
  38. package/dist/reasoning/combinatorics/burnside.d.ts.map +1 -0
  39. package/dist/reasoning/combinatorics/burnside.js +91 -0
  40. package/dist/reasoning/combinatorics/burnside.js.map +1 -0
  41. package/dist/reasoning/combinatorics/generating-functions.d.ts +12 -0
  42. package/dist/reasoning/combinatorics/generating-functions.d.ts.map +1 -0
  43. package/dist/reasoning/combinatorics/generating-functions.js +67 -0
  44. package/dist/reasoning/combinatorics/generating-functions.js.map +1 -0
  45. package/dist/reasoning/combinatorics/generators.d.ts +5 -0
  46. package/dist/reasoning/combinatorics/generators.d.ts.map +1 -0
  47. package/dist/reasoning/combinatorics/generators.js +111 -0
  48. package/dist/reasoning/combinatorics/generators.js.map +1 -0
  49. package/dist/reasoning/combinatorics/inclusion-exclusion.d.ts +8 -0
  50. package/dist/reasoning/combinatorics/inclusion-exclusion.d.ts.map +1 -0
  51. package/dist/reasoning/combinatorics/inclusion-exclusion.js +45 -0
  52. package/dist/reasoning/combinatorics/inclusion-exclusion.js.map +1 -0
  53. package/dist/reasoning/combinatorics/index.d.ts +10 -0
  54. package/dist/reasoning/combinatorics/index.d.ts.map +1 -0
  55. package/dist/reasoning/combinatorics/index.js +44 -0
  56. package/dist/reasoning/combinatorics/index.js.map +1 -0
  57. package/dist/reasoning/combinatorics/partitions.d.ts +4 -0
  58. package/dist/reasoning/combinatorics/partitions.d.ts.map +1 -0
  59. package/dist/reasoning/combinatorics/partitions.js +90 -0
  60. package/dist/reasoning/combinatorics/partitions.js.map +1 -0
  61. package/dist/reasoning/combinatorics/permutations.d.ts +6 -0
  62. package/dist/reasoning/combinatorics/permutations.d.ts.map +1 -0
  63. package/dist/reasoning/combinatorics/permutations.js +124 -0
  64. package/dist/reasoning/combinatorics/permutations.js.map +1 -0
  65. package/dist/reasoning/combinatorics/set-partitions.d.ts +3 -0
  66. package/dist/reasoning/combinatorics/set-partitions.d.ts.map +1 -0
  67. package/dist/reasoning/combinatorics/set-partitions.js +46 -0
  68. package/dist/reasoning/combinatorics/set-partitions.js.map +1 -0
  69. package/dist/reasoning/combinatorics/special-numbers.d.ts +7 -0
  70. package/dist/reasoning/combinatorics/special-numbers.d.ts.map +1 -0
  71. package/dist/reasoning/combinatorics/special-numbers.js +128 -0
  72. package/dist/reasoning/combinatorics/special-numbers.js.map +1 -0
  73. package/dist/reasoning/constructive-analysis/cauchy.d.ts +51 -0
  74. package/dist/reasoning/constructive-analysis/cauchy.d.ts.map +1 -0
  75. package/dist/reasoning/constructive-analysis/cauchy.js +77 -0
  76. package/dist/reasoning/constructive-analysis/cauchy.js.map +1 -0
  77. package/dist/reasoning/constructive-analysis/compact.d.ts +35 -0
  78. package/dist/reasoning/constructive-analysis/compact.d.ts.map +1 -0
  79. package/dist/reasoning/constructive-analysis/compact.js +61 -0
  80. package/dist/reasoning/constructive-analysis/compact.js.map +1 -0
  81. package/dist/reasoning/constructive-analysis/continuity.d.ts +62 -0
  82. package/dist/reasoning/constructive-analysis/continuity.d.ts.map +1 -0
  83. package/dist/reasoning/constructive-analysis/continuity.js +112 -0
  84. package/dist/reasoning/constructive-analysis/continuity.js.map +1 -0
  85. package/dist/reasoning/constructive-analysis/index.d.ts +24 -0
  86. package/dist/reasoning/constructive-analysis/index.d.ts.map +1 -0
  87. package/dist/reasoning/constructive-analysis/index.js +36 -0
  88. package/dist/reasoning/constructive-analysis/index.js.map +1 -0
  89. package/dist/reasoning/constructive-analysis/integral.d.ts +31 -0
  90. package/dist/reasoning/constructive-analysis/integral.d.ts.map +1 -0
  91. package/dist/reasoning/constructive-analysis/integral.js +59 -0
  92. package/dist/reasoning/constructive-analysis/integral.js.map +1 -0
  93. package/dist/reasoning/constructive-analysis/ivt.d.ts +41 -0
  94. package/dist/reasoning/constructive-analysis/ivt.d.ts.map +1 -0
  95. package/dist/reasoning/constructive-analysis/ivt.js +115 -0
  96. package/dist/reasoning/constructive-analysis/ivt.js.map +1 -0
  97. package/dist/reasoning/constructive-reals/index.d.ts +23 -0
  98. package/dist/reasoning/constructive-reals/index.d.ts.map +1 -1
  99. package/dist/reasoning/constructive-reals/index.js +52 -1
  100. package/dist/reasoning/constructive-reals/index.js.map +1 -1
  101. package/dist/reasoning/datalog/index.d.ts +131 -0
  102. package/dist/reasoning/datalog/index.d.ts.map +1 -0
  103. package/dist/reasoning/datalog/index.js +706 -0
  104. package/dist/reasoning/datalog/index.js.map +1 -0
  105. package/dist/reasoning/galois-fields/index.d.ts +29 -0
  106. package/dist/reasoning/galois-fields/index.d.ts.map +1 -0
  107. package/dist/reasoning/galois-fields/index.js +522 -0
  108. package/dist/reasoning/galois-fields/index.js.map +1 -0
  109. package/dist/reasoning/lattice/index.d.ts +165 -0
  110. package/dist/reasoning/lattice/index.d.ts.map +1 -0
  111. package/dist/reasoning/lattice/index.js +587 -0
  112. package/dist/reasoning/lattice/index.js.map +1 -0
  113. package/dist/reasoning/linear-algebra/index.d.ts +69 -0
  114. package/dist/reasoning/linear-algebra/index.d.ts.map +1 -0
  115. package/dist/reasoning/linear-algebra/index.js +859 -0
  116. package/dist/reasoning/linear-algebra/index.js.map +1 -0
  117. package/dist/reasoning/polynomial-ring/index.d.ts +30 -0
  118. package/dist/reasoning/polynomial-ring/index.d.ts.map +1 -0
  119. package/dist/reasoning/polynomial-ring/index.js +797 -0
  120. package/dist/reasoning/polynomial-ring/index.js.map +1 -0
  121. package/dist/reasoning/set-theory/hf-functions.d.ts +35 -0
  122. package/dist/reasoning/set-theory/hf-functions.d.ts.map +1 -0
  123. package/dist/reasoning/set-theory/hf-functions.js +147 -0
  124. package/dist/reasoning/set-theory/hf-functions.js.map +1 -0
  125. package/dist/reasoning/set-theory/hf-sets.d.ts +79 -0
  126. package/dist/reasoning/set-theory/hf-sets.d.ts.map +1 -0
  127. package/dist/reasoning/set-theory/hf-sets.js +338 -0
  128. package/dist/reasoning/set-theory/hf-sets.js.map +1 -0
  129. package/dist/reasoning/set-theory/index.d.ts +7 -0
  130. package/dist/reasoning/set-theory/index.d.ts.map +1 -0
  131. package/dist/reasoning/set-theory/index.js +44 -0
  132. package/dist/reasoning/set-theory/index.js.map +1 -0
  133. package/dist/reasoning/set-theory/zfc-axioms.d.ts +59 -0
  134. package/dist/reasoning/set-theory/zfc-axioms.d.ts.map +1 -0
  135. package/dist/reasoning/set-theory/zfc-axioms.js +245 -0
  136. package/dist/reasoning/set-theory/zfc-axioms.js.map +1 -0
  137. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.d.ts +2 -0
  138. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.d.ts.map +1 -0
  139. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.js +253 -0
  140. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.js.map +1 -0
  141. package/dist/tests/reasoning/combinatorics/combinatorics.test.d.ts +2 -0
  142. package/dist/tests/reasoning/combinatorics/combinatorics.test.d.ts.map +1 -0
  143. package/dist/tests/reasoning/combinatorics/combinatorics.test.js +256 -0
  144. package/dist/tests/reasoning/combinatorics/combinatorics.test.js.map +1 -0
  145. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.d.ts +2 -0
  146. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.d.ts.map +1 -0
  147. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.js +174 -0
  148. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.js.map +1 -0
  149. package/dist/tests/reasoning/datalog/datalog.test.d.ts +2 -0
  150. package/dist/tests/reasoning/datalog/datalog.test.d.ts.map +1 -0
  151. package/dist/tests/reasoning/datalog/datalog.test.js +333 -0
  152. package/dist/tests/reasoning/datalog/datalog.test.js.map +1 -0
  153. package/dist/tests/reasoning/galois-fields/galois-fields.test.d.ts +2 -0
  154. package/dist/tests/reasoning/galois-fields/galois-fields.test.d.ts.map +1 -0
  155. package/dist/tests/reasoning/galois-fields/galois-fields.test.js +226 -0
  156. package/dist/tests/reasoning/galois-fields/galois-fields.test.js.map +1 -0
  157. package/dist/tests/reasoning/lattice/lattice.test.d.ts +2 -0
  158. package/dist/tests/reasoning/lattice/lattice.test.d.ts.map +1 -0
  159. package/dist/tests/reasoning/lattice/lattice.test.js +238 -0
  160. package/dist/tests/reasoning/lattice/lattice.test.js.map +1 -0
  161. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.d.ts +2 -0
  162. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.d.ts.map +1 -0
  163. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.js +369 -0
  164. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.js.map +1 -0
  165. package/dist/tests/reasoning/polynomial-ring/polynomial-ring.test.d.ts +2 -0
  166. package/dist/tests/reasoning/polynomial-ring/polynomial-ring.test.d.ts.map +1 -0
  167. package/dist/tests/reasoning/polynomial-ring/polynomial-ring.test.js +230 -0
  168. package/dist/tests/reasoning/polynomial-ring/polynomial-ring.test.js.map +1 -0
  169. package/dist/tests/reasoning/set-theory/hf-functions.test.d.ts +2 -0
  170. package/dist/tests/reasoning/set-theory/hf-functions.test.d.ts.map +1 -0
  171. package/dist/tests/reasoning/set-theory/hf-functions.test.js +122 -0
  172. package/dist/tests/reasoning/set-theory/hf-functions.test.js.map +1 -0
  173. package/dist/tests/reasoning/set-theory/hf-sets.test.d.ts +2 -0
  174. package/dist/tests/reasoning/set-theory/hf-sets.test.d.ts.map +1 -0
  175. package/dist/tests/reasoning/set-theory/hf-sets.test.js +177 -0
  176. package/dist/tests/reasoning/set-theory/hf-sets.test.js.map +1 -0
  177. package/dist/tests/reasoning/set-theory/zfc-axioms.test.d.ts +2 -0
  178. package/dist/tests/reasoning/set-theory/zfc-axioms.test.d.ts.map +1 -0
  179. package/dist/tests/reasoning/set-theory/zfc-axioms.test.js +56 -0
  180. package/dist/tests/reasoning/set-theory/zfc-axioms.test.js.map +1 -0
  181. package/dist/tests/tooling/doc-gen/doc-gen.test.d.ts +2 -0
  182. package/dist/tests/tooling/doc-gen/doc-gen.test.d.ts.map +1 -0
  183. package/dist/tests/tooling/doc-gen/doc-gen.test.js +350 -0
  184. package/dist/tests/tooling/doc-gen/doc-gen.test.js.map +1 -0
  185. package/dist/tests/tooling/test-harness/test-harness.test.d.ts +2 -0
  186. package/dist/tests/tooling/test-harness/test-harness.test.d.ts.map +1 -0
  187. package/dist/tests/tooling/test-harness/test-harness.test.js +208 -0
  188. package/dist/tests/tooling/test-harness/test-harness.test.js.map +1 -0
  189. package/dist/tests/type-theory/lambda-cube/lambda-cube.test.d.ts +2 -0
  190. package/dist/tests/type-theory/lambda-cube/lambda-cube.test.d.ts.map +1 -0
  191. package/dist/tests/type-theory/lambda-cube/lambda-cube.test.js +266 -0
  192. package/dist/tests/type-theory/lambda-cube/lambda-cube.test.js.map +1 -0
  193. package/dist/tooling/doc-gen/extract.d.ts +13 -0
  194. package/dist/tooling/doc-gen/extract.d.ts.map +1 -0
  195. package/dist/tooling/doc-gen/extract.js +379 -0
  196. package/dist/tooling/doc-gen/extract.js.map +1 -0
  197. package/dist/tooling/doc-gen/generate.d.ts +9 -0
  198. package/dist/tooling/doc-gen/generate.d.ts.map +1 -0
  199. package/dist/tooling/doc-gen/generate.js +116 -0
  200. package/dist/tooling/doc-gen/generate.js.map +1 -0
  201. package/dist/tooling/doc-gen/index.d.ts +7 -0
  202. package/dist/tooling/doc-gen/index.d.ts.map +1 -0
  203. package/dist/tooling/doc-gen/index.js +39 -0
  204. package/dist/tooling/doc-gen/index.js.map +1 -0
  205. package/dist/tooling/doc-gen/jsdoc.d.ts +31 -0
  206. package/dist/tooling/doc-gen/jsdoc.d.ts.map +1 -0
  207. package/dist/tooling/doc-gen/jsdoc.js +140 -0
  208. package/dist/tooling/doc-gen/jsdoc.js.map +1 -0
  209. package/dist/tooling/doc-gen/render.d.ts +29 -0
  210. package/dist/tooling/doc-gen/render.d.ts.map +1 -0
  211. package/dist/tooling/doc-gen/render.js +206 -0
  212. package/dist/tooling/doc-gen/render.js.map +1 -0
  213. package/dist/tooling/doc-gen/types.d.ts +51 -0
  214. package/dist/tooling/doc-gen/types.d.ts.map +1 -0
  215. package/dist/tooling/doc-gen/types.js +10 -0
  216. package/dist/tooling/doc-gen/types.js.map +1 -0
  217. package/dist/tooling/test-harness/combinators.d.ts +14 -0
  218. package/dist/tooling/test-harness/combinators.d.ts.map +1 -0
  219. package/dist/tooling/test-harness/combinators.js +122 -0
  220. package/dist/tooling/test-harness/combinators.js.map +1 -0
  221. package/dist/tooling/test-harness/coverage.d.ts +3 -0
  222. package/dist/tooling/test-harness/coverage.d.ts.map +1 -0
  223. package/dist/tooling/test-harness/coverage.js +32 -0
  224. package/dist/tooling/test-harness/coverage.js.map +1 -0
  225. package/dist/tooling/test-harness/generators.d.ts +6 -0
  226. package/dist/tooling/test-harness/generators.d.ts.map +1 -0
  227. package/dist/tooling/test-harness/generators.js +66 -0
  228. package/dist/tooling/test-harness/generators.js.map +1 -0
  229. package/dist/tooling/test-harness/index.d.ts +7 -0
  230. package/dist/tooling/test-harness/index.d.ts.map +1 -0
  231. package/dist/tooling/test-harness/index.js +27 -0
  232. package/dist/tooling/test-harness/index.js.map +1 -0
  233. package/dist/tooling/test-harness/mutation.d.ts +4 -0
  234. package/dist/tooling/test-harness/mutation.d.ts.map +1 -0
  235. package/dist/tooling/test-harness/mutation.js +28 -0
  236. package/dist/tooling/test-harness/mutation.js.map +1 -0
  237. package/dist/tooling/test-harness/snapshot.d.ts +5 -0
  238. package/dist/tooling/test-harness/snapshot.d.ts.map +1 -0
  239. package/dist/tooling/test-harness/snapshot.js +86 -0
  240. package/dist/tooling/test-harness/snapshot.js.map +1 -0
  241. package/dist/tooling/test-harness/types.d.ts +32 -0
  242. package/dist/tooling/test-harness/types.d.ts.map +1 -0
  243. package/dist/tooling/test-harness/types.js +3 -0
  244. package/dist/tooling/test-harness/types.js.map +1 -0
  245. package/dist/type-theory/lambda-cube/erase.d.ts +26 -0
  246. package/dist/type-theory/lambda-cube/erase.d.ts.map +1 -0
  247. package/dist/type-theory/lambda-cube/erase.js +68 -0
  248. package/dist/type-theory/lambda-cube/erase.js.map +1 -0
  249. package/dist/type-theory/lambda-cube/examples.d.ts +59 -0
  250. package/dist/type-theory/lambda-cube/examples.d.ts.map +1 -0
  251. package/dist/type-theory/lambda-cube/examples.js +110 -0
  252. package/dist/type-theory/lambda-cube/examples.js.map +1 -0
  253. package/dist/type-theory/lambda-cube/index.d.ts +11 -0
  254. package/dist/type-theory/lambda-cube/index.d.ts.map +1 -0
  255. package/dist/type-theory/lambda-cube/index.js +64 -0
  256. package/dist/type-theory/lambda-cube/index.js.map +1 -0
  257. package/dist/type-theory/lambda-cube/normalize.d.ts +17 -0
  258. package/dist/type-theory/lambda-cube/normalize.d.ts.map +1 -0
  259. package/dist/type-theory/lambda-cube/normalize.js +134 -0
  260. package/dist/type-theory/lambda-cube/normalize.js.map +1 -0
  261. package/dist/type-theory/lambda-cube/rules.d.ts +26 -0
  262. package/dist/type-theory/lambda-cube/rules.d.ts.map +1 -0
  263. package/dist/type-theory/lambda-cube/rules.js +67 -0
  264. package/dist/type-theory/lambda-cube/rules.js.map +1 -0
  265. package/dist/type-theory/lambda-cube/typecheck.d.ts +20 -0
  266. package/dist/type-theory/lambda-cube/typecheck.d.ts.map +1 -0
  267. package/dist/type-theory/lambda-cube/typecheck.js +168 -0
  268. package/dist/type-theory/lambda-cube/typecheck.js.map +1 -0
  269. package/dist/type-theory/lambda-cube/types.d.ts +40 -0
  270. package/dist/type-theory/lambda-cube/types.d.ts.map +1 -0
  271. package/dist/type-theory/lambda-cube/types.js +192 -0
  272. package/dist/type-theory/lambda-cube/types.js.map +1 -0
  273. package/package.json +1 -1
@@ -0,0 +1,333 @@
1
+ "use strict";
2
+ // ============================================================
3
+ // ST Datalog — Tests
4
+ // ============================================================
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ const vitest_1 = require("vitest");
7
+ const datalog_1 = require("../../../reasoning/datalog");
8
+ // ── Helpers de tests ─────────────────────────────────────────
9
+ function atomKey(a) {
10
+ return `${a.predicate}(${a.args.join(',')})`;
11
+ }
12
+ function hasAtom(list, pred, args) {
13
+ const key = `${pred}(${args.join(',')})`;
14
+ return list.some((a) => atomKey(a) === key);
15
+ }
16
+ // ── Parser ──────────────────────────────────────────────────
17
+ (0, vitest_1.describe)('datalog — parser', () => {
18
+ (0, vitest_1.it)('parseAtom: "parent(alice, bob)" → predicate y args correctos', () => {
19
+ const a = (0, datalog_1.parseAtom)('parent(alice, bob)');
20
+ (0, vitest_1.expect)(a).not.toBeNull();
21
+ (0, vitest_1.expect)(a?.predicate).toBe('parent');
22
+ (0, vitest_1.expect)(a?.args).toEqual(['alice', 'bob']);
23
+ });
24
+ (0, vitest_1.it)('parseAtom: predicado con variable mayúscula', () => {
25
+ const a = (0, datalog_1.parseAtom)('ancestor(X, Y)');
26
+ (0, vitest_1.expect)(a).not.toBeNull();
27
+ (0, vitest_1.expect)(a?.args).toEqual(['X', 'Y']);
28
+ (0, vitest_1.expect)((0, datalog_1.isVariable)('X')).toBe(true);
29
+ (0, vitest_1.expect)((0, datalog_1.isVariable)('alice')).toBe(false);
30
+ });
31
+ (0, vitest_1.it)('parseAtom: sintaxis inválida devuelve null', () => {
32
+ (0, vitest_1.expect)((0, datalog_1.parseAtom)('parent(')).toBeNull();
33
+ (0, vitest_1.expect)((0, datalog_1.parseAtom)('parent(a,)')).toBeNull();
34
+ (0, vitest_1.expect)((0, datalog_1.parseAtom)('123pred(a)')).toBeNull();
35
+ });
36
+ (0, vitest_1.it)('parseRule: "ancestor(X, Y) :- parent(X, Y)." → regla', () => {
37
+ const r = (0, datalog_1.parseRule)('ancestor(X, Y) :- parent(X, Y).');
38
+ (0, vitest_1.expect)(r).not.toBeNull();
39
+ (0, vitest_1.expect)(r?.head.predicate).toBe('ancestor');
40
+ (0, vitest_1.expect)(r?.body).toHaveLength(1);
41
+ (0, vitest_1.expect)(r?.body[0]?.predicate).toBe('parent');
42
+ });
43
+ (0, vitest_1.it)('parseRule: regla recursiva con dos literales en body', () => {
44
+ const r = (0, datalog_1.parseRule)('ancestor(X, Y) :- parent(X, Z), ancestor(Z, Y).');
45
+ (0, vitest_1.expect)(r).not.toBeNull();
46
+ (0, vitest_1.expect)(r?.body).toHaveLength(2);
47
+ (0, vitest_1.expect)(r?.body[0]?.predicate).toBe('parent');
48
+ (0, vitest_1.expect)(r?.body[1]?.predicate).toBe('ancestor');
49
+ });
50
+ (0, vitest_1.it)('parseRule: hecho (sin :-) devuelve regla con body vacío', () => {
51
+ const r = (0, datalog_1.parseRule)('parent(alice, bob).');
52
+ (0, vitest_1.expect)(r).not.toBeNull();
53
+ (0, vitest_1.expect)(r?.body).toEqual([]);
54
+ (0, vitest_1.expect)(r?.head.args).toEqual(['alice', 'bob']);
55
+ });
56
+ });
57
+ // ── Unificación ─────────────────────────────────────────────
58
+ (0, vitest_1.describe)('datalog — unificación', () => {
59
+ (0, vitest_1.it)('unifyAtoms: variables con constantes', () => {
60
+ const a = { predicate: 'p', args: ['X', 'Y'] };
61
+ const b = { predicate: 'p', args: ['alice', 'bob'] };
62
+ const s = (0, datalog_1.unifyAtoms)(a, b);
63
+ (0, vitest_1.expect)(s).not.toBeNull();
64
+ (0, vitest_1.expect)(s?.X).toBe('alice');
65
+ (0, vitest_1.expect)(s?.Y).toBe('bob');
66
+ });
67
+ (0, vitest_1.it)('unifyAtoms: predicados distintos → null', () => {
68
+ const a = { predicate: 'p', args: ['X'] };
69
+ const b = { predicate: 'q', args: ['alice'] };
70
+ (0, vitest_1.expect)((0, datalog_1.unifyAtoms)(a, b)).toBeNull();
71
+ });
72
+ (0, vitest_1.it)('unifyAtoms: aridades distintas → null', () => {
73
+ const a = { predicate: 'p', args: ['X', 'Y'] };
74
+ const b = { predicate: 'p', args: ['alice'] };
75
+ (0, vitest_1.expect)((0, datalog_1.unifyAtoms)(a, b)).toBeNull();
76
+ });
77
+ (0, vitest_1.it)('unifyAtoms: constantes distintas → null', () => {
78
+ const a = { predicate: 'p', args: ['alice'] };
79
+ const b = { predicate: 'p', args: ['bob'] };
80
+ (0, vitest_1.expect)((0, datalog_1.unifyAtoms)(a, b)).toBeNull();
81
+ });
82
+ (0, vitest_1.it)('unifyAtoms: misma variable repetida fuerza igualdad', () => {
83
+ const a = { predicate: 'p', args: ['X', 'X'] };
84
+ const b = { predicate: 'p', args: ['alice', 'alice'] };
85
+ (0, vitest_1.expect)((0, datalog_1.unifyAtoms)(a, b)).not.toBeNull();
86
+ const c = { predicate: 'p', args: ['alice', 'bob'] };
87
+ (0, vitest_1.expect)((0, datalog_1.unifyAtoms)(a, c)).toBeNull();
88
+ });
89
+ (0, vitest_1.it)('applySubstitution: sustituye variables, deja constantes', () => {
90
+ const atom = { predicate: 'p', args: ['X', 'alice', 'Y'] };
91
+ const out = (0, datalog_1.applySubstitution)(atom, { X: 'bob', Y: 'carol' });
92
+ (0, vitest_1.expect)(out.args).toEqual(['bob', 'alice', 'carol']);
93
+ });
94
+ (0, vitest_1.it)('isGround: detecta átomos ground correctamente', () => {
95
+ (0, vitest_1.expect)((0, datalog_1.isGround)({ predicate: 'p', args: ['alice', 'bob'] })).toBe(true);
96
+ (0, vitest_1.expect)((0, datalog_1.isGround)({ predicate: 'p', args: ['alice', 'X'] })).toBe(false);
97
+ });
98
+ });
99
+ // ── Bottom-up: transitive closure ───────────────────────────
100
+ (0, vitest_1.describe)('datalog — bottom-up transitive closure', () => {
101
+ (0, vitest_1.it)('3 parent facts derivan los 3 ancestor directos + 3 transitivos', () => {
102
+ const p = (0, datalog_1.transitiveClosure)();
103
+ const result = (0, datalog_1.evaluateBottomUp)(p);
104
+ // Hechos parent originales: 3.
105
+ // Hechos ancestor derivados: 3 directos + 3 transitivos
106
+ // ancestor(alice,bob), ancestor(bob,carol), ancestor(carol,dave)
107
+ // ancestor(alice,carol) [via bob],
108
+ // ancestor(bob,dave) [via carol],
109
+ // ancestor(alice,dave) [via bob+carol].
110
+ const ancestors = result.facts.filter((f) => f.predicate === 'ancestor');
111
+ (0, vitest_1.expect)(ancestors.length).toBe(6);
112
+ (0, vitest_1.expect)(hasAtom(result.facts, 'ancestor', ['alice', 'bob'])).toBe(true);
113
+ (0, vitest_1.expect)(hasAtom(result.facts, 'ancestor', ['alice', 'carol'])).toBe(true);
114
+ (0, vitest_1.expect)(hasAtom(result.facts, 'ancestor', ['alice', 'dave'])).toBe(true);
115
+ (0, vitest_1.expect)(hasAtom(result.facts, 'ancestor', ['bob', 'dave'])).toBe(true);
116
+ });
117
+ (0, vitest_1.it)('terminates con iterations finitas (idempotencia tras fixpoint)', () => {
118
+ const p = (0, datalog_1.transitiveClosure)();
119
+ const result = (0, datalog_1.evaluateBottomUp)(p);
120
+ (0, vitest_1.expect)(result.iterations).toBeGreaterThan(0);
121
+ (0, vitest_1.expect)(result.iterations).toBeLessThan(20);
122
+ // Re-evaluación da el mismo conteo de facts (idempotente).
123
+ const result2 = (0, datalog_1.evaluateBottomUp)(p);
124
+ (0, vitest_1.expect)(result2.facts.length).toBe(result.facts.length);
125
+ });
126
+ });
127
+ // ── Bottom-up: path reachability ────────────────────────────
128
+ (0, vitest_1.describe)('datalog — bottom-up path reachability', () => {
129
+ (0, vitest_1.it)('grafo de 4 nodos deriva todas las conexiones alcanzables', () => {
130
+ const p = (0, datalog_1.pathReachability)();
131
+ const result = (0, datalog_1.evaluateBottomUp)(p);
132
+ // edges: n1→n2, n2→n3, n3→n4, n1→n3.
133
+ // reach esperado:
134
+ // directos: (n1,n2), (n2,n3), (n3,n4), (n1,n3)
135
+ // transitivos: (n1,n4) via n2-n3-n4 o n1-n3-n4, (n2,n4) via n3.
136
+ const reaches = result.facts.filter((f) => f.predicate === 'reach');
137
+ (0, vitest_1.expect)(reaches.length).toBe(6);
138
+ (0, vitest_1.expect)(hasAtom(result.facts, 'reach', ['n1', 'n4'])).toBe(true);
139
+ (0, vitest_1.expect)(hasAtom(result.facts, 'reach', ['n2', 'n4'])).toBe(true);
140
+ (0, vitest_1.expect)(hasAtom(result.facts, 'reach', ['n1', 'n3'])).toBe(true);
141
+ });
142
+ });
143
+ // ── Uniqueness y terminación ────────────────────────────────
144
+ (0, vitest_1.describe)('datalog — uniqueness y terminación', () => {
145
+ (0, vitest_1.it)('no produce facts duplicados (set semantics)', () => {
146
+ const p = (0, datalog_1.transitiveClosure)();
147
+ const result = (0, datalog_1.evaluateBottomUp)(p);
148
+ const keys = result.facts.map((a) => atomKey(a));
149
+ const uniq = new Set(keys);
150
+ (0, vitest_1.expect)(uniq.size).toBe(keys.length);
151
+ });
152
+ (0, vitest_1.it)('ciclo en grafo no genera bucle infinito', () => {
153
+ // grafo cíclico: a→b, b→a.
154
+ const p = {
155
+ facts: [
156
+ { predicate: 'edge', args: ['a', 'b'] },
157
+ { predicate: 'edge', args: ['b', 'a'] },
158
+ ],
159
+ rules: [
160
+ {
161
+ head: { predicate: 'reach', args: ['X', 'Y'] },
162
+ body: [{ predicate: 'edge', args: ['X', 'Y'] }],
163
+ },
164
+ {
165
+ head: { predicate: 'reach', args: ['X', 'Y'] },
166
+ body: [
167
+ { predicate: 'edge', args: ['X', 'Z'] },
168
+ { predicate: 'reach', args: ['Z', 'Y'] },
169
+ ],
170
+ },
171
+ ],
172
+ };
173
+ const result = (0, datalog_1.evaluateBottomUp)(p, { maxIterations: 50 });
174
+ // Debe terminar y derivar: (a,b), (b,a), (a,a), (b,b).
175
+ const reaches = result.facts.filter((f) => f.predicate === 'reach');
176
+ (0, vitest_1.expect)(reaches.length).toBe(4);
177
+ (0, vitest_1.expect)(hasAtom(result.facts, 'reach', ['a', 'a'])).toBe(true);
178
+ (0, vitest_1.expect)(hasAtom(result.facts, 'reach', ['b', 'b'])).toBe(true);
179
+ });
180
+ });
181
+ // ── querySLD ────────────────────────────────────────────────
182
+ (0, vitest_1.describe)('datalog — querySLD top-down con memoización', () => {
183
+ (0, vitest_1.it)('query ancestor(alice, Y) devuelve todos los descendientes de alice', () => {
184
+ const p = (0, datalog_1.transitiveClosure)();
185
+ const results = (0, datalog_1.querySLD)(p, {
186
+ predicate: 'ancestor',
187
+ args: ['alice', 'Y'],
188
+ });
189
+ (0, vitest_1.expect)(results.length).toBe(3);
190
+ (0, vitest_1.expect)(hasAtom(results, 'ancestor', ['alice', 'bob'])).toBe(true);
191
+ (0, vitest_1.expect)(hasAtom(results, 'ancestor', ['alice', 'carol'])).toBe(true);
192
+ (0, vitest_1.expect)(hasAtom(results, 'ancestor', ['alice', 'dave'])).toBe(true);
193
+ });
194
+ (0, vitest_1.it)('query ground exacto devuelve [match] o []', () => {
195
+ const p = (0, datalog_1.transitiveClosure)();
196
+ const hit = (0, datalog_1.querySLD)(p, {
197
+ predicate: 'ancestor',
198
+ args: ['alice', 'dave'],
199
+ });
200
+ (0, vitest_1.expect)(hit.length).toBe(1);
201
+ const miss = (0, datalog_1.querySLD)(p, {
202
+ predicate: 'ancestor',
203
+ args: ['dave', 'alice'],
204
+ });
205
+ (0, vitest_1.expect)(miss.length).toBe(0);
206
+ });
207
+ });
208
+ // ── Negación estratificada ──────────────────────────────────
209
+ (0, vitest_1.describe)('datalog — negación estratificada', () => {
210
+ (0, vitest_1.it)('orphan(X) :- person(X), ¬hasParent(X)', () => {
211
+ // person(alice). person(bob). person(carol).
212
+ // hasParent(alice). hasParent(bob).
213
+ // orphan(X) :- person(X), ¬hasParent(X).
214
+ // Esperado: orphan(carol).
215
+ const rules = [
216
+ {
217
+ head: { predicate: 'orphan', args: ['X'] },
218
+ body: [{ predicate: 'person', args: ['X'] }],
219
+ negBody: [{ predicate: 'hasParent', args: ['X'] }],
220
+ },
221
+ ];
222
+ const program = {
223
+ facts: [
224
+ { predicate: 'person', args: ['alice'] },
225
+ { predicate: 'person', args: ['bob'] },
226
+ { predicate: 'person', args: ['carol'] },
227
+ { predicate: 'hasParent', args: ['alice'] },
228
+ { predicate: 'hasParent', args: ['bob'] },
229
+ ],
230
+ rules,
231
+ };
232
+ const result = (0, datalog_1.evaluateStratified)(program);
233
+ const orphans = result.facts.filter((f) => f.predicate === 'orphan');
234
+ (0, vitest_1.expect)(orphans.length).toBe(1);
235
+ (0, vitest_1.expect)(hasAtom(result.facts, 'orphan', ['carol'])).toBe(true);
236
+ });
237
+ (0, vitest_1.it)('estratificación: predicado negado se evalúa antes del predicado que lo niega', () => {
238
+ // p(a). p(b). q(X) :- p(X). r(X) :- p(X), ¬q(X).
239
+ // r debería estar vacío porque q tiene los mismos elementos que p.
240
+ const rules = [
241
+ {
242
+ head: { predicate: 'q', args: ['X'] },
243
+ body: [{ predicate: 'p', args: ['X'] }],
244
+ negBody: [],
245
+ },
246
+ {
247
+ head: { predicate: 'r', args: ['X'] },
248
+ body: [{ predicate: 'p', args: ['X'] }],
249
+ negBody: [{ predicate: 'q', args: ['X'] }],
250
+ },
251
+ ];
252
+ const program = {
253
+ facts: [
254
+ { predicate: 'p', args: ['a'] },
255
+ { predicate: 'p', args: ['b'] },
256
+ ],
257
+ rules,
258
+ };
259
+ const result = (0, datalog_1.evaluateStratified)(program);
260
+ const rs = result.facts.filter((f) => f.predicate === 'r');
261
+ (0, vitest_1.expect)(rs.length).toBe(0);
262
+ const qs = result.facts.filter((f) => f.predicate === 'q');
263
+ (0, vitest_1.expect)(qs.length).toBe(2);
264
+ });
265
+ });
266
+ // ── Magic sets ──────────────────────────────────────────────
267
+ (0, vitest_1.describe)('datalog — magic sets', () => {
268
+ (0, vitest_1.it)('magic sets preserva resultados del query bajo bottom-up', () => {
269
+ const p = (0, datalog_1.transitiveClosure)();
270
+ const query = {
271
+ predicate: 'ancestor',
272
+ args: ['alice', 'Y'],
273
+ };
274
+ const transformed = (0, datalog_1.magicSets)(p, query);
275
+ const result = (0, datalog_1.evaluateBottomUp)(transformed);
276
+ // El programa transformado debe seguir derivando los ancestor
277
+ // que el query pide (alice → bob, carol, dave).
278
+ const ancestorsFromAlice = result.facts.filter((f) => f.predicate === 'ancestor' && f.args[0] === 'alice');
279
+ (0, vitest_1.expect)(ancestorsFromAlice.length).toBeGreaterThanOrEqual(3);
280
+ (0, vitest_1.expect)(hasAtom(result.facts, 'ancestor', ['alice', 'dave'])).toBe(true);
281
+ });
282
+ (0, vitest_1.it)('magic sets agrega seed magic_<pred> al programa', () => {
283
+ const p = (0, datalog_1.transitiveClosure)();
284
+ const query = {
285
+ predicate: 'ancestor',
286
+ args: ['alice', 'Y'],
287
+ };
288
+ const transformed = (0, datalog_1.magicSets)(p, query);
289
+ const hasMagicSeed = transformed.facts.some((f) => f.predicate === 'magic_ancestor');
290
+ (0, vitest_1.expect)(hasMagicSeed).toBe(true);
291
+ });
292
+ (0, vitest_1.it)('magic sets sobre query totalmente variable devuelve programa equivalente', () => {
293
+ const p = (0, datalog_1.transitiveClosure)();
294
+ const query = {
295
+ predicate: 'ancestor',
296
+ args: ['X', 'Y'],
297
+ };
298
+ const transformed = (0, datalog_1.magicSets)(p, query);
299
+ // No hay args ground → no se introduce magic, programa equivalente.
300
+ const result = (0, datalog_1.evaluateBottomUp)(transformed);
301
+ const ancestors = result.facts.filter((f) => f.predicate === 'ancestor');
302
+ (0, vitest_1.expect)(ancestors.length).toBe(6);
303
+ });
304
+ });
305
+ // ── End-to-end con parser ───────────────────────────────────
306
+ (0, vitest_1.describe)('datalog — end-to-end parse + evaluate', () => {
307
+ (0, vitest_1.it)('programa parseado y evaluado da los mismos resultados que construido a mano', () => {
308
+ const ruleStrs = [
309
+ 'parent(alice, bob).',
310
+ 'parent(bob, carol).',
311
+ 'parent(carol, dave).',
312
+ 'ancestor(X, Y) :- parent(X, Y).',
313
+ 'ancestor(X, Y) :- parent(X, Z), ancestor(Z, Y).',
314
+ ];
315
+ const parsedRules = ruleStrs.map((s) => (0, datalog_1.parseRule)(s));
316
+ (0, vitest_1.expect)(parsedRules.every((r) => r !== null)).toBe(true);
317
+ const facts = [];
318
+ const rules = [];
319
+ for (const r of parsedRules) {
320
+ if (!r)
321
+ continue;
322
+ if (r.body.length === 0)
323
+ facts.push(r.head);
324
+ else
325
+ rules.push(r);
326
+ }
327
+ const program = { facts, rules };
328
+ const result = (0, datalog_1.evaluateBottomUp)(program);
329
+ const ancestors = result.facts.filter((f) => f.predicate === 'ancestor');
330
+ (0, vitest_1.expect)(ancestors.length).toBe(6);
331
+ });
332
+ });
333
+ //# sourceMappingURL=datalog.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"datalog.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/datalog/datalog.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qBAAqB;AACrB,+DAA+D;;AAE/D,mCAA8C;AAC9C,wDAgBoC;AAEpC,gEAAgE;AAEhE,SAAS,OAAO,CAAC,CAAc;IAC7B,OAAO,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC/C,CAAC;AAED,SAAS,OAAO,CAAC,IAAmB,EAAE,IAAY,EAAE,IAAc;IAChE,MAAM,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACzC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;AAC9C,CAAC;AAED,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,GAAG,IAAA,mBAAS,EAAC,oBAAoB,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAG,IAAA,mBAAS,EAAC,gBAAgB,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,oBAAU,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,oBAAU,EAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,CAAC,GAAG,IAAA,mBAAS,EAAC,iCAAiC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,CAAC,GAAG,IAAA,mBAAS,EAAC,iDAAiD,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,IAAA,mBAAS,EAAC,qBAAqB,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;QAC5D,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;QAClE,MAAM,CAAC,GAAG,IAAA,oBAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QACvD,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3D,IAAA,eAAM,EAAC,IAAA,oBAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;QAC5D,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3D,IAAA,eAAM,EAAC,IAAA,oBAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3D,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QACzD,IAAA,eAAM,EAAC,IAAA,oBAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;QAC5D,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;QACpE,IAAA,eAAM,EAAC,IAAA,oBAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACxC,MAAM,CAAC,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;QAClE,IAAA,eAAM,EAAC,IAAA,oBAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,IAAI,GAAgB,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;QACxE,MAAM,GAAG,GAAG,IAAA,2BAAiB,EAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,IAAA,eAAM,EAAC,IAAA,kBAAQ,EAAC,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,kBAAQ,EAAC,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,CAAC,GAAG,IAAA,2BAAiB,GAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAA,0BAAgB,EAAC,CAAC,CAAC,CAAC;QACnC,+BAA+B;QAC/B,wDAAwD;QACxD,mEAAmE;QACnE,qCAAqC;QACrC,uCAAuC;QACvC,2CAA2C;QAC3C,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,CAAC,GAAG,IAAA,2BAAiB,GAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAA,0BAAgB,EAAC,CAAC,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAC3C,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAA,0BAAgB,EAAC,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,CAAC,GAAG,IAAA,0BAAgB,GAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAA,0BAAgB,EAAC,CAAC,CAAC,CAAC;QACnC,qCAAqC;QACrC,kBAAkB;QAClB,iDAAiD;QACjD,kEAAkE;QAClE,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAG,IAAA,2BAAiB,GAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAA,0BAAgB,EAAC,CAAC,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,2BAA2B;QAC3B,MAAM,CAAC,GAAmB;YACxB,KAAK,EAAE;gBACL,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;gBACvC,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;aACxC;YACD,KAAK,EAAE;gBACL;oBACE,IAAI,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;oBAC9C,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;iBAChD;gBACD;oBACE,IAAI,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;oBAC9C,IAAI,EAAE;wBACJ,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;wBACvC,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;qBACzC;iBACF;aACF;SACF,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,0BAAgB,EAAC,CAAC,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1D,uDAAuD;QACvD,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,6CAA6C,EAAE,GAAG,EAAE;IAC3D,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,CAAC,GAAG,IAAA,2BAAiB,GAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAA,kBAAQ,EAAC,CAAC,EAAE;YAC1B,SAAS,EAAE,UAAU;YACrB,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC;SACrB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,OAAO,CAAC,OAAO,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,OAAO,CAAC,OAAO,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,OAAO,CAAC,OAAO,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,2BAAiB,GAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAA,kBAAQ,EAAC,CAAC,EAAE;YACtB,SAAS,EAAE,UAAU;YACrB,IAAI,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC;SACxB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAA,kBAAQ,EAAC,CAAC,EAAE;YACvB,SAAS,EAAE,UAAU;YACrB,IAAI,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC;SACxB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,6CAA6C;QAC7C,oCAAoC;QACpC,yCAAyC;QACzC,2BAA2B;QAC3B,MAAM,KAAK,GAAqB;YAC9B;gBACE,IAAI,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC1C,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5C,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;aACnD;SACF,CAAC;QACF,MAAM,OAAO,GAAG;YACd,KAAK,EAAE;gBACL,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE;gBACxC,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;gBACtC,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE;gBACxC,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE;gBAC3C,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;aAC1C;YACD,KAAK;SACN,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,4BAAkB,EAAC,OAAO,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,iDAAiD;QACjD,mEAAmE;QACnE,MAAM,KAAK,GAAqB;YAC9B;gBACE,IAAI,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE;gBACrC,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvC,OAAO,EAAE,EAAE;aACZ;YACD;gBACE,IAAI,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE;gBACrC,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvC,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;aAC3C;SACF,CAAC;QACF,MAAM,OAAO,GAAG;YACd,KAAK,EAAE;gBACL,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC/B,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE;aAChC;YACD,KAAK;SACN,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,4BAAkB,EAAC,OAAO,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,GAAG,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,GAAG,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,IAAA,2BAAiB,GAAE,CAAC;QAC9B,MAAM,KAAK,GAAgB;YACzB,SAAS,EAAE,UAAU;YACrB,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC;SACrB,CAAC;QACF,MAAM,WAAW,GAAG,IAAA,mBAAS,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,IAAA,0BAAgB,EAAC,WAAW,CAAC,CAAC;QAC7C,8DAA8D;QAC9D,gDAAgD;QAChD,MAAM,kBAAkB,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAC5C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,CAC3D,CAAC;QACF,IAAA,eAAM,EAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,IAAA,2BAAiB,GAAE,CAAC;QAC9B,MAAM,KAAK,GAAgB;YACzB,SAAS,EAAE,UAAU;YACrB,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC;SACrB,CAAC;QACF,MAAM,WAAW,GAAG,IAAA,mBAAS,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,YAAY,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,gBAAgB,CAAC,CAAC;QACrF,IAAA,eAAM,EAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0EAA0E,EAAE,GAAG,EAAE;QAClF,MAAM,CAAC,GAAG,IAAA,2BAAiB,GAAE,CAAC;QAC9B,MAAM,KAAK,GAAgB;YACzB,SAAS,EAAE,UAAU;YACrB,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;SACjB,CAAC;QACF,MAAM,WAAW,GAAG,IAAA,mBAAS,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACxC,oEAAoE;QACpE,MAAM,MAAM,GAAG,IAAA,0BAAgB,EAAC,WAAW,CAAC,CAAC;QAC7C,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,6EAA6E,EAAE,GAAG,EAAE;QACrF,MAAM,QAAQ,GAAG;YACf,qBAAqB;YACrB,qBAAqB;YACrB,sBAAsB;YACtB,iCAAiC;YACjC,iDAAiD;SAClD,CAAC;QACF,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxD,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,IAAI,CAAC,CAAC;gBAAE,SAAS;YACjB,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;;gBACvC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,MAAM,OAAO,GAAmB,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAgB,EAAC,OAAO,CAAC,CAAC;QACzC,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
@@ -0,0 +1,2 @@
1
+ export {};
2
+ //# sourceMappingURL=galois-fields.test.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"galois-fields.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/galois-fields/galois-fields.test.ts"],"names":[],"mappings":""}
@@ -0,0 +1,226 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ const vitest_1 = require("vitest");
4
+ const galois_fields_1 = require("../../../reasoning/galois-fields");
5
+ // Helpers ----------------------------------------------------
6
+ function enumerateElements(F) {
7
+ const out = [];
8
+ for (let k = 0; k < F.order; k++) {
9
+ const coeffs = Array.from({ length: F.degree }, () => 0);
10
+ let x = k;
11
+ for (let i = 0; i < F.degree; i++) {
12
+ coeffs[i] = x % F.prime;
13
+ x = Math.floor(x / F.prime);
14
+ }
15
+ out.push((0, galois_fields_1.gfElement)(F, coeffs));
16
+ }
17
+ return out;
18
+ }
19
+ (0, vitest_1.describe)('Galois Fields — irreducibles', () => {
20
+ (0, vitest_1.it)('findIrreducibleOverZp(2, 1) devuelve x', () => {
21
+ (0, vitest_1.expect)((0, galois_fields_1.findIrreducibleOverZp)(2, 1)).toEqual([0, 1]);
22
+ });
23
+ (0, vitest_1.it)('findIrreducibleOverZp(2, 3) devuelve un polinomio de grado 3 mónico', () => {
24
+ const f = (0, galois_fields_1.findIrreducibleOverZp)(2, 3);
25
+ (0, vitest_1.expect)(f).not.toBeNull();
26
+ (0, vitest_1.expect)(f && f[f.length - 1]).toBe(1);
27
+ (0, vitest_1.expect)(f && f.length).toBe(4);
28
+ });
29
+ (0, vitest_1.it)('findIrreducibleOverZp(3, 2) existe y es de grado 2', () => {
30
+ const f = (0, galois_fields_1.findIrreducibleOverZp)(3, 2);
31
+ (0, vitest_1.expect)(f).not.toBeNull();
32
+ (0, vitest_1.expect)(f && f.length).toBe(3);
33
+ });
34
+ (0, vitest_1.it)('rechaza p no primo', () => {
35
+ (0, vitest_1.expect)(() => (0, galois_fields_1.findIrreducibleOverZp)(4, 2)).toThrow();
36
+ });
37
+ });
38
+ (0, vitest_1.describe)('Galois Fields — GF(p)', () => {
39
+ (0, vitest_1.it)('GF(2): suma equivale a XOR', () => {
40
+ const F = (0, galois_fields_1.makeGaloisField)(2, 1);
41
+ const zero = (0, galois_fields_1.gfZero)(F);
42
+ const one = (0, galois_fields_1.gfOne)(F);
43
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfAdd)(F, one, one), zero)).toBe(true);
44
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfAdd)(F, one, zero), one)).toBe(true);
45
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfAdd)(F, zero, zero), zero)).toBe(true);
46
+ });
47
+ (0, vitest_1.it)('GF(2): multiplicación equivale a AND', () => {
48
+ const F = (0, galois_fields_1.makeGaloisField)(2, 1);
49
+ const zero = (0, galois_fields_1.gfZero)(F);
50
+ const one = (0, galois_fields_1.gfOne)(F);
51
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, one, one), one)).toBe(true);
52
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, one, zero), zero)).toBe(true);
53
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, zero, zero), zero)).toBe(true);
54
+ });
55
+ (0, vitest_1.it)('GF(7): inverso de cada no-cero da 1', () => {
56
+ const F = (0, galois_fields_1.makeGaloisField)(7, 1);
57
+ for (let k = 1; k < 7; k++) {
58
+ const a = (0, galois_fields_1.gfElement)(F, [k]);
59
+ const inv = (0, galois_fields_1.gfInverse)(F, a);
60
+ (0, vitest_1.expect)(inv).not.toBeNull();
61
+ if (inv)
62
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, a, inv), (0, galois_fields_1.gfOne)(F))).toBe(true);
63
+ }
64
+ });
65
+ (0, vitest_1.it)('GF(7) tiene primitivo y su orden es 6', () => {
66
+ const F = (0, galois_fields_1.makeGaloisField)(7, 1);
67
+ const g = (0, galois_fields_1.findPrimitive)(F);
68
+ (0, vitest_1.expect)((0, galois_fields_1.order)(F, g)).toBe(6);
69
+ });
70
+ });
71
+ (0, vitest_1.describe)('Galois Fields — GF(2^3)', () => {
72
+ const F = (0, galois_fields_1.makeGaloisField)(2, 3);
73
+ (0, vitest_1.it)('orden del cuerpo = 8', () => {
74
+ (0, vitest_1.expect)(F.order).toBe(8);
75
+ });
76
+ (0, vitest_1.it)('todo no-cero tiene inverso y a · a^-1 = 1', () => {
77
+ const elements = enumerateElements(F);
78
+ const one = (0, galois_fields_1.gfOne)(F);
79
+ for (const a of elements) {
80
+ if ((0, galois_fields_1.gfEq)(a, (0, galois_fields_1.gfZero)(F)))
81
+ continue;
82
+ const inv = (0, galois_fields_1.gfInverse)(F, a);
83
+ (0, vitest_1.expect)(inv).not.toBeNull();
84
+ if (inv)
85
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, a, inv), one)).toBe(true);
86
+ }
87
+ });
88
+ (0, vitest_1.it)('Fermat little: a^(p^n - 1) = 1 para todo no-cero', () => {
89
+ const exp = BigInt(F.order - 1);
90
+ const one = (0, galois_fields_1.gfOne)(F);
91
+ for (const a of enumerateElements(F)) {
92
+ if ((0, galois_fields_1.gfEq)(a, (0, galois_fields_1.gfZero)(F)))
93
+ continue;
94
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfPow)(F, a, exp), one)).toBe(true);
95
+ }
96
+ });
97
+ (0, vitest_1.it)('existe primitivo y su orden divide a p^n − 1', () => {
98
+ const g = (0, galois_fields_1.findPrimitive)(F);
99
+ const ord = (0, galois_fields_1.order)(F, g);
100
+ (0, vitest_1.expect)(ord).toBe(F.order - 1);
101
+ (0, vitest_1.expect)((F.order - 1) % ord).toBe(0);
102
+ });
103
+ });
104
+ (0, vitest_1.describe)('Galois Fields — GF(2^4)', () => {
105
+ const F = (0, galois_fields_1.makeGaloisField)(2, 4);
106
+ (0, vitest_1.it)('orden = 16 y existe primitivo de orden 15', () => {
107
+ (0, vitest_1.expect)(F.order).toBe(16);
108
+ const g = (0, galois_fields_1.findPrimitive)(F);
109
+ (0, vitest_1.expect)((0, galois_fields_1.order)(F, g)).toBe(15);
110
+ });
111
+ (0, vitest_1.it)('discreteLog inverso de gfPow', () => {
112
+ const g = (0, galois_fields_1.findPrimitive)(F);
113
+ for (let k = 0; k < F.order - 1; k++) {
114
+ const target = (0, galois_fields_1.gfPow)(F, g, BigInt(k));
115
+ const log = (0, galois_fields_1.discreteLog)(F, g, target);
116
+ (0, vitest_1.expect)(log).toBe(k);
117
+ }
118
+ });
119
+ (0, vitest_1.it)('gfDiv consistente con gfMul + inverso', () => {
120
+ const a = (0, galois_fields_1.gfElement)(F, [1, 1, 0, 1]);
121
+ const b = (0, galois_fields_1.gfElement)(F, [0, 1, 1, 0]);
122
+ const q = (0, galois_fields_1.gfDiv)(F, a, b);
123
+ (0, vitest_1.expect)(q).not.toBeNull();
124
+ if (q)
125
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, q, b), a)).toBe(true);
126
+ });
127
+ });
128
+ (0, vitest_1.describe)('Galois Fields — leyes algebraicas (GF(3^2))', () => {
129
+ const F = (0, galois_fields_1.makeGaloisField)(3, 2);
130
+ (0, vitest_1.it)('suma asociativa y conmutativa', () => {
131
+ const elements = enumerateElements(F);
132
+ // Muestreo: 3 triples (a,b,c) deterministas.
133
+ const samples = [];
134
+ for (let i = 0; i < 4; i++) {
135
+ const a = elements[(i * 3) % elements.length];
136
+ const b = elements[(i * 5 + 1) % elements.length];
137
+ const c = elements[(i * 7 + 2) % elements.length];
138
+ if (a && b && c)
139
+ samples.push([a, b, c]);
140
+ }
141
+ for (const [a, b, c] of samples) {
142
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfAdd)(F, a, b), (0, galois_fields_1.gfAdd)(F, b, a))).toBe(true);
143
+ const left = (0, galois_fields_1.gfAdd)(F, (0, galois_fields_1.gfAdd)(F, a, b), c);
144
+ const right = (0, galois_fields_1.gfAdd)(F, a, (0, galois_fields_1.gfAdd)(F, b, c));
145
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)(left, right)).toBe(true);
146
+ }
147
+ });
148
+ (0, vitest_1.it)('multiplicación distributiva sobre la suma', () => {
149
+ const elements = enumerateElements(F);
150
+ for (let i = 0; i < 5; i++) {
151
+ const a = elements[(i * 2) % elements.length];
152
+ const b = elements[(i * 3 + 1) % elements.length];
153
+ const c = elements[(i * 5 + 2) % elements.length];
154
+ if (!a || !b || !c)
155
+ continue;
156
+ const left = (0, galois_fields_1.gfMul)(F, a, (0, galois_fields_1.gfAdd)(F, b, c));
157
+ const right = (0, galois_fields_1.gfAdd)(F, (0, galois_fields_1.gfMul)(F, a, b), (0, galois_fields_1.gfMul)(F, a, c));
158
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)(left, right)).toBe(true);
159
+ }
160
+ });
161
+ (0, vitest_1.it)('a − a = 0 y a + (−a) = 0', () => {
162
+ for (const a of enumerateElements(F)) {
163
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfSub)(F, a, a), (0, galois_fields_1.gfZero)(F))).toBe(true);
164
+ }
165
+ });
166
+ });
167
+ (0, vitest_1.describe)('Galois Fields — Reed-Solomon encoding (GF(2^3))', () => {
168
+ const F = (0, galois_fields_1.makeGaloisField)(2, 3);
169
+ (0, vitest_1.it)('rsEncode con mensaje constante c devuelve [c, c, ...]', () => {
170
+ const c = (0, galois_fields_1.gfElement)(F, [1, 0, 1]);
171
+ const word = (0, galois_fields_1.rsEncode)(F, [c], 5);
172
+ (0, vitest_1.expect)(word.length).toBe(5);
173
+ for (const w of word) {
174
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)(w, c)).toBe(true);
175
+ }
176
+ });
177
+ (0, vitest_1.it)('rsEncode evalúa el polinomio en potencias del primitivo', () => {
178
+ const g = (0, galois_fields_1.findPrimitive)(F);
179
+ const m0 = (0, galois_fields_1.gfOne)(F);
180
+ const m1 = (0, galois_fields_1.gfOne)(F);
181
+ // polinomio P(x) = 1 + x
182
+ const word = (0, galois_fields_1.rsEncode)(F, [m0, m1], 3);
183
+ (0, vitest_1.expect)(word.length).toBe(3);
184
+ // P(1) = 1+1 = 0 en GF(2^k)
185
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)(word[0], (0, galois_fields_1.gfZero)(F))).toBe(true);
186
+ // P(g) = 1 + g
187
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)(word[1], (0, galois_fields_1.gfAdd)(F, (0, galois_fields_1.gfOne)(F), g))).toBe(true);
188
+ });
189
+ });
190
+ (0, vitest_1.describe)('Galois Fields — errores y bordes', () => {
191
+ (0, vitest_1.it)('gfInverse(0) = null', () => {
192
+ const F = (0, galois_fields_1.makeGaloisField)(5, 2);
193
+ (0, vitest_1.expect)((0, galois_fields_1.gfInverse)(F, (0, galois_fields_1.gfZero)(F))).toBeNull();
194
+ });
195
+ (0, vitest_1.it)('gfDiv por 0 devuelve null', () => {
196
+ const F = (0, galois_fields_1.makeGaloisField)(5, 2);
197
+ const a = (0, galois_fields_1.gfElement)(F, [1, 2]);
198
+ (0, vitest_1.expect)((0, galois_fields_1.gfDiv)(F, a, (0, galois_fields_1.gfZero)(F))).toBeNull();
199
+ });
200
+ (0, vitest_1.it)('gfPow con exponente 0 da 1', () => {
201
+ const F = (0, galois_fields_1.makeGaloisField)(3, 2);
202
+ const a = (0, galois_fields_1.gfElement)(F, [2, 1]);
203
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfPow)(F, a, 0n), (0, galois_fields_1.gfOne)(F))).toBe(true);
204
+ });
205
+ (0, vitest_1.it)('gfPow exponente negativo usa inverso', () => {
206
+ const F = (0, galois_fields_1.makeGaloisField)(5, 1);
207
+ const a = (0, galois_fields_1.gfElement)(F, [3]);
208
+ // 3^(-1) mod 5 = 2
209
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfPow)(F, a, -1n), (0, galois_fields_1.gfElement)(F, [2]))).toBe(true);
210
+ });
211
+ (0, vitest_1.it)('makeGaloisField rechaza irreducible reducible', () => {
212
+ // (x^2) sobre Z/2 NO es irreducible.
213
+ (0, vitest_1.expect)(() => (0, galois_fields_1.makeGaloisField)(2, 2, [0, 0, 1])).toThrow();
214
+ });
215
+ (0, vitest_1.it)('makeGaloisField acepta irreducible explícito válido para GF(2^2)', () => {
216
+ // x^2 + x + 1 sobre Z/2 es irreducible.
217
+ const F = (0, galois_fields_1.makeGaloisField)(2, 2, [1, 1, 1]);
218
+ (0, vitest_1.expect)(F.order).toBe(4);
219
+ // Verificar que (1 + x) * (1 + x) reducido tiene sentido.
220
+ const a = (0, galois_fields_1.gfElement)(F, [1, 1]);
221
+ const a2 = (0, galois_fields_1.gfMul)(F, a, a);
222
+ // (1+x)^2 = 1 + 2x + x^2 = 1 + x^2 ≡ 1 + (x+1) = x (mod x^2+x+1, en Z/2)
223
+ (0, vitest_1.expect)((0, galois_fields_1.gfEq)(a2, (0, galois_fields_1.gfElement)(F, [0, 1]))).toBe(true);
224
+ });
225
+ });
226
+ //# sourceMappingURL=galois-fields.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"galois-fields.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/galois-fields/galois-fields.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,oEAkB0C;AAE1C,+DAA+D;AAE/D,SAAS,iBAAiB,CAAC,CAAqC;IAC9D,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,MAAM,GAAa,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;YACxB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,IAAA,yBAAS,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,IAAA,eAAM,EAAC,IAAA,qCAAqB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,CAAC,GAAG,IAAA,qCAAqB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,IAAA,qCAAqB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,qCAAqB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,GAAG,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAI,GAAG;gBAAE,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhC,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,IAAA,oBAAI,EAAC,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC;gBAAE,SAAS;YACjC,MAAM,GAAG,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAI,GAAG;gBAAE,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;YACrC,IAAI,IAAA,oBAAI,EAAC,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC;gBAAE,SAAS;YACjC,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhC,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,GAAG,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,GAAG,GAAG,IAAA,2BAAW,EAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YACtC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC;YAAE,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,6CAA6C,EAAE,GAAG,EAAE;IAC3D,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhC,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACtC,6CAA6C;QAC7C,MAAM,OAAO,GAA6C,EAAE,CAAC;QAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC9C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClD,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;YAChC,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxD,MAAM,IAAI,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzC,MAAM,KAAK,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC9C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClD,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAS;YAC7B,MAAM,IAAI,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,KAAK,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACvD,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;YACrC,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iDAAiD,EAAE,GAAG,EAAE;IAC/D,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhC,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAA,wBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACpB,yBAAyB;QACzB,MAAM,IAAI,GAAG,IAAA,wBAAQ,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,4BAA4B;QAC5B,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,eAAe;QACf,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,yBAAS,EAAC,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,mBAAmB;QACnB,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,qCAAqC;QACrC,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,wCAAwC;QACxC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,0DAA0D;QAC1D,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,yEAAyE;QACzE,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,EAAE,EAAE,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
@@ -0,0 +1,2 @@
1
+ export {};
2
+ //# sourceMappingURL=lattice.test.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lattice.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/lattice/lattice.test.ts"],"names":[],"mappings":""}