@stevenvo780/st-lang 4.10.0 → 4.12.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 (329) hide show
  1. package/dist/proof-systems/distributed-exchange/index.d.ts +101 -0
  2. package/dist/proof-systems/distributed-exchange/index.d.ts.map +1 -0
  3. package/dist/proof-systems/distributed-exchange/index.js +408 -0
  4. package/dist/proof-systems/distributed-exchange/index.js.map +1 -0
  5. package/dist/proof-systems/fol-prover-advanced/index.d.ts +7 -0
  6. package/dist/proof-systems/fol-prover-advanced/index.d.ts.map +1 -0
  7. package/dist/proof-systems/fol-prover-advanced/index.js +34 -0
  8. package/dist/proof-systems/fol-prover-advanced/index.js.map +1 -0
  9. package/dist/proof-systems/fol-prover-advanced/ordering.d.ts +34 -0
  10. package/dist/proof-systems/fol-prover-advanced/ordering.d.ts.map +1 -0
  11. package/dist/proof-systems/fol-prover-advanced/ordering.js +197 -0
  12. package/dist/proof-systems/fol-prover-advanced/ordering.js.map +1 -0
  13. package/dist/proof-systems/fol-prover-advanced/prover.d.ts +22 -0
  14. package/dist/proof-systems/fol-prover-advanced/prover.d.ts.map +1 -0
  15. package/dist/proof-systems/fol-prover-advanced/prover.js +219 -0
  16. package/dist/proof-systems/fol-prover-advanced/prover.js.map +1 -0
  17. package/dist/proof-systems/fol-prover-advanced/resolve.d.ts +43 -0
  18. package/dist/proof-systems/fol-prover-advanced/resolve.d.ts.map +1 -0
  19. package/dist/proof-systems/fol-prover-advanced/resolve.js +297 -0
  20. package/dist/proof-systems/fol-prover-advanced/resolve.js.map +1 -0
  21. package/dist/proof-systems/fol-prover-advanced/subsumption.d.ts +28 -0
  22. package/dist/proof-systems/fol-prover-advanced/subsumption.d.ts.map +1 -0
  23. package/dist/proof-systems/fol-prover-advanced/subsumption.js +172 -0
  24. package/dist/proof-systems/fol-prover-advanced/subsumption.js.map +1 -0
  25. package/dist/proof-systems/fol-prover-advanced/types.d.ts +68 -0
  26. package/dist/proof-systems/fol-prover-advanced/types.d.ts.map +1 -0
  27. package/dist/proof-systems/fol-prover-advanced/types.js +12 -0
  28. package/dist/proof-systems/fol-prover-advanced/types.js.map +1 -0
  29. package/dist/proof-systems/fol-prover-advanced/unify.d.ts +15 -0
  30. package/dist/proof-systems/fol-prover-advanced/unify.d.ts.map +1 -0
  31. package/dist/proof-systems/fol-prover-advanced/unify.js +144 -0
  32. package/dist/proof-systems/fol-prover-advanced/unify.js.map +1 -0
  33. package/dist/reasoning/combinatorics/basic-counts.d.ts +6 -0
  34. package/dist/reasoning/combinatorics/basic-counts.d.ts.map +1 -0
  35. package/dist/reasoning/combinatorics/basic-counts.js +82 -0
  36. package/dist/reasoning/combinatorics/basic-counts.js.map +1 -0
  37. package/dist/reasoning/combinatorics/bigint-helpers.d.ts +5 -0
  38. package/dist/reasoning/combinatorics/bigint-helpers.d.ts.map +1 -0
  39. package/dist/reasoning/combinatorics/bigint-helpers.js +8 -0
  40. package/dist/reasoning/combinatorics/bigint-helpers.js.map +1 -0
  41. package/dist/reasoning/combinatorics/burnside.d.ts +15 -0
  42. package/dist/reasoning/combinatorics/burnside.d.ts.map +1 -0
  43. package/dist/reasoning/combinatorics/burnside.js +91 -0
  44. package/dist/reasoning/combinatorics/burnside.js.map +1 -0
  45. package/dist/reasoning/combinatorics/generating-functions.d.ts +12 -0
  46. package/dist/reasoning/combinatorics/generating-functions.d.ts.map +1 -0
  47. package/dist/reasoning/combinatorics/generating-functions.js +67 -0
  48. package/dist/reasoning/combinatorics/generating-functions.js.map +1 -0
  49. package/dist/reasoning/combinatorics/generators.d.ts +5 -0
  50. package/dist/reasoning/combinatorics/generators.d.ts.map +1 -0
  51. package/dist/reasoning/combinatorics/generators.js +111 -0
  52. package/dist/reasoning/combinatorics/generators.js.map +1 -0
  53. package/dist/reasoning/combinatorics/inclusion-exclusion.d.ts +8 -0
  54. package/dist/reasoning/combinatorics/inclusion-exclusion.d.ts.map +1 -0
  55. package/dist/reasoning/combinatorics/inclusion-exclusion.js +45 -0
  56. package/dist/reasoning/combinatorics/inclusion-exclusion.js.map +1 -0
  57. package/dist/reasoning/combinatorics/index.d.ts +10 -0
  58. package/dist/reasoning/combinatorics/index.d.ts.map +1 -0
  59. package/dist/reasoning/combinatorics/index.js +44 -0
  60. package/dist/reasoning/combinatorics/index.js.map +1 -0
  61. package/dist/reasoning/combinatorics/partitions.d.ts +4 -0
  62. package/dist/reasoning/combinatorics/partitions.d.ts.map +1 -0
  63. package/dist/reasoning/combinatorics/partitions.js +90 -0
  64. package/dist/reasoning/combinatorics/partitions.js.map +1 -0
  65. package/dist/reasoning/combinatorics/permutations.d.ts +6 -0
  66. package/dist/reasoning/combinatorics/permutations.d.ts.map +1 -0
  67. package/dist/reasoning/combinatorics/permutations.js +124 -0
  68. package/dist/reasoning/combinatorics/permutations.js.map +1 -0
  69. package/dist/reasoning/combinatorics/set-partitions.d.ts +3 -0
  70. package/dist/reasoning/combinatorics/set-partitions.d.ts.map +1 -0
  71. package/dist/reasoning/combinatorics/set-partitions.js +46 -0
  72. package/dist/reasoning/combinatorics/set-partitions.js.map +1 -0
  73. package/dist/reasoning/combinatorics/special-numbers.d.ts +7 -0
  74. package/dist/reasoning/combinatorics/special-numbers.d.ts.map +1 -0
  75. package/dist/reasoning/combinatorics/special-numbers.js +128 -0
  76. package/dist/reasoning/combinatorics/special-numbers.js.map +1 -0
  77. package/dist/reasoning/constructive-analysis/cauchy.d.ts +51 -0
  78. package/dist/reasoning/constructive-analysis/cauchy.d.ts.map +1 -0
  79. package/dist/reasoning/constructive-analysis/cauchy.js +77 -0
  80. package/dist/reasoning/constructive-analysis/cauchy.js.map +1 -0
  81. package/dist/reasoning/constructive-analysis/compact.d.ts +35 -0
  82. package/dist/reasoning/constructive-analysis/compact.d.ts.map +1 -0
  83. package/dist/reasoning/constructive-analysis/compact.js +61 -0
  84. package/dist/reasoning/constructive-analysis/compact.js.map +1 -0
  85. package/dist/reasoning/constructive-analysis/continuity.d.ts +62 -0
  86. package/dist/reasoning/constructive-analysis/continuity.d.ts.map +1 -0
  87. package/dist/reasoning/constructive-analysis/continuity.js +112 -0
  88. package/dist/reasoning/constructive-analysis/continuity.js.map +1 -0
  89. package/dist/reasoning/constructive-analysis/index.d.ts +24 -0
  90. package/dist/reasoning/constructive-analysis/index.d.ts.map +1 -0
  91. package/dist/reasoning/constructive-analysis/index.js +36 -0
  92. package/dist/reasoning/constructive-analysis/index.js.map +1 -0
  93. package/dist/reasoning/constructive-analysis/integral.d.ts +31 -0
  94. package/dist/reasoning/constructive-analysis/integral.d.ts.map +1 -0
  95. package/dist/reasoning/constructive-analysis/integral.js +59 -0
  96. package/dist/reasoning/constructive-analysis/integral.js.map +1 -0
  97. package/dist/reasoning/constructive-analysis/ivt.d.ts +41 -0
  98. package/dist/reasoning/constructive-analysis/ivt.d.ts.map +1 -0
  99. package/dist/reasoning/constructive-analysis/ivt.js +115 -0
  100. package/dist/reasoning/constructive-analysis/ivt.js.map +1 -0
  101. package/dist/reasoning/constructive-reals/index.d.ts +23 -0
  102. package/dist/reasoning/constructive-reals/index.d.ts.map +1 -1
  103. package/dist/reasoning/constructive-reals/index.js +52 -1
  104. package/dist/reasoning/constructive-reals/index.js.map +1 -1
  105. package/dist/reasoning/graph-theory/index.d.ts +63 -0
  106. package/dist/reasoning/graph-theory/index.d.ts.map +1 -0
  107. package/dist/reasoning/graph-theory/index.js +1043 -0
  108. package/dist/reasoning/graph-theory/index.js.map +1 -0
  109. package/dist/reasoning/group-presentation/cayley.d.ts +8 -0
  110. package/dist/reasoning/group-presentation/cayley.d.ts.map +1 -0
  111. package/dist/reasoning/group-presentation/cayley.js +38 -0
  112. package/dist/reasoning/group-presentation/cayley.js.map +1 -0
  113. package/dist/reasoning/group-presentation/index.d.ts +8 -0
  114. package/dist/reasoning/group-presentation/index.d.ts.map +1 -0
  115. package/dist/reasoning/group-presentation/index.js +36 -0
  116. package/dist/reasoning/group-presentation/index.js.map +1 -0
  117. package/dist/reasoning/group-presentation/standard-groups.d.ts +6 -0
  118. package/dist/reasoning/group-presentation/standard-groups.d.ts.map +1 -0
  119. package/dist/reasoning/group-presentation/standard-groups.js +93 -0
  120. package/dist/reasoning/group-presentation/standard-groups.js.map +1 -0
  121. package/dist/reasoning/group-presentation/todd-coxeter.d.ts +10 -0
  122. package/dist/reasoning/group-presentation/todd-coxeter.d.ts.map +1 -0
  123. package/dist/reasoning/group-presentation/todd-coxeter.js +362 -0
  124. package/dist/reasoning/group-presentation/todd-coxeter.js.map +1 -0
  125. package/dist/reasoning/group-presentation/types.d.ts +7 -0
  126. package/dist/reasoning/group-presentation/types.d.ts.map +1 -0
  127. package/dist/reasoning/group-presentation/types.js +22 -0
  128. package/dist/reasoning/group-presentation/types.js.map +1 -0
  129. package/dist/reasoning/group-presentation/words.d.ts +10 -0
  130. package/dist/reasoning/group-presentation/words.d.ts.map +1 -0
  131. package/dist/reasoning/group-presentation/words.js +109 -0
  132. package/dist/reasoning/group-presentation/words.js.map +1 -0
  133. package/dist/reasoning/linear-algebra/index.d.ts +69 -0
  134. package/dist/reasoning/linear-algebra/index.d.ts.map +1 -0
  135. package/dist/reasoning/linear-algebra/index.js +859 -0
  136. package/dist/reasoning/linear-algebra/index.js.map +1 -0
  137. package/dist/reasoning/set-theory/hf-functions.d.ts +35 -0
  138. package/dist/reasoning/set-theory/hf-functions.d.ts.map +1 -0
  139. package/dist/reasoning/set-theory/hf-functions.js +147 -0
  140. package/dist/reasoning/set-theory/hf-functions.js.map +1 -0
  141. package/dist/reasoning/set-theory/hf-sets.d.ts +79 -0
  142. package/dist/reasoning/set-theory/hf-sets.d.ts.map +1 -0
  143. package/dist/reasoning/set-theory/hf-sets.js +338 -0
  144. package/dist/reasoning/set-theory/hf-sets.js.map +1 -0
  145. package/dist/reasoning/set-theory/index.d.ts +7 -0
  146. package/dist/reasoning/set-theory/index.d.ts.map +1 -0
  147. package/dist/reasoning/set-theory/index.js +44 -0
  148. package/dist/reasoning/set-theory/index.js.map +1 -0
  149. package/dist/reasoning/set-theory/zfc-axioms.d.ts +59 -0
  150. package/dist/reasoning/set-theory/zfc-axioms.d.ts.map +1 -0
  151. package/dist/reasoning/set-theory/zfc-axioms.js +245 -0
  152. package/dist/reasoning/set-theory/zfc-axioms.js.map +1 -0
  153. package/dist/tests/proof-systems/distributed-exchange/distributed-exchange.test.d.ts +2 -0
  154. package/dist/tests/proof-systems/distributed-exchange/distributed-exchange.test.d.ts.map +1 -0
  155. package/dist/tests/proof-systems/distributed-exchange/distributed-exchange.test.js +328 -0
  156. package/dist/tests/proof-systems/distributed-exchange/distributed-exchange.test.js.map +1 -0
  157. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.d.ts +2 -0
  158. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.d.ts.map +1 -0
  159. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.js +253 -0
  160. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.js.map +1 -0
  161. package/dist/tests/reasoning/combinatorics/combinatorics.test.d.ts +2 -0
  162. package/dist/tests/reasoning/combinatorics/combinatorics.test.d.ts.map +1 -0
  163. package/dist/tests/reasoning/combinatorics/combinatorics.test.js +256 -0
  164. package/dist/tests/reasoning/combinatorics/combinatorics.test.js.map +1 -0
  165. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.d.ts +2 -0
  166. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.d.ts.map +1 -0
  167. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.js +174 -0
  168. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.js.map +1 -0
  169. package/dist/tests/reasoning/graph-theory/graph-theory.test.d.ts +2 -0
  170. package/dist/tests/reasoning/graph-theory/graph-theory.test.d.ts.map +1 -0
  171. package/dist/tests/reasoning/graph-theory/graph-theory.test.js +363 -0
  172. package/dist/tests/reasoning/graph-theory/graph-theory.test.js.map +1 -0
  173. package/dist/tests/reasoning/group-presentation/group-presentation.test.d.ts +2 -0
  174. package/dist/tests/reasoning/group-presentation/group-presentation.test.d.ts.map +1 -0
  175. package/dist/tests/reasoning/group-presentation/group-presentation.test.js +229 -0
  176. package/dist/tests/reasoning/group-presentation/group-presentation.test.js.map +1 -0
  177. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.d.ts +2 -0
  178. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.d.ts.map +1 -0
  179. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.js +369 -0
  180. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.js.map +1 -0
  181. package/dist/tests/reasoning/set-theory/hf-functions.test.d.ts +2 -0
  182. package/dist/tests/reasoning/set-theory/hf-functions.test.d.ts.map +1 -0
  183. package/dist/tests/reasoning/set-theory/hf-functions.test.js +122 -0
  184. package/dist/tests/reasoning/set-theory/hf-functions.test.js.map +1 -0
  185. package/dist/tests/reasoning/set-theory/hf-sets.test.d.ts +2 -0
  186. package/dist/tests/reasoning/set-theory/hf-sets.test.d.ts.map +1 -0
  187. package/dist/tests/reasoning/set-theory/hf-sets.test.js +177 -0
  188. package/dist/tests/reasoning/set-theory/hf-sets.test.js.map +1 -0
  189. package/dist/tests/reasoning/set-theory/zfc-axioms.test.d.ts +2 -0
  190. package/dist/tests/reasoning/set-theory/zfc-axioms.test.d.ts.map +1 -0
  191. package/dist/tests/reasoning/set-theory/zfc-axioms.test.js +56 -0
  192. package/dist/tests/reasoning/set-theory/zfc-axioms.test.js.map +1 -0
  193. package/dist/tests/tooling/doc-gen/doc-gen.test.d.ts +2 -0
  194. package/dist/tests/tooling/doc-gen/doc-gen.test.d.ts.map +1 -0
  195. package/dist/tests/tooling/doc-gen/doc-gen.test.js +350 -0
  196. package/dist/tests/tooling/doc-gen/doc-gen.test.js.map +1 -0
  197. package/dist/tests/tooling/exporters/coq-v2/coq-v2-exporter.test.d.ts +2 -0
  198. package/dist/tests/tooling/exporters/coq-v2/coq-v2-exporter.test.d.ts.map +1 -0
  199. package/dist/tests/tooling/exporters/coq-v2/coq-v2-exporter.test.js +411 -0
  200. package/dist/tests/tooling/exporters/coq-v2/coq-v2-exporter.test.js.map +1 -0
  201. package/dist/tests/tooling/lemma-library/lemma-library.test.d.ts +2 -0
  202. package/dist/tests/tooling/lemma-library/lemma-library.test.d.ts.map +1 -0
  203. package/dist/tests/tooling/lemma-library/lemma-library.test.js +197 -0
  204. package/dist/tests/tooling/lemma-library/lemma-library.test.js.map +1 -0
  205. package/dist/tests/tooling/provenance/ledger.test.d.ts +2 -0
  206. package/dist/tests/tooling/provenance/ledger.test.d.ts.map +1 -0
  207. package/dist/tests/tooling/provenance/ledger.test.js +545 -0
  208. package/dist/tests/tooling/provenance/ledger.test.js.map +1 -0
  209. package/dist/tests/tooling/test-harness/test-harness.test.d.ts +2 -0
  210. package/dist/tests/tooling/test-harness/test-harness.test.d.ts.map +1 -0
  211. package/dist/tests/tooling/test-harness/test-harness.test.js +208 -0
  212. package/dist/tests/tooling/test-harness/test-harness.test.js.map +1 -0
  213. package/dist/tooling/doc-gen/extract.d.ts +13 -0
  214. package/dist/tooling/doc-gen/extract.d.ts.map +1 -0
  215. package/dist/tooling/doc-gen/extract.js +379 -0
  216. package/dist/tooling/doc-gen/extract.js.map +1 -0
  217. package/dist/tooling/doc-gen/generate.d.ts +9 -0
  218. package/dist/tooling/doc-gen/generate.d.ts.map +1 -0
  219. package/dist/tooling/doc-gen/generate.js +116 -0
  220. package/dist/tooling/doc-gen/generate.js.map +1 -0
  221. package/dist/tooling/doc-gen/index.d.ts +7 -0
  222. package/dist/tooling/doc-gen/index.d.ts.map +1 -0
  223. package/dist/tooling/doc-gen/index.js +39 -0
  224. package/dist/tooling/doc-gen/index.js.map +1 -0
  225. package/dist/tooling/doc-gen/jsdoc.d.ts +31 -0
  226. package/dist/tooling/doc-gen/jsdoc.d.ts.map +1 -0
  227. package/dist/tooling/doc-gen/jsdoc.js +140 -0
  228. package/dist/tooling/doc-gen/jsdoc.js.map +1 -0
  229. package/dist/tooling/doc-gen/render.d.ts +29 -0
  230. package/dist/tooling/doc-gen/render.d.ts.map +1 -0
  231. package/dist/tooling/doc-gen/render.js +206 -0
  232. package/dist/tooling/doc-gen/render.js.map +1 -0
  233. package/dist/tooling/doc-gen/types.d.ts +51 -0
  234. package/dist/tooling/doc-gen/types.d.ts.map +1 -0
  235. package/dist/tooling/doc-gen/types.js +10 -0
  236. package/dist/tooling/doc-gen/types.js.map +1 -0
  237. package/dist/tooling/exporters/coq-v2/index.d.ts +68 -0
  238. package/dist/tooling/exporters/coq-v2/index.d.ts.map +1 -0
  239. package/dist/tooling/exporters/coq-v2/index.js +692 -0
  240. package/dist/tooling/exporters/coq-v2/index.js.map +1 -0
  241. package/dist/tooling/lemma-library/apply.d.ts +9 -0
  242. package/dist/tooling/lemma-library/apply.d.ts.map +1 -0
  243. package/dist/tooling/lemma-library/apply.js +94 -0
  244. package/dist/tooling/lemma-library/apply.js.map +1 -0
  245. package/dist/tooling/lemma-library/arithmetic.d.ts +3 -0
  246. package/dist/tooling/lemma-library/arithmetic.d.ts.map +1 -0
  247. package/dist/tooling/lemma-library/arithmetic.js +176 -0
  248. package/dist/tooling/lemma-library/arithmetic.js.map +1 -0
  249. package/dist/tooling/lemma-library/firstorder.d.ts +3 -0
  250. package/dist/tooling/lemma-library/firstorder.d.ts.map +1 -0
  251. package/dist/tooling/lemma-library/firstorder.js +136 -0
  252. package/dist/tooling/lemma-library/firstorder.js.map +1 -0
  253. package/dist/tooling/lemma-library/index.d.ts +13 -0
  254. package/dist/tooling/lemma-library/index.d.ts.map +1 -0
  255. package/dist/tooling/lemma-library/index.js +32 -0
  256. package/dist/tooling/lemma-library/index.js.map +1 -0
  257. package/dist/tooling/lemma-library/library.d.ts +34 -0
  258. package/dist/tooling/lemma-library/library.d.ts.map +1 -0
  259. package/dist/tooling/lemma-library/library.js +126 -0
  260. package/dist/tooling/lemma-library/library.js.map +1 -0
  261. package/dist/tooling/lemma-library/modal.d.ts +3 -0
  262. package/dist/tooling/lemma-library/modal.d.ts.map +1 -0
  263. package/dist/tooling/lemma-library/modal.js +138 -0
  264. package/dist/tooling/lemma-library/modal.js.map +1 -0
  265. package/dist/tooling/lemma-library/propositional.d.ts +3 -0
  266. package/dist/tooling/lemma-library/propositional.d.ts.map +1 -0
  267. package/dist/tooling/lemma-library/propositional.js +265 -0
  268. package/dist/tooling/lemma-library/propositional.js.map +1 -0
  269. package/dist/tooling/lemma-library/set-theory.d.ts +3 -0
  270. package/dist/tooling/lemma-library/set-theory.d.ts.map +1 -0
  271. package/dist/tooling/lemma-library/set-theory.js +134 -0
  272. package/dist/tooling/lemma-library/set-theory.js.map +1 -0
  273. package/dist/tooling/lemma-library/standard.d.ts +3 -0
  274. package/dist/tooling/lemma-library/standard.d.ts.map +1 -0
  275. package/dist/tooling/lemma-library/standard.js +27 -0
  276. package/dist/tooling/lemma-library/standard.js.map +1 -0
  277. package/dist/tooling/lemma-library/tfidf.d.ts +5 -0
  278. package/dist/tooling/lemma-library/tfidf.d.ts.map +1 -0
  279. package/dist/tooling/lemma-library/tfidf.js +100 -0
  280. package/dist/tooling/lemma-library/tfidf.js.map +1 -0
  281. package/dist/tooling/lemma-library/tokenize.d.ts +2 -0
  282. package/dist/tooling/lemma-library/tokenize.d.ts.map +1 -0
  283. package/dist/tooling/lemma-library/tokenize.js +74 -0
  284. package/dist/tooling/lemma-library/tokenize.js.map +1 -0
  285. package/dist/tooling/lemma-library/types.d.ts +53 -0
  286. package/dist/tooling/lemma-library/types.d.ts.map +1 -0
  287. package/dist/tooling/lemma-library/types.js +10 -0
  288. package/dist/tooling/lemma-library/types.js.map +1 -0
  289. package/dist/tooling/provenance/index.d.ts +3 -0
  290. package/dist/tooling/provenance/index.d.ts.map +1 -0
  291. package/dist/tooling/provenance/index.js +16 -0
  292. package/dist/tooling/provenance/index.js.map +1 -0
  293. package/dist/tooling/provenance/ledger.d.ts +89 -0
  294. package/dist/tooling/provenance/ledger.d.ts.map +1 -0
  295. package/dist/tooling/provenance/ledger.js +439 -0
  296. package/dist/tooling/provenance/ledger.js.map +1 -0
  297. package/dist/tooling/provenance/types.d.ts +70 -0
  298. package/dist/tooling/provenance/types.d.ts.map +1 -0
  299. package/dist/tooling/provenance/types.js +14 -0
  300. package/dist/tooling/provenance/types.js.map +1 -0
  301. package/dist/tooling/test-harness/combinators.d.ts +14 -0
  302. package/dist/tooling/test-harness/combinators.d.ts.map +1 -0
  303. package/dist/tooling/test-harness/combinators.js +122 -0
  304. package/dist/tooling/test-harness/combinators.js.map +1 -0
  305. package/dist/tooling/test-harness/coverage.d.ts +3 -0
  306. package/dist/tooling/test-harness/coverage.d.ts.map +1 -0
  307. package/dist/tooling/test-harness/coverage.js +32 -0
  308. package/dist/tooling/test-harness/coverage.js.map +1 -0
  309. package/dist/tooling/test-harness/generators.d.ts +6 -0
  310. package/dist/tooling/test-harness/generators.d.ts.map +1 -0
  311. package/dist/tooling/test-harness/generators.js +66 -0
  312. package/dist/tooling/test-harness/generators.js.map +1 -0
  313. package/dist/tooling/test-harness/index.d.ts +7 -0
  314. package/dist/tooling/test-harness/index.d.ts.map +1 -0
  315. package/dist/tooling/test-harness/index.js +27 -0
  316. package/dist/tooling/test-harness/index.js.map +1 -0
  317. package/dist/tooling/test-harness/mutation.d.ts +4 -0
  318. package/dist/tooling/test-harness/mutation.d.ts.map +1 -0
  319. package/dist/tooling/test-harness/mutation.js +28 -0
  320. package/dist/tooling/test-harness/mutation.js.map +1 -0
  321. package/dist/tooling/test-harness/snapshot.d.ts +5 -0
  322. package/dist/tooling/test-harness/snapshot.d.ts.map +1 -0
  323. package/dist/tooling/test-harness/snapshot.js +86 -0
  324. package/dist/tooling/test-harness/snapshot.js.map +1 -0
  325. package/dist/tooling/test-harness/types.d.ts +32 -0
  326. package/dist/tooling/test-harness/types.d.ts.map +1 -0
  327. package/dist/tooling/test-harness/types.js +3 -0
  328. package/dist/tooling/test-harness/types.js.map +1 -0
  329. package/package.json +1 -1
@@ -0,0 +1,174 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ const vitest_1 = require("vitest");
4
+ const constructive_reals_1 = require("../../../reasoning/constructive-reals");
5
+ const constructive_analysis_1 = require("../../../reasoning/constructive-analysis");
6
+ (0, vitest_1.describe)('constructive-reals primitives (smoke)', () => {
7
+ (0, vitest_1.it)('add and mul are exact on rationals', () => {
8
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)((0, constructive_reals_1.add)((0, constructive_reals_1.fromFloat)(1), (0, constructive_reals_1.fromFloat)(2)))).toBeCloseTo(3, 6);
9
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)((0, constructive_reals_1.mul)((0, constructive_reals_1.fromFloat)(3), (0, constructive_reals_1.fromFloat)(4)))).toBeCloseTo(12, 6);
10
+ });
11
+ });
12
+ (0, vitest_1.describe)('Cauchy sequences', () => {
13
+ // x_n = 1/n. Cauchy modulus: to get |x_m - x_n| < 1/eps for m, n >= N,
14
+ // suffice N >= 2 * eps (since |1/m - 1/n| <= 1/m + 1/n <= 2/N).
15
+ const oneOverN = (0, constructive_analysis_1.cauchyFrom)((n) => (0, constructive_reals_1.fromFloat)(1 / (n + 1)), // n >= 0
16
+ (eps) => 2 * eps + 1);
17
+ (0, vitest_1.it)('1/n is constructively Cauchy (modulus sound at eps=10)', () => {
18
+ (0, vitest_1.expect)((0, constructive_analysis_1.isCauchy)(oneOverN, 10)).toBe(true);
19
+ });
20
+ (0, vitest_1.it)('1/n is constructively Cauchy at eps=100', () => {
21
+ (0, vitest_1.expect)((0, constructive_analysis_1.isCauchy)(oneOverN, 100)).toBe(true);
22
+ });
23
+ (0, vitest_1.it)('limit of 1/n is 0', () => {
24
+ const lim = (0, constructive_analysis_1.limit)(oneOverN);
25
+ (0, vitest_1.expect)((0, constructive_reals_1.approxEq)(lim, constructive_reals_1.zero, 50)).toBe(true);
26
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(lim, 10_000)).toBeCloseTo(0, 3);
27
+ });
28
+ (0, vitest_1.it)('Cauchy detection rejects a bogus modulus', () => {
29
+ const bogus = (0, constructive_analysis_1.cauchyFrom)((n) => (0, constructive_reals_1.fromFloat)((-1) ** n), () => 1);
30
+ (0, vitest_1.expect)((0, constructive_analysis_1.isCauchy)(bogus, 4)).toBe(false);
31
+ });
32
+ (0, vitest_1.it)('constant sequence is trivially Cauchy and converges to itself', () => {
33
+ const c = (0, constructive_analysis_1.cauchyFrom)(() => (0, constructive_reals_1.fromFloat)(7), () => 1);
34
+ (0, vitest_1.expect)((0, constructive_analysis_1.isCauchy)(c, 100)).toBe(true);
35
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)((0, constructive_analysis_1.limit)(c))).toBeCloseTo(7, 6);
36
+ });
37
+ (0, vitest_1.it)('partial sums of 1/2^n converge to 2', () => {
38
+ // S_n = sum_{k=0}^{n} 1/2^k = 2 - 1/2^n.
39
+ // |S_m - S_n| < 1/2^min(m,n). To get < 1/eps, take N = ceil(log2(eps)) + 1.
40
+ const partial = (0, constructive_analysis_1.cauchyFrom)((n) => (0, constructive_reals_1.fromFloat)(2 - Math.pow(2, -n)), (eps) => Math.max(1, Math.ceil(Math.log2(eps)) + 2));
41
+ (0, vitest_1.expect)((0, constructive_analysis_1.isCauchy)(partial, 100)).toBe(true);
42
+ const lim = (0, constructive_analysis_1.limit)(partial);
43
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(lim, 10_000)).toBeCloseTo(2, 3);
44
+ });
45
+ });
46
+ (0, vitest_1.describe)('Uniform continuity', () => {
47
+ // f(x) = x^2. On [0, 1], Lipschitz constant is 2 (since |f'| <= 2).
48
+ // So modulus(eps) = ceil(2 * eps) works.
49
+ const xSquared = {
50
+ fn: (x) => (0, constructive_reals_1.mul)(x, x),
51
+ modulus: (eps) => Math.max(1, 2 * eps)
52
+ };
53
+ (0, vitest_1.it)('x^2 is uniformly continuous on [0, 1]', () => {
54
+ (0, vitest_1.expect)((0, constructive_analysis_1.isUniformlyContinuousOn)(xSquared, [constructive_reals_1.zero, constructive_reals_1.one], 50)).toBe(true);
55
+ });
56
+ (0, vitest_1.it)('x^2 modulus is sound at finer precision', () => {
57
+ (0, vitest_1.expect)((0, constructive_analysis_1.isUniformlyContinuousOn)(xSquared, [constructive_reals_1.zero, constructive_reals_1.one], 200, 16)).toBe(true);
58
+ });
59
+ (0, vitest_1.it)('identity is uniformly continuous on [-1, 1]', () => {
60
+ const id = (0, constructive_analysis_1.identity)();
61
+ (0, vitest_1.expect)((0, constructive_analysis_1.isUniformlyContinuousOn)(id, [(0, constructive_reals_1.fromFloat)(-1), constructive_reals_1.one], 100)).toBe(true);
62
+ });
63
+ (0, vitest_1.it)('constant function is uniformly continuous everywhere', () => {
64
+ const k = (0, constructive_analysis_1.constant)((0, constructive_reals_1.fromFloat)(3.14));
65
+ (0, vitest_1.expect)((0, constructive_analysis_1.isUniformlyContinuousOn)(k, [constructive_reals_1.zero, (0, constructive_reals_1.fromFloat)(10)], 100)).toBe(true);
66
+ });
67
+ (0, vitest_1.it)('composition of two Lipschitz continuous functions is continuous', () => {
68
+ const g = (0, constructive_analysis_1.lipschitz)((x) => (0, constructive_reals_1.add)(x, constructive_reals_1.one), 1); // g(x) = x + 1
69
+ const f = (0, constructive_analysis_1.lipschitz)((x) => (0, constructive_reals_1.mul)(x, (0, constructive_reals_1.fromFloat)(2)), 2); // f(y) = 2y
70
+ const fog = (0, constructive_analysis_1.composition)(f, g);
71
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(fog.fn((0, constructive_reals_1.fromFloat)(3)))).toBeCloseTo(8, 6); // 2*(3+1)
72
+ (0, vitest_1.expect)((0, constructive_analysis_1.isUniformlyContinuousOn)(fog, [constructive_reals_1.zero, constructive_reals_1.one], 50)).toBe(true);
73
+ });
74
+ (0, vitest_1.it)('a wrong modulus is rejected', () => {
75
+ const wrongMod = {
76
+ fn: (x) => (0, constructive_reals_1.mul)(x, (0, constructive_reals_1.mul)(x, x)), // x^3
77
+ modulus: () => 1 // claims |x-y| < 1 => |f(x)-f(y)| < 1/eps. False.
78
+ };
79
+ (0, vitest_1.expect)((0, constructive_analysis_1.isUniformlyContinuousOn)(wrongMod, [constructive_reals_1.zero, (0, constructive_reals_1.fromFloat)(5)], 10)).toBe(false);
80
+ });
81
+ });
82
+ (0, vitest_1.describe)('Bishop integral', () => {
83
+ (0, vitest_1.it)('integral of constant c over [a, b] equals c * (b - a)', () => {
84
+ const c = (0, constructive_analysis_1.constant)((0, constructive_reals_1.fromFloat)(2.5));
85
+ const I = (0, constructive_analysis_1.bishopIntegral)(c, (0, constructive_reals_1.fromFloat)(1), (0, constructive_reals_1.fromFloat)(4), 100);
86
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(I, 10_000)).toBeCloseTo(2.5 * 3, 2);
87
+ });
88
+ (0, vitest_1.it)('integral of identity over [0, 1] is 0.5', () => {
89
+ const id = (0, constructive_analysis_1.identity)();
90
+ const I = (0, constructive_analysis_1.bishopIntegral)(id, constructive_reals_1.zero, constructive_reals_1.one, 200);
91
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(I, 10_000)).toBeCloseTo(0.5, 2);
92
+ });
93
+ (0, vitest_1.it)('integral of x^2 over [0, 1] is approximately 1/3', () => {
94
+ const xSq = {
95
+ fn: (x) => (0, constructive_reals_1.mul)(x, x),
96
+ modulus: (eps) => Math.max(1, 2 * eps)
97
+ };
98
+ const I = (0, constructive_analysis_1.bishopIntegral)(xSq, constructive_reals_1.zero, constructive_reals_1.one, 200);
99
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(I, 10_000)).toBeCloseTo(1 / 3, 2);
100
+ });
101
+ (0, vitest_1.it)('integral is sign-aware (reversing limits flips sign)', () => {
102
+ const id = (0, constructive_analysis_1.identity)();
103
+ const Iup = (0, constructive_analysis_1.bishopIntegral)(id, constructive_reals_1.zero, constructive_reals_1.one, 100);
104
+ const Idn = (0, constructive_analysis_1.bishopIntegral)(id, constructive_reals_1.one, constructive_reals_1.zero, 100);
105
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(Iup, 1_000)).toBeCloseTo(0.5, 2);
106
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(Idn, 1_000)).toBeCloseTo(-0.5, 2);
107
+ });
108
+ });
109
+ (0, vitest_1.describe)('Heine-Borel finite subcover', () => {
110
+ (0, vitest_1.it)('three open intervals cover [0, 1]', () => {
111
+ const cover = {
112
+ intervals: [
113
+ [(0, constructive_reals_1.fromFloat)(-0.1), (0, constructive_reals_1.fromFloat)(0.5)],
114
+ [(0, constructive_reals_1.fromFloat)(0.3), (0, constructive_reals_1.fromFloat)(0.8)],
115
+ [(0, constructive_reals_1.fromFloat)(0.7), (0, constructive_reals_1.fromFloat)(1.2)]
116
+ ]
117
+ };
118
+ (0, vitest_1.expect)((0, constructive_analysis_1.hasFiniteSubcover)(cover, [constructive_reals_1.zero, constructive_reals_1.one])).toBe(true);
119
+ });
120
+ (0, vitest_1.it)('a gap in the cover is rejected', () => {
121
+ const cover = {
122
+ intervals: [
123
+ [(0, constructive_reals_1.fromFloat)(-0.1), (0, constructive_reals_1.fromFloat)(0.3)],
124
+ [(0, constructive_reals_1.fromFloat)(0.7), (0, constructive_reals_1.fromFloat)(1.2)]
125
+ ]
126
+ };
127
+ (0, vitest_1.expect)((0, constructive_analysis_1.hasFiniteSubcover)(cover, [constructive_reals_1.zero, constructive_reals_1.one])).toBe(false);
128
+ });
129
+ });
130
+ (0, vitest_1.describe)('Intermediate Value Theorem (constructive)', () => {
131
+ (0, vitest_1.it)('IVT for f(x) = x^2 - 2 on [1, 2] finds c with f(c) ≈ 0', () => {
132
+ const f = {
133
+ fn: (x) => (0, constructive_reals_1.sub)((0, constructive_reals_1.mul)(x, x), (0, constructive_reals_1.fromFloat)(2)),
134
+ modulus: (eps) => Math.max(1, 4 * eps) // L = 4 on [1, 2]
135
+ };
136
+ const c = (0, constructive_analysis_1.intermediateValueTheorem)(f, constructive_reals_1.one, (0, constructive_reals_1.fromFloat)(2), constructive_reals_1.zero, 200);
137
+ (0, vitest_1.expect)(c).not.toBeNull();
138
+ if (c !== null) {
139
+ // c should be close to sqrt(2).
140
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(c, 10_000)).toBeCloseTo(Math.SQRT2, 1);
141
+ // f(c) should be close to 0.
142
+ const fc = f.fn(c);
143
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)((0, constructive_reals_1.abs)(fc), 10_000)).toBeLessThan(1 / 50);
144
+ }
145
+ });
146
+ (0, vitest_1.it)('IVT for f(x) = x - 0.5 on [0, 1] hits target 0', () => {
147
+ const f = {
148
+ fn: (x) => (0, constructive_reals_1.sub)(x, (0, constructive_reals_1.fromFloat)(0.5)),
149
+ modulus: (eps) => Math.max(1, eps)
150
+ };
151
+ const c = (0, constructive_analysis_1.intermediateValueTheorem)(f, constructive_reals_1.zero, constructive_reals_1.one, constructive_reals_1.zero, 100);
152
+ (0, vitest_1.expect)(c).not.toBeNull();
153
+ if (c !== null) {
154
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(c, 1_000)).toBeCloseTo(0.5, 2);
155
+ }
156
+ });
157
+ (0, vitest_1.it)('IVT returns null when target is not bracketed', () => {
158
+ // f(x) = 1 (constant) on [0, 1]: target 0 is not in the image.
159
+ const f = (0, constructive_analysis_1.constant)(constructive_reals_1.one);
160
+ const c = (0, constructive_analysis_1.intermediateValueTheorem)(f, constructive_reals_1.zero, constructive_reals_1.one, constructive_reals_1.zero, 50);
161
+ (0, vitest_1.expect)(c).toBeNull();
162
+ });
163
+ });
164
+ (0, vitest_1.describe)('Mean value (constructive)', () => {
165
+ (0, vitest_1.it)('mean of x on [0, 1] is 0.5 and IVT finds c with f(c) ≈ 0.5', () => {
166
+ const id = (0, constructive_analysis_1.identity)();
167
+ const c = (0, constructive_analysis_1.meanValueConstructive)(id, constructive_reals_1.zero, constructive_reals_1.one, 100);
168
+ (0, vitest_1.expect)(c).not.toBeNull();
169
+ if (c !== null) {
170
+ (0, vitest_1.expect)((0, constructive_reals_1.toNumber)(c, 1_000)).toBeCloseTo(0.5, 2);
171
+ }
172
+ });
173
+ });
174
+ //# sourceMappingURL=constructive-analysis.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"constructive-analysis.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/constructive-analysis/constructive-analysis.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAE9C,8EAY+C;AAE/C,oFAekD;AAElD,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,IAAA,wBAAG,EAAC,IAAA,8BAAS,EAAC,CAAC,CAAC,EAAE,IAAA,8BAAS,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,IAAA,wBAAG,EAAC,IAAA,8BAAS,EAAC,CAAC,CAAC,EAAE,IAAA,8BAAS,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,uEAAuE;IACvE,gEAAgE;IAChE,MAAM,QAAQ,GAA0B,IAAA,kCAAU,EAChD,CAAC,CAAS,EAAE,EAAE,CAAC,IAAA,8BAAS,EAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,SAAS;IAChD,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAC7B,CAAC;IAEF,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,IAAA,eAAM,EAAC,IAAA,gCAAQ,EAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,IAAA,eAAM,EAAC,IAAA,gCAAQ,EAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mBAAmB,EAAE,GAAG,EAAE;QAC3B,MAAM,GAAG,GAAG,IAAA,6BAAK,EAAC,QAAQ,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,GAAG,EAAE,yBAAI,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAA0B,IAAA,kCAAU,EAC7C,CAAC,CAAS,EAAE,EAAE,CAAC,IAAA,8BAAS,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EACnC,GAAG,EAAE,CAAC,CAAC,CACR,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,gCAAQ,EAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,CAAC,GAAG,IAAA,kCAAU,EAAC,GAAG,EAAE,CAAC,IAAA,8BAAS,EAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,IAAA,gCAAQ,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,IAAA,6BAAK,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,yCAAyC;QACzC,4EAA4E;QAC5E,MAAM,OAAO,GAA0B,IAAA,kCAAU,EAC/C,CAAC,CAAS,EAAE,EAAE,CAAC,IAAA,8BAAS,EAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAC7C,CAAC,GAAW,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAC5D,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,gCAAQ,EAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,IAAA,6BAAK,EAAC,OAAO,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,oEAAoE;IACpE,yCAAyC;IACzC,MAAM,QAAQ,GAA2B;QACvC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,CAAC,CAAC;QACpB,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;KACvC,CAAC;IAEF,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,IAAA,eAAM,EAAC,IAAA,+CAAuB,EAAC,QAAQ,EAAE,CAAC,yBAAI,EAAE,wBAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,IAAA,eAAM,EAAC,IAAA,+CAAuB,EAAC,QAAQ,EAAE,CAAC,yBAAI,EAAE,wBAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,EAAE,GAAG,IAAA,gCAAQ,GAAE,CAAC;QACtB,IAAA,eAAM,EAAC,IAAA,+CAAuB,EAAC,EAAE,EAAE,CAAC,IAAA,8BAAS,EAAC,CAAC,CAAC,CAAC,EAAE,wBAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,CAAC,GAAG,IAAA,gCAAQ,EAAC,IAAA,8BAAS,EAAC,IAAI,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,+CAAuB,EAAC,CAAC,EAAE,CAAC,yBAAI,EAAE,IAAA,8BAAS,EAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,CAAC,GAAG,IAAA,iCAAS,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,wBAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,eAAe;QAC3D,MAAM,CAAC,GAAG,IAAA,iCAAS,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,IAAA,8BAAS,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY;QACjE,MAAM,GAAG,GAAG,IAAA,mCAAW,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,GAAG,CAAC,EAAE,CAAC,IAAA,8BAAS,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU;QACpE,IAAA,eAAM,EAAC,IAAA,+CAAuB,EAAC,GAAG,EAAE,CAAC,yBAAI,EAAE,wBAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,QAAQ,GAA2B;YACvC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM;YACpC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,kDAAkD;SACpE,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,+CAAuB,EAAC,QAAQ,EAAE,CAAC,yBAAI,EAAE,IAAA,8BAAS,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,IAAA,gCAAQ,EAAC,IAAA,8BAAS,EAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAA,sCAAc,EAAC,CAAC,EAAE,IAAA,8BAAS,EAAC,CAAC,CAAC,EAAE,IAAA,8BAAS,EAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,EAAE,GAAG,IAAA,gCAAQ,GAAE,CAAC;QACtB,MAAM,CAAC,GAAG,IAAA,sCAAc,EAAC,EAAE,EAAE,yBAAI,EAAE,wBAAG,EAAE,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,GAAG,GAA2B;YAClC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,CAAC,CAAC;YACpB,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;SACvC,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,sCAAc,EAAC,GAAG,EAAE,yBAAI,EAAE,wBAAG,EAAE,GAAG,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAG,IAAA,gCAAQ,GAAE,CAAC;QACtB,MAAM,GAAG,GAAG,IAAA,sCAAc,EAAC,EAAE,EAAE,yBAAI,EAAE,wBAAG,EAAE,GAAG,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAA,sCAAc,EAAC,EAAE,EAAE,wBAAG,EAAE,yBAAI,EAAE,GAAG,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,KAAK,GAAG;YACZ,SAAS,EAAE;gBACT,CAAC,IAAA,8BAAS,EAAC,CAAC,GAAG,CAAC,EAAE,IAAA,8BAAS,EAAC,GAAG,CAAC,CAAC;gBACjC,CAAC,IAAA,8BAAS,EAAC,GAAG,CAAC,EAAE,IAAA,8BAAS,EAAC,GAAG,CAAC,CAAC;gBAChC,CAAC,IAAA,8BAAS,EAAC,GAAG,CAAC,EAAE,IAAA,8BAAS,EAAC,GAAG,CAAC,CAAC;aACS;SAC5C,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,yCAAiB,EAAC,KAAK,EAAE,CAAC,yBAAI,EAAE,wBAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,KAAK,GAAG;YACZ,SAAS,EAAE;gBACT,CAAC,IAAA,8BAAS,EAAC,CAAC,GAAG,CAAC,EAAE,IAAA,8BAAS,EAAC,GAAG,CAAC,CAAC;gBACjC,CAAC,IAAA,8BAAS,EAAC,GAAG,CAAC,EAAE,IAAA,8BAAS,EAAC,GAAG,CAAC,CAAC;aACS;SAC5C,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,yCAAiB,EAAC,KAAK,EAAE,CAAC,yBAAI,EAAE,wBAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAA2B;YAChC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,8BAAS,EAAC,CAAC,CAAC,CAAC;YACvC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,kBAAkB;SAC1D,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,gDAAwB,EAAC,CAAC,EAAE,wBAAG,EAAE,IAAA,8BAAS,EAAC,CAAC,CAAC,EAAE,yBAAI,EAAE,GAAG,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACf,gCAAgC;YAChC,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvD,6BAA6B;YAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACnB,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,IAAA,wBAAG,EAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAA2B;YAChC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,IAAA,8BAAS,EAAC,GAAG,CAAC,CAAC;YACjC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC;SACnC,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,gDAAwB,EAAC,CAAC,EAAE,yBAAI,EAAE,wBAAG,EAAE,yBAAI,EAAE,GAAG,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACf,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,+DAA+D;QAC/D,MAAM,CAAC,GAAG,IAAA,gCAAQ,EAAC,wBAAG,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAA,gDAAwB,EAAC,CAAC,EAAE,yBAAI,EAAE,wBAAG,EAAE,yBAAI,EAAE,EAAE,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,EAAE,GAAG,IAAA,gCAAQ,GAAE,CAAC;QACtB,MAAM,CAAC,GAAG,IAAA,6CAAqB,EAAC,EAAE,EAAE,yBAAI,EAAE,wBAAG,EAAE,GAAG,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACf,IAAA,eAAM,EAAC,IAAA,6BAAQ,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
@@ -0,0 +1,2 @@
1
+ export {};
2
+ //# sourceMappingURL=graph-theory.test.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"graph-theory.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/graph-theory/graph-theory.test.ts"],"names":[],"mappings":""}
@@ -0,0 +1,363 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ const vitest_1 = require("vitest");
4
+ const graph_theory_1 = require("../../../reasoning/graph-theory");
5
+ // Helpers
6
+ function pathGraph(n, directed = false) {
7
+ const G = (0, graph_theory_1.makeGraph)(directed);
8
+ for (let i = 0; i < n; i++)
9
+ (0, graph_theory_1.addVertex)(G, i);
10
+ for (let i = 0; i < n - 1; i++)
11
+ (0, graph_theory_1.addEdge)(G, { from: i, to: i + 1, weight: 1 });
12
+ return G;
13
+ }
14
+ function cycleGraph(n, directed = false) {
15
+ const G = (0, graph_theory_1.makeGraph)(directed);
16
+ for (let i = 0; i < n; i++)
17
+ (0, graph_theory_1.addVertex)(G, i);
18
+ for (let i = 0; i < n; i++)
19
+ (0, graph_theory_1.addEdge)(G, { from: i, to: (i + 1) % n, weight: 1 });
20
+ return G;
21
+ }
22
+ function completeGraph(n) {
23
+ const G = (0, graph_theory_1.makeGraph)(false);
24
+ for (let i = 0; i < n; i++)
25
+ (0, graph_theory_1.addVertex)(G, i);
26
+ for (let i = 0; i < n; i++) {
27
+ for (let j = i + 1; j < n; j++) {
28
+ (0, graph_theory_1.addEdge)(G, { from: i, to: j, weight: 1 });
29
+ }
30
+ }
31
+ return G;
32
+ }
33
+ // ------------------------------------------------------------
34
+ // 1. Construcción
35
+ // ------------------------------------------------------------
36
+ (0, vitest_1.describe)('graph-theory / construcción', () => {
37
+ (0, vitest_1.it)('makeGraph inicializa vacío', () => {
38
+ const G = (0, graph_theory_1.makeGraph)();
39
+ (0, vitest_1.expect)(G.vertices.size).toBe(0);
40
+ (0, vitest_1.expect)(G.edges.length).toBe(0);
41
+ (0, vitest_1.expect)(G.directed).toBe(false);
42
+ });
43
+ (0, vitest_1.it)('addEdge añade extremos como vértices', () => {
44
+ const G = (0, graph_theory_1.makeGraph)();
45
+ (0, graph_theory_1.addEdge)(G, { from: 'a', to: 'b', weight: 2 });
46
+ (0, vitest_1.expect)(G.vertices.has('a')).toBe(true);
47
+ (0, vitest_1.expect)(G.vertices.has('b')).toBe(true);
48
+ (0, vitest_1.expect)(G.edges.length).toBe(1);
49
+ });
50
+ (0, vitest_1.it)('neighbors respeta dirección', () => {
51
+ const G = (0, graph_theory_1.makeGraph)(true);
52
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
53
+ (0, vitest_1.expect)((0, graph_theory_1.neighbors)(G, 1)).toEqual([2]);
54
+ (0, vitest_1.expect)((0, graph_theory_1.neighbors)(G, 2)).toEqual([]);
55
+ });
56
+ (0, vitest_1.it)('inDegree/outDegree en grafo dirigido', () => {
57
+ const G = (0, graph_theory_1.makeGraph)(true);
58
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
59
+ (0, graph_theory_1.addEdge)(G, { from: 3, to: 2 });
60
+ (0, vitest_1.expect)((0, graph_theory_1.inDegree)(G, 2)).toBe(2);
61
+ (0, vitest_1.expect)((0, graph_theory_1.outDegree)(G, 2)).toBe(0);
62
+ (0, vitest_1.expect)((0, graph_theory_1.outDegree)(G, 1)).toBe(1);
63
+ });
64
+ });
65
+ // ------------------------------------------------------------
66
+ // 2. Recorridos
67
+ // ------------------------------------------------------------
68
+ (0, vitest_1.describe)('graph-theory / recorridos', () => {
69
+ (0, vitest_1.it)('BFS visita en orden de niveles', () => {
70
+ // Grafo: 0 - 1 - 3
71
+ // | |
72
+ // 2 - 4
73
+ const G = (0, graph_theory_1.makeGraph)();
74
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 1 });
75
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 2 });
76
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 3 });
77
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 4 });
78
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 4 });
79
+ const order = (0, graph_theory_1.bfs)(G, 0);
80
+ (0, vitest_1.expect)(order[0]).toBe(0);
81
+ // Nivel 1 debe ser {1, 2} antes que {3, 4}.
82
+ const idx = new Map(order.map((v, i) => [v, i]));
83
+ (0, vitest_1.expect)(idx.get(1)).toBeLessThan(idx.get(3));
84
+ (0, vitest_1.expect)(idx.get(2)).toBeLessThan(idx.get(3));
85
+ (0, vitest_1.expect)(idx.get(1)).toBeLessThan(idx.get(4));
86
+ });
87
+ (0, vitest_1.it)('DFS recorre en profundidad', () => {
88
+ const G = pathGraph(5);
89
+ const order = (0, graph_theory_1.dfs)(G, 0);
90
+ // Path 0-1-2-3-4: DFS desde 0 debe visitar todos en orden creciente.
91
+ (0, vitest_1.expect)(order).toEqual([0, 1, 2, 3, 4]);
92
+ });
93
+ (0, vitest_1.it)('topologicalSort en DAG válido', () => {
94
+ const G = (0, graph_theory_1.makeGraph)(true);
95
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
96
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 3 });
97
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 4 });
98
+ (0, graph_theory_1.addEdge)(G, { from: 3, to: 4 });
99
+ const order = (0, graph_theory_1.topologicalSort)(G);
100
+ (0, vitest_1.expect)(order).not.toBe('has-cycle');
101
+ if (order === 'has-cycle')
102
+ return;
103
+ const idx = new Map(order.map((v, i) => [v, i]));
104
+ (0, vitest_1.expect)(idx.get(1)).toBeLessThan(idx.get(2));
105
+ (0, vitest_1.expect)(idx.get(1)).toBeLessThan(idx.get(3));
106
+ (0, vitest_1.expect)(idx.get(2)).toBeLessThan(idx.get(4));
107
+ (0, vitest_1.expect)(idx.get(3)).toBeLessThan(idx.get(4));
108
+ });
109
+ (0, vitest_1.it)('topologicalSort detecta ciclo', () => {
110
+ const G = (0, graph_theory_1.makeGraph)(true);
111
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
112
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 3 });
113
+ (0, graph_theory_1.addEdge)(G, { from: 3, to: 1 });
114
+ (0, vitest_1.expect)((0, graph_theory_1.topologicalSort)(G)).toBe('has-cycle');
115
+ });
116
+ });
117
+ // ------------------------------------------------------------
118
+ // 3. Conectividad
119
+ // ------------------------------------------------------------
120
+ (0, vitest_1.describe)('graph-theory / conectividad', () => {
121
+ (0, vitest_1.it)('connectedComponents identifica 2 componentes', () => {
122
+ const G = (0, graph_theory_1.makeGraph)();
123
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
124
+ (0, graph_theory_1.addEdge)(G, { from: 3, to: 4 });
125
+ (0, graph_theory_1.addVertex)(G, 5);
126
+ const comps = (0, graph_theory_1.connectedComponents)(G);
127
+ (0, vitest_1.expect)(comps.length).toBe(3);
128
+ const sizes = comps.map((c) => c.length).sort((a, b) => a - b);
129
+ (0, vitest_1.expect)(sizes).toEqual([1, 2, 2]);
130
+ });
131
+ (0, vitest_1.it)('isConnected en path', () => {
132
+ (0, vitest_1.expect)((0, graph_theory_1.isConnected)(pathGraph(5))).toBe(true);
133
+ });
134
+ (0, vitest_1.it)('SCC de Tarjan con 2 SCC en grafo dirigido', () => {
135
+ // SCC 1: {1, 2, 3} (ciclo) ; SCC 2: {4} ; arista 3 -> 4 no fuerte.
136
+ const G = (0, graph_theory_1.makeGraph)(true);
137
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
138
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 3 });
139
+ (0, graph_theory_1.addEdge)(G, { from: 3, to: 1 });
140
+ (0, graph_theory_1.addEdge)(G, { from: 3, to: 4 });
141
+ const sccs = (0, graph_theory_1.stronglyConnectedComponents)(G);
142
+ (0, vitest_1.expect)(sccs.length).toBe(2);
143
+ const sizes = sccs.map((c) => c.length).sort((a, b) => a - b);
144
+ (0, vitest_1.expect)(sizes).toEqual([1, 3]);
145
+ });
146
+ (0, vitest_1.it)('articulationPoints en cadena lineal', () => {
147
+ // Path 0-1-2-3-4: los puntos de articulación son 1, 2, 3.
148
+ const G = pathGraph(5);
149
+ const arts = (0, graph_theory_1.articulationPoints)(G).sort((a, b) => a - b);
150
+ (0, vitest_1.expect)(arts).toEqual([1, 2, 3]);
151
+ });
152
+ (0, vitest_1.it)('bridges en cadena lineal', () => {
153
+ const G = pathGraph(4);
154
+ const br = (0, graph_theory_1.bridges)(G);
155
+ // Todo edge de un árbol es puente.
156
+ (0, vitest_1.expect)(br.length).toBe(3);
157
+ });
158
+ (0, vitest_1.it)('bridges: ciclo no tiene puentes', () => {
159
+ const G = cycleGraph(5);
160
+ (0, vitest_1.expect)((0, graph_theory_1.bridges)(G).length).toBe(0);
161
+ });
162
+ });
163
+ // ------------------------------------------------------------
164
+ // 4. Caminos mínimos
165
+ // ------------------------------------------------------------
166
+ (0, vitest_1.describe)('graph-theory / caminos mínimos', () => {
167
+ (0, vitest_1.it)('dijkstra en grafo 5-vertex weighted', () => {
168
+ // Grafo clásico:
169
+ // 0 --(7)-- 1 --(1)-- 4
170
+ // |\ |
171
+ // (1)(5) (2)
172
+ // | \ |
173
+ // 2 --(2)- 3
174
+ const G = (0, graph_theory_1.makeGraph)();
175
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 1, weight: 7 });
176
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 2, weight: 1 });
177
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 3, weight: 5 });
178
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 3, weight: 2 });
179
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 4, weight: 1 });
180
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: 2 });
181
+ const { distances } = (0, graph_theory_1.dijkstra)(G, 0);
182
+ (0, vitest_1.expect)(distances.get(0)).toBe(0);
183
+ (0, vitest_1.expect)(distances.get(1)).toBe(5); // 0->2->3->1 = 1+2+2 = 5
184
+ (0, vitest_1.expect)(distances.get(2)).toBe(1);
185
+ (0, vitest_1.expect)(distances.get(3)).toBe(3); // 0->2->3 = 3
186
+ (0, vitest_1.expect)(distances.get(4)).toBe(6); // 0->2->3->1->4 = 6
187
+ });
188
+ (0, vitest_1.it)('dijkstra rechaza pesos negativos', () => {
189
+ const G = (0, graph_theory_1.makeGraph)();
190
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 1, weight: -1 });
191
+ (0, vitest_1.expect)(() => (0, graph_theory_1.dijkstra)(G, 0)).toThrow();
192
+ });
193
+ (0, vitest_1.it)('bellmanFord detecta ciclo negativo', () => {
194
+ const G = (0, graph_theory_1.makeGraph)(true);
195
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2, weight: 1 });
196
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: -3 });
197
+ (0, graph_theory_1.addEdge)(G, { from: 3, to: 1, weight: 1 });
198
+ const r = (0, graph_theory_1.bellmanFord)(G, 1);
199
+ (0, vitest_1.expect)(r.negativeCycle).toBe(true);
200
+ });
201
+ (0, vitest_1.it)('bellmanFord en grafo sin ciclos negativos', () => {
202
+ const G = (0, graph_theory_1.makeGraph)(true);
203
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2, weight: 4 });
204
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 3, weight: 1 });
205
+ (0, graph_theory_1.addEdge)(G, { from: 3, to: 2, weight: 2 });
206
+ const r = (0, graph_theory_1.bellmanFord)(G, 1);
207
+ (0, vitest_1.expect)(r.negativeCycle).toBe(false);
208
+ (0, vitest_1.expect)(r.distances.get(2)).toBe(3); // 1->3->2 = 3
209
+ });
210
+ (0, vitest_1.it)('floydWarshall coincide con dijkstra en pesos positivos', () => {
211
+ const G = (0, graph_theory_1.makeGraph)();
212
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 1, weight: 4 });
213
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 2, weight: 1 });
214
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2, weight: 2 });
215
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 3, weight: 1 });
216
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: 5 });
217
+ const fw = (0, graph_theory_1.floydWarshall)(G);
218
+ const dj = (0, graph_theory_1.dijkstra)(G, 0);
219
+ for (const v of G.vertices) {
220
+ (0, vitest_1.expect)(fw.get(0)?.get(v)).toBe(dj.distances.get(v));
221
+ }
222
+ });
223
+ });
224
+ // ------------------------------------------------------------
225
+ // 5. MST
226
+ // ------------------------------------------------------------
227
+ (0, vitest_1.describe)('graph-theory / MST', () => {
228
+ (0, vitest_1.it)('kruskal MST en grafo simple', () => {
229
+ // Grafo de 4 nodos con pesos:
230
+ // 1-2(1), 2-3(2), 3-4(3), 1-4(10), 1-3(5)
231
+ const G = (0, graph_theory_1.makeGraph)();
232
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2, weight: 1 });
233
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: 2 });
234
+ (0, graph_theory_1.addEdge)(G, { from: 3, to: 4, weight: 3 });
235
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 4, weight: 10 });
236
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 3, weight: 5 });
237
+ const mst = (0, graph_theory_1.kruskal)(G);
238
+ (0, vitest_1.expect)(mst.totalWeight).toBe(6); // 1 + 2 + 3
239
+ (0, vitest_1.expect)(mst.edges.length).toBe(3);
240
+ });
241
+ (0, vitest_1.it)('prim MST coincide con kruskal en weight', () => {
242
+ const G = (0, graph_theory_1.makeGraph)();
243
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 1, weight: 4 });
244
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 2, weight: 3 });
245
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 2, weight: 1 });
246
+ (0, graph_theory_1.addEdge)(G, { from: 1, to: 3, weight: 2 });
247
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: 4 });
248
+ (0, graph_theory_1.addEdge)(G, { from: 3, to: 4, weight: 2 });
249
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 4, weight: 7 });
250
+ const kw = (0, graph_theory_1.kruskal)(G).totalWeight;
251
+ const pw = (0, graph_theory_1.prim)(G).totalWeight;
252
+ (0, vitest_1.expect)(pw).toBe(kw);
253
+ });
254
+ (0, vitest_1.it)('prim en grafo desconectado cubre solo su componente', () => {
255
+ const G = (0, graph_theory_1.makeGraph)();
256
+ (0, graph_theory_1.addEdge)(G, { from: 0, to: 1, weight: 1 });
257
+ (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: 1 });
258
+ const r = (0, graph_theory_1.prim)(G, 0);
259
+ (0, vitest_1.expect)(r.edges.length).toBe(1);
260
+ });
261
+ });
262
+ // ------------------------------------------------------------
263
+ // 6. Bipartite matching
264
+ // ------------------------------------------------------------
265
+ (0, vitest_1.describe)('graph-theory / matching bipartito', () => {
266
+ (0, vitest_1.it)('bipartiteMaximumMatching: 3 + 3 con 4 edges, max 3', () => {
267
+ // Lado izquierdo: L1, L2, L3 ; derecho: R1, R2, R3
268
+ // L1-R1, L1-R2, L2-R2, L3-R3
269
+ const G = (0, graph_theory_1.makeGraph)();
270
+ const left = new Set(['L1', 'L2', 'L3']);
271
+ (0, graph_theory_1.addEdge)(G, { from: 'L1', to: 'R1' });
272
+ (0, graph_theory_1.addEdge)(G, { from: 'L1', to: 'R2' });
273
+ (0, graph_theory_1.addEdge)(G, { from: 'L2', to: 'R2' });
274
+ (0, graph_theory_1.addEdge)(G, { from: 'L3', to: 'R3' });
275
+ const m = (0, graph_theory_1.bipartiteMaximumMatching)(G, left);
276
+ (0, vitest_1.expect)(m.length).toBe(3);
277
+ });
278
+ (0, vitest_1.it)('hopcroftKarp coincide en tamaño con Kuhn', () => {
279
+ const G = (0, graph_theory_1.makeGraph)();
280
+ const left = new Set(['L1', 'L2', 'L3', 'L4']);
281
+ (0, graph_theory_1.addEdge)(G, { from: 'L1', to: 'R1' });
282
+ (0, graph_theory_1.addEdge)(G, { from: 'L1', to: 'R2' });
283
+ (0, graph_theory_1.addEdge)(G, { from: 'L2', to: 'R1' });
284
+ (0, graph_theory_1.addEdge)(G, { from: 'L3', to: 'R2' });
285
+ (0, graph_theory_1.addEdge)(G, { from: 'L3', to: 'R3' });
286
+ (0, graph_theory_1.addEdge)(G, { from: 'L4', to: 'R3' });
287
+ const k = (0, graph_theory_1.bipartiteMaximumMatching)(G, left).length;
288
+ const h = (0, graph_theory_1.hopcroftKarp)(G, left).length;
289
+ (0, vitest_1.expect)(h).toBe(k);
290
+ (0, vitest_1.expect)(h).toBe(3);
291
+ });
292
+ });
293
+ // ------------------------------------------------------------
294
+ // 7. Coloreo
295
+ // ------------------------------------------------------------
296
+ (0, vitest_1.describe)('graph-theory / coloreo', () => {
297
+ (0, vitest_1.it)('chromaticNumber de K4 = 4', () => {
298
+ (0, vitest_1.expect)((0, graph_theory_1.chromaticNumber)(completeGraph(4))).toBe(4);
299
+ });
300
+ (0, vitest_1.it)('chromaticNumber de bipartito completo K_{3,3} = 2', () => {
301
+ const G = (0, graph_theory_1.makeGraph)();
302
+ const left = ['l1', 'l2', 'l3'];
303
+ const right = ['r1', 'r2', 'r3'];
304
+ for (const l of left)
305
+ for (const r of right)
306
+ (0, graph_theory_1.addEdge)(G, { from: l, to: r });
307
+ (0, vitest_1.expect)((0, graph_theory_1.chromaticNumber)(G)).toBe(2);
308
+ });
309
+ (0, vitest_1.it)('chromaticNumber de C5 (impar) = 3', () => {
310
+ (0, vitest_1.expect)((0, graph_theory_1.chromaticNumber)(cycleGraph(5))).toBe(3);
311
+ });
312
+ (0, vitest_1.it)('greedyColoring no asigna mismo color a vecinos', () => {
313
+ const G = completeGraph(5);
314
+ const color = (0, graph_theory_1.greedyColoring)(G);
315
+ for (const e of G.edges) {
316
+ (0, vitest_1.expect)(color.get(e.from)).not.toBe(color.get(e.to));
317
+ }
318
+ });
319
+ });
320
+ // ------------------------------------------------------------
321
+ // 8. Isomorfismo
322
+ // ------------------------------------------------------------
323
+ (0, vitest_1.describe)('graph-theory / isomorfismo', () => {
324
+ (0, vitest_1.it)('dos C5 son isomorfos', () => {
325
+ const G1 = cycleGraph(5);
326
+ const G2 = (0, graph_theory_1.makeGraph)();
327
+ const labels = ['a', 'b', 'c', 'd', 'e'];
328
+ for (const l of labels)
329
+ (0, graph_theory_1.addVertex)(G2, l);
330
+ for (let i = 0; i < labels.length; i++) {
331
+ (0, graph_theory_1.addEdge)(G2, { from: labels[i], to: labels[(i + 1) % labels.length] });
332
+ }
333
+ (0, vitest_1.expect)((0, graph_theory_1.areIsomorphic)(G1, G2)).toBe(true);
334
+ });
335
+ (0, vitest_1.it)('C5 y C6 no son isomorfos', () => {
336
+ (0, vitest_1.expect)((0, graph_theory_1.areIsomorphic)(cycleGraph(5), cycleGraph(6))).toBe(false);
337
+ });
338
+ (0, vitest_1.it)('K4 y C4 no son isomorfos (mismo |V| distinto |E|)', () => {
339
+ (0, vitest_1.expect)((0, graph_theory_1.areIsomorphic)(completeGraph(4), cycleGraph(4))).toBe(false);
340
+ });
341
+ (0, vitest_1.it)('findIsomorphism devuelve mapeo válido', () => {
342
+ const G1 = pathGraph(4);
343
+ const G2 = (0, graph_theory_1.makeGraph)();
344
+ const labels = ['w', 'x', 'y', 'z'];
345
+ for (const l of labels)
346
+ (0, graph_theory_1.addVertex)(G2, l);
347
+ for (let i = 0; i < labels.length - 1; i++) {
348
+ (0, graph_theory_1.addEdge)(G2, { from: labels[i], to: labels[i + 1] });
349
+ }
350
+ const m = (0, graph_theory_1.findIsomorphism)(G1, G2);
351
+ (0, vitest_1.expect)(m).not.toBeNull();
352
+ if (!m)
353
+ return;
354
+ // Verificar que las aristas se preservan.
355
+ for (const e of G1.edges) {
356
+ const f = m.get(e.from);
357
+ const t = m.get(e.to);
358
+ const found = G2.edges.some((e2) => (e2.from === f && e2.to === t) || (e2.from === t && e2.to === f));
359
+ (0, vitest_1.expect)(found).toBe(true);
360
+ }
361
+ });
362
+ });
363
+ //# sourceMappingURL=graph-theory.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"graph-theory.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/graph-theory/graph-theory.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,kEA2ByC;AAEzC,UAAU;AACV,SAAS,SAAS,CAAC,CAAS,EAAE,QAAQ,GAAG,KAAK;IAC5C,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,QAAQ,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9E,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,QAAQ,GAAG,KAAK;IAC7C,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,QAAQ,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IAChF,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,aAAa,CAAC,CAAS;IAC9B,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,KAAK,CAAC,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,+DAA+D;AAC/D,kBAAkB;AAClB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,uBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,gBAAgB;AAChB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,oBAAoB;QACpB,gBAAgB;QAChB,gBAAgB;QAChB,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAA,kBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,4CAA4C;QAC5C,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAU,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,IAAA,kBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,qEAAqE;QACrE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAA,8BAAe,EAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,KAAK,KAAK,WAAW;YAAE,OAAO;QAClC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAU,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,kBAAkB;AAClB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChB,MAAM,KAAK,GAAG,IAAA,kCAAmB,EAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,IAAA,eAAM,EAAC,IAAA,0BAAW,EAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,mEAAmE;QACnE,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAA,0CAA2B,EAAC,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,0DAA0D;QAC1D,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAA,iCAAkB,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC;QACtB,mCAAmC;QACnC,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,qBAAqB;AACrB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,iBAAiB;QACjB,0BAA0B;QAC1B,gBAAgB;QAChB,gBAAgB;QAChB,eAAe;QACf,eAAe;QACf,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,EAAE,SAAS,EAAE,GAAG,IAAA,uBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,yBAAyB;QAC3D,IAAA,eAAM,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;QAChD,IAAA,eAAM,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,oBAAoB;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,uBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,IAAA,4BAAa,EAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,IAAA,uBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,SAAS;AACT,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,8BAA8B;QAC9B,0CAA0C;QAC1C,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY;QAC7C,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QAClC,MAAM,EAAE,GAAG,IAAA,mBAAI,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QAC/B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAA,mBAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,wBAAwB;AACxB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,mDAAmD;QACnD,6BAA6B;QAC7B,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACzC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,uCAAwB,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC/C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,uCAAwB,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;QACnD,MAAM,CAAC,GAAG,IAAA,2BAAY,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;QACvC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,aAAa;AACb,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5E,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,IAAA,6BAAc,EAAC,CAAC,CAAC,CAAC;QAChC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACxB,IAAA,eAAM,EAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,iBAAiB;AACjB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,EAAE,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC/B,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAA,wBAAS,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAA,sBAAO,EAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACxE,CAAC;QACD,IAAA,eAAM,EAAC,IAAA,4BAAa,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,IAAA,eAAM,EAAC,IAAA,4BAAa,EAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,IAAA,eAAM,EAAC,IAAA,4BAAa,EAAC,aAAa,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC/B,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAA,wBAAS,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAA,sBAAO,EAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,CAAC,GAAG,IAAA,8BAAe,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC;YAAE,OAAO;QACf,0CAA0C;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAW,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAW,CAAC;YAChC,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CACzB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CACzE,CAAC;YACF,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
@@ -0,0 +1,2 @@
1
+ export {};
2
+ //# sourceMappingURL=group-presentation.test.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"group-presentation.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/group-presentation/group-presentation.test.ts"],"names":[],"mappings":""}