tla-ts 0.0.4-dev.0be9567 → 0.0.4-dev.1a3acf6
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 +37 -126
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +44 -12
- package/dist/index.d.ts +44 -12
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +1006 -0
- package/dist/prove.js +1006 -0
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +76 -92
- package/dist/transfer.js +76 -92
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/ast.ts +2 -2
- package/src/bags.ts +22 -23
- package/src/builtins.ts +16 -8
- package/src/check.ts +131 -1153
- package/src/{cli-options.ts → cli/options.ts} +54 -9
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/{run-cli.ts → cli/tlc.ts} +115 -721
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +1 -1
- package/src/codegen.ts +17 -15
- package/src/config.ts +5 -5
- package/src/dependencies.ts +4 -6
- package/src/environment.ts +55 -60
- package/src/errors.ts +97 -35
- package/src/evaluate.ts +135 -120
- package/src/exit-codes.ts +1 -1
- package/src/fingerprints.ts +3 -3
- package/src/index.ts +10 -0
- package/src/instances.ts +56 -46
- package/src/java-overrides.ts +79 -41
- package/src/json.ts +31 -36
- package/src/levels.ts +10 -13
- package/src/{live-check.ts → liveness-checker.ts} +169 -142
- package/src/liveness.ts +38 -34
- package/src/{obligation-action.ts → obligations/action.ts} +248 -74
- package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +618 -0
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/obligations/generate.ts +457 -0
- package/src/{obligations.ts → obligations/index.ts} +46 -32
- package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
- package/src/obligations/module.ts +445 -0
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +195 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/obligations/regroup.ts +100 -0
- package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
- package/src/{obligation-source.ts → obligations/source.ts} +172 -216
- package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +39 -51
- package/src/parallel.ts +39 -66
- package/src/parser.ts +67 -74
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
- package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
- package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
- package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
- package/src/prover/decide-pool.ts +95 -0
- package/src/prover/deciders.ts +33 -0
- package/src/prover/first-order.ts +175 -0
- package/src/prover/isabelle/LICENSE +36 -0
- package/src/prover/isabelle/LICENSE-tlapm +26 -0
- package/src/prover/isabelle/decide.ts +44 -0
- package/src/prover/isabelle/encode.ts +445 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prover/isabelle/isar/method.ts +367 -0
- package/src/prover/isabelle/isar/proof.ts +28 -0
- package/src/prover/isabelle/isar/statement.ts +57 -0
- package/src/prover/isabelle/isar/theory.ts +192 -0
- package/src/prover/isabelle/isar/type-check.ts +278 -0
- package/src/prover/isabelle/provers/blast/blast.ts +258 -0
- package/src/prover/isabelle/provers/blast/branch.ts +322 -0
- package/src/prover/isabelle/provers/blast/prove.ts +347 -0
- package/src/prover/isabelle/provers/blast/rules.ts +330 -0
- package/src/prover/isabelle/provers/blast/state.ts +180 -0
- package/src/prover/isabelle/provers/blast/term.ts +546 -0
- package/src/prover/isabelle/provers/clasimp.ts +150 -0
- package/src/prover/isabelle/provers/classical.ts +389 -0
- package/src/prover/isabelle/provers/hypsubst.ts +433 -0
- package/src/prover/isabelle/pure/bicompose.ts +174 -0
- package/src/prover/isabelle/pure/consts.ts +32 -0
- package/src/prover/isabelle/pure/conv.ts +79 -0
- package/src/prover/isabelle/pure/drule.ts +264 -0
- package/src/prover/isabelle/pure/envir.ts +331 -0
- package/src/prover/isabelle/pure/goal.ts +53 -0
- package/src/prover/isabelle/pure/interrupt.ts +16 -0
- package/src/prover/isabelle/pure/list.ts +12 -0
- package/src/prover/isabelle/pure/logic.ts +330 -0
- package/src/prover/isabelle/pure/name.ts +98 -0
- package/src/prover/isabelle/pure/net.ts +215 -0
- package/src/prover/isabelle/pure/object-logic.ts +41 -0
- package/src/prover/isabelle/pure/pattern.ts +631 -0
- package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prover/isabelle/pure/rewriter.ts +602 -0
- package/src/prover/isabelle/pure/search.ts +68 -0
- package/src/prover/isabelle/pure/seq.ts +133 -0
- package/src/prover/isabelle/pure/simplifier.ts +106 -0
- package/src/prover/isabelle/pure/table.ts +201 -0
- package/src/prover/isabelle/pure/tactic.ts +168 -0
- package/src/prover/isabelle/pure/tactical.ts +264 -0
- package/src/prover/isabelle/pure/term-ord.ts +105 -0
- package/src/prover/isabelle/pure/term.ts +688 -0
- package/src/prover/isabelle/pure/thm.ts +783 -0
- package/src/prover/isabelle/pure/type.ts +121 -0
- package/src/prover/isabelle/pure/unify.ts +753 -0
- package/src/prover/isabelle/pure/variable.ts +25 -0
- package/src/prover/isabelle/tla/classical-setup.ts +101 -0
- package/src/prover/isabelle/tla/context.ts +74 -0
- package/src/prover/isabelle/tla/logic-data.ts +5 -0
- package/src/prover/isabelle/tla/logic.ts +215 -0
- package/src/prover/isabelle/tla/simpdata.ts +241 -0
- package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prover/ocaml.ts +22 -0
- package/src/prover/prep/action.ts +508 -0
- package/src/prover/prep/enabled-axioms.ts +189 -0
- package/src/prover/prep/fingerprint.ts +388 -0
- package/src/prover/prep/level-comparison.ts +529 -0
- package/src/prover/prep/md5.ts +60 -0
- package/src/prover/prep/methods.ts +221 -0
- package/src/prover/prep/normalize.ts +309 -0
- package/src/prover/prove-worker.ts +22 -0
- package/src/prover/prove.ts +492 -0
- package/src/prover/ptl/decide.ts +68 -0
- package/src/prover/ptl/encode.ts +244 -0
- package/src/prover/ptl/sat.ts +151 -0
- package/src/prover/ptl/tableau.ts +276 -0
- package/src/prover/smt/axioms.ts +209 -0
- package/src/prover/smt/context.ts +108 -0
- package/src/prover/smt/data.ts +636 -0
- package/src/prover/smt/encode.ts +275 -0
- package/src/prover/smt/extensionality.ts +65 -0
- package/src/prover/smt/flatten.ts +112 -0
- package/src/prover/smt/format.ts +154 -0
- package/src/prover/smt/instances.ts +181 -0
- package/src/prover/smt/rewrite.ts +766 -0
- package/src/prover/smt/solver/act-cache.ts +265 -0
- package/src/prover/smt/solver/arith-rewriter.ts +962 -0
- package/src/prover/smt/solver/array.ts +22 -0
- package/src/prover/smt/solver/asserted-formulas.ts +469 -0
- package/src/prover/smt/solver/ast-lt.ts +157 -0
- package/src/prover/smt/solver/ast-util.ts +91 -0
- package/src/prover/smt/solver/ast.ts +1315 -0
- package/src/prover/smt/solver/auf-solver.ts +572 -0
- package/src/prover/smt/solver/case-split-queue.ts +178 -0
- package/src/prover/smt/solver/cg-table.ts +175 -0
- package/src/prover/smt/solver/clause.ts +276 -0
- package/src/prover/smt/solver/conflict-resolution.ts +343 -0
- package/src/prover/smt/solver/context.ts +1292 -0
- package/src/prover/smt/solver/ctx-simplify.ts +334 -0
- package/src/prover/smt/solver/der.ts +224 -0
- package/src/prover/smt/solver/dyn-ack.ts +141 -0
- package/src/prover/smt/solver/e-matching.ts +659 -0
- package/src/prover/smt/solver/enode.ts +259 -0
- package/src/prover/smt/solver/expr-ref.ts +21 -0
- package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prover/smt/solver/fingerprints.ts +92 -0
- package/src/prover/smt/solver/flat-literals.ts +51 -0
- package/src/prover/smt/solver/goal.ts +138 -0
- package/src/prover/smt/solver/hash.ts +173 -0
- package/src/prover/smt/solver/hashtable.ts +166 -0
- package/src/prover/smt/solver/internalizer.ts +1381 -0
- package/src/prover/smt/solver/lbool.ts +5 -0
- package/src/prover/smt/solver/literal.ts +24 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prover/smt/solver/lp/constraints.ts +78 -0
- package/src/prover/smt/solver/lp/containers.ts +296 -0
- package/src/prover/smt/solver/lp/core-solver.ts +504 -0
- package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prover/smt/solver/lp/dependency.ts +51 -0
- package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prover/smt/solver/lp/explanation.ts +46 -0
- package/src/prover/smt/solver/lp/gomory.ts +255 -0
- package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prover/smt/solver/lp/hnf.ts +281 -0
- package/src/prover/smt/solver/lp/int-cube.ts +295 -0
- package/src/prover/smt/solver/lp/int-solver.ts +514 -0
- package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prover/smt/solver/lp/lar-term.ts +62 -0
- package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prover/smt/solver/lp/nex.ts +120 -0
- package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prover/smt/solver/lp/nla-core.ts +968 -0
- package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prover/smt/solver/lp/nla-order.ts +307 -0
- package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prover/smt/solver/lp/nla-types.ts +124 -0
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prover/smt/solver/lp/pdd.ts +971 -0
- package/src/prover/smt/solver/lp/random-updater.ts +138 -0
- package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prover/smt/solver/lp/union-find.ts +96 -0
- package/src/prover/smt/solver/mam-compiler.ts +847 -0
- package/src/prover/smt/solver/mam-interpreter.ts +400 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prover/smt/solver/model-checker.ts +347 -0
- package/src/prover/smt/solver/model-evaluator.ts +262 -0
- package/src/prover/smt/solver/model-finder.ts +155 -0
- package/src/prover/smt/solver/model-generator.ts +97 -0
- package/src/prover/smt/solver/model-macro-solver.ts +728 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prover/smt/solver/nlsat/explain.ts +607 -0
- package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prover/smt/solver/nlsat/solver.ts +911 -0
- package/src/prover/smt/solver/nlsat/types.ts +43 -0
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prover/smt/solver/nnf.ts +469 -0
- package/src/prover/smt/solver/pattern-inference.ts +351 -0
- package/src/prover/smt/solver/poly-rewriter.ts +477 -0
- package/src/prover/smt/solver/propagate-values.ts +83 -0
- package/src/prover/smt/solver/proto-model.ts +551 -0
- package/src/prover/smt/solver/pull-quant.ts +139 -0
- package/src/prover/smt/solver/qe-lite-der.ts +526 -0
- package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prover/smt/solver/qe-lite.ts +381 -0
- package/src/prover/smt/solver/qi-queue.ts +362 -0
- package/src/prover/smt/solver/quant-tactics.ts +117 -0
- package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prover/smt/solver/quantifier-manager.ts +186 -0
- package/src/prover/smt/solver/random-gen.ts +10 -0
- package/src/prover/smt/solver/rational.ts +165 -0
- package/src/prover/smt/solver/ref-vector.ts +62 -0
- package/src/prover/smt/solver/relevancy.ts +247 -0
- package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prover/smt/solver/rewriter.ts +843 -0
- package/src/prover/smt/solver/rlimit.ts +79 -0
- package/src/prover/smt/solver/smtlib-parser.ts +526 -0
- package/src/prover/smt/solver/solver.ts +71 -0
- package/src/prover/smt/solver/sort.ts +35 -0
- package/src/prover/smt/solver/sticky-generations.ts +69 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prover/smt/solver/theory-lra-model.ts +243 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prover/smt/solver/theory-lra-state.ts +43 -0
- package/src/prover/smt/solver/theory-lra.ts +56 -0
- package/src/prover/smt/solver/var-subst.ts +258 -0
- package/src/prover/smt/solver/z3-license.txt +10 -0
- package/src/prover/smt/table.ts +170 -0
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/prover/tlapm/tlapm.ts +96 -0
- package/src/prover/tlaps-module.ts +510 -0
- package/src/prover/verdict.ts +13 -0
- package/src/prover/zenon/LICENSE +32 -0
- package/src/prover/zenon/check/check.ts +105 -0
- package/src/prover/zenon/check/definitions.ts +144 -0
- package/src/prover/zenon/check/equality.ts +182 -0
- package/src/prover/zenon/check/functions.ts +62 -0
- package/src/prover/zenon/check/keys.ts +125 -0
- package/src/prover/zenon/check/propositional.ts +104 -0
- package/src/prover/zenon/check/records.ts +188 -0
- package/src/prover/zenon/check/relations.ts +121 -0
- package/src/prover/zenon/check/rewrites.ts +224 -0
- package/src/prover/zenon/check/sets.ts +302 -0
- package/src/prover/zenon/check/terms.ts +127 -0
- package/src/prover/zenon/check/tla.ts +126 -0
- package/src/prover/zenon/decide.ts +107 -0
- package/src/prover/zenon/encode.ts +378 -0
- package/src/prover/zenon/eqrel.ts +300 -0
- package/src/prover/zenon/equality-rules.ts +435 -0
- package/src/prover/zenon/expr.ts +551 -0
- package/src/prover/zenon/index-table.ts +350 -0
- package/src/prover/zenon/isar-case.ts +513 -0
- package/src/prover/zenon/isar.ts +1249 -0
- package/src/prover/zenon/limits.ts +15 -0
- package/src/prover/zenon/llproof.ts +173 -0
- package/src/prover/zenon/mltoll.ts +1566 -0
- package/src/prover/zenon/node.ts +297 -0
- package/src/prover/zenon/ocaml.ts +169 -0
- package/src/prover/zenon/parse.ts +247 -0
- package/src/prover/zenon/phrase.ts +191 -0
- package/src/prover/zenon/proof.ts +198 -0
- package/src/prover/zenon/propositional-rules.ts +387 -0
- package/src/prover/zenon/rules.ts +94 -0
- package/src/prover/zenon/search.ts +288 -0
- package/src/prover/zenon/tla/functions.ts +151 -0
- package/src/prover/zenon/tla/llproof.ts +480 -0
- package/src/prover/zenon/tla/records.ts +225 -0
- package/src/prover/zenon/tla/rewrites.ts +447 -0
- package/src/prover/zenon/tla/sets.ts +304 -0
- package/src/prover/zenon/tla/terms.ts +162 -0
- package/src/prover/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +19 -24
- package/src/resolve.ts +15 -22
- package/src/runtime.ts +8 -8
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +38 -55
- package/src/{sany-levels.ts → sany/levels.ts} +45 -48
- package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +16 -17
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
- package/src/{sany-source.ts → sany/source.ts} +6 -7
- package/src/{sany-xml.ts → sany/xml.ts} +5 -6
- package/src/search.ts +969 -0
- package/src/spec-description.ts +26 -20
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +16 -20
- package/src/state-graph.ts +9 -8
- package/src/substitution-levels.ts +2 -2
- package/src/successors.ts +38 -22
- package/src/symmetry.ts +1 -1
- package/src/tableau.ts +6 -7
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +3 -190
- package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
- package/src/{tlc-version.ts → tlc/version.ts} +8 -7
- package/src/transfer.ts +32 -32
- package/src/values.ts +119 -71
- package/src/worker.ts +62 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -55
- package/dist/run-cli.js +0 -55
- package/src/canonical.ts +0 -40
- package/src/obligation-expression.ts +0 -1060
- package/src/obligation-module.ts +0 -1042
- package/src/standard-ranges.ts +0 -116
- package/src/value-sources.ts +0 -29
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
package/src/values.ts
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
import { TlaEvaluationError
|
|
1
|
+
import { TlaEvaluationError } from "./errors";
|
|
2
2
|
import { prettyPrint } from "./pretty-print";
|
|
3
|
-
import type { TlcVersion } from "./tlc
|
|
3
|
+
import type { TlcVersion } from "./tlc/version";
|
|
4
4
|
|
|
5
5
|
export interface ModelValue {
|
|
6
6
|
kind: "ModelValue";
|
|
@@ -161,6 +161,9 @@ export const isFunctionValue = (value: Value): value is FunctionValue | LazyFunc
|
|
|
161
161
|
export const isModelValue = (value: Value): value is ModelValue =>
|
|
162
162
|
typeof value === "object" && value.kind === "ModelValue";
|
|
163
163
|
|
|
164
|
+
export const isEnumeratedSet = (value: Value): value is SetValue | MixedSetValue =>
|
|
165
|
+
typeof value === "object" && (value.kind === "Set" || value.kind === "MixedSet");
|
|
166
|
+
|
|
164
167
|
export const describeKind = (value: Value) => {
|
|
165
168
|
if (typeof value === "boolean") return "boolean";
|
|
166
169
|
if (typeof value === "number") return "integer";
|
|
@@ -169,12 +172,8 @@ export const describeKind = (value: Value) => {
|
|
|
169
172
|
return isSetValue(value) ? "set" : "function";
|
|
170
173
|
};
|
|
171
174
|
|
|
172
|
-
export const
|
|
173
|
-
|
|
174
|
-
throw new TlaModuleError(`Integer overflow: ${value} is outside TLC's 32-bit range`);
|
|
175
|
-
}
|
|
176
|
-
return value;
|
|
177
|
-
};
|
|
175
|
+
export const isTlcInteger = (value: number) =>
|
|
176
|
+
Number.isInteger(value) && value <= MAXIMUM_INTEGER && value >= MINIMUM_INTEGER;
|
|
178
177
|
|
|
179
178
|
// TLC keeps a record, or a function with string keys that @@ builds, in the order the spec writes
|
|
180
179
|
// it until it sorts the value to compare or fingerprint it. ToString, Assert, and error messages
|
|
@@ -189,7 +188,7 @@ const setWrittenOrder = (functionValue: FunctionValue, keys: Value[]) => {
|
|
|
189
188
|
|
|
190
189
|
export const getWrittenPairs = (functionValue: FunctionValue): [Value, Value][] => {
|
|
191
190
|
const keys = functionValue.writtenKeys ?? functionValue.domain;
|
|
192
|
-
return keys.map((key) => [key, functionValue.range[
|
|
191
|
+
return keys.map((key) => [key, functionValue.range[findSortedIndex(functionValue.domain, key)]]);
|
|
193
192
|
};
|
|
194
193
|
|
|
195
194
|
export const createWrittenRecord = (names: Value[], range: Value[], writtenNames: Value[]) =>
|
|
@@ -234,7 +233,13 @@ const compareFunctions = (left: FunctionValue, right: FunctionValue) => {
|
|
|
234
233
|
const rightRange = right.range;
|
|
235
234
|
if (leftRange === rightRange) return 0;
|
|
236
235
|
for (let index = 0; index < leftRange.length; index++) {
|
|
237
|
-
const
|
|
236
|
+
const leftValue = leftRange[index];
|
|
237
|
+
const rightValue = rightRange[index];
|
|
238
|
+
// V8 can't inline the recursive compareValues here, so two numbers skip the call.
|
|
239
|
+
const valueComparison =
|
|
240
|
+
typeof leftValue === "number" && typeof rightValue === "number"
|
|
241
|
+
? leftValue - rightValue
|
|
242
|
+
: compareValues(leftValue, rightValue);
|
|
238
243
|
if (valueComparison !== 0) return valueComparison;
|
|
239
244
|
}
|
|
240
245
|
return 0;
|
|
@@ -416,7 +421,7 @@ export const compareValues = (left: Value, right: Value): number => {
|
|
|
416
421
|
|
|
417
422
|
const modelValues = new Map<string, ModelValue>();
|
|
418
423
|
|
|
419
|
-
//
|
|
424
|
+
// setStringOrder clears the model values, so each check ranks and creates its own.
|
|
420
425
|
export const createModelValue = (name: string): ModelValue => {
|
|
421
426
|
const known = modelValues.get(name);
|
|
422
427
|
if (known) return known;
|
|
@@ -538,9 +543,6 @@ export const markFingerprinted = (value: Value): void => {
|
|
|
538
543
|
}
|
|
539
544
|
};
|
|
540
545
|
|
|
541
|
-
export const createSortedRecord = (names: Value[], range: Value[]) =>
|
|
542
|
-
setFunctionClass(createSortedFunction(names, range), "record");
|
|
543
|
-
|
|
544
546
|
export const valuesEqual = (left: Value, right: Value): boolean => {
|
|
545
547
|
cacheSet(left);
|
|
546
548
|
if (left === right) {
|
|
@@ -619,9 +621,14 @@ export const valuesEqual = (left: Value, right: Value): boolean => {
|
|
|
619
621
|
// TLC prints and words errors about an equal function by its Java class, so a value can stand for
|
|
620
622
|
// another in a state only if each function in it has the same class.
|
|
621
623
|
const createSameValueCheck = (isClassSensitive: boolean) => {
|
|
622
|
-
const areSameValues = (left: Value[], right: Value[]) =>
|
|
623
|
-
left === right
|
|
624
|
-
(left.length
|
|
624
|
+
const areSameValues = (left: Value[], right: Value[]) => {
|
|
625
|
+
if (left === right) return true;
|
|
626
|
+
if (left.length !== right.length) return false;
|
|
627
|
+
for (let index = 0; index < left.length; index++) {
|
|
628
|
+
if (!isSame(left[index], right[index])) return false;
|
|
629
|
+
}
|
|
630
|
+
return true;
|
|
631
|
+
};
|
|
625
632
|
const isSame = (left: Value, right: Value): boolean => {
|
|
626
633
|
if (left === right) return true;
|
|
627
634
|
if (typeof left !== "object" || typeof right !== "object") return false;
|
|
@@ -644,7 +651,48 @@ const createSameValueCheck = (isClassSensitive: boolean) => {
|
|
|
644
651
|
|
|
645
652
|
export const isSameValue = createSameValueCheck(false);
|
|
646
653
|
|
|
647
|
-
|
|
654
|
+
const isInterchangeableValue = createSameValueCheck(true);
|
|
655
|
+
|
|
656
|
+
const canonicalizeElements = (elements: Value[], canonicalize: (value: Value) => Value) => {
|
|
657
|
+
for (let index = 0; index < elements.length; index++) {
|
|
658
|
+
elements[index] = canonicalize(elements[index]);
|
|
659
|
+
}
|
|
660
|
+
};
|
|
661
|
+
|
|
662
|
+
// Replaces each set and function in a state with the first interchangeable one it has seen, so that
|
|
663
|
+
// the states it keeps share their values.
|
|
664
|
+
export const createCanonicalizer = () => {
|
|
665
|
+
const canonicalValues = new Map<number, Value | Value[]>();
|
|
666
|
+
const canonicalize = (value: Value): Value => {
|
|
667
|
+
if (typeof value !== "object" || (value.kind !== "Set" && value.kind !== "Function")) {
|
|
668
|
+
return value;
|
|
669
|
+
}
|
|
670
|
+
const hash = getValueHash(value);
|
|
671
|
+
const bucket = canonicalValues.get(hash);
|
|
672
|
+
if (bucket !== undefined && !Array.isArray(bucket)) {
|
|
673
|
+
if (bucket === value || isInterchangeableValue(bucket, value)) return bucket;
|
|
674
|
+
}
|
|
675
|
+
if (Array.isArray(bucket)) {
|
|
676
|
+
for (let index = 0; index < bucket.length; index++) {
|
|
677
|
+
if (bucket[index] === value || isInterchangeableValue(bucket[index], value))
|
|
678
|
+
return bucket[index];
|
|
679
|
+
}
|
|
680
|
+
}
|
|
681
|
+
if (value.kind === "Set") canonicalizeElements(value.elements, canonicalize);
|
|
682
|
+
else {
|
|
683
|
+
canonicalizeElements(value.domain, canonicalize);
|
|
684
|
+
canonicalizeElements(value.range, canonicalize);
|
|
685
|
+
}
|
|
686
|
+
if (bucket === undefined) canonicalValues.set(hash, value);
|
|
687
|
+
else if (Array.isArray(bucket)) bucket.push(value);
|
|
688
|
+
else canonicalValues.set(hash, [bucket, value]);
|
|
689
|
+
return value;
|
|
690
|
+
};
|
|
691
|
+
return (state: Value[]) => {
|
|
692
|
+
for (let index = 0; index < state.length; index++) state[index] = canonicalize(state[index]);
|
|
693
|
+
return state;
|
|
694
|
+
};
|
|
695
|
+
};
|
|
648
696
|
|
|
649
697
|
// The comparisons above fail with their own messages. These follow the compareTo and equals
|
|
650
698
|
// methods of TLC's Java value classes, which word a failure by the class of the left operand, so a
|
|
@@ -678,56 +726,25 @@ const toTlcRecord = (value: Value) => {
|
|
|
678
726
|
return functionValue.domain.every((key) => typeof key === "string") ? functionValue : undefined;
|
|
679
727
|
};
|
|
680
728
|
|
|
729
|
+
// A model value compared with a value of another kind. The other value is never a model value.
|
|
681
730
|
const compareModelValueWith = (modelValue: ModelValue, other: Value) => {
|
|
682
|
-
|
|
683
|
-
throw new TlaEvaluationError(
|
|
684
|
-
`Attempted to compare the typed model value ${formatValue(modelValue)} and the non-model value\n${formatValue(other)}`,
|
|
685
|
-
);
|
|
686
|
-
}
|
|
731
|
+
checkModelValueTypes(other, modelValue, false);
|
|
687
732
|
return 1;
|
|
688
733
|
};
|
|
689
734
|
|
|
690
735
|
const equalsModelValueWith = (modelValue: ModelValue, other: Value) => {
|
|
691
|
-
|
|
692
|
-
throw new TlaEvaluationError(
|
|
693
|
-
`Attempted to check equality of the typed model value ${formatValue(modelValue)} and the non-model value\n${formatValue(other)}`,
|
|
694
|
-
);
|
|
695
|
-
}
|
|
736
|
+
checkModelValueTypes(other, modelValue, true);
|
|
696
737
|
return false;
|
|
697
738
|
};
|
|
698
739
|
|
|
699
740
|
const compareModelValue = (left: ModelValue, right: Value) => {
|
|
700
|
-
|
|
701
|
-
|
|
702
|
-
if (!isModelValue(right)) {
|
|
703
|
-
throw new TlaEvaluationError(
|
|
704
|
-
`Attempted to compare the typed model value ${formatValue(left)} and non-model value\n${formatValue(right)}`,
|
|
705
|
-
);
|
|
706
|
-
}
|
|
707
|
-
const otherType = getModelValueType(right);
|
|
708
|
-
if (otherType !== undefined && otherType !== type) {
|
|
709
|
-
throw new TlaEvaluationError(
|
|
710
|
-
`Attempted to compare the differently-typed model values ${formatValue(left)} and ${formatValue(right)}`,
|
|
711
|
-
);
|
|
712
|
-
}
|
|
713
|
-
return left.rank - right.rank;
|
|
741
|
+
if (left.type !== undefined) checkModelValueTypes(left, right, false);
|
|
742
|
+
return isModelValue(right) ? left.rank - right.rank : -1;
|
|
714
743
|
};
|
|
715
744
|
|
|
716
745
|
const equalsModelValue = (left: ModelValue, right: Value) => {
|
|
717
|
-
|
|
718
|
-
|
|
719
|
-
if (!isModelValue(right)) {
|
|
720
|
-
throw new TlaEvaluationError(
|
|
721
|
-
`Attempted to check equality of typed model value ${formatValue(left)} and non-model value\n${formatValue(right)}`,
|
|
722
|
-
);
|
|
723
|
-
}
|
|
724
|
-
const otherType = getModelValueType(right);
|
|
725
|
-
if (otherType !== undefined && otherType !== type) {
|
|
726
|
-
throw new TlaEvaluationError(
|
|
727
|
-
`Attempted to check equality of the differently-typed model values ${formatValue(left)} and ${formatValue(right)}`,
|
|
728
|
-
);
|
|
729
|
-
}
|
|
730
|
-
return left.name === right.name;
|
|
746
|
+
if (left.type !== undefined) checkModelValueTypes(left, right, true);
|
|
747
|
+
return isModelValue(right) && left.name === right.name;
|
|
731
748
|
};
|
|
732
749
|
|
|
733
750
|
const SCALAR_KINDS = {
|
|
@@ -822,9 +839,6 @@ const compareFunctionLikeTlc = (left: FunctionValue | LazyFunctionValue, right:
|
|
|
822
839
|
);
|
|
823
840
|
};
|
|
824
841
|
|
|
825
|
-
export const isEnumeratedSet = (value: Value): value is SetValue | MixedSetValue =>
|
|
826
|
-
typeof value === "object" && (value.kind === "Set" || value.kind === "MixedSet");
|
|
827
|
-
|
|
828
842
|
// TLC compares a lazy set, or a set it overrides in Java, through its own class before it compares
|
|
829
843
|
// elements. The comparisons above already fail as those classes do.
|
|
830
844
|
const isComparedByClass = (left: ObjectValue, right: Value) =>
|
|
@@ -1058,7 +1072,7 @@ export const createEnumeratedSet = (elements: Value[]): SetValue | MixedSetValue
|
|
|
1058
1072
|
|
|
1059
1073
|
export const EMPTY_SET = createSortedSet([]);
|
|
1060
1074
|
|
|
1061
|
-
export const
|
|
1075
|
+
export const getSortedDifference = (left: SetValue, right: SetValue): SetValue => {
|
|
1062
1076
|
if (left.elements.length === 0 || right.elements.length === 0) return left;
|
|
1063
1077
|
const leftElements = left.elements;
|
|
1064
1078
|
const rightElements = right.elements;
|
|
@@ -1083,7 +1097,7 @@ export const differenceSorted = (left: SetValue, right: SetValue): SetValue => {
|
|
|
1083
1097
|
return kept.length === leftElements.length ? left : createSortedSet(kept);
|
|
1084
1098
|
};
|
|
1085
1099
|
|
|
1086
|
-
export const
|
|
1100
|
+
export const getSortedIntersection = (left: SetValue, right: SetValue): SetValue => {
|
|
1087
1101
|
const leftElements = left.elements;
|
|
1088
1102
|
const rightElements = right.elements;
|
|
1089
1103
|
const kept: Value[] = [];
|
|
@@ -1106,7 +1120,7 @@ export const intersectSorted = (left: SetValue, right: SetValue): SetValue => {
|
|
|
1106
1120
|
return kept.length === leftElements.length ? left : createSortedSet(kept);
|
|
1107
1121
|
};
|
|
1108
1122
|
|
|
1109
|
-
export const
|
|
1123
|
+
export const getSortedUnion = (left: SetValue, right: SetValue): SetValue => {
|
|
1110
1124
|
if (left.elements.length === 0) return right;
|
|
1111
1125
|
if (right.elements.length === 0) return left;
|
|
1112
1126
|
const leftElements = left.elements;
|
|
@@ -1231,6 +1245,9 @@ export const createTuple = (elements: Value[]): FunctionValue =>
|
|
|
1231
1245
|
export const createRecord = (fields: [string, Value][]): FunctionValue =>
|
|
1232
1246
|
setFunctionClass(createFunction(fields), "record");
|
|
1233
1247
|
|
|
1248
|
+
export const createSortedRecord = (names: Value[], range: Value[]) =>
|
|
1249
|
+
setFunctionClass(createSortedFunction(names, range), "record");
|
|
1250
|
+
|
|
1234
1251
|
// TLC's Enumerable classes: every set except the ones it implements in Java.
|
|
1235
1252
|
export const isTlcEnumerable = (value: Value) => isSetValue(value) && !isOverriddenSet(value);
|
|
1236
1253
|
|
|
@@ -1530,7 +1547,7 @@ const enumerateSet = (
|
|
|
1530
1547
|
);
|
|
1531
1548
|
}
|
|
1532
1549
|
if (value.operator === "\\cup")
|
|
1533
|
-
return
|
|
1550
|
+
return getSortedUnion(toFiniteSet(value.left), toFiniteSet(value.right)).elements;
|
|
1534
1551
|
const isLeftEnumerated = value.operator === "\\" || isTlcEnumerable(value.left);
|
|
1535
1552
|
const enumerated = isLeftEnumerated ? value.left : value.right;
|
|
1536
1553
|
const other = isLeftEnumerated ? value.right : value.left;
|
|
@@ -1595,6 +1612,38 @@ const getCombinedSets = (value: ObjectValue) =>
|
|
|
1595
1612
|
? [value.range]
|
|
1596
1613
|
: undefined;
|
|
1597
1614
|
|
|
1615
|
+
// Whether a value TLC builds alike at each evaluation and that enumerating, comparing or
|
|
1616
|
+
// fingerprinting it leaves alike, so that one evaluation can stand for the next. It holds no UNION or
|
|
1617
|
+
// \cup, which streams until TLC caches it, no lambda, which fingerprinting turns into a record, and
|
|
1618
|
+
// no record a comparison reorders.
|
|
1619
|
+
export const isSettledValue = (value: Value): boolean => {
|
|
1620
|
+
if (typeof value !== "object") return true;
|
|
1621
|
+
switch (value.kind) {
|
|
1622
|
+
case "ModelValue":
|
|
1623
|
+
case "Interval":
|
|
1624
|
+
return true;
|
|
1625
|
+
case "Set":
|
|
1626
|
+
return value.elements.every(isSettledValue);
|
|
1627
|
+
case "Function":
|
|
1628
|
+
return (
|
|
1629
|
+
value.functionClass !== "lambda" &&
|
|
1630
|
+
value.writtenKeys === undefined &&
|
|
1631
|
+
value.domain.every(isSettledValue) &&
|
|
1632
|
+
value.range.every(isSettledValue)
|
|
1633
|
+
);
|
|
1634
|
+
case "SetOperation":
|
|
1635
|
+
return (
|
|
1636
|
+
value.operator !== "\\cup" && isSettledValue(value.left) && isSettledValue(value.right)
|
|
1637
|
+
);
|
|
1638
|
+
case "FilteredSet":
|
|
1639
|
+
return isSettledValue(value.base);
|
|
1640
|
+
case "ProductSet":
|
|
1641
|
+
return value.factors.every(isSettledValue);
|
|
1642
|
+
default:
|
|
1643
|
+
return false;
|
|
1644
|
+
}
|
|
1645
|
+
};
|
|
1646
|
+
|
|
1598
1647
|
// Whether a set streams its elements in another order than the normalized set, so that a set of
|
|
1599
1648
|
// tuples, records, or functions it is a component of has to stream too.
|
|
1600
1649
|
const isStreamedApart = (value: Value): boolean => {
|
|
@@ -1686,10 +1735,8 @@ const describeOverflow = (value: Value) =>
|
|
|
1686
1735
|
// checking whether one is empty, so an infinite component fails even beside an empty one.
|
|
1687
1736
|
export const getCardinality = (value: Value, version?: TlcVersion): number => {
|
|
1688
1737
|
if (typeof value !== "object") {
|
|
1689
|
-
const kind =
|
|
1690
|
-
typeof value === "number" ? "integer" : typeof value === "string" ? "string" : "boolean";
|
|
1691
1738
|
throw new TlaEvaluationError(
|
|
1692
|
-
`Attempted to compute the number of elements in the ${
|
|
1739
|
+
`Attempted to compute the number of elements in the ${describeKind(value)} ${formatValue(value)}.`,
|
|
1693
1740
|
);
|
|
1694
1741
|
}
|
|
1695
1742
|
switch (value.kind) {
|
|
@@ -1822,7 +1869,7 @@ export const isFiniteSet = (value: Value): boolean => {
|
|
|
1822
1869
|
}
|
|
1823
1870
|
};
|
|
1824
1871
|
|
|
1825
|
-
const
|
|
1872
|
+
const findSortedIndex = (sortedValues: Value[], target: Value, compare = compareValues) => {
|
|
1826
1873
|
const bounds = { low: 0, high: sortedValues.length - 1 };
|
|
1827
1874
|
while (bounds.low <= bounds.high) {
|
|
1828
1875
|
const middle = (bounds.low + bounds.high) >> 1;
|
|
@@ -1904,7 +1951,8 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1904
1951
|
return isElement;
|
|
1905
1952
|
};
|
|
1906
1953
|
|
|
1907
|
-
const isInSortedSet = (element: Value, set: SetValue) =>
|
|
1954
|
+
const isInSortedSet = (element: Value, set: SetValue) =>
|
|
1955
|
+
findSortedIndex(set.elements, element) !== -1;
|
|
1908
1956
|
|
|
1909
1957
|
const isInSortedSetLikeTlc = (element: Value, set: SetValue) =>
|
|
1910
1958
|
normalizedSets.has(set)
|
|
@@ -1979,7 +2027,7 @@ const isElementOfSet = (element: Value, set: Value): boolean => {
|
|
|
1979
2027
|
return (
|
|
1980
2028
|
functionValue.domain.length === set.names.length &&
|
|
1981
2029
|
set.names.every((name, index) => {
|
|
1982
|
-
const position =
|
|
2030
|
+
const position = findSortedIndex(functionValue.domain, name);
|
|
1983
2031
|
return position !== -1 && isElementOf(functionValue.range[position], set.sets[index]);
|
|
1984
2032
|
})
|
|
1985
2033
|
);
|
|
@@ -2133,7 +2181,7 @@ const failKeyLikeTlc = (domain: Value[], argument: Value, error: TlaEvaluationEr
|
|
|
2133
2181
|
if (valueVersion.is174 || domain.length < LINEAR_SEARCH_LIMIT) {
|
|
2134
2182
|
domain.forEach((key) => equalsLikeTlc(key, argument));
|
|
2135
2183
|
} else {
|
|
2136
|
-
|
|
2184
|
+
findSortedIndex(domain, argument, compareLikeTlc);
|
|
2137
2185
|
}
|
|
2138
2186
|
throw error;
|
|
2139
2187
|
};
|
|
@@ -2160,7 +2208,7 @@ const findKeyIndexLikeTlc = (
|
|
|
2160
2208
|
}
|
|
2161
2209
|
const identical = findIdenticalKey(domain, argument);
|
|
2162
2210
|
if (identical !== -1) return identical;
|
|
2163
|
-
return computeLikeTlcOnFailure(
|
|
2211
|
+
return computeLikeTlcOnFailure(findSortedIndex, failKeyLikeTlc, domain, argument);
|
|
2164
2212
|
};
|
|
2165
2213
|
|
|
2166
2214
|
export const applyFunction = (
|
package/src/worker.ts
ADDED
|
@@ -0,0 +1,62 @@
|
|
|
1
|
+
// Worker threads as Web Workers, or as Node's worker_threads where there are none.
|
|
2
|
+
|
|
3
|
+
const WORKER_THREADS_MODULE = "node:worker_threads";
|
|
4
|
+
|
|
5
|
+
export interface Port {
|
|
6
|
+
postMessage: (message: unknown, transfer?: unknown[]) => void;
|
|
7
|
+
addEventListener: (type: "message", listener: (event: { data: unknown }) => void) => void;
|
|
8
|
+
removeEventListener?: (type: "message", listener: (event: { data: unknown }) => void) => void;
|
|
9
|
+
start?: () => void;
|
|
10
|
+
}
|
|
11
|
+
|
|
12
|
+
export interface WorkerHandle {
|
|
13
|
+
postMessage: (message: unknown, transfer?: unknown[]) => void;
|
|
14
|
+
terminate: () => void;
|
|
15
|
+
}
|
|
16
|
+
|
|
17
|
+
interface WebWorker {
|
|
18
|
+
postMessage: (message: unknown, transfer?: unknown[]) => void;
|
|
19
|
+
addEventListener: (type: string, listener: (event: { data: unknown }) => void) => void;
|
|
20
|
+
terminate: () => void;
|
|
21
|
+
}
|
|
22
|
+
|
|
23
|
+
declare const Worker: new (url: URL, options: { type: "module" }) => WebWorker;
|
|
24
|
+
|
|
25
|
+
export const isWorkerSupported = () =>
|
|
26
|
+
typeof Worker === "function" ||
|
|
27
|
+
(typeof process !== "undefined" && process.versions?.node !== undefined);
|
|
28
|
+
|
|
29
|
+
// The caller writes url as new URL("./name.js", import.meta.url) for bundlers to find.
|
|
30
|
+
export const spawnWorker = async (
|
|
31
|
+
url: URL,
|
|
32
|
+
onMessage: (message: unknown) => void,
|
|
33
|
+
onError: (error: unknown) => void,
|
|
34
|
+
): Promise<WorkerHandle> => {
|
|
35
|
+
if (typeof Worker === "function") {
|
|
36
|
+
const worker = new Worker(url, { type: "module" });
|
|
37
|
+
worker.addEventListener("message", (event) => onMessage(event.data));
|
|
38
|
+
worker.addEventListener("error", onError);
|
|
39
|
+
return worker;
|
|
40
|
+
}
|
|
41
|
+
const threads: typeof import("node:worker_threads") = await import(
|
|
42
|
+
/* @vite-ignore */ /* webpackIgnore: true */ WORKER_THREADS_MODULE
|
|
43
|
+
);
|
|
44
|
+
const worker = new threads.Worker(url);
|
|
45
|
+
worker.on("message", onMessage);
|
|
46
|
+
worker.on("error", onError);
|
|
47
|
+
return {
|
|
48
|
+
postMessage: (message, transfer) =>
|
|
49
|
+
worker.postMessage(message, transfer as Parameters<typeof worker.postMessage>[1]),
|
|
50
|
+
terminate: () => void worker.terminate(),
|
|
51
|
+
};
|
|
52
|
+
};
|
|
53
|
+
|
|
54
|
+
export const getParentPort = async () => {
|
|
55
|
+
if (typeof (globalThis as { postMessage?: unknown }).postMessage === "function") {
|
|
56
|
+
return globalThis as unknown as Port;
|
|
57
|
+
}
|
|
58
|
+
const threads: typeof import("node:worker_threads") = await import(
|
|
59
|
+
/* @vite-ignore */ /* webpackIgnore: true */ WORKER_THREADS_MODULE
|
|
60
|
+
);
|
|
61
|
+
return threads.parentPort as unknown as Port;
|
|
62
|
+
};
|
package/dist/parallel.cjs
DELETED
|
@@ -1,12 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* @license tla-ts
|
|
3
|
-
*
|
|
4
|
-
* Copyright (c) Aiden Bai
|
|
5
|
-
*
|
|
6
|
-
* This source code is licensed under the MIT license found in the
|
|
7
|
-
* LICENSE file in the root directory of this source tree.
|
|
8
|
-
*/
|
|
9
|
-
const e=require("./transfer.cjs"),t=async e=>{if(typeof Worker==`function`){let t=new Worker(new URL(`./parallel-worker.js`,require("url").pathToFileURL(__filename).href),{type:`module`});return t.addEventListener(`message`,t=>e(t.data)),t.addEventListener(`error`,()=>e({type:`abort`})),t}let t=new(await(import(
|
|
10
|
-
/* @vite-ignore */
|
|
11
|
-
/* webpackIgnore: true */
|
|
12
|
-
`node:worker_threads`))).Worker(new URL(`./parallel-worker.js`,require("url").pathToFileURL(__filename).href));return t.on(`message`,e),t.on(`error`,()=>e({type:`abort`})),{postMessage:(e,n)=>t.postMessage(e,n),terminate:()=>void t.terminate()}},n=async n=>{let r=typeof n.config==`string`?e.Z(n.config,n.version):n.config,i=n.onPrint??console.log,a={count:0},o=e=>[e.kind,`name`in e?e.name:``,`count`in e?e.count:``,`text`in e?e.text:``].join(` `),s=/* @__PURE__ */ new Set,c=e=>{s.add(o(e)),n.onProgress?.(e)},l=()=>{let t={count:a.count};return e.l({...n,config:r,onPrint:e=>t.count-->0?void 0:i(e),onProgress:e=>{s.has(o(e))||n.onProgress?.(e)}})},u=n.workers??1;if(u<2||typeof SharedArrayBuffer!=`function`||n.dump!==void 0||r.view!==void 0||r.postconditions.length>0||r.possible.length>0)return l();let d=/* @__PURE__ */ new Map,f=e=>{let t=n.loadModule?.(e);return d.set(e,t),t},p=/* @__PURE__ */ new Map,m=e=>{let t=n.loadClass?.(e);return p.set(e,t),t};e.Y(e.x(n.source,r,f)),e.X(n.version);let h=e.J(),g=e.y(r,{source:n.source,loadModule:f,loadClass:m,print:e=>{a.count++,i(e)},files:{readFile:n.readFile,writeFile:n.writeFile},isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isSanyReported:n.isSanyReported,isWarningEnabled:n.isWarningEnabled,version:n.version});e.p(g,r,c);let _=g.environment,v=e.u(r,_,()=>e.S(n.source,f),c);if(e.d(g.assumptions,_)||!v||v.spec.init===void 0||v.spec.next===void 0||v.properties.liveness.length>0||e.N(_))return l();let y=e.G(),b={fingerprints:e.i()},x=/* @__PURE__ */ new Int32Array(2),S=Array.from({length:u},e.n),C={generatedStates:0,distinctStates:0,queuedStates:0,depth:0,initialStates:void 0,outDegrees:Array.from({length:32},()=>0)},w=[],T=()=>({status:`success`,violation:void 0,failure:void 0,...C,fingerprintDistance:e.g(C.distinctStates,C.generatedStates,()=>{let e=new BigInt64Array(C.distinctStates);return w.reduce((t,n)=>(e.set(n,t),t+n.length),0),e})}),E=t=>{let n=[];for(let r of e.P(t,_,v.spec.scope))if(e.f(C.generatedStates,c),y(r),C.generatedStates++,e.c(v.getFingerprintState(r),x),e.s(b.fingerprints)&&(b.fingerprints=e.a(b.fingerprints)),e.o(b.fingerprints,x[0],x[1])){if(v.findViolatedInvariant(r)||v.findFailedInitialPredicate(r))return!1;if(v.satisfiesConstraints(r)){if(!S[n.length%u].encode(r))return!1;n.push(r),C.distinctStates++}}return w.push(BigInt64Array.from(n,e=>_.runtime.getFingerprint(e))),!0};c({kind:`initial-states-started`});try{if(!E(v.spec.init))return l()}catch(t){if(!(t instanceof e.st))throw t;return l()}if(e.J()!==h)return l();if(C.depth=C.generatedStates===0?0:1,C.initialStates={generated:C.generatedStates,distinct:C.distinctStates},c({kind:`initial-states-computed`,initialStates:C.initialStates}),C.distinctStates===0)return T();let D=[],O={count:u,resolve:e=>{}},k=e=>{D.push(e),(e.type===`abort`||D.length===O.count)&&O.resolve(D.splice(0))},A=e=>new Promise(t=>{O.count=e,O.resolve=t}),j=A(u),M=new Int32Array(new SharedArrayBuffer(u*4)),N=new Int32Array(new SharedArrayBuffer(u*4)),P=await Promise.all(Array.from({length:u},()=>t(k))),F=()=>P.forEach(e=>e.terminate()),I=/* @__PURE__ */ new Map,L=(e,t)=>{let n=e<t?`${e}:${t}`:`${t}:${e}`,r=I.get(n)??new MessageChannel;return I.set(n,r),e<t?r.port1:r.port2};P.forEach((e,t)=>{let i=Array.from({length:u},(e,n)=>n===t?void 0:L(t,n)),a=S[t].finish(),o={type:`start`,source:n.source,config:r,modules:[...d],classes:[...p],index:t,ports:i,seed:a,isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isWarningEnabled:n.isWarningEnabled,version:n.version,fingerprints:b.fingerprints,requests:M,remaining:N};e.postMessage(o,[...i.filter(e=>e!==void 0),a.words.buffer])});let R=e=>e.some(e=>e.type===`abort`),z=e=>P.forEach(t=>t.postMessage(e)),B=async t=>{let n=t.filter(e=>e.type===`paused`).length;if(n===0||R(t))return t;b.fingerprints=e.a(b.fingerprints);let r=A(n);return z({type:`resize`,fingerprints:b.fingerprints}),[...t.filter(e=>e.type!==`paused`),...await B(await r)]};if(R(await j))return F(),l();for(let e=1;;e++){let t=A(u);M.forEach((e,t)=>Atomics.store(M,t,0)),z({type:`level`,level:e});let n=await B(await t);if(R(n))return F(),l();let r=n.flatMap(e=>e.type===`level`?[e]:[]),i=r.reduce((e,t)=>e+t.added,0);if(C.generatedStates+=r.reduce((e,t)=>e+t.generated,0),C.distinctStates+=i,r.forEach(e=>{e.outDegrees.forEach((e,t)=>C.outDegrees[t]+=e),w.push(e.fingerprints)}),i===0)return F(),T();C.depth++}};Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return n}});
|
package/dist/parallel.js
DELETED
|
@@ -1,12 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* @license tla-ts
|
|
3
|
-
*
|
|
4
|
-
* Copyright (c) Aiden Bai
|
|
5
|
-
*
|
|
6
|
-
* This source code is licensed under the MIT license found in the
|
|
7
|
-
* LICENSE file in the root directory of this source tree.
|
|
8
|
-
*/
|
|
9
|
-
import{G as e,J as t,N as n,P as r,S as i,X as ee,Y as te,Z as a,a as o,c as ne,d as s,f as c,g as l,i as u,l as d,n as f,o as re,p,s as ie,st as m,u as h,x as g,y as _}from"./transfer.js";const ae=async e=>{if(typeof Worker==`function`){let t=new Worker(new URL(`./parallel-worker.js`,import.meta.url),{type:`module`});return t.addEventListener(`message`,t=>e(t.data)),t.addEventListener(`error`,()=>e({type:`abort`})),t}let t=new(await(import(
|
|
10
|
-
/* @vite-ignore */
|
|
11
|
-
/* webpackIgnore: true */
|
|
12
|
-
`node:worker_threads`))).Worker(new URL(`./parallel-worker.js`,import.meta.url));return t.on(`message`,e),t.on(`error`,()=>e({type:`abort`})),{postMessage:(e,n)=>t.postMessage(e,n),terminate:()=>void t.terminate()}},v=async v=>{let y=typeof v.config==`string`?a(v.config,v.version):v.config,b=v.onPrint??console.log,x={count:0},S=e=>[e.kind,`name`in e?e.name:``,`count`in e?e.count:``,`text`in e?e.text:``].join(` `),C=/* @__PURE__ */ new Set,w=e=>{C.add(S(e)),v.onProgress?.(e)},T=()=>{let e={count:x.count};return d({...v,config:y,onPrint:t=>e.count-->0?void 0:b(t),onProgress:e=>{C.has(S(e))||v.onProgress?.(e)}})},E=v.workers??1;if(E<2||typeof SharedArrayBuffer!=`function`||v.dump!==void 0||y.view!==void 0||y.postconditions.length>0||y.possible.length>0)return T();let D=/* @__PURE__ */ new Map,O=e=>{let t=v.loadModule?.(e);return D.set(e,t),t},k=/* @__PURE__ */ new Map,A=e=>{let t=v.loadClass?.(e);return k.set(e,t),t};te(g(v.source,y,O)),ee(v.version);let oe=t(),j=_(y,{source:v.source,loadModule:O,loadClass:A,print:e=>{x.count++,b(e)},files:{readFile:v.readFile,writeFile:v.writeFile},isTool:v.isTool,isTraceRecorded:v.isTraceRecorded,isSanyReported:v.isSanyReported,isWarningEnabled:v.isWarningEnabled,version:v.version});p(j,y,w);let M=j.environment,N=h(y,M,()=>i(v.source,O),w);if(s(j.assumptions,M)||!N||N.spec.init===void 0||N.spec.next===void 0||N.properties.liveness.length>0||n(M))return T();let P=e(),F={fingerprints:u()},I=/* @__PURE__ */ new Int32Array(2),L=Array.from({length:E},f),R={generatedStates:0,distinctStates:0,queuedStates:0,depth:0,initialStates:void 0,outDegrees:Array.from({length:32},()=>0)},z=[],B=()=>({status:`success`,violation:void 0,failure:void 0,...R,fingerprintDistance:l(R.distinctStates,R.generatedStates,()=>{let e=new BigInt64Array(R.distinctStates);return z.reduce((t,n)=>(e.set(n,t),t+n.length),0),e})}),V=e=>{let t=[];for(let n of r(e,M,N.spec.scope))if(c(R.generatedStates,w),P(n),R.generatedStates++,ne(N.getFingerprintState(n),I),ie(F.fingerprints)&&(F.fingerprints=o(F.fingerprints)),re(F.fingerprints,I[0],I[1])){if(N.findViolatedInvariant(n)||N.findFailedInitialPredicate(n))return!1;if(N.satisfiesConstraints(n)){if(!L[t.length%E].encode(n))return!1;t.push(n),R.distinctStates++}}return z.push(BigInt64Array.from(t,e=>M.runtime.getFingerprint(e))),!0};w({kind:`initial-states-started`});try{if(!V(N.spec.init))return T()}catch(e){if(!(e instanceof m))throw e;return T()}if(t()!==oe)return T();if(R.depth=R.generatedStates===0?0:1,R.initialStates={generated:R.generatedStates,distinct:R.distinctStates},w({kind:`initial-states-computed`,initialStates:R.initialStates}),R.distinctStates===0)return B();let H=[],U={count:E,resolve:e=>{}},W=e=>{H.push(e),(e.type===`abort`||H.length===U.count)&&U.resolve(H.splice(0))},G=e=>new Promise(t=>{U.count=e,U.resolve=t}),K=G(E),q=new Int32Array(new SharedArrayBuffer(E*4)),se=new Int32Array(new SharedArrayBuffer(E*4)),J=await Promise.all(Array.from({length:E},()=>ae(W))),Y=()=>J.forEach(e=>e.terminate()),X=/* @__PURE__ */ new Map,ce=(e,t)=>{let n=e<t?`${e}:${t}`:`${t}:${e}`,r=X.get(n)??new MessageChannel;return X.set(n,r),e<t?r.port1:r.port2};J.forEach((e,t)=>{let n=Array.from({length:E},(e,n)=>n===t?void 0:ce(t,n)),r=L[t].finish(),i={type:`start`,source:v.source,config:y,modules:[...D],classes:[...k],index:t,ports:n,seed:r,isTool:v.isTool,isTraceRecorded:v.isTraceRecorded,isWarningEnabled:v.isWarningEnabled,version:v.version,fingerprints:F.fingerprints,requests:q,remaining:se};e.postMessage(i,[...n.filter(e=>e!==void 0),r.words.buffer])});let Z=e=>e.some(e=>e.type===`abort`),Q=e=>J.forEach(t=>t.postMessage(e)),$=async e=>{let t=e.filter(e=>e.type===`paused`).length;if(t===0||Z(e))return e;F.fingerprints=o(F.fingerprints);let n=G(t);return Q({type:`resize`,fingerprints:F.fingerprints}),[...e.filter(e=>e.type!==`paused`),...await $(await n)]};if(Z(await K))return Y(),T();for(let e=1;;e++){let t=G(E);q.forEach((e,t)=>Atomics.store(q,t,0)),Q({type:`level`,level:e});let n=await $(await t);if(Z(n))return Y(),T();let r=n.flatMap(e=>e.type===`level`?[e]:[]),i=r.reduce((e,t)=>e+t.added,0);if(R.generatedStates+=r.reduce((e,t)=>e+t.generated,0),R.distinctStates+=i,r.forEach(e=>{e.outDegrees.forEach((e,t)=>R.outDegrees[t]+=e),z.push(e.fingerprints)}),i===0)return Y(),B();R.depth++}};export{v as t};
|