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