tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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 (587) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,709 @@
1
+ import { Rational } from "./rational";
2
+
3
+ export const MPF_ROUND_NEAREST_TEVEN = 0;
4
+ export const MPF_ROUND_NEAREST_TAWAY = 1;
5
+ export const MPF_ROUND_TOWARD_POSITIVE = 2;
6
+ export const MPF_ROUND_TOWARD_NEGATIVE = 3;
7
+ export const MPF_ROUND_TOWARD_ZERO = 4;
8
+
9
+ export const MPF_MAX_SBITS = (1 << 16) - 1;
10
+
11
+ export interface Mpf {
12
+ ebits: number;
13
+ sbits: number;
14
+ sign: boolean;
15
+ significand: bigint;
16
+ exponent: number;
17
+ }
18
+
19
+ const getPower = (exponent: number) => 1n << BigInt(exponent);
20
+
21
+ const isOdd = (value: bigint) => (value & 1n) === 1n;
22
+
23
+ const getPrevPowerOfTwo = (value: bigint) => (value <= 0n ? 0 : value.toString(2).length - 1);
24
+
25
+ const getBitSize = (value: bigint) => getPrevPowerOfTwo(value < 0n ? -value : value) + 1;
26
+
27
+ const getPowerOfTwoMultiple = (value: bigint) => {
28
+ if (value === 0n) return 0;
29
+ let count = 0;
30
+ for (let rest = value < 0n ? -value : value; (rest & 1n) === 0n; rest >>= 1n) count++;
31
+ return count;
32
+ };
33
+
34
+ // An inexact root comes out one too large, as the callers expect.
35
+ const getRoot = (value: bigint) => {
36
+ if (value < 2n) return { root: value, isExact: true };
37
+ let low = 1n;
38
+ let high = getPower(Math.ceil((getPrevPowerOfTwo(value) + 1) / 2));
39
+ while (high - low > 1n) {
40
+ const mid = (low + high) >> 1n;
41
+ if (mid * mid <= value) low = mid;
42
+ else high = mid;
43
+ }
44
+ return low * low === value ? { root: low, isExact: true } : { root: low + 1n, isExact: false };
45
+ };
46
+
47
+ const mkBotExp = (ebits: number) => -(2 ** (ebits - 1) - 1);
48
+
49
+ const mkTopExp = (ebits: number) => 2 ** (ebits - 1);
50
+
51
+ export const mkMinExp = (ebits: number) => mkBotExp(ebits) + 1;
52
+
53
+ export const mkMaxExp = (ebits: number) => 2 ** (ebits - 1) - 1;
54
+
55
+ export const biasExp = (ebits: number, exponent: number) => exponent + mkMaxExp(ebits);
56
+
57
+ export const unbiasExp = (ebits: number, exponent: number) => exponent - mkMaxExp(ebits);
58
+
59
+ export const mkMpf = (
60
+ ebits: number,
61
+ sbits: number,
62
+ sign: boolean,
63
+ exponent: number,
64
+ significand: bigint,
65
+ ): Mpf => ({ ebits, sbits, sign, significand, exponent });
66
+
67
+ export const mkZero = (ebits: number, sbits: number, sign: boolean) =>
68
+ mkMpf(ebits, sbits, sign, mkBotExp(ebits), 0n);
69
+
70
+ export const mkNan = (ebits: number, sbits: number) =>
71
+ mkMpf(ebits, sbits, false, mkTopExp(ebits), getPower(sbits - 1) - 1n);
72
+
73
+ export const mkInf = (ebits: number, sbits: number, sign: boolean) =>
74
+ mkMpf(ebits, sbits, sign, mkTopExp(ebits), 0n);
75
+
76
+ const mkOne = (ebits: number, sbits: number, sign: boolean) => mkMpf(ebits, sbits, sign, 0, 0n);
77
+
78
+ export const mkMaxValue = (ebits: number, sbits: number, sign: boolean) =>
79
+ mkMpf(ebits, sbits, sign, mkTopExp(ebits) - 1, getPower(sbits - 1) - 1n);
80
+
81
+ const copy = (value: Mpf): Mpf => ({ ...value });
82
+
83
+ const hasBotExp = (value: Mpf) => value.exponent === mkBotExp(value.ebits);
84
+
85
+ const hasTopExp = (value: Mpf) => value.exponent === mkTopExp(value.ebits);
86
+
87
+ export const isNan = (value: Mpf) => hasTopExp(value) && value.significand !== 0n;
88
+
89
+ export const isInf = (value: Mpf) => hasTopExp(value) && value.significand === 0n;
90
+
91
+ export const isZero = (value: Mpf) => hasBotExp(value) && value.significand === 0n;
92
+
93
+ export const isPinf = (value: Mpf) => !value.sign && isInf(value);
94
+
95
+ const isNinf = (value: Mpf) => value.sign && isInf(value);
96
+
97
+ export const isPzero = (value: Mpf) => !value.sign && isZero(value);
98
+
99
+ export const isNeg = (value: Mpf) => value.sign && !isNan(value);
100
+
101
+ export const isDenormal = (value: Mpf) => !isZero(value) && hasBotExp(value);
102
+
103
+ export const isNormal = (value: Mpf) => !(hasTopExp(value) || isDenormal(value) || isZero(value));
104
+
105
+ export const mpfEq = (first: Mpf, second: Mpf) => {
106
+ if (isNan(first) || isNan(second)) return false;
107
+ if (isZero(first) && isZero(second)) return true;
108
+ if (first.sign !== second.sign) return false;
109
+ return first.exponent === second.exponent && first.significand === second.significand;
110
+ };
111
+
112
+ export const mpfLt = (first: Mpf, second: Mpf) => {
113
+ if (isNan(first) || isNan(second)) return false;
114
+ if (isZero(first) && isZero(second)) return false;
115
+ if (first.sign)
116
+ return (
117
+ !second.sign ||
118
+ second.exponent < first.exponent ||
119
+ (second.exponent === first.exponent && second.significand < first.significand)
120
+ );
121
+ if (second.sign) return false;
122
+ return (
123
+ first.exponent < second.exponent ||
124
+ (first.exponent === second.exponent && first.significand < second.significand)
125
+ );
126
+ };
127
+
128
+ export const mpfLe = (first: Mpf, second: Mpf) => mpfLt(first, second) || mpfEq(first, second);
129
+
130
+ const mpfGt = (first: Mpf, second: Mpf) => {
131
+ if (isNan(first) || isNan(second)) return false;
132
+ if (isZero(first) && isZero(second)) return false;
133
+ return !mpfLe(first, second);
134
+ };
135
+
136
+ export const mpfNeg = (value: Mpf) =>
137
+ isNan(value) ? copy(value) : { ...value, sign: !value.sign };
138
+
139
+ const unpack = (value: Mpf, isNormalizing: boolean) => {
140
+ if (isZero(value)) return;
141
+ if (isNormal(value)) {
142
+ value.significand += getPower(value.sbits - 1);
143
+ return;
144
+ }
145
+ value.exponent = mkBotExp(value.ebits) + 1;
146
+ if (!isNormalizing || value.significand === 0n) return;
147
+ const power = getPower(value.sbits - 1);
148
+ while (power > value.significand) {
149
+ value.exponent--;
150
+ value.significand <<= 1n;
151
+ }
152
+ };
153
+
154
+ const mkRoundInf = (rm: number, value: Mpf) => {
155
+ const isToMax = value.sign
156
+ ? rm === MPF_ROUND_TOWARD_ZERO || rm === MPF_ROUND_TOWARD_POSITIVE
157
+ : rm === MPF_ROUND_TOWARD_ZERO || rm === MPF_ROUND_TOWARD_NEGATIVE;
158
+ const rounded = isToMax
159
+ ? mkMaxValue(value.ebits, value.sbits, value.sign)
160
+ : mkInf(value.ebits, value.sbits, value.sign);
161
+ value.exponent = rounded.exponent;
162
+ value.significand = rounded.significand;
163
+ };
164
+
165
+ const getRoundingIncrement = (
166
+ rm: number,
167
+ sign: boolean,
168
+ last: boolean,
169
+ round: boolean,
170
+ sticky: boolean,
171
+ ) =>
172
+ rm === MPF_ROUND_NEAREST_TEVEN
173
+ ? round && (last || sticky)
174
+ : rm === MPF_ROUND_NEAREST_TAWAY
175
+ ? round
176
+ : rm === MPF_ROUND_TOWARD_POSITIVE
177
+ ? !sign && (round || sticky)
178
+ : rm === MPF_ROUND_TOWARD_NEGATIVE
179
+ ? sign && (round || sticky)
180
+ : false;
181
+
182
+ const round = (rm: number, value: Mpf) => {
183
+ const maxExp = mkMaxExp(value.ebits);
184
+ const minExp = mkMinExp(value.ebits);
185
+ const sigWidth = getPrevPowerOfTwo(value.significand) + 1;
186
+ const leadingZeros = value.sbits + 4 - sigWidth;
187
+ const beta = value.exponent - leadingZeros + 1;
188
+ const sigma = Math.max(
189
+ beta < minExp ? value.exponent - minExp : leadingZeros - 1,
190
+ -(value.sbits + 2),
191
+ );
192
+ value.exponent = beta < minExp ? minExp : beta;
193
+ if (sigma <= -1) {
194
+ const divisor = getPower(-sigma);
195
+ const remainder = value.significand % divisor;
196
+ value.significand /= divisor;
197
+ if (remainder !== 0n && !isOdd(value.significand)) value.significand++;
198
+ } else value.significand <<= BigInt(sigma);
199
+ const isLowSticky = isOdd(value.significand);
200
+ value.significand >>= 1n;
201
+ const sticky = isLowSticky || isOdd(value.significand);
202
+ value.significand >>= 1n;
203
+ const roundBit = isOdd(value.significand);
204
+ value.significand >>= 1n;
205
+ const last = isOdd(value.significand);
206
+ if (getRoundingIncrement(rm, value.sign, last, roundBit, sticky)) value.significand++;
207
+ if (value.significand >= getPower(value.sbits)) {
208
+ value.significand >>= 1n;
209
+ value.exponent++;
210
+ }
211
+ if (value.exponent > maxExp) {
212
+ mkRoundInf(rm, value);
213
+ return;
214
+ }
215
+ const hidden = getPower(value.sbits - 1);
216
+ if (value.significand >= hidden) value.significand -= hidden;
217
+ else value.exponent = mkBotExp(value.ebits);
218
+ };
219
+
220
+ export const mpfFromRational = (
221
+ ebits: number,
222
+ sbits: number,
223
+ rm: number,
224
+ exponent: bigint,
225
+ significand: Rational,
226
+ ): Mpf => {
227
+ const sign = significand.isNegative();
228
+ if (significand.isZero()) return mkZero(ebits, sbits, sign);
229
+ let sig = significand.abs();
230
+ let exp = exponent;
231
+ if (sig.compare(Rational.one) < 0) {
232
+ const inverse = Rational.one.div(sig);
233
+ const floor = inverse.floor();
234
+ const isPowerOfTwo = inverse.isInt() && floor.num > 0n && (floor.num & (floor.num - 1n)) === 0n;
235
+ const power = getPrevPowerOfTwo(floor.num) + (isPowerOfTwo ? 0 : 1);
236
+ sig = sig.mul(Rational.of(getPower(power)));
237
+ exp -= BigInt(power);
238
+ } else if (sig.compare(Rational.of(2n)) >= 0) {
239
+ const power = getPrevPowerOfTwo(sig.floor().num);
240
+ sig = sig.div(Rational.of(getPower(power)));
241
+ exp += BigInt(power);
242
+ }
243
+ const value = mkMpf(ebits, sbits, sign, 0, 0n);
244
+ if (exp > BigInt(mkMaxExp(ebits))) {
245
+ mkRoundInf(rm, value);
246
+ return value;
247
+ }
248
+ const scale = Rational.of(getPower(sbits + 2));
249
+ value.significand = scale.mul(sig).floor().num;
250
+ const rest = sig.sub(Rational.of(value.significand).div(scale));
251
+ if (!rest.isZero() && !isOdd(value.significand)) value.significand++;
252
+ const minExp = mkMinExp(ebits) - sbits - 4;
253
+ value.exponent = exp < BigInt(minExp) ? minExp : Number(exp);
254
+ round(rm, value);
255
+ return value;
256
+ };
257
+
258
+ export const mpfToFormat = (ebits: number, sbits: number, rm: number, value: Mpf): Mpf => {
259
+ if (isNan(value)) return mkNan(ebits, sbits);
260
+ if (isInf(value)) return mkInf(ebits, sbits, value.sign);
261
+ if (isZero(value)) return mkZero(ebits, sbits, value.sign);
262
+ if (value.ebits === ebits && value.sbits === sbits) return copy(value);
263
+ const result = copy(value);
264
+ unpack(result, true);
265
+ result.ebits = ebits;
266
+ result.sbits = sbits;
267
+ const shift = sbits - value.sbits + 3;
268
+ if (shift > 0) result.significand <<= BigInt(shift);
269
+ else if (shift < 0) {
270
+ let sticky = false;
271
+ for (let rest = shift; rest < 0; rest++) {
272
+ sticky ||= isOdd(result.significand);
273
+ result.significand >>= 1n;
274
+ }
275
+ if (sticky && !isOdd(result.significand)) result.significand++;
276
+ }
277
+ round(rm, result);
278
+ return result;
279
+ };
280
+
281
+ const mpfAddSub = (rm: number, first: Mpf, second: Mpf, isSub: boolean): Mpf => {
282
+ const ebits = first.ebits;
283
+ const sbits = first.sbits;
284
+ const secondSign = second.sign !== isSub;
285
+ if (isNan(first) || isNan(second)) return mkNan(ebits, sbits);
286
+ if (isInf(first))
287
+ return isInf(second) && first.sign !== secondSign ? mkNan(ebits, sbits) : copy(first);
288
+ if (isInf(second)) return { ...second, sign: secondSign };
289
+ if (isZero(first) && isZero(second))
290
+ return mkZero(
291
+ ebits,
292
+ sbits,
293
+ (first.sign && secondSign) || (rm === MPF_ROUND_TOWARD_NEGATIVE && first.sign !== secondSign),
294
+ );
295
+ if (isZero(first)) return { ...second, sign: secondSign };
296
+ if (isZero(second)) return copy(first);
297
+ const left = copy(first);
298
+ const right = { ...second, sign: secondSign };
299
+ unpack(left, false);
300
+ unpack(right, false);
301
+ const isSwapped = right.exponent > left.exponent;
302
+ const a = isSwapped ? right : left;
303
+ const b = isSwapped ? left : right;
304
+ const delta = Math.min(a.exponent - b.exponent, sbits + 2);
305
+ a.significand <<= 3n;
306
+ b.significand <<= 3n;
307
+ const divisor = getPower(delta);
308
+ const stickyRemainder = b.significand % divisor;
309
+ b.significand /= divisor;
310
+ const result = mkMpf(ebits, sbits, false, 0, 0n);
311
+ if (a.sign !== b.sign) {
312
+ result.significand = a.significand - b.significand;
313
+ if (stickyRemainder !== 0n && !isOdd(result.significand)) result.significand--;
314
+ } else {
315
+ result.significand = a.significand + b.significand;
316
+ if (stickyRemainder !== 0n && !isOdd(result.significand)) result.significand++;
317
+ }
318
+ if (result.significand === 0n) return mkZero(ebits, sbits, rm === MPF_ROUND_TOWARD_NEGATIVE);
319
+ const isNegative = result.significand < 0n;
320
+ if (isNegative) result.significand = -result.significand;
321
+ result.sign =
322
+ (!a.sign && b.sign && isNegative) || (a.sign && !b.sign && !isNegative) || (a.sign && b.sign);
323
+ result.exponent = a.exponent;
324
+ round(rm, result);
325
+ return result;
326
+ };
327
+
328
+ export const mpfAdd = (rm: number, first: Mpf, second: Mpf) => mpfAddSub(rm, first, second, false);
329
+
330
+ export const mpfMul = (rm: number, first: Mpf, second: Mpf): Mpf => {
331
+ const ebits = first.ebits;
332
+ const sbits = first.sbits;
333
+ if (isNan(first) || isNan(second)) return mkNan(ebits, sbits);
334
+ if (isPinf(first)) return isZero(second) ? mkNan(ebits, sbits) : mkInf(ebits, sbits, second.sign);
335
+ if (isPinf(second)) return isZero(first) ? mkNan(ebits, sbits) : mkInf(ebits, sbits, first.sign);
336
+ if (isNinf(first))
337
+ return isZero(second) ? mkNan(ebits, sbits) : mkInf(ebits, sbits, !second.sign);
338
+ if (isNinf(second)) return isZero(first) ? mkNan(ebits, sbits) : mkInf(ebits, sbits, !first.sign);
339
+ if (isZero(first) || isZero(second)) return mkZero(ebits, sbits, first.sign !== second.sign);
340
+ const a = copy(first);
341
+ const b = copy(second);
342
+ unpack(a, true);
343
+ unpack(b, true);
344
+ const result = mkMpf(
345
+ ebits,
346
+ sbits,
347
+ first.sign !== second.sign,
348
+ a.exponent + b.exponent,
349
+ a.significand * b.significand,
350
+ );
351
+ if (sbits >= 4) {
352
+ const divisor = getPower(sbits - 4);
353
+ const stickyRemainder = result.significand % divisor;
354
+ result.significand /= divisor;
355
+ if (stickyRemainder !== 0n && !isOdd(result.significand)) result.significand++;
356
+ } else result.significand <<= BigInt(4 - sbits);
357
+ round(rm, result);
358
+ return result;
359
+ };
360
+
361
+ export const mpfDiv = (rm: number, first: Mpf, second: Mpf): Mpf => {
362
+ const ebits = first.ebits;
363
+ const sbits = first.sbits;
364
+ if (isNan(first) || isNan(second)) return mkNan(ebits, sbits);
365
+ if (isPinf(first)) return isInf(second) ? mkNan(ebits, sbits) : mkInf(ebits, sbits, second.sign);
366
+ if (isPinf(second))
367
+ return isInf(first) ? mkNan(ebits, sbits) : mkZero(ebits, sbits, first.sign !== second.sign);
368
+ if (isNinf(first)) return isInf(second) ? mkNan(ebits, sbits) : mkInf(ebits, sbits, !second.sign);
369
+ if (isNinf(second))
370
+ return isInf(first) ? mkNan(ebits, sbits) : mkZero(ebits, sbits, first.sign !== second.sign);
371
+ if (isZero(second))
372
+ return isZero(first) ? mkNan(ebits, sbits) : mkInf(ebits, sbits, first.sign !== second.sign);
373
+ if (isZero(first)) return mkZero(ebits, sbits, first.sign !== second.sign);
374
+ const a = copy(first);
375
+ const b = copy(second);
376
+ unpack(a, true);
377
+ unpack(b, true);
378
+ const extraBits = sbits + 2;
379
+ const quotient = (a.significand << BigInt(sbits + extraBits)) / b.significand;
380
+ const divisor = getPower(extraBits - 2);
381
+ const result = mkMpf(
382
+ ebits,
383
+ sbits,
384
+ first.sign !== second.sign,
385
+ a.exponent - b.exponent,
386
+ quotient / divisor,
387
+ );
388
+ if (quotient % divisor !== 0n && !isOdd(result.significand)) result.significand++;
389
+ round(rm, result);
390
+ return result;
391
+ };
392
+
393
+ export const mpfFma = (rm: number, first: Mpf, second: Mpf, third: Mpf): Mpf => {
394
+ const ebits = first.ebits;
395
+ const sbits = first.sbits;
396
+ if (isNan(first) || isNan(second) || isNan(third)) return mkNan(ebits, sbits);
397
+ const isInfClash = isInf(third) && (first.sign !== second.sign) !== third.sign;
398
+ if (isPinf(first))
399
+ return isZero(second) || isInfClash ? mkNan(ebits, sbits) : mkInf(ebits, sbits, second.sign);
400
+ if (isPinf(second))
401
+ return isZero(first) || isInfClash ? mkNan(ebits, sbits) : mkInf(ebits, sbits, first.sign);
402
+ if (isNinf(first))
403
+ return isZero(second) || isInfClash ? mkNan(ebits, sbits) : mkInf(ebits, sbits, !second.sign);
404
+ if (isNinf(second))
405
+ return isZero(first) || isInfClash ? mkNan(ebits, sbits) : mkInf(ebits, sbits, !first.sign);
406
+ if (isInf(third)) return copy(third);
407
+ if (isZero(first) || isZero(second))
408
+ return isZero(third) && (first.sign !== second.sign) !== third.sign
409
+ ? mkZero(ebits, sbits, rm === MPF_ROUND_TOWARD_NEGATIVE)
410
+ : copy(third);
411
+ const a = copy(first);
412
+ const b = copy(second);
413
+ const c = copy(third);
414
+ unpack(a, true);
415
+ unpack(b, true);
416
+ unpack(c, true);
417
+ const product = mkMpf(
418
+ ebits + 2,
419
+ 2 * sbits - 1 + 3,
420
+ a.sign !== b.sign,
421
+ a.exponent + b.exponent,
422
+ (a.significand * b.significand) << 3n,
423
+ );
424
+ const addend = mkMpf(
425
+ ebits + 2,
426
+ 2 * sbits - 1 + 3,
427
+ c.sign,
428
+ c.exponent,
429
+ c.significand << BigInt(sbits - 1 + 3),
430
+ );
431
+ const isSwapped = addend.exponent > product.exponent;
432
+ const larger = isSwapped ? addend : product;
433
+ const smaller = isSwapped ? product : addend;
434
+ const delta = Math.min(larger.exponent - smaller.exponent, 2 * sbits + 3);
435
+ const divisor = getPower(delta);
436
+ const isAlignmentSticky = smaller.significand % divisor !== 0n;
437
+ smaller.significand /= divisor;
438
+ const sum = copy(larger);
439
+ if (larger.sign !== smaller.sign) {
440
+ sum.significand = larger.significand - smaller.significand;
441
+ if (isAlignmentSticky && !isOdd(sum.significand)) sum.significand--;
442
+ if (sum.significand < 0n) {
443
+ sum.significand = -sum.significand;
444
+ sum.sign = !sum.sign;
445
+ }
446
+ } else {
447
+ sum.significand = larger.significand + smaller.significand;
448
+ if (isAlignmentSticky && !isOdd(sum.significand)) sum.significand++;
449
+ }
450
+ let isRenormSticky = false;
451
+ if (sum.significand >= getPower(2 * sbits + 3)) {
452
+ sum.exponent++;
453
+ isRenormSticky = isOdd(sum.significand);
454
+ sum.significand >>= 1n;
455
+ }
456
+ const sigWidth = getPrevPowerOfTwo(sum.significand) + 1;
457
+ const renormDelta = Math.max(
458
+ 0,
459
+ Math.min(2 * sbits + 3 - sigWidth, sum.exponent - mkMinExp(ebits)),
460
+ );
461
+ sum.exponent -= renormDelta;
462
+ sum.significand <<= BigInt(renormDelta);
463
+ const result = mkMpf(ebits, sbits, sum.sign, sum.exponent, 0n);
464
+ if (sbits >= 4) {
465
+ const shift = getPower(sbits - 4 + 3);
466
+ result.significand = sum.significand / shift;
467
+ isRenormSticky ||= sum.significand % shift !== 0n;
468
+ } else {
469
+ result.significand = sum.significand << BigInt(4 - sbits + 3);
470
+ result.exponent -= 4 - sbits + 3;
471
+ }
472
+ if (isRenormSticky && !isOdd(result.significand)) result.significand++;
473
+ const maxSize = sbits + 4;
474
+ const sigSize = getBitSize(result.significand);
475
+ if (sigSize > maxSize) {
476
+ result.significand >>= BigInt(sigSize - maxSize);
477
+ result.exponent += sigSize - maxSize;
478
+ }
479
+ if (result.significand === 0n) return mkZero(ebits, sbits, rm === MPF_ROUND_TOWARD_NEGATIVE);
480
+ round(rm, result);
481
+ return result;
482
+ };
483
+
484
+ export const mpfSqrt = (rm: number, value: Mpf): Mpf => {
485
+ if (isNan(value)) return mkNan(value.ebits, value.sbits);
486
+ if (isPinf(value) || isZero(value)) return copy(value);
487
+ if (value.sign) return mkNan(value.ebits, value.sbits);
488
+ const a = copy(value);
489
+ unpack(a, true);
490
+ const shifted = a.significand << BigInt(value.sbits + (a.exponent % 2 !== 0 ? 6 : 7));
491
+ const root = getRoot(shifted);
492
+ const result = mkMpf(
493
+ value.ebits,
494
+ value.sbits,
495
+ false,
496
+ Math.floor(a.exponent / 2) - (a.exponent % 2 === 0 ? 1 : 0),
497
+ !root.isExact && !isOdd(root.root) ? root.root - 1n : root.root,
498
+ );
499
+ round(rm, result);
500
+ return result;
501
+ };
502
+
503
+ const renormalize = (sbits: number, value: { exponent: number; significand: bigint }) => {
504
+ if (value.significand === 0n) return;
505
+ const upper = getPower(sbits);
506
+ while (value.significand >= upper) {
507
+ value.significand >>= 1n;
508
+ value.exponent++;
509
+ }
510
+ const lower = getPower(sbits - 1);
511
+ while (value.significand < lower) {
512
+ value.significand <<= 1n;
513
+ value.exponent--;
514
+ }
515
+ };
516
+
517
+ export const mpfRoundToIntegral = (rm: number, value: Mpf): Mpf => {
518
+ const ebits = value.ebits;
519
+ const sbits = value.sbits;
520
+ if (isNan(value)) return mkNan(ebits, sbits);
521
+ if (isInf(value)) return copy(value);
522
+ if (isZero(value)) return mkZero(ebits, sbits, value.sign);
523
+ if (value.exponent < 0) {
524
+ if (rm === MPF_ROUND_TOWARD_ZERO) return mkZero(ebits, sbits, value.sign);
525
+ if (rm === MPF_ROUND_TOWARD_NEGATIVE)
526
+ return value.sign ? mkOne(ebits, sbits, true) : mkZero(ebits, sbits, false);
527
+ if (rm === MPF_ROUND_TOWARD_POSITIVE)
528
+ return value.sign ? mkZero(ebits, sbits, true) : mkOne(ebits, sbits, false);
529
+ const effective = { exponent: value.exponent, significand: value.significand };
530
+ if (isDenormal(value)) {
531
+ effective.exponent = mkMinExp(ebits);
532
+ renormalize(sbits, effective);
533
+ if (effective.significand !== 0n) effective.significand -= getPower(sbits - 1);
534
+ }
535
+ const isTie = effective.significand === 0n && effective.exponent === -1;
536
+ if (isTie)
537
+ return rm === MPF_ROUND_NEAREST_TEVEN
538
+ ? mkZero(ebits, sbits, value.sign)
539
+ : mkOne(ebits, sbits, value.sign);
540
+ return effective.exponent < -1
541
+ ? mkZero(ebits, sbits, value.sign)
542
+ : mkOne(ebits, sbits, value.sign);
543
+ }
544
+ if (value.exponent >= sbits - 1) return copy(value);
545
+ const a = copy(value);
546
+ unpack(a, true);
547
+ const shift = sbits - 1 - a.exponent;
548
+ const shiftPower = getPower(shift);
549
+ const half = getPower(shift - 1);
550
+ let quotient = a.significand / shiftPower;
551
+ const remainder = a.significand % shiftPower;
552
+ const isIncremented =
553
+ rm === MPF_ROUND_NEAREST_TEVEN || rm === MPF_ROUND_NEAREST_TAWAY
554
+ ? remainder === half
555
+ ? (rm === MPF_ROUND_NEAREST_TEVEN && isOdd(quotient)) || rm === MPF_ROUND_NEAREST_TAWAY
556
+ : remainder > half
557
+ : rm === MPF_ROUND_TOWARD_POSITIVE
558
+ ? remainder !== 0n && !value.sign
559
+ : rm === MPF_ROUND_TOWARD_NEGATIVE && remainder !== 0n && value.sign;
560
+ if (isIncremented) quotient++;
561
+ const result = mkMpf(ebits, sbits, value.sign, a.exponent, quotient << BigInt(shift));
562
+ while (result.significand >= getPower(sbits)) {
563
+ result.significand >>= 1n;
564
+ result.exponent++;
565
+ }
566
+ result.significand -= getPower(sbits - 1);
567
+ return result;
568
+ };
569
+
570
+ const partialRemainder = (x: Mpf, y: Mpf, expDiff: number, isPartial: boolean) => {
571
+ const ebits = x.ebits;
572
+ const sbits = x.sbits;
573
+ const bigN = sbits - 1;
574
+ const quotientLarge = (x.significand << BigInt(2 * sbits + 2)) / y.significand;
575
+ const quotientShift = sbits - 1 + (sbits + 3) - (isPartial ? bigN : expDiff);
576
+ const q = { exponent: expDiff, significand: 0n };
577
+ if (isPartial) q.significand = quotientLarge >> BigInt(quotientShift);
578
+ else {
579
+ const divisor = getPower(quotientShift);
580
+ q.significand = quotientLarge / divisor;
581
+ const remainder = quotientLarge % divisor;
582
+ const half = getPower(quotientShift - 1);
583
+ if ((remainder === half && isOdd(q.significand)) || remainder > half) q.significand++;
584
+ }
585
+ q.significand = (q.significand << BigInt(quotientShift)) >> BigInt(sbits + 3);
586
+ renormalize(sbits, q);
587
+ if ((expDiff === -1 || isPartial) && q.significand === 0n) return;
588
+ const yq = { exponent: q.exponent + y.exponent, significand: y.significand * q.significand };
589
+ renormalize(2 * sbits - 1, yq);
590
+ const minuend = x.significand << BigInt(sbits - 1);
591
+ let subtrahend = yq.significand;
592
+ let expDelta = x.exponent - yq.exponent;
593
+ if (expDelta !== 0) {
594
+ let stickyRemainder = 0n;
595
+ if (expDelta > sbits + 5) {
596
+ stickyRemainder = subtrahend;
597
+ subtrahend = 0n;
598
+ } else if (expDelta > 0) {
599
+ const divisor = getPower(expDelta);
600
+ stickyRemainder = subtrahend % divisor;
601
+ subtrahend /= divisor;
602
+ } else {
603
+ expDelta = -expDelta;
604
+ subtrahend <<= BigInt(expDelta);
605
+ }
606
+ if (stickyRemainder !== 0n && !isOdd(subtrahend)) subtrahend++;
607
+ }
608
+ const difference = minuend - subtrahend;
609
+ const isNegative = difference < 0n;
610
+ const result = {
611
+ exponent: x.exponent,
612
+ significand: isNegative ? -difference : difference,
613
+ };
614
+ const sign = x.sign !== isNegative;
615
+ if (result.significand === 0n) {
616
+ Object.assign(x, mkZero(ebits, sbits, x.sign));
617
+ return;
618
+ }
619
+ renormalize(2 * sbits - 1, result);
620
+ const divisor = getPower(sbits - 1);
621
+ const roundBits = result.significand % divisor;
622
+ result.significand /= divisor;
623
+ if ((roundBits === 32n && isOdd(result.significand)) || roundBits > 32n) result.significand++;
624
+ Object.assign(x, mkMpf(ebits, sbits, sign, result.exponent, result.significand));
625
+ };
626
+
627
+ export const mpfRem = (first: Mpf, second: Mpf): Mpf => {
628
+ const ebits = first.ebits;
629
+ const sbits = first.sbits;
630
+ if (isNan(first) || isNan(second) || isInf(first) || isZero(second)) return mkNan(ebits, sbits);
631
+ if (isInf(second) || isZero(first)) return copy(first);
632
+ const st0 = copy(first);
633
+ const st1 = copy(second);
634
+ unpack(st0, true);
635
+ unpack(st1, true);
636
+ for (;;) {
637
+ const delta = st0.exponent < st1.exponent - 1 ? 0 : st0.exponent - st1.exponent;
638
+ if (st0.exponent >= st1.exponent - 1) partialRemainder(st0, st1, delta, delta >= sbits);
639
+ if (!(delta >= sbits && !isZero(st0))) break;
640
+ }
641
+ st0.significand <<= 3n;
642
+ const result = mpfToFormat(ebits, sbits, MPF_ROUND_TOWARD_ZERO, st0);
643
+ round(MPF_ROUND_NEAREST_TEVEN, result);
644
+ return result;
645
+ };
646
+
647
+ // The callers rule out the unspecified min and max of zeros of different signs.
648
+ export const mpfMaximum = (first: Mpf, second: Mpf) =>
649
+ isNan(first)
650
+ ? copy(second)
651
+ : isNan(second)
652
+ ? copy(first)
653
+ : isZero(first) && isZero(second)
654
+ ? copy(second)
655
+ : mpfGt(first, second)
656
+ ? copy(first)
657
+ : copy(second);
658
+
659
+ export const mpfMinimum = (first: Mpf, second: Mpf) =>
660
+ isNan(first)
661
+ ? copy(second)
662
+ : isNan(second)
663
+ ? copy(first)
664
+ : isZero(first) && isZero(second)
665
+ ? copy(second)
666
+ : mpfLt(first, second)
667
+ ? copy(first)
668
+ : copy(second);
669
+
670
+ export const mpfToRational = (value: Mpf) => {
671
+ const a = copy(value);
672
+ unpack(a, true);
673
+ const numerator = a.sign ? -a.significand : a.significand;
674
+ const denominator = getPower(a.sbits - 1);
675
+ return a.exponent >= 0
676
+ ? Rational.of(numerator << BigInt(a.exponent), denominator)
677
+ : Rational.of(numerator, denominator << BigInt(-a.exponent));
678
+ };
679
+
680
+ export const mpfToSbv = (rm: number, value: Mpf) => {
681
+ const t = copy(value);
682
+ unpack(t, true);
683
+ let integer = t.significand;
684
+ if (t.exponent < t.sbits - 1) {
685
+ const shift = t.exponent < 0 ? -(t.exponent + 1) + t.sbits : t.sbits - 1 - t.exponent;
686
+ const flags = { last: false, round: false, sticky: false };
687
+ if (integer !== 0n) {
688
+ const bits = getBitSize(integer);
689
+ const getBit = (index: number) => ((integer >> BigInt(index)) & 1n) === 1n;
690
+ flags.last = shift < bits && getBit(shift);
691
+ flags.round = shift <= bits && getBit(shift - 1);
692
+ flags.sticky = shift > 1 && getPowerOfTwoMultiple(integer) < shift - 1;
693
+ integer = shift >= bits ? 0n : integer >> BigInt(shift);
694
+ }
695
+ if (getRoundingIncrement(rm, value.sign, flags.last, flags.round, flags.sticky)) integer++;
696
+ } else integer <<= BigInt(t.exponent - t.sbits + 1);
697
+ return value.sign ? -integer : integer;
698
+ };
699
+
700
+ export const mpfToIeeeBv = (value: Mpf) => {
701
+ const sign = value.sign ? 1n : 0n;
702
+ if (isInf(value))
703
+ return ((sign << BigInt(value.ebits)) + getPower(value.ebits) - 1n) << BigInt(value.sbits - 1);
704
+ return (
705
+ (((sign << BigInt(value.ebits)) + BigInt(biasExp(value.ebits, value.exponent))) <<
706
+ BigInt(value.sbits - 1)) +
707
+ value.significand
708
+ );
709
+ };