@stevenvo780/st-lang 4.5.1 → 4.6.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 (465) hide show
  1. package/dist/bdd/index.d.ts +4 -0
  2. package/dist/bdd/index.d.ts.map +1 -0
  3. package/dist/bdd/index.js +29 -0
  4. package/dist/bdd/index.js.map +1 -0
  5. package/dist/bdd/manager.d.ts +122 -0
  6. package/dist/bdd/manager.d.ts.map +1 -0
  7. package/dist/bdd/manager.js +524 -0
  8. package/dist/bdd/manager.js.map +1 -0
  9. package/dist/bdd/types.d.ts +20 -0
  10. package/dist/bdd/types.d.ts.map +1 -0
  11. package/dist/bdd/types.js +28 -0
  12. package/dist/bdd/types.js.map +1 -0
  13. package/dist/categorical/fin-set.d.ts +39 -0
  14. package/dist/categorical/fin-set.d.ts.map +1 -0
  15. package/dist/categorical/fin-set.js +217 -0
  16. package/dist/categorical/fin-set.js.map +1 -0
  17. package/dist/categorical/free.d.ts +23 -0
  18. package/dist/categorical/free.d.ts.map +1 -0
  19. package/dist/categorical/free.js +168 -0
  20. package/dist/categorical/free.js.map +1 -0
  21. package/dist/categorical/functor.d.ts +40 -0
  22. package/dist/categorical/functor.d.ts.map +1 -0
  23. package/dist/categorical/functor.js +139 -0
  24. package/dist/categorical/functor.js.map +1 -0
  25. package/dist/categorical/index.d.ts +11 -0
  26. package/dist/categorical/index.d.ts.map +1 -0
  27. package/dist/categorical/index.js +33 -0
  28. package/dist/categorical/index.js.map +1 -0
  29. package/dist/categorical/limits.d.ts +64 -0
  30. package/dist/categorical/limits.d.ts.map +1 -0
  31. package/dist/categorical/limits.js +248 -0
  32. package/dist/categorical/limits.js.map +1 -0
  33. package/dist/categorical/monoidal.d.ts +14 -0
  34. package/dist/categorical/monoidal.d.ts.map +1 -0
  35. package/dist/categorical/monoidal.js +148 -0
  36. package/dist/categorical/monoidal.js.map +1 -0
  37. package/dist/categorical/poset.d.ts +14 -0
  38. package/dist/categorical/poset.d.ts.map +1 -0
  39. package/dist/categorical/poset.js +115 -0
  40. package/dist/categorical/poset.js.map +1 -0
  41. package/dist/categorical/types.d.ts +111 -0
  42. package/dist/categorical/types.d.ts.map +1 -0
  43. package/dist/categorical/types.js +15 -0
  44. package/dist/categorical/types.js.map +1 -0
  45. package/dist/csp-hoare/analysis.d.ts +51 -0
  46. package/dist/csp-hoare/analysis.d.ts.map +1 -0
  47. package/dist/csp-hoare/analysis.js +317 -0
  48. package/dist/csp-hoare/analysis.js.map +1 -0
  49. package/dist/csp-hoare/examples.d.ts +33 -0
  50. package/dist/csp-hoare/examples.d.ts.map +1 -0
  51. package/dist/csp-hoare/examples.js +108 -0
  52. package/dist/csp-hoare/examples.js.map +1 -0
  53. package/dist/csp-hoare/index.d.ts +6 -0
  54. package/dist/csp-hoare/index.d.ts.map +1 -0
  55. package/dist/csp-hoare/index.js +50 -0
  56. package/dist/csp-hoare/index.js.map +1 -0
  57. package/dist/csp-hoare/semantics.d.ts +49 -0
  58. package/dist/csp-hoare/semantics.d.ts.map +1 -0
  59. package/dist/csp-hoare/semantics.js +494 -0
  60. package/dist/csp-hoare/semantics.js.map +1 -0
  61. package/dist/csp-hoare/types.d.ts +60 -0
  62. package/dist/csp-hoare/types.d.ts.map +1 -0
  63. package/dist/csp-hoare/types.js +31 -0
  64. package/dist/csp-hoare/types.js.map +1 -0
  65. package/dist/game-theory/common-games.d.ts +50 -0
  66. package/dist/game-theory/common-games.d.ts.map +1 -0
  67. package/dist/game-theory/common-games.js +112 -0
  68. package/dist/game-theory/common-games.js.map +1 -0
  69. package/dist/game-theory/dominance.d.ts +26 -0
  70. package/dist/game-theory/dominance.d.ts.map +1 -0
  71. package/dist/game-theory/dominance.js +203 -0
  72. package/dist/game-theory/dominance.js.map +1 -0
  73. package/dist/game-theory/index.d.ts +8 -0
  74. package/dist/game-theory/index.d.ts.map +1 -0
  75. package/dist/game-theory/index.js +47 -0
  76. package/dist/game-theory/index.js.map +1 -0
  77. package/dist/game-theory/lemke-howson.d.ts +3 -0
  78. package/dist/game-theory/lemke-howson.d.ts.map +1 -0
  79. package/dist/game-theory/lemke-howson.js +269 -0
  80. package/dist/game-theory/lemke-howson.js.map +1 -0
  81. package/dist/game-theory/linalg.d.ts +7 -0
  82. package/dist/game-theory/linalg.d.ts.map +1 -0
  83. package/dist/game-theory/linalg.js +69 -0
  84. package/dist/game-theory/linalg.js.map +1 -0
  85. package/dist/game-theory/pure-nash.d.ts +3 -0
  86. package/dist/game-theory/pure-nash.d.ts.map +1 -0
  87. package/dist/game-theory/pure-nash.js +86 -0
  88. package/dist/game-theory/pure-nash.js.map +1 -0
  89. package/dist/game-theory/support-enumeration.d.ts +3 -0
  90. package/dist/game-theory/support-enumeration.d.ts.map +1 -0
  91. package/dist/game-theory/support-enumeration.js +214 -0
  92. package/dist/game-theory/support-enumeration.js.map +1 -0
  93. package/dist/game-theory/types.d.ts +57 -0
  94. package/dist/game-theory/types.d.ts.map +1 -0
  95. package/dist/game-theory/types.js +191 -0
  96. package/dist/game-theory/types.js.map +1 -0
  97. package/dist/hindley-milner/index.d.ts +7 -0
  98. package/dist/hindley-milner/index.d.ts.map +1 -0
  99. package/dist/hindley-milner/index.js +60 -0
  100. package/dist/hindley-milner/index.js.map +1 -0
  101. package/dist/hindley-milner/infer.d.ts +26 -0
  102. package/dist/hindley-milner/infer.d.ts.map +1 -0
  103. package/dist/hindley-milner/infer.js +278 -0
  104. package/dist/hindley-milner/infer.js.map +1 -0
  105. package/dist/hindley-milner/substitution.d.ts +21 -0
  106. package/dist/hindley-milner/substitution.d.ts.map +1 -0
  107. package/dist/hindley-milner/substitution.js +215 -0
  108. package/dist/hindley-milner/substitution.js.map +1 -0
  109. package/dist/hindley-milner/types.d.ts +84 -0
  110. package/dist/hindley-milner/types.d.ts.map +1 -0
  111. package/dist/hindley-milner/types.js +166 -0
  112. package/dist/hindley-milner/types.js.map +1 -0
  113. package/dist/hott/equality.d.ts +4 -0
  114. package/dist/hott/equality.d.ts.map +1 -0
  115. package/dist/hott/equality.js +108 -0
  116. package/dist/hott/equality.js.map +1 -0
  117. package/dist/hott/index.d.ts +13 -0
  118. package/dist/hott/index.d.ts.map +1 -0
  119. package/dist/hott/index.js +77 -0
  120. package/dist/hott/index.js.map +1 -0
  121. package/dist/hott/infer.d.ts +11 -0
  122. package/dist/hott/infer.d.ts.map +1 -0
  123. package/dist/hott/infer.js +465 -0
  124. package/dist/hott/infer.js.map +1 -0
  125. package/dist/hott/normalize.d.ts +5 -0
  126. package/dist/hott/normalize.d.ts.map +1 -0
  127. package/dist/hott/normalize.js +240 -0
  128. package/dist/hott/normalize.js.map +1 -0
  129. package/dist/hott/path-algebra.d.ts +25 -0
  130. package/dist/hott/path-algebra.d.ts.map +1 -0
  131. package/dist/hott/path-algebra.js +67 -0
  132. package/dist/hott/path-algebra.js.map +1 -0
  133. package/dist/hott/substitute.d.ts +3 -0
  134. package/dist/hott/substitute.d.ts.map +1 -0
  135. package/dist/hott/substitute.js +131 -0
  136. package/dist/hott/substitute.js.map +1 -0
  137. package/dist/hott/types.d.ts +126 -0
  138. package/dist/hott/types.d.ts.map +1 -0
  139. package/dist/hott/types.js +346 -0
  140. package/dist/hott/types.js.map +1 -0
  141. package/dist/index.d.ts +16 -1
  142. package/dist/index.d.ts.map +1 -1
  143. package/dist/index.js +83 -3
  144. package/dist/index.js.map +1 -1
  145. package/dist/information-theory/index.d.ts +29 -0
  146. package/dist/information-theory/index.d.ts.map +1 -0
  147. package/dist/information-theory/index.js +323 -0
  148. package/dist/information-theory/index.js.map +1 -0
  149. package/dist/lemma-synthesis/index.d.ts +124 -0
  150. package/dist/lemma-synthesis/index.d.ts.map +1 -0
  151. package/dist/lemma-synthesis/index.js +640 -0
  152. package/dist/lemma-synthesis/index.js.map +1 -0
  153. package/dist/namespaces/logic.d.ts +42 -0
  154. package/dist/namespaces/logic.d.ts.map +1 -0
  155. package/dist/namespaces/logic.js +112 -0
  156. package/dist/namespaces/logic.js.map +1 -0
  157. package/dist/namespaces/proof-systems.d.ts +18 -0
  158. package/dist/namespaces/proof-systems.d.ts.map +1 -0
  159. package/dist/namespaces/proof-systems.js +59 -0
  160. package/dist/namespaces/proof-systems.js.map +1 -0
  161. package/dist/namespaces/reasoning.d.ts +26 -0
  162. package/dist/namespaces/reasoning.d.ts.map +1 -0
  163. package/dist/namespaces/reasoning.js +72 -0
  164. package/dist/namespaces/reasoning.js.map +1 -0
  165. package/dist/namespaces/semantics.d.ts +21 -0
  166. package/dist/namespaces/semantics.d.ts.map +1 -0
  167. package/dist/namespaces/semantics.js +64 -0
  168. package/dist/namespaces/semantics.js.map +1 -0
  169. package/dist/namespaces/solvers.d.ts +22 -0
  170. package/dist/namespaces/solvers.d.ts.map +1 -0
  171. package/dist/namespaces/solvers.js +66 -0
  172. package/dist/namespaces/solvers.js.map +1 -0
  173. package/dist/namespaces/type-theory.d.ts +22 -0
  174. package/dist/namespaces/type-theory.d.ts.map +1 -0
  175. package/dist/namespaces/type-theory.js +65 -0
  176. package/dist/namespaces/type-theory.js.map +1 -0
  177. package/dist/optimization/branch-and-bound.d.ts +11 -0
  178. package/dist/optimization/branch-and-bound.d.ts.map +1 -0
  179. package/dist/optimization/branch-and-bound.js +311 -0
  180. package/dist/optimization/branch-and-bound.js.map +1 -0
  181. package/dist/optimization/index.d.ts +5 -0
  182. package/dist/optimization/index.d.ts.map +1 -0
  183. package/dist/optimization/index.js +20 -0
  184. package/dist/optimization/index.js.map +1 -0
  185. package/dist/optimization/simplex.d.ts +8 -0
  186. package/dist/optimization/simplex.d.ts.map +1 -0
  187. package/dist/optimization/simplex.js +408 -0
  188. package/dist/optimization/simplex.js.map +1 -0
  189. package/dist/optimization/standard-form.d.ts +11 -0
  190. package/dist/optimization/standard-form.d.ts.map +1 -0
  191. package/dist/optimization/standard-form.js +112 -0
  192. package/dist/optimization/standard-form.js.map +1 -0
  193. package/dist/optimization/types.d.ts +44 -0
  194. package/dist/optimization/types.d.ts.map +1 -0
  195. package/dist/optimization/types.js +15 -0
  196. package/dist/optimization/types.js.map +1 -0
  197. package/dist/profiles/hol/connectives.d.ts +46 -0
  198. package/dist/profiles/hol/connectives.d.ts.map +1 -0
  199. package/dist/profiles/hol/connectives.js +104 -0
  200. package/dist/profiles/hol/connectives.js.map +1 -0
  201. package/dist/profiles/hol/index.d.ts +7 -0
  202. package/dist/profiles/hol/index.d.ts.map +1 -0
  203. package/dist/profiles/hol/index.js +77 -0
  204. package/dist/profiles/hol/index.js.map +1 -0
  205. package/dist/profiles/hol/rules.d.ts +31 -0
  206. package/dist/profiles/hol/rules.d.ts.map +1 -0
  207. package/dist/profiles/hol/rules.js +258 -0
  208. package/dist/profiles/hol/rules.js.map +1 -0
  209. package/dist/profiles/hol/term.d.ts +52 -0
  210. package/dist/profiles/hol/term.d.ts.map +1 -0
  211. package/dist/profiles/hol/term.js +345 -0
  212. package/dist/profiles/hol/term.js.map +1 -0
  213. package/dist/profiles/hol/type-system.d.ts +38 -0
  214. package/dist/profiles/hol/type-system.d.ts.map +1 -0
  215. package/dist/profiles/hol/type-system.js +133 -0
  216. package/dist/profiles/hol/type-system.js.map +1 -0
  217. package/dist/profiles/hol/types.d.ts +59 -0
  218. package/dist/profiles/hol/types.d.ts.map +1 -0
  219. package/dist/profiles/hol/types.js +26 -0
  220. package/dist/profiles/hol/types.js.map +1 -0
  221. package/dist/smt-lib/ast.d.ts +138 -0
  222. package/dist/smt-lib/ast.d.ts.map +1 -0
  223. package/dist/smt-lib/ast.js +73 -0
  224. package/dist/smt-lib/ast.js.map +1 -0
  225. package/dist/smt-lib/emitter.d.ts +12 -0
  226. package/dist/smt-lib/emitter.d.ts.map +1 -0
  227. package/dist/smt-lib/emitter.js +174 -0
  228. package/dist/smt-lib/emitter.js.map +1 -0
  229. package/dist/smt-lib/index.d.ts +6 -0
  230. package/dist/smt-lib/index.d.ts.map +1 -0
  231. package/dist/smt-lib/index.js +31 -0
  232. package/dist/smt-lib/index.js.map +1 -0
  233. package/dist/smt-lib/parser.d.ts +13 -0
  234. package/dist/smt-lib/parser.d.ts.map +1 -0
  235. package/dist/smt-lib/parser.js +614 -0
  236. package/dist/smt-lib/parser.js.map +1 -0
  237. package/dist/smt-lib/tokenizer.d.ts +16 -0
  238. package/dist/smt-lib/tokenizer.d.ts.map +1 -0
  239. package/dist/smt-lib/tokenizer.js +234 -0
  240. package/dist/smt-lib/tokenizer.js.map +1 -0
  241. package/dist/tactic-dsl/combinators.d.ts +6 -0
  242. package/dist/tactic-dsl/combinators.d.ts.map +1 -0
  243. package/dist/tactic-dsl/combinators.js +98 -0
  244. package/dist/tactic-dsl/combinators.js.map +1 -0
  245. package/dist/tactic-dsl/index.d.ts +39 -0
  246. package/dist/tactic-dsl/index.d.ts.map +1 -0
  247. package/dist/tactic-dsl/index.js +162 -0
  248. package/dist/tactic-dsl/index.js.map +1 -0
  249. package/dist/tactic-dsl/tactics.d.ts +21 -0
  250. package/dist/tactic-dsl/tactics.d.ts.map +1 -0
  251. package/dist/tactic-dsl/tactics.js +536 -0
  252. package/dist/tactic-dsl/tactics.js.map +1 -0
  253. package/dist/tactic-dsl/types.d.ts +54 -0
  254. package/dist/tactic-dsl/types.d.ts.map +1 -0
  255. package/dist/tactic-dsl/types.js +226 -0
  256. package/dist/tactic-dsl/types.js.map +1 -0
  257. package/dist/tests/api/namespaces.test.d.ts +9 -0
  258. package/dist/tests/api/namespaces.test.d.ts.map +1 -0
  259. package/dist/tests/api/namespaces.test.js +218 -0
  260. package/dist/tests/api/namespaces.test.js.map +1 -0
  261. package/dist/tests/bdd/manager.test.d.ts +2 -0
  262. package/dist/tests/bdd/manager.test.d.ts.map +1 -0
  263. package/dist/tests/bdd/manager.test.js +472 -0
  264. package/dist/tests/bdd/manager.test.js.map +1 -0
  265. package/dist/tests/categorical/categorical.test.d.ts +2 -0
  266. package/dist/tests/categorical/categorical.test.d.ts.map +1 -0
  267. package/dist/tests/categorical/categorical.test.js +300 -0
  268. package/dist/tests/categorical/categorical.test.js.map +1 -0
  269. package/dist/tests/csp-hoare/csp-hoare.test.d.ts +2 -0
  270. package/dist/tests/csp-hoare/csp-hoare.test.d.ts.map +1 -0
  271. package/dist/tests/csp-hoare/csp-hoare.test.js +313 -0
  272. package/dist/tests/csp-hoare/csp-hoare.test.js.map +1 -0
  273. package/dist/tests/game-theory/game-theory.test.d.ts +2 -0
  274. package/dist/tests/game-theory/game-theory.test.d.ts.map +1 -0
  275. package/dist/tests/game-theory/game-theory.test.js +252 -0
  276. package/dist/tests/game-theory/game-theory.test.js.map +1 -0
  277. package/dist/tests/hindley-milner/hindley-milner.test.d.ts +2 -0
  278. package/dist/tests/hindley-milner/hindley-milner.test.d.ts.map +1 -0
  279. package/dist/tests/hindley-milner/hindley-milner.test.js +327 -0
  280. package/dist/tests/hindley-milner/hindley-milner.test.js.map +1 -0
  281. package/dist/tests/hol/hol.test.d.ts +2 -0
  282. package/dist/tests/hol/hol.test.d.ts.map +1 -0
  283. package/dist/tests/hol/hol.test.js +340 -0
  284. package/dist/tests/hol/hol.test.js.map +1 -0
  285. package/dist/tests/hott/hott.test.d.ts +2 -0
  286. package/dist/tests/hott/hott.test.d.ts.map +1 -0
  287. package/dist/tests/hott/hott.test.js +271 -0
  288. package/dist/tests/hott/hott.test.js.map +1 -0
  289. package/dist/tests/information-theory/information-theory.test.d.ts +2 -0
  290. package/dist/tests/information-theory/information-theory.test.d.ts.map +1 -0
  291. package/dist/tests/information-theory/information-theory.test.js +291 -0
  292. package/dist/tests/information-theory/information-theory.test.js.map +1 -0
  293. package/dist/tests/lemma-synthesis/lemma-synthesis.test.d.ts +2 -0
  294. package/dist/tests/lemma-synthesis/lemma-synthesis.test.d.ts.map +1 -0
  295. package/dist/tests/lemma-synthesis/lemma-synthesis.test.js +460 -0
  296. package/dist/tests/lemma-synthesis/lemma-synthesis.test.js.map +1 -0
  297. package/dist/tests/optimization/ilp.test.d.ts +2 -0
  298. package/dist/tests/optimization/ilp.test.d.ts.map +1 -0
  299. package/dist/tests/optimization/ilp.test.js +204 -0
  300. package/dist/tests/optimization/ilp.test.js.map +1 -0
  301. package/dist/tests/optimization/lp.test.d.ts +2 -0
  302. package/dist/tests/optimization/lp.test.d.ts.map +1 -0
  303. package/dist/tests/optimization/lp.test.js +224 -0
  304. package/dist/tests/optimization/lp.test.js.map +1 -0
  305. package/dist/tests/properties/agm.property.test.d.ts +2 -0
  306. package/dist/tests/properties/agm.property.test.d.ts.map +1 -0
  307. package/dist/tests/properties/agm.property.test.js +75 -0
  308. package/dist/tests/properties/agm.property.test.js.map +1 -0
  309. package/dist/tests/properties/anti-unification.property.test.d.ts +2 -0
  310. package/dist/tests/properties/anti-unification.property.test.d.ts.map +1 -0
  311. package/dist/tests/properties/anti-unification.property.test.js +43 -0
  312. package/dist/tests/properties/anti-unification.property.test.js.map +1 -0
  313. package/dist/tests/properties/argumentation.property.test.d.ts +2 -0
  314. package/dist/tests/properties/argumentation.property.test.d.ts.map +1 -0
  315. package/dist/tests/properties/argumentation.property.test.js +51 -0
  316. package/dist/tests/properties/argumentation.property.test.js.map +1 -0
  317. package/dist/tests/properties/bayesian.property.test.d.ts +2 -0
  318. package/dist/tests/properties/bayesian.property.test.d.ts.map +1 -0
  319. package/dist/tests/properties/bayesian.property.test.js +32 -0
  320. package/dist/tests/properties/bayesian.property.test.js.map +1 -0
  321. package/dist/tests/properties/bisimulation.property.test.d.ts +2 -0
  322. package/dist/tests/properties/bisimulation.property.test.d.ts.map +1 -0
  323. package/dist/tests/properties/bisimulation.property.test.js +50 -0
  324. package/dist/tests/properties/bisimulation.property.test.js.map +1 -0
  325. package/dist/tests/properties/cdcl.property.test.d.ts +2 -0
  326. package/dist/tests/properties/cdcl.property.test.d.ts.map +1 -0
  327. package/dist/tests/properties/cdcl.property.test.js +70 -0
  328. package/dist/tests/properties/cdcl.property.test.js.map +1 -0
  329. package/dist/tests/properties/coinduction.property.test.d.ts +2 -0
  330. package/dist/tests/properties/coinduction.property.test.d.ts.map +1 -0
  331. package/dist/tests/properties/coinduction.property.test.js +34 -0
  332. package/dist/tests/properties/coinduction.property.test.js.map +1 -0
  333. package/dist/tests/properties/constructive-reals.property.test.d.ts +2 -0
  334. package/dist/tests/properties/constructive-reals.property.test.d.ts.map +1 -0
  335. package/dist/tests/properties/constructive-reals.property.test.js +59 -0
  336. package/dist/tests/properties/constructive-reals.property.test.js.map +1 -0
  337. package/dist/tests/properties/csp.property.test.d.ts +2 -0
  338. package/dist/tests/properties/csp.property.test.d.ts.map +1 -0
  339. package/dist/tests/properties/csp.property.test.js +58 -0
  340. package/dist/tests/properties/csp.property.test.js.map +1 -0
  341. package/dist/tests/properties/generators.d.ts +78 -0
  342. package/dist/tests/properties/generators.d.ts.map +1 -0
  343. package/dist/tests/properties/generators.js +348 -0
  344. package/dist/tests/properties/generators.js.map +1 -0
  345. package/dist/tests/properties/ho-unify.property.test.d.ts +2 -0
  346. package/dist/tests/properties/ho-unify.property.test.d.ts.map +1 -0
  347. package/dist/tests/properties/ho-unify.property.test.js +46 -0
  348. package/dist/tests/properties/ho-unify.property.test.js.map +1 -0
  349. package/dist/tests/properties/hyperreal.property.test.d.ts +2 -0
  350. package/dist/tests/properties/hyperreal.property.test.d.ts.map +1 -0
  351. package/dist/tests/properties/hyperreal.property.test.js +33 -0
  352. package/dist/tests/properties/hyperreal.property.test.js.map +1 -0
  353. package/dist/tests/properties/intuit-nj.property.test.d.ts +2 -0
  354. package/dist/tests/properties/intuit-nj.property.test.d.ts.map +1 -0
  355. package/dist/tests/properties/intuit-nj.property.test.js +57 -0
  356. package/dist/tests/properties/intuit-nj.property.test.js.map +1 -0
  357. package/dist/tests/properties/lambda-calc.property.test.d.ts +2 -0
  358. package/dist/tests/properties/lambda-calc.property.test.d.ts.map +1 -0
  359. package/dist/tests/properties/lambda-calc.property.test.js +35 -0
  360. package/dist/tests/properties/lambda-calc.property.test.js.map +1 -0
  361. package/dist/tests/properties/mln.property.test.d.ts +2 -0
  362. package/dist/tests/properties/mln.property.test.d.ts.map +1 -0
  363. package/dist/tests/properties/mln.property.test.js +41 -0
  364. package/dist/tests/properties/mln.property.test.js.map +1 -0
  365. package/dist/tests/properties/mltt.property.test.d.ts +2 -0
  366. package/dist/tests/properties/mltt.property.test.d.ts.map +1 -0
  367. package/dist/tests/properties/mltt.property.test.js +33 -0
  368. package/dist/tests/properties/mltt.property.test.js.map +1 -0
  369. package/dist/tests/properties/nbe.property.test.d.ts +2 -0
  370. package/dist/tests/properties/nbe.property.test.d.ts.map +1 -0
  371. package/dist/tests/properties/nbe.property.test.js +44 -0
  372. package/dist/tests/properties/nbe.property.test.js.map +1 -0
  373. package/dist/tests/properties/planning.property.test.d.ts +2 -0
  374. package/dist/tests/properties/planning.property.test.d.ts.map +1 -0
  375. package/dist/tests/properties/planning.property.test.js +51 -0
  376. package/dist/tests/properties/planning.property.test.js.map +1 -0
  377. package/dist/tests/properties/profile-bridge.property.test.d.ts +2 -0
  378. package/dist/tests/properties/profile-bridge.property.test.d.ts.map +1 -0
  379. package/dist/tests/properties/profile-bridge.property.test.js +71 -0
  380. package/dist/tests/properties/profile-bridge.property.test.js.map +1 -0
  381. package/dist/tests/properties/refinement-types.property.test.d.ts +2 -0
  382. package/dist/tests/properties/refinement-types.property.test.d.ts.map +1 -0
  383. package/dist/tests/properties/refinement-types.property.test.js +37 -0
  384. package/dist/tests/properties/refinement-types.property.test.js.map +1 -0
  385. package/dist/tests/properties/sequent-g3.property.test.d.ts +2 -0
  386. package/dist/tests/properties/sequent-g3.property.test.d.ts.map +1 -0
  387. package/dist/tests/properties/sequent-g3.property.test.js +34 -0
  388. package/dist/tests/properties/sequent-g3.property.test.js.map +1 -0
  389. package/dist/tests/properties/symbolic-diff.property.test.d.ts +2 -0
  390. package/dist/tests/properties/symbolic-diff.property.test.d.ts.map +1 -0
  391. package/dist/tests/properties/symbolic-diff.property.test.js +49 -0
  392. package/dist/tests/properties/symbolic-diff.property.test.js.map +1 -0
  393. package/dist/tests/properties/system-f.property.test.d.ts +2 -0
  394. package/dist/tests/properties/system-f.property.test.d.ts.map +1 -0
  395. package/dist/tests/properties/system-f.property.test.js +37 -0
  396. package/dist/tests/properties/system-f.property.test.js.map +1 -0
  397. package/dist/tests/properties/theorem-cache.property.test.d.ts +2 -0
  398. package/dist/tests/properties/theorem-cache.property.test.d.ts.map +1 -0
  399. package/dist/tests/properties/theorem-cache.property.test.js +38 -0
  400. package/dist/tests/properties/theorem-cache.property.test.js.map +1 -0
  401. package/dist/tests/properties/trs.property.test.d.ts +2 -0
  402. package/dist/tests/properties/trs.property.test.d.ts.map +1 -0
  403. package/dist/tests/properties/trs.property.test.js +34 -0
  404. package/dist/tests/properties/trs.property.test.js.map +1 -0
  405. package/dist/tests/properties/unification.property.test.d.ts +2 -0
  406. package/dist/tests/properties/unification.property.test.d.ts.map +1 -0
  407. package/dist/tests/properties/unification.property.test.js +42 -0
  408. package/dist/tests/properties/unification.property.test.js.map +1 -0
  409. package/dist/tests/smt-lib/emitter.test.d.ts +2 -0
  410. package/dist/tests/smt-lib/emitter.test.d.ts.map +1 -0
  411. package/dist/tests/smt-lib/emitter.test.js +155 -0
  412. package/dist/tests/smt-lib/emitter.test.js.map +1 -0
  413. package/dist/tests/smt-lib/parser.test.d.ts +2 -0
  414. package/dist/tests/smt-lib/parser.test.d.ts.map +1 -0
  415. package/dist/tests/smt-lib/parser.test.js +164 -0
  416. package/dist/tests/smt-lib/parser.test.js.map +1 -0
  417. package/dist/tests/smt-lib/tokenizer.test.d.ts +2 -0
  418. package/dist/tests/smt-lib/tokenizer.test.d.ts.map +1 -0
  419. package/dist/tests/smt-lib/tokenizer.test.js +59 -0
  420. package/dist/tests/smt-lib/tokenizer.test.js.map +1 -0
  421. package/dist/tests/tactic-dsl/tactic-dsl.test.d.ts +2 -0
  422. package/dist/tests/tactic-dsl/tactic-dsl.test.d.ts.map +1 -0
  423. package/dist/tests/tactic-dsl/tactic-dsl.test.js +259 -0
  424. package/dist/tests/tactic-dsl/tactic-dsl.test.js.map +1 -0
  425. package/dist/tests/tptp/bridge.test.d.ts +2 -0
  426. package/dist/tests/tptp/bridge.test.d.ts.map +1 -0
  427. package/dist/tests/tptp/bridge.test.js +154 -0
  428. package/dist/tests/tptp/bridge.test.js.map +1 -0
  429. package/dist/tests/tptp/emitter.test.d.ts +2 -0
  430. package/dist/tests/tptp/emitter.test.d.ts.map +1 -0
  431. package/dist/tests/tptp/emitter.test.js +128 -0
  432. package/dist/tests/tptp/emitter.test.js.map +1 -0
  433. package/dist/tests/tptp/parser.test.d.ts +2 -0
  434. package/dist/tests/tptp/parser.test.d.ts.map +1 -0
  435. package/dist/tests/tptp/parser.test.js +192 -0
  436. package/dist/tests/tptp/parser.test.js.map +1 -0
  437. package/dist/tests/tptp/tokenizer.test.d.ts +2 -0
  438. package/dist/tests/tptp/tokenizer.test.d.ts.map +1 -0
  439. package/dist/tests/tptp/tokenizer.test.js +60 -0
  440. package/dist/tests/tptp/tokenizer.test.js.map +1 -0
  441. package/dist/tptp/ast.d.ts +73 -0
  442. package/dist/tptp/ast.d.ts.map +1 -0
  443. package/dist/tptp/ast.js +35 -0
  444. package/dist/tptp/ast.js.map +1 -0
  445. package/dist/tptp/bridge.d.ts +14 -0
  446. package/dist/tptp/bridge.d.ts.map +1 -0
  447. package/dist/tptp/bridge.js +146 -0
  448. package/dist/tptp/bridge.js.map +1 -0
  449. package/dist/tptp/emitter.d.ts +5 -0
  450. package/dist/tptp/emitter.d.ts.map +1 -0
  451. package/dist/tptp/emitter.js +103 -0
  452. package/dist/tptp/emitter.js.map +1 -0
  453. package/dist/tptp/index.d.ts +7 -0
  454. package/dist/tptp/index.d.ts.map +1 -0
  455. package/dist/tptp/index.js +31 -0
  456. package/dist/tptp/index.js.map +1 -0
  457. package/dist/tptp/parser.d.ts +23 -0
  458. package/dist/tptp/parser.d.ts.map +1 -0
  459. package/dist/tptp/parser.js +440 -0
  460. package/dist/tptp/parser.js.map +1 -0
  461. package/dist/tptp/tokenizer.d.ts +14 -0
  462. package/dist/tptp/tokenizer.d.ts.map +1 -0
  463. package/dist/tptp/tokenizer.js +264 -0
  464. package/dist/tptp/tokenizer.js.map +1 -0
  465. package/package.json +5 -1
@@ -0,0 +1,313 @@
1
+ "use strict";
2
+ // ============================================================
3
+ // CSP Hoare — Tests de semántica operacional + trazas + failures
4
+ // ============================================================
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ const vitest_1 = require("vitest");
7
+ const csp_hoare_1 = require("../../csp-hoare");
8
+ // ── Helpers ──────────────────────────────────────────────────
9
+ function tracesAsStrings(t) {
10
+ return t.map((tr) => tr.join(','));
11
+ }
12
+ // ── 1. Procesos triviales ────────────────────────────────────
13
+ (0, vitest_1.describe)('CSP Hoare — STOP / SKIP', () => {
14
+ (0, vitest_1.it)('STOP está en deadlock y no ofrece eventos', () => {
15
+ (0, vitest_1.expect)((0, csp_hoare_1.isDeadlocked)(csp_hoare_1.STOP)).toBe(true);
16
+ (0, vitest_1.expect)((0, csp_hoare_1.nextEvents)(csp_hoare_1.STOP).size).toBe(0);
17
+ (0, vitest_1.expect)((0, csp_hoare_1.step)(csp_hoare_1.STOP, 'a')).toBeNull();
18
+ });
19
+ (0, vitest_1.it)('SKIP ofrece el tick ✓ y termina', () => {
20
+ (0, vitest_1.expect)((0, csp_hoare_1.nextEvents)(csp_hoare_1.SKIP).has(csp_hoare_1.TICK)).toBe(true);
21
+ (0, vitest_1.expect)((0, csp_hoare_1.step)(csp_hoare_1.SKIP, csp_hoare_1.TICK)).not.toBeNull();
22
+ (0, vitest_1.expect)((0, csp_hoare_1.isDeadlocked)(csp_hoare_1.SKIP)).toBe(false);
23
+ });
24
+ (0, vitest_1.it)('traces(STOP) = [[]] (solo traza vacía)', () => {
25
+ const ts = (0, csp_hoare_1.traces)(csp_hoare_1.STOP, 5);
26
+ (0, vitest_1.expect)(ts.length).toBe(1);
27
+ (0, vitest_1.expect)(ts[0]).toEqual([]);
28
+ });
29
+ });
30
+ // ── 2. Prefijo ───────────────────────────────────────────────
31
+ (0, vitest_1.describe)('CSP Hoare — Prefijo a → P', () => {
32
+ (0, vitest_1.it)('a → STOP tiene trazas [[], [a]]', () => {
33
+ const p = (0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP);
34
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(p, 5));
35
+ (0, vitest_1.expect)(ts).toContain('');
36
+ (0, vitest_1.expect)(ts).toContain('a');
37
+ (0, vitest_1.expect)(ts.length).toBe(2);
38
+ });
39
+ (0, vitest_1.it)('a → b → STOP da exactamente las trazas vacía, [a], [a,b]', () => {
40
+ const p = (0, csp_hoare_1.prefix)('a', (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
41
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(p, 5));
42
+ (0, vitest_1.expect)(ts.sort()).toEqual(['', 'a', 'a,b']);
43
+ });
44
+ (0, vitest_1.it)('step(a → P, a) = P; step(a → P, b) = null', () => {
45
+ const cont = (0, csp_hoare_1.prefix)('x', csp_hoare_1.STOP);
46
+ const p = (0, csp_hoare_1.prefix)('a', cont);
47
+ (0, vitest_1.expect)((0, csp_hoare_1.step)(p, 'a')).toEqual(cont);
48
+ (0, vitest_1.expect)((0, csp_hoare_1.step)(p, 'b')).toBeNull();
49
+ });
50
+ });
51
+ // ── 3. Elección externa □ ────────────────────────────────────
52
+ (0, vitest_1.describe)('CSP Hoare — Elección externa □', () => {
53
+ (0, vitest_1.it)('(a → STOP) □ (b → STOP) ofrece tanto a como b', () => {
54
+ const p = (0, csp_hoare_1.choice)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
55
+ const init = (0, csp_hoare_1.nextEvents)(p);
56
+ (0, vitest_1.expect)(init.has('a')).toBe(true);
57
+ (0, vitest_1.expect)(init.has('b')).toBe(true);
58
+ });
59
+ (0, vitest_1.it)('trazas de (a → STOP) □ (b → STOP) son {[], [a], [b]}', () => {
60
+ const p = (0, csp_hoare_1.choice)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
61
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(p, 5));
62
+ (0, vitest_1.expect)(ts.sort()).toEqual(['', 'a', 'b']);
63
+ });
64
+ });
65
+ // ── 4. Elección interna ⊓ ────────────────────────────────────
66
+ (0, vitest_1.describe)('CSP Hoare — Elección interna ⊓', () => {
67
+ (0, vitest_1.it)('(a → STOP) ⊓ (b → STOP) tiene refusal {b} en una resolución y {a} en otra', () => {
68
+ const p = (0, csp_hoare_1.internal)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
69
+ const fs = (0, csp_hoare_1.failures)(p, 1);
70
+ // Hay al menos un failure con traza vacía donde se rehúsa `a`,
71
+ // y otro donde se rehúsa `b` (porque la rama interna elegida fijó la opción).
72
+ const empties = fs.filter((f) => f.trace.length === 0);
73
+ const refusedA = empties.some((f) => f.refusal.has('a'));
74
+ const refusedB = empties.some((f) => f.refusal.has('b'));
75
+ (0, vitest_1.expect)(refusedA).toBe(true);
76
+ (0, vitest_1.expect)(refusedB).toBe(true);
77
+ });
78
+ (0, vitest_1.it)('externa (a □ b) NUNCA rehúsa a ni b en la traza vacía', () => {
79
+ const p = (0, csp_hoare_1.choice)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
80
+ const fs = (0, csp_hoare_1.failures)(p, 1);
81
+ const empties = fs.filter((f) => f.trace.length === 0);
82
+ for (const f of empties) {
83
+ (0, vitest_1.expect)(f.refusal.has('a')).toBe(false);
84
+ (0, vitest_1.expect)(f.refusal.has('b')).toBe(false);
85
+ }
86
+ });
87
+ });
88
+ // ── 5. Máquina expendedora ───────────────────────────────────
89
+ (0, vitest_1.describe)('CSP Hoare — Vending machine', () => {
90
+ (0, vitest_1.it)('vendingMachine ofrece coin como único evento inicial', () => {
91
+ const vm = (0, csp_hoare_1.vendingMachine)();
92
+ const init = (0, csp_hoare_1.nextEvents)(vm);
93
+ (0, vitest_1.expect)(init.has('coin')).toBe(true);
94
+ (0, vitest_1.expect)(init.size).toBe(1);
95
+ });
96
+ (0, vitest_1.it)('vendingMachine produce trazas [coin, tea] y [coin, coffee]', () => {
97
+ const vm = (0, csp_hoare_1.vendingMachine)();
98
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(vm, 5));
99
+ (0, vitest_1.expect)(ts).toContain('coin,tea');
100
+ (0, vitest_1.expect)(ts).toContain('coin,coffee');
101
+ });
102
+ (0, vitest_1.it)('vendingMachineLoop tiene comportamiento cíclico (acepta secuencias largas)', () => {
103
+ const vm = (0, csp_hoare_1.vendingMachineLoop)();
104
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(vm, 6));
105
+ // Tras coin/tea o coin/coffee, vuelve y acepta otro coin.
106
+ (0, vitest_1.expect)(ts.some((s) => s.startsWith('coin,tea,coin'))).toBe(true);
107
+ (0, vitest_1.expect)(ts.some((s) => s.startsWith('coin,coffee,coin'))).toBe(true);
108
+ });
109
+ });
110
+ // ── 6. Entrelazado ||| y paralelo |[A]| ──────────────────────
111
+ (0, vitest_1.describe)('CSP Hoare — Paralelo / interleave', () => {
112
+ (0, vitest_1.it)('(a → STOP) ||| (b → STOP): traces [a,b] y [b,a]', () => {
113
+ const p = (0, csp_hoare_1.interleave)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
114
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(p, 4));
115
+ (0, vitest_1.expect)(ts).toContain('a,b');
116
+ (0, vitest_1.expect)(ts).toContain('b,a');
117
+ });
118
+ (0, vitest_1.it)('(a → STOP) |[{a}]| (a → STOP): sincroniza, traces incluyen [a]', () => {
119
+ const p = (0, csp_hoare_1.parallel)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), ['a']);
120
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(p, 4));
121
+ (0, vitest_1.expect)(ts).toContain('a');
122
+ // No hay [a,a] porque ambos lados solo ofrecen `a` una vez.
123
+ (0, vitest_1.expect)(ts).not.toContain('a,a');
124
+ });
125
+ (0, vitest_1.it)('(a → STOP) |[{a}]| (b → STOP) DEADLOCKS: a requiere ambos, b solo izq', () => {
126
+ // Como `a` solo está en el izq y está en el alfabeto sync, el derecho
127
+ // debe ofrecerlo también — pero no lo hace. Y `b` no está sincronizado,
128
+ // así que el derecho sí puede hacer su b.
129
+ const p = (0, csp_hoare_1.parallel)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP), ['a']);
130
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(p, 4));
131
+ // Solo trazas: [] y [b] (porque a está bloqueado).
132
+ (0, vitest_1.expect)(ts).toContain('b');
133
+ (0, vitest_1.expect)(ts).not.toContain('a');
134
+ });
135
+ });
136
+ // ── 7. Composición secuencial ──────────────────────────────-
137
+ (0, vitest_1.describe)('CSP Hoare — Composición secuencial ;', () => {
138
+ (0, vitest_1.it)('SKIP ; (a → STOP) ≡ a → STOP en trazas', () => {
139
+ const lhs = (0, csp_hoare_1.sequence)(csp_hoare_1.SKIP, (0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP));
140
+ const rhs = (0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP);
141
+ const tsLhs = tracesAsStrings((0, csp_hoare_1.traces)(lhs, 4)).sort();
142
+ const tsRhs = tracesAsStrings((0, csp_hoare_1.traces)(rhs, 4)).sort();
143
+ (0, vitest_1.expect)(tsLhs).toEqual(tsRhs);
144
+ });
145
+ (0, vitest_1.it)('(a → SKIP) ; (b → STOP) tiene la traza [a, b]', () => {
146
+ const p = (0, csp_hoare_1.sequence)((0, csp_hoare_1.prefix)('a', csp_hoare_1.SKIP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
147
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(p, 4));
148
+ (0, vitest_1.expect)(ts).toContain('a,b');
149
+ });
150
+ });
151
+ // ── 8. Hide \ A ──────────────────────────────────────────────
152
+ (0, vitest_1.describe)('CSP Hoare — Ocultación \\', () => {
153
+ (0, vitest_1.it)('(a → b → STOP) \\ {a} ≡ b → STOP en trazas', () => {
154
+ const p = (0, csp_hoare_1.hide)((0, csp_hoare_1.prefix)('a', (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP)), ['a']);
155
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(p, 4)).sort();
156
+ // a queda oculto (τ silencioso), así que solo observamos `b`.
157
+ (0, vitest_1.expect)(ts).toEqual(['', 'b']);
158
+ });
159
+ (0, vitest_1.it)('hide no introduce eventos nuevos: alphabet shrink', () => {
160
+ const inner = (0, csp_hoare_1.prefix)('a', (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
161
+ const p = (0, csp_hoare_1.hide)(inner, ['a']);
162
+ const alpha = (0, csp_hoare_1.alphabet)(p);
163
+ (0, vitest_1.expect)(alpha.has('a')).toBe(false);
164
+ (0, vitest_1.expect)(alpha.has('b')).toBe(true);
165
+ });
166
+ });
167
+ // ── 9. Renaming P[f] ────────────────────────────────────────-
168
+ (0, vitest_1.describe)('CSP Hoare — Renaming', () => {
169
+ (0, vitest_1.it)('rename a↦x en (a → STOP) produce trazas [[], [x]]', () => {
170
+ const m = new Map([['a', 'x']]);
171
+ const p = (0, csp_hoare_1.rename)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), m);
172
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(p, 3)).sort();
173
+ (0, vitest_1.expect)(ts).toEqual(['', 'x']);
174
+ });
175
+ });
176
+ // ── 10. Refinamiento ────────────────────────────────────────-
177
+ (0, vitest_1.describe)('CSP Hoare — Refinement', () => {
178
+ (0, vitest_1.it)('STOP ⊑_T (a → STOP)? NO: a → STOP tiene traza [a] que STOP no acepta', () => {
179
+ // STOP solo tiene la traza vacía. (a → STOP) tiene también [a].
180
+ // En refinesTraces(spec, impl): impl_traces ⊆ spec_traces.
181
+ // STOP es el spec más restrictivo (solo []), así que (a → STOP) NO lo refina.
182
+ (0, vitest_1.expect)((0, csp_hoare_1.refinesTraces)(csp_hoare_1.STOP, (0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP))).toBe(false);
183
+ });
184
+ (0, vitest_1.it)('(a → STOP) ⊑_T STOP: STOP refina trivialmente todo (en trazas)', () => {
185
+ // Cualquier traza de STOP (solo []) está en (a → STOP).
186
+ (0, vitest_1.expect)((0, csp_hoare_1.refinesTraces)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), csp_hoare_1.STOP)).toBe(true);
187
+ });
188
+ (0, vitest_1.it)('Externa □ ⊑_F Interna ⊓ (con mismas trazas)', () => {
189
+ // El cliente prefiere la externa: si la interna refina la externa en
190
+ // failures, está bien — interna es "menos determinista", externa "más"
191
+ // → refinesFailures(externa_como_spec, interna_como_impl) DEBERÍA fallar
192
+ // porque interna agrega refusals.
193
+ // Es decir: la versión interna NO refina a la externa.
194
+ const ext = (0, csp_hoare_1.choice)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
195
+ const int = (0, csp_hoare_1.internal)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
196
+ (0, vitest_1.expect)((0, csp_hoare_1.refinesFailures)(ext, int, 2)).toBe(false);
197
+ });
198
+ (0, vitest_1.it)('Externa ⊑_F Externa (auto-refinamiento)', () => {
199
+ const p = (0, csp_hoare_1.choice)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
200
+ (0, vitest_1.expect)((0, csp_hoare_1.refinesFailures)(p, p, 2)).toBe(true);
201
+ });
202
+ });
203
+ // ── 11. Filósofos cenando: deadlock ─────────────────────────-
204
+ (0, vitest_1.describe)('CSP Hoare — Dining philosophers', () => {
205
+ (0, vitest_1.it)('diningPhilosophers(2) puede llegar a estado bloqueado por contención de tenedores', () => {
206
+ // Con 2 filósofos compartiendo 2 tenedores, si ambos toman su L
207
+ // primero, nadie tiene R libre — eso aparece como una resolución
208
+ // alcanzable cuyo nextEvents queda vacío.
209
+ const dp = (0, csp_hoare_1.diningPhilosophers)(2);
210
+ // Buscamos en el árbol de estados una resolución sin eventos.
211
+ let foundDeadlock = false;
212
+ const visit = (q, depth) => {
213
+ if (depth > 6 || foundDeadlock)
214
+ return;
215
+ if ((0, csp_hoare_1.isDeadlocked)(q)) {
216
+ // STOP global (todas las resoluciones sin eventos) cuenta;
217
+ // pero nos interesa "deadlock no-trivial" (con alguna traza ejecutada).
218
+ foundDeadlock = true;
219
+ return;
220
+ }
221
+ const init = (0, csp_hoare_1.nextEvents)(q);
222
+ for (const e of init) {
223
+ const next = (0, csp_hoare_1.step)(q, e);
224
+ if (next)
225
+ visit(next, depth + 1);
226
+ }
227
+ };
228
+ visit(dp, 0);
229
+ (0, vitest_1.expect)(foundDeadlock).toBe(true);
230
+ });
231
+ (0, vitest_1.it)('diningPhilosophers exige n ≥ 2', () => {
232
+ (0, vitest_1.expect)(() => (0, csp_hoare_1.diningPhilosophers)(1)).toThrow();
233
+ });
234
+ });
235
+ // ── 12. Recursión y guardas ─────────────────────────────────-
236
+ (0, vitest_1.describe)('CSP Hoare — Recursión', () => {
237
+ (0, vitest_1.it)('μX. a → X produce trazas con repetidos de a', () => {
238
+ const p = (0, csp_hoare_1.recursion)('X', (0, csp_hoare_1.prefix)('a', (0, csp_hoare_1.processVar)('X')));
239
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(p, 4)).sort();
240
+ (0, vitest_1.expect)(ts).toContain('a');
241
+ (0, vitest_1.expect)(ts).toContain('a,a');
242
+ (0, vitest_1.expect)(ts).toContain('a,a,a');
243
+ });
244
+ (0, vitest_1.it)('μX. X (sin guarda) es livelock', () => {
245
+ const p = (0, csp_hoare_1.recursion)('X', (0, csp_hoare_1.processVar)('X'));
246
+ (0, vitest_1.expect)((0, csp_hoare_1.isLiveLocked)(p, 4)).toBe(true);
247
+ });
248
+ (0, vitest_1.it)('μX. a → X (con guarda) NO es livelock', () => {
249
+ const p = (0, csp_hoare_1.recursion)('X', (0, csp_hoare_1.prefix)('a', (0, csp_hoare_1.processVar)('X')));
250
+ (0, vitest_1.expect)((0, csp_hoare_1.isLiveLocked)(p, 4)).toBe(false);
251
+ });
252
+ });
253
+ // ── 13. Alphabet ─────────────────────────────────────────────
254
+ (0, vitest_1.describe)('CSP Hoare — Alphabet sintáctico', () => {
255
+ (0, vitest_1.it)('alphabet(a → b → STOP) = {a, b}', () => {
256
+ const p = (0, csp_hoare_1.prefix)('a', (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
257
+ const a = (0, csp_hoare_1.alphabet)(p);
258
+ (0, vitest_1.expect)(a.has('a')).toBe(true);
259
+ (0, vitest_1.expect)(a.has('b')).toBe(true);
260
+ (0, vitest_1.expect)(a.size).toBe(2);
261
+ });
262
+ (0, vitest_1.it)('alphabet aplica renaming', () => {
263
+ const m = new Map([['a', 'x']]);
264
+ const p = (0, csp_hoare_1.rename)((0, csp_hoare_1.prefix)('a', (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP)), m);
265
+ const a = (0, csp_hoare_1.alphabet)(p);
266
+ (0, vitest_1.expect)(a.has('x')).toBe(true);
267
+ (0, vitest_1.expect)(a.has('b')).toBe(true);
268
+ (0, vitest_1.expect)(a.has('a')).toBe(false);
269
+ });
270
+ });
271
+ // ── 14. Failures: STOP rehúsa todo ──────────────────────────-
272
+ (0, vitest_1.describe)('CSP Hoare — Failures de STOP', () => {
273
+ (0, vitest_1.it)('Tras a → STOP consumir [a], el estado STOP rehúsa todos los eventos visibles', () => {
274
+ // Tras la traza [a], el continuante es STOP: debe aparecer un failure
275
+ // con traza [a] cuyo refusal contenga el alfabeto visible (acá: {a}).
276
+ const p = (0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP);
277
+ const fs = (0, csp_hoare_1.failures)(p, 2);
278
+ const afterA = fs.find((f) => f.trace.length === 1 && f.trace[0] === 'a');
279
+ (0, vitest_1.expect)(afterA).toBeDefined();
280
+ (0, vitest_1.expect)(afterA.refusal.has('a')).toBe(true);
281
+ });
282
+ });
283
+ // ── 15. Determinismo: traces() es determinista (mismo input → mismo output) ──
284
+ (0, vitest_1.describe)('CSP Hoare — Determinismo del análisis', () => {
285
+ (0, vitest_1.it)('traces() es determinista bajo el mismo proceso', () => {
286
+ const p = (0, csp_hoare_1.choice)((0, csp_hoare_1.prefix)('a', (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP)), (0, csp_hoare_1.prefix)('c', csp_hoare_1.STOP));
287
+ const t1 = tracesAsStrings((0, csp_hoare_1.traces)(p, 4));
288
+ const t2 = tracesAsStrings((0, csp_hoare_1.traces)(p, 4));
289
+ (0, vitest_1.expect)(t1).toEqual(t2);
290
+ });
291
+ (0, vitest_1.it)('failures() es determinista (mismo número de fallas, mismas trazas)', () => {
292
+ const p = (0, csp_hoare_1.internal)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), (0, csp_hoare_1.prefix)('b', csp_hoare_1.STOP));
293
+ const f1 = (0, csp_hoare_1.failures)(p, 2);
294
+ const f2 = (0, csp_hoare_1.failures)(p, 2);
295
+ (0, vitest_1.expect)(f1.length).toBe(f2.length);
296
+ });
297
+ });
298
+ // ── 16. Composición: paralelo asociativo en trazas ──────────-
299
+ (0, vitest_1.describe)('CSP Hoare — Propiedades algebraicas', () => {
300
+ (0, vitest_1.it)('(a → STOP) ||| STOP ≡ a → STOP en trazas', () => {
301
+ const lhs = (0, csp_hoare_1.interleave)((0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP), csp_hoare_1.STOP);
302
+ const ts = tracesAsStrings((0, csp_hoare_1.traces)(lhs, 3)).sort();
303
+ (0, vitest_1.expect)(ts).toEqual(['', 'a']);
304
+ });
305
+ (0, vitest_1.it)('STOP □ P ofrece exactamente lo de P (en eventos iniciales)', () => {
306
+ const p = (0, csp_hoare_1.prefix)('a', csp_hoare_1.STOP);
307
+ const ext = (0, csp_hoare_1.choice)(csp_hoare_1.STOP, p);
308
+ const init = (0, csp_hoare_1.nextEvents)(ext);
309
+ (0, vitest_1.expect)(init.has('a')).toBe(true);
310
+ (0, vitest_1.expect)(init.size).toBe(1);
311
+ });
312
+ });
313
+ //# sourceMappingURL=csp-hoare.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"csp-hoare.test.js","sourceRoot":"","sources":["../../../src/tests/csp-hoare/csp-hoare.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iEAAiE;AACjE,+DAA+D;;AAE/D,mCAA8C;AAC9C,+CA0ByB;AAGzB,gEAAgE;AAEhE,SAAS,eAAe,CAAC,CAAU;IACjC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,IAAA,wBAAY,EAAC,gBAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAA,sBAAU,EAAC,gBAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAA,gBAAI,EAAC,gBAAI,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,IAAA,eAAM,EAAC,IAAA,sBAAU,EAAC,gBAAI,CAAC,CAAC,GAAG,CAAC,gBAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,gBAAI,EAAC,gBAAI,EAAE,gBAAI,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,wBAAY,EAAC,gBAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,EAAE,GAAG,IAAA,kBAAM,EAAC,gBAAI,EAAE,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,GAAG,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,IAAI,GAAG,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAA,gBAAI,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,gBAAI,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAA,sBAAU,EAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACvD,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,2EAA2E,EAAE,GAAG,EAAE;QACnF,MAAM,CAAC,GAAG,IAAA,oBAAQ,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACzD,MAAM,EAAE,GAAG,IAAA,oBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,+DAA+D;QAC/D,8EAA8E;QAC9E,MAAM,OAAO,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACvD,MAAM,EAAE,GAAG,IAAA,oBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,OAAO,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;QACvD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAG,IAAA,0BAAc,GAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAA,sBAAU,EAAC,EAAE,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,EAAE,GAAG,IAAA,0BAAc,GAAE,CAAC;QAC5B,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4EAA4E,EAAE,GAAG,EAAE;QACpF,MAAM,EAAE,GAAG,IAAA,8BAAkB,GAAE,CAAC;QAChC,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,0DAA0D;QAC1D,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,IAAA,sBAAU,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,CAAC,GAAG,IAAA,oBAAQ,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC1B,4DAA4D;QAC5D,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,sEAAsE;QACtE,wEAAwE;QACxE,0CAA0C;QAC1C,MAAM,CAAC,GAAG,IAAA,oBAAQ,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,mDAAmD;QACnD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,GAAG,GAAG,IAAA,oBAAQ,EAAC,gBAAI,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QAC9C,MAAM,GAAG,GAAG,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACrD,MAAM,KAAK,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACrD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,GAAG,IAAA,oBAAQ,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACzD,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,CAAC,GAAG,IAAA,gBAAI,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChD,8DAA8D;QAC9D,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAG,IAAA,kBAAM,EAAC,GAAG,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAA,gBAAI,EAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAA,oBAAQ,EAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,CAAC,GAAG,IAAI,GAAG,CAAe,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,gEAAgE;QAChE,2DAA2D;QAC3D,8EAA8E;QAC9E,IAAA,eAAM,EAAC,IAAA,yBAAa,EAAC,gBAAI,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,wDAAwD;QACxD,IAAA,eAAM,EAAC,IAAA,yBAAa,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,gBAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,qEAAqE;QACrE,uEAAuE;QACvE,yEAAyE;QACzE,kCAAkC;QAClC,uDAAuD;QACvD,MAAM,GAAG,GAAG,IAAA,kBAAM,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,IAAA,oBAAQ,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,IAAA,2BAAe,EAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,IAAA,2BAAe,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,mFAAmF,EAAE,GAAG,EAAE;QAC3F,gEAAgE;QAChE,iEAAiE;QACjE,0CAA0C;QAC1C,MAAM,EAAE,GAAG,IAAA,8BAAkB,EAAC,CAAC,CAAC,CAAC;QACjC,8DAA8D;QAC9D,IAAI,aAAa,GAAG,KAAK,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,CAAY,EAAE,KAAa,EAAQ,EAAE;YAClD,IAAI,KAAK,GAAG,CAAC,IAAI,aAAa;gBAAE,OAAO;YACvC,IAAI,IAAA,wBAAY,EAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,2DAA2D;gBAC3D,wEAAwE;gBACxE,aAAa,GAAG,IAAI,CAAC;gBACrB,OAAO;YACT,CAAC;YACD,MAAM,IAAI,GAAG,IAAA,sBAAU,EAAC,CAAC,CAAC,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,IAAA,gBAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACxB,IAAI,IAAI;oBAAE,KAAK,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACnC,CAAC;QACH,CAAC,CAAC;QACF,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACb,IAAA,eAAM,EAAC,aAAa,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,8BAAkB,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAG,IAAA,qBAAS,EAAC,GAAG,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,IAAA,sBAAU,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,GAAG,IAAA,qBAAS,EAAC,GAAG,EAAE,IAAA,sBAAU,EAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,IAAA,wBAAY,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,IAAA,qBAAS,EAAC,GAAG,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,IAAA,sBAAU,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,IAAA,wBAAY,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,GAAG,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,IAAA,oBAAQ,EAAC,CAAC,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,GAAG,IAAI,GAAG,CAAe,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,GAAG,IAAA,oBAAQ,EAAC,CAAC,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,sEAAsE;QACtE,sEAAsE;QACtE,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,IAAA,oBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QAC1E,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,MAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gFAAgF;AAEhF,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACpE,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,CAAC,GAAG,IAAA,oBAAQ,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC,CAAC;QACzD,MAAM,EAAE,GAAG,IAAA,oBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,IAAA,oBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,GAAG,GAAG,IAAA,sBAAU,EAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,EAAE,gBAAI,CAAC,CAAC;QAChD,MAAM,EAAE,GAAG,eAAe,CAAC,IAAA,kBAAM,EAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAClD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,CAAC,GAAG,IAAA,kBAAM,EAAC,GAAG,EAAE,gBAAI,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,IAAA,kBAAM,EAAC,gBAAI,EAAE,CAAC,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAA,sBAAU,EAAC,GAAG,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
@@ -0,0 +1,2 @@
1
+ export {};
2
+ //# sourceMappingURL=game-theory.test.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"game-theory.test.d.ts","sourceRoot":"","sources":["../../../src/tests/game-theory/game-theory.test.ts"],"names":[],"mappings":""}
@@ -0,0 +1,252 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ const vitest_1 = require("vitest");
4
+ const game_theory_1 = require("../../game-theory");
5
+ function pure(player, s, size) {
6
+ return { player, distribution: (0, game_theory_1.pureDistribution)(s, size) };
7
+ }
8
+ function mixed(player, dist) {
9
+ return { player, distribution: dist };
10
+ }
11
+ (0, vitest_1.describe)('game-theory — common-games sanity', () => {
12
+ (0, vitest_1.it)("Prisoner's Dilemma: único Nash puro (D, D) con payoff (1, 1)", () => {
13
+ const g = (0, game_theory_1.prisonersDilemma)();
14
+ const eqs = (0, game_theory_1.findPureNash)(g);
15
+ (0, vitest_1.expect)(eqs).toHaveLength(1);
16
+ const eq = eqs[0];
17
+ (0, vitest_1.expect)(eq.isPure).toBe(true);
18
+ (0, vitest_1.expect)(eq.isStrict).toBe(true);
19
+ (0, vitest_1.expect)(eq.strategies[0].distribution).toEqual([0, 1]);
20
+ (0, vitest_1.expect)(eq.strategies[1].distribution).toEqual([0, 1]);
21
+ (0, vitest_1.expect)(eq.payoffs).toEqual([1, 1]);
22
+ });
23
+ (0, vitest_1.it)('Matching Pennies: no hay Nash puro', () => {
24
+ const g = (0, game_theory_1.matchingPennies)();
25
+ const eqs = (0, game_theory_1.findPureNash)(g);
26
+ (0, vitest_1.expect)(eqs).toHaveLength(0);
27
+ });
28
+ (0, vitest_1.it)('Matching Pennies: Nash mixto (1/2, 1/2) via support enumeration', () => {
29
+ const g = (0, game_theory_1.matchingPennies)();
30
+ const all = (0, game_theory_1.enumerateAllNash)(g);
31
+ (0, vitest_1.expect)(all).toHaveLength(1);
32
+ const eq = all[0];
33
+ (0, vitest_1.expect)(eq.isPure).toBe(false);
34
+ (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[0].distribution, [0.5, 0.5], 1e-7)).toBe(true);
35
+ (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[1].distribution, [0.5, 0.5], 1e-7)).toBe(true);
36
+ (0, vitest_1.expect)((0, game_theory_1.approxEqual)(eq.payoffs[0], 0, 1e-7)).toBe(true);
37
+ (0, vitest_1.expect)((0, game_theory_1.approxEqual)(eq.payoffs[1], 0, 1e-7)).toBe(true);
38
+ });
39
+ (0, vitest_1.it)('Rock-Paper-Scissors: único Nash mixto (1/3, 1/3, 1/3) cada jugador', () => {
40
+ const g = (0, game_theory_1.rockPaperScissors)();
41
+ (0, vitest_1.expect)((0, game_theory_1.findPureNash)(g)).toHaveLength(0);
42
+ const all = (0, game_theory_1.enumerateAllNash)(g);
43
+ (0, vitest_1.expect)(all).toHaveLength(1);
44
+ const eq = all[0];
45
+ (0, vitest_1.expect)(eq.isPure).toBe(false);
46
+ (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[0].distribution, [1 / 3, 1 / 3, 1 / 3], 1e-7)).toBe(true);
47
+ (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[1].distribution, [1 / 3, 1 / 3, 1 / 3], 1e-7)).toBe(true);
48
+ });
49
+ (0, vitest_1.it)('Battle of the Sexes: 2 Nash puros + 1 mixto', () => {
50
+ const g = (0, game_theory_1.battleOfSexes)();
51
+ const pures = (0, game_theory_1.findPureNash)(g);
52
+ (0, vitest_1.expect)(pures).toHaveLength(2);
53
+ const all = (0, game_theory_1.enumerateAllNash)(g);
54
+ (0, vitest_1.expect)(all).toHaveLength(3);
55
+ const mixedEq = all.find((e) => !e.isPure);
56
+ (0, vitest_1.expect)(mixedEq).toBeDefined();
57
+ // En BoS con (2,1)/(0,0)/(0,0)/(1,2), el mixto es p=2/3 para player1
58
+ // (probabilidad de Opera) y q=1/3 para player2.
59
+ (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(mixedEq.strategies[0].distribution, [2 / 3, 1 / 3], 1e-7)).toBe(true);
60
+ (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(mixedEq.strategies[1].distribution, [1 / 3, 2 / 3], 1e-7)).toBe(true);
61
+ });
62
+ (0, vitest_1.it)('Stag Hunt: 2 Nash puros + 1 mixto', () => {
63
+ const g = (0, game_theory_1.stagHunt)();
64
+ const pures = (0, game_theory_1.findPureNash)(g);
65
+ (0, vitest_1.expect)(pures).toHaveLength(2);
66
+ const all = (0, game_theory_1.enumerateAllNash)(g);
67
+ (0, vitest_1.expect)(all).toHaveLength(3);
68
+ });
69
+ });
70
+ (0, vitest_1.describe)('game-theory — bestResponse', () => {
71
+ (0, vitest_1.it)('PD: best response a coop puro es D', () => {
72
+ const g = (0, game_theory_1.prisonersDilemma)();
73
+ // opponentStrategies debe incluir todos los jugadores; la entrada
74
+ // de "player" se ignora — usamos una distribución placeholder.
75
+ const opp = [pure(0, 0, 2), pure(1, 0, 2)];
76
+ const br = (0, game_theory_1.bestResponse)(g, 0, opp);
77
+ (0, vitest_1.expect)(br).toEqual([1]); // Defect
78
+ });
79
+ (0, vitest_1.it)('Matching Pennies: best response a mezcla 50/50 son todas las puras (empate)', () => {
80
+ const g = (0, game_theory_1.matchingPennies)();
81
+ const opp = [pure(0, 0, 2), mixed(1, [0.5, 0.5])];
82
+ const br = (0, game_theory_1.bestResponse)(g, 0, opp);
83
+ (0, vitest_1.expect)(br.sort()).toEqual([0, 1]);
84
+ });
85
+ (0, vitest_1.it)('Battle of the Sexes: best response a "Opera" puro del rival es "Opera"', () => {
86
+ const g = (0, game_theory_1.battleOfSexes)();
87
+ const opp = [pure(0, 0, 2), pure(1, 0, 2)];
88
+ const br0 = (0, game_theory_1.bestResponse)(g, 0, opp);
89
+ (0, vitest_1.expect)(br0).toEqual([0]);
90
+ });
91
+ });
92
+ (0, vitest_1.describe)('game-theory — dominance', () => {
93
+ (0, vitest_1.it)('isDominated detecta estrategia estrictamente dominada', () => {
94
+ // Jugador 1: estrategia 0 da [1,1], estrategia 1 da [3,3] → 0 dominada
95
+ const g = (0, game_theory_1.createTwoPlayerGame)([
96
+ [1, 1],
97
+ [3, 3],
98
+ ], [
99
+ [0, 0],
100
+ [0, 0],
101
+ ]);
102
+ (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 0, 0, true)).toBe(true);
103
+ (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 0, 1, true)).toBe(false);
104
+ });
105
+ (0, vitest_1.it)('eliminateDominated reduce el juego', () => {
106
+ // 3x2: la estrategia 2 del jugador 1 está dominada por la 0 (estricta).
107
+ // Las otras dos filas de P1 dan los mismos pagos, así que ninguna
108
+ // está estrictamente dominada por la otra. P2 tiene pagos planos →
109
+ // tampoco se elimina nada del lado 2.
110
+ const g = (0, game_theory_1.createTwoPlayerGame)([
111
+ [5, 5],
112
+ [5, 5], // mismo que fila 0 → no estrictamente dominada
113
+ [1, 1], // dominada por estrategia 0
114
+ ], [
115
+ [0, 0],
116
+ [0, 0],
117
+ [0, 0],
118
+ ]);
119
+ const reduced = (0, game_theory_1.eliminateDominated)(g, true);
120
+ (0, vitest_1.expect)(reduced.strategies[0]).toBe(2);
121
+ (0, vitest_1.expect)(reduced.strategies[1]).toBe(2);
122
+ });
123
+ (0, vitest_1.it)('eliminateDominated: iterado encuentra mas reducciones', () => {
124
+ // Juego donde tras eliminar una de player 1, una de player 2 queda dominada.
125
+ // Player 1 elige fila, Player 2 elige columna.
126
+ // Row 2 dominada por row 0 para P1; tras eliminarla, col 2 queda dominada por col 0 para P2.
127
+ const g = (0, game_theory_1.createTwoPlayerGame)([
128
+ [5, 4, 3], // P1 utility
129
+ [4, 3, 2],
130
+ [1, 0, -1], // dominada por fila 0
131
+ ], [
132
+ [3, 4, 2], // P2 utility
133
+ [3, 4, 2],
134
+ [3, 4, 2],
135
+ ]);
136
+ const reduced = (0, game_theory_1.eliminateDominated)(g, true);
137
+ // Tras eliminar fila 2 de P1, miramos columnas de P2.
138
+ // P2 ahora tiene matrices [[3,4,2],[3,4,2]]. col 2 (=2) está dominada por col 1 (=4).
139
+ (0, vitest_1.expect)(reduced.strategies[0]).toBeLessThanOrEqual(2);
140
+ (0, vitest_1.expect)(reduced.strategies[1]).toBeLessThanOrEqual(3);
141
+ // Al menos UNA dimensión debe haberse reducido del original
142
+ const originalProfiles = 3 * 3;
143
+ const newProfiles = reduced.strategies[0] * reduced.strategies[1];
144
+ (0, vitest_1.expect)(newProfiles).toBeLessThan(originalProfiles);
145
+ });
146
+ (0, vitest_1.it)('PD: ninguna estrategia esta dominada (D es weak-better pero ambos prefieren D)', () => {
147
+ const g = (0, game_theory_1.prisonersDilemma)();
148
+ // Cooperate está estrictamente dominada por Defect en PD
149
+ (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 0, 0, true)).toBe(true);
150
+ (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 0, 1, true)).toBe(false);
151
+ (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 1, 0, true)).toBe(true);
152
+ (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 1, 1, true)).toBe(false);
153
+ const reduced = (0, game_theory_1.eliminateDominated)(g, true);
154
+ (0, vitest_1.expect)(reduced.strategies).toEqual([1, 1]);
155
+ (0, vitest_1.expect)(reduced.payoffs[0]).toEqual([1]);
156
+ (0, vitest_1.expect)(reduced.payoffs[1]).toEqual([1]);
157
+ });
158
+ });
159
+ (0, vitest_1.describe)('game-theory — lemke-howson', () => {
160
+ (0, vitest_1.it)('lemkeHowson encuentra Nash en matching pennies', () => {
161
+ const g = (0, game_theory_1.matchingPennies)();
162
+ const eq = (0, game_theory_1.lemkeHowson)(g, 0);
163
+ (0, vitest_1.expect)(eq).not.toBeNull();
164
+ (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[0].distribution, [0.5, 0.5], 1e-6)).toBe(true);
165
+ (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[1].distribution, [0.5, 0.5], 1e-6)).toBe(true);
166
+ });
167
+ (0, vitest_1.it)('lemkeHowson encuentra Nash en RPS', () => {
168
+ const g = (0, game_theory_1.rockPaperScissors)();
169
+ const eq = (0, game_theory_1.lemkeHowson)(g, 0);
170
+ (0, vitest_1.expect)(eq).not.toBeNull();
171
+ (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[0].distribution, [1 / 3, 1 / 3, 1 / 3], 1e-6)).toBe(true);
172
+ });
173
+ (0, vitest_1.it)('lemkeHowson encuentra UN Nash en battle of sexes', () => {
174
+ const g = (0, game_theory_1.battleOfSexes)();
175
+ const eq = (0, game_theory_1.lemkeHowson)(g, 0);
176
+ (0, vitest_1.expect)(eq).not.toBeNull();
177
+ // Debe ser uno de los 3 Nash conocidos
178
+ const allEqs = (0, game_theory_1.enumerateAllNash)(g);
179
+ const match = allEqs.some((e) => (0, game_theory_1.vectorsApproxEqual)(e.strategies[0].distribution, eq.strategies[0].distribution, 1e-5) &&
180
+ (0, game_theory_1.vectorsApproxEqual)(e.strategies[1].distribution, eq.strategies[1].distribution, 1e-5));
181
+ (0, vitest_1.expect)(match).toBe(true);
182
+ });
183
+ });
184
+ (0, vitest_1.describe)('game-theory — expectedPayoff', () => {
185
+ (0, vitest_1.it)('expectedPayoff es lineal en el perfil mixto', () => {
186
+ const g = (0, game_theory_1.matchingPennies)();
187
+ const halfHalf = [mixed(0, [0.5, 0.5]), mixed(1, [0.5, 0.5])];
188
+ (0, vitest_1.expect)((0, game_theory_1.approxEqual)((0, game_theory_1.expectedPayoff)(g, 0, halfHalf), 0, 1e-9)).toBe(true);
189
+ (0, vitest_1.expect)((0, game_theory_1.approxEqual)((0, game_theory_1.expectedPayoff)(g, 1, halfHalf), 0, 1e-9)).toBe(true);
190
+ // Si player 2 juega H puro y player 1 juega 50/50, payoff de player 1 = 0
191
+ const allH = [mixed(0, [0.5, 0.5]), pure(1, 0, 2)];
192
+ (0, vitest_1.expect)((0, game_theory_1.approxEqual)((0, game_theory_1.expectedPayoff)(g, 0, allH), 0, 1e-9)).toBe(true);
193
+ // y payoff de player 2 = 0
194
+ (0, vitest_1.expect)((0, game_theory_1.approxEqual)((0, game_theory_1.expectedPayoff)(g, 1, allH), 0, 1e-9)).toBe(true);
195
+ });
196
+ });
197
+ (0, vitest_1.describe)('game-theory — asymmetric NxM games', () => {
198
+ (0, vitest_1.it)('2x3 con única Nash pura', () => {
199
+ // Construido para que (0, 1) sea la única Nash:
200
+ // P1: fila 0 le da 5,7,3 ; fila 1 le da 4,2,1 → fila 0 domina
201
+ // P2: dada fila 0, columna 1 (=7) le da 6 vs 1 y 2 → mejor.
202
+ const g = (0, game_theory_1.createTwoPlayerGame)([
203
+ [5, 7, 3],
204
+ [4, 2, 1],
205
+ ], [
206
+ [1, 6, 2],
207
+ [3, 5, 4],
208
+ ]);
209
+ const eqs = (0, game_theory_1.findPureNash)(g);
210
+ (0, vitest_1.expect)(eqs.length).toBeGreaterThanOrEqual(1);
211
+ const has01 = eqs.some((e) => e.strategies[0].distribution[0] === 1 && e.strategies[1].distribution[1] === 1);
212
+ (0, vitest_1.expect)(has01).toBe(true);
213
+ });
214
+ (0, vitest_1.it)('enumerateAllNash respeta maxSize cap', () => {
215
+ const g = (0, game_theory_1.rockPaperScissors)();
216
+ const cap1 = (0, game_theory_1.enumerateAllNash)(g, 1);
217
+ // Cap a tamaño 1 → solo busca puros (no hay en RPS)
218
+ (0, vitest_1.expect)(cap1).toHaveLength(0);
219
+ const cap3 = (0, game_theory_1.enumerateAllNash)(g, 3);
220
+ (0, vitest_1.expect)(cap3).toHaveLength(1);
221
+ });
222
+ });
223
+ (0, vitest_1.describe)('game-theory — N-player simétricos chicos', () => {
224
+ (0, vitest_1.it)('3-player coordination game: hay Nash puros donde todos coordinan', () => {
225
+ // 3 jugadores, 2 estrategias cada uno (A=0, B=1).
226
+ // payoff[player][profile_index]: si todos juegan lo mismo dan 1, sino 0.
227
+ // perfil index: (s1, s2, s3) → s1*4 + s2*2 + s3
228
+ const players = 3;
229
+ const sizes = [2, 2, 2];
230
+ const payoff = (s1, s2, s3) => (s1 === s2 && s2 === s3 ? 1 : 0);
231
+ const payoffs = [];
232
+ for (let p = 0; p < players; p++) {
233
+ const row = [];
234
+ for (let s1 = 0; s1 < 2; s1++) {
235
+ for (let s2 = 0; s2 < 2; s2++) {
236
+ for (let s3 = 0; s3 < 2; s3++) {
237
+ row.push(payoff(s1, s2, s3));
238
+ }
239
+ }
240
+ }
241
+ payoffs.push(row);
242
+ }
243
+ const g = { players, strategies: sizes, payoffs };
244
+ const pures = (0, game_theory_1.findPureNash)(g);
245
+ // (0,0,0) y (1,1,1) son Nash; (0,0,1) no (player 3 desviaría a 0).
246
+ (0, vitest_1.expect)(pures.length).toBeGreaterThanOrEqual(2);
247
+ const allCoord = pures.filter((e) => e.strategies.every((s) => s.distribution[0] === 1) ||
248
+ e.strategies.every((s) => s.distribution[1] === 1));
249
+ (0, vitest_1.expect)(allCoord).toHaveLength(2);
250
+ });
251
+ });
252
+ //# sourceMappingURL=game-theory.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"game-theory.test.js","sourceRoot":"","sources":["../../../src/tests/game-theory/game-theory.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,mDAmB2B;AAE3B,SAAS,IAAI,CAAC,MAAc,EAAE,CAAS,EAAE,IAAY;IACnD,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,IAAA,8BAAgB,EAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;AAC7D,CAAC;AAED,SAAS,KAAK,CAAC,MAAc,EAAE,IAAc;IAC3C,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;AACxC,CAAC;AAED,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,GAAG,IAAA,8BAAgB,GAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,EAAE,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAA,6BAAe,GAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,CAAC,GAAG,IAAA,6BAAe,GAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,IAAA,8BAAgB,EAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,gCAAkB,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvF,IAAA,eAAM,EAAC,IAAA,gCAAkB,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvF,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,CAAC,GAAG,IAAA,+BAAiB,GAAE,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,IAAA,8BAAgB,EAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,gCAAkB,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CACzF,IAAI,CACL,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,gCAAkB,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CACzF,IAAI,CACL,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAG,IAAA,2BAAa,GAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAA,8BAAgB,EAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QAC9B,qEAAqE;QACrE,gDAAgD;QAChD,IAAA,eAAM,EAAC,IAAA,gCAAkB,EAAC,OAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CACxF,IAAI,CACL,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,gCAAkB,EAAC,OAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CACxF,IAAI,CACL,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,IAAA,sBAAQ,GAAE,CAAC;QACrB,MAAM,KAAK,GAAG,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAA,8BAAgB,EAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAA,8BAAgB,GAAE,CAAC;QAC7B,kEAAkE;QAClE,+DAA+D;QAC/D,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,IAAA,0BAAY,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6EAA6E,EAAE,GAAG,EAAE;QACrF,MAAM,CAAC,GAAG,IAAA,6BAAe,GAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,EAAE,GAAG,IAAA,0BAAY,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,MAAM,CAAC,GAAG,IAAA,2BAAa,GAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,IAAA,0BAAY,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,uEAAuE;QACvE,MAAM,CAAC,GAAG,IAAA,iCAAmB,EAC3B;YACE,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,CAAC,CAAC,EAAE,CAAC,CAAC;SACP,EACD;YACE,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,CAAC,CAAC,EAAE,CAAC,CAAC;SACP,CACF,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,wEAAwE;QACxE,kEAAkE;QAClE,mEAAmE;QACnE,sCAAsC;QACtC,MAAM,CAAC,GAAG,IAAA,iCAAmB,EAC3B;YACE,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,+CAA+C;YACvD,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,4BAA4B;SACrC,EACD;YACE,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,CAAC,CAAC,EAAE,CAAC,CAAC;SACP,CACF,CAAC;QACF,MAAM,OAAO,GAAG,IAAA,gCAAkB,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,6EAA6E;QAC7E,+CAA+C;QAC/C,6FAA6F;QAC7F,MAAM,CAAC,GAAG,IAAA,iCAAmB,EAC3B;YACE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa;YACxB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,sBAAsB;SACnC,EACD;YACE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa;YACxB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACV,CACF,CAAC;QACF,MAAM,OAAO,GAAG,IAAA,gCAAkB,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC5C,sDAAsD;QACtD,sFAAsF;QACtF,IAAA,eAAM,EAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QACrD,4DAA4D;QAC5D,MAAM,gBAAgB,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,WAAW,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,WAAW,CAAC,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gFAAgF,EAAE,GAAG,EAAE;QACxF,MAAM,CAAC,GAAG,IAAA,8BAAgB,GAAE,CAAC;QAC7B,yDAAyD;QACzD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAA,gCAAkB,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,OAAO,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,IAAA,6BAAe,GAAE,CAAC;QAC5B,MAAM,EAAE,GAAG,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1B,IAAA,eAAM,EAAC,IAAA,gCAAkB,EAAC,EAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxF,IAAA,eAAM,EAAC,IAAA,gCAAkB,EAAC,EAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1F,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,IAAA,+BAAiB,GAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1B,IAAA,eAAM,EAAC,IAAA,gCAAkB,EAAC,EAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAC1F,IAAI,CACL,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,CAAC,GAAG,IAAA,2BAAa,GAAE,CAAC;QAC1B,MAAM,EAAE,GAAG,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1B,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAA,8BAAgB,EAAC,CAAC,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CACvB,CAAC,CAAC,EAAE,EAAE,CACJ,IAAA,gCAAkB,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,EAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC;YACtF,IAAA,gCAAkB,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,EAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,CACzF,CAAC;QACF,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAG,IAAA,6BAAe,GAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,4BAAc,EAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,4BAAc,EAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAExE,0EAA0E;QAC1E,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,4BAAc,EAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpE,2BAA2B;QAC3B,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,4BAAc,EAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,gDAAgD;QAChD,gEAAgE;QAChE,8DAA8D;QAC9D,MAAM,CAAC,GAAG,IAAA,iCAAmB,EAC3B;YACE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACV,EACD;YACE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACV,CACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CACpB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CACtF,CAAC;QACF,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,+BAAiB,GAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAA,8BAAgB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,oDAAoD;QACpD,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAA,8BAAgB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,kDAAkD;QAClD,yEAAyE;QACzE,gDAAgD;QAChD,MAAM,OAAO,GAAG,CAAC,CAAC;QAClB,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAU,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,MAAM,OAAO,GAAe,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBAC9B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;oBAC9B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;wBAC9B,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBAC/B,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;QACD,MAAM,CAAC,GAAmB,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QAClE,MAAM,KAAK,GAAG,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC;QAC9B,mEAAmE;QACnE,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAC3B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAClD,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CACrD,CAAC;QACF,IAAA,eAAM,EAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}