tla-ts 0.0.9 → 0.0.10-dev.28c823e4b
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 +29 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +28 -28
- package/dist/deciders.js +43 -43
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +106 -10
- package/dist/index.d.ts +106 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +116 -36
- package/dist/prove.js +116 -36
- package/dist/run.cjs +143 -31
- package/dist/run.js +143 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +129 -104
- package/dist/transfer.js +129 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +4 -23
- package/src/bags.ts +99 -102
- package/src/builtins.ts +40 -78
- package/src/bundled-modules.ts +1 -8
- package/src/check.ts +599 -388
- package/src/cli/options.ts +11 -6
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +18 -11
- package/src/cli/tlapm.ts +0 -12
- package/src/cli/tlc-arguments.ts +640 -0
- package/src/cli/tlc-usage.ts +361 -0
- package/src/cli/tlc.ts +538 -220
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +4 -16
- package/src/cli.ts +0 -1
- package/src/codegen.ts +191 -64
- package/src/config.ts +140 -109
- package/src/coverage.ts +837 -0
- package/src/dependencies.ts +6 -40
- package/src/dfid.ts +618 -0
- package/src/environment.ts +240 -118
- package/src/errors.ts +70 -55
- package/src/evaluate.ts +596 -339
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +10 -10
- package/src/index.ts +3 -0
- package/src/instances.ts +79 -11
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +255 -139
- package/src/levels.ts +8 -17
- package/src/lexer.ts +80 -100
- package/src/liveness-checker.ts +82 -119
- package/src/liveness.ts +112 -64
- package/src/obligations/action.ts +4 -28
- package/src/obligations/anonymize.ts +84 -80
- package/src/obligations/equality.ts +1 -1
- package/src/obligations/expression.ts +2 -19
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +1 -11
- package/src/obligations/index.ts +0 -11
- package/src/obligations/levels.ts +4 -8
- package/src/obligations/module.ts +1 -15
- package/src/obligations/normalize.ts +5 -24
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +1 -10
- package/src/obligations/printer.ts +47 -46
- package/src/obligations/proof.ts +1 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +3 -14
- package/src/obligations/source.ts +1 -21
- package/src/obligations/subexpression.ts +5 -11
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +8 -14
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +29 -39
- package/src/parallel.ts +53 -44
- package/src/parser.ts +565 -282
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +5 -10
- package/src/prover/deciders.ts +0 -4
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +0 -6
- package/src/prover/isabelle/encode.ts +11 -23
- package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
- package/src/prover/isabelle/isar/method.ts +25 -38
- package/src/prover/isabelle/isar/proof.ts +1 -10
- package/src/prover/isabelle/isar/statement.ts +1 -6
- package/src/prover/isabelle/isar/theory.ts +15 -26
- package/src/prover/isabelle/isar/type-check.ts +11 -25
- package/src/prover/isabelle/provers/blast/blast.ts +10 -41
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +14 -42
- package/src/prover/isabelle/provers/hypsubst.ts +11 -25
- package/src/prover/isabelle/pure/bicompose.ts +16 -13
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +1 -9
- package/src/prover/isabelle/pure/drule.ts +24 -40
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +1 -7
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -14
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +3 -10
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
- package/src/prover/isabelle/pure/rewriter.ts +26 -58
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +4 -12
- package/src/prover/isabelle/pure/table.ts +1 -31
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +6 -12
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +13 -36
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +9 -19
- package/src/prover/isabelle/tla/context.ts +8 -16
- package/src/prover/isabelle/tla/logic.ts +4 -11
- package/src/prover/isabelle/tla/simpdata.ts +46 -34
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +4 -36
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +0 -16
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +9 -36
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +0 -36
- package/src/prover/ptl/decide.ts +7 -12
- package/src/prover/ptl/encode.ts +14 -36
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +12 -26
- package/src/prover/smt/axioms.ts +0 -7
- package/src/prover/smt/context.ts +19 -26
- package/src/prover/smt/data.ts +51 -54
- package/src/prover/smt/encode.ts +14 -35
- package/src/prover/smt/extensionality.ts +0 -10
- package/src/prover/smt/flatten.ts +3 -22
- package/src/prover/smt/format.ts +5 -10
- package/src/prover/smt/instances.ts +0 -10
- package/src/prover/smt/rewrite.ts +66 -101
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -48
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +1 -43
- package/src/prover/smt/solver/ast-lt.ts +1 -11
- package/src/prover/smt/solver/ast-util.ts +1 -6
- package/src/prover/smt/solver/ast.ts +1 -143
- package/src/prover/smt/solver/auf-solver.ts +6 -39
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +1 -18
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/conflict-resolution.ts +0 -9
- package/src/prover/smt/solver/context.ts +4 -61
- package/src/prover/smt/solver/ctx-simplify.ts +14 -41
- package/src/prover/smt/solver/der.ts +2 -21
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +3 -34
- package/src/prover/smt/solver/enode.ts +1 -21
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
- package/src/prover/smt/solver/fingerprints.ts +1 -12
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/goal.ts +2 -14
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +1 -12
- package/src/prover/smt/solver/internalizer.ts +6 -98
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +10 -31
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +15 -36
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +35 -130
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +1 -6
- package/src/prover/smt/solver/mam-compiler.ts +14 -56
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
- package/src/prover/smt/solver/model-checker.ts +2 -36
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +3 -15
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +12 -69
- package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
- package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +3 -47
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
- package/src/prover/smt/solver/nlsat/solver.ts +7 -67
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nnf.ts +3 -38
- package/src/prover/smt/solver/pattern-inference.ts +2 -15
- package/src/prover/smt/solver/poly-rewriter.ts +3 -23
- package/src/prover/smt/solver/propagate-values.ts +1 -10
- package/src/prover/smt/solver/proto-model.ts +3 -48
- package/src/prover/smt/solver/pull-quant.ts +1 -12
- package/src/prover/smt/solver/qe-lite-der.ts +1 -29
- package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
- package/src/prover/smt/solver/qe-lite.ts +3 -33
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/quant-tactics.ts +5 -22
- package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
- package/src/prover/smt/solver/quantifier-manager.ts +1 -8
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +1 -8
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +2 -15
- package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
- package/src/prover/smt/solver/rewriter.ts +3 -85
- package/src/prover/smt/solver/rlimit.ts +2 -20
- package/src/prover/smt/solver/smtlib-parser.ts +2 -37
- package/src/prover/smt/solver/solver.ts +23 -34
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
- package/src/prover/smt/solver/theory-lra-model.ts +4 -19
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
- package/src/prover/smt/solver/theory-lra-state.ts +3 -8
- package/src/prover/smt/solver/theory-lra.ts +1 -8
- package/src/prover/smt/solver/var-subst.ts +2 -26
- package/src/prover/smt/table.ts +0 -8
- package/src/prover/tlapm/cache.ts +20 -25
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +12 -17
- package/src/prover/verdict.ts +0 -2
- package/src/prover/zenon/check/check.ts +0 -9
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +0 -5
- package/src/prover/zenon/check/relations.ts +0 -13
- package/src/prover/zenon/check/rewrites.ts +0 -6
- package/src/prover/zenon/check/sets.ts +0 -3
- package/src/prover/zenon/check/terms.ts +0 -17
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +0 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +1 -26
- package/src/prover/zenon/index-table.ts +17 -38
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +1 -29
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +0 -9
- package/src/prover/zenon/mltoll.ts +54 -76
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +2 -7
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +1 -17
- package/src/prover/zenon/tla/functions.ts +57 -29
- package/src/prover/zenon/tla/llproof.ts +63 -70
- package/src/prover/zenon/tla/records.ts +56 -27
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +68 -39
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +59 -58
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +12 -112
- package/src/runtime.ts +22 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generator.ts +149 -252
- package/src/sany/levels.ts +6 -34
- package/src/sany/lexer.ts +41 -61
- package/src/sany/linter.ts +1 -9
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +0 -31
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +29 -63
- package/src/sany/selectors.ts +15 -39
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +13 -63
- package/src/search.ts +495 -155
- package/src/simulate.ts +685 -0
- package/src/spec-description.ts +176 -69
- package/src/standard-definitions.ts +0 -4
- package/src/standard-modules.ts +254 -69
- package/src/state-graph.ts +50 -24
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +2 -3
- package/src/successors.ts +263 -94
- package/src/symmetry.ts +33 -25
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -67
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +110 -44
- package/src/tlc/order.ts +37 -60
- package/src/tlc/random.ts +33 -45
- package/src/tlc/replay.ts +549 -217
- package/src/tlc/summary.ts +36 -47
- package/src/tlc/tlc-operators.ts +76 -41
- package/src/tlc/tlcext-operators.ts +139 -122
- package/src/tlc/trace-spec.ts +269 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +481 -0
- package/src/typescript/collections.ts +600 -0
- package/src/typescript/compile.ts +65 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +152 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +163 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +165 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +780 -337
- package/src/worker.ts +7 -8
package/src/tlc/order.ts
CHANGED
|
@@ -1,11 +1,10 @@
|
|
|
1
|
-
// TLC orders strings and model values by when it first interned their text, and compares a
|
|
2
|
-
// state's variables in the order of SANY's symbol table. This reproduces both orders.
|
|
3
1
|
import type { Module, SourceLocation } from "../ast";
|
|
4
2
|
import type { ConfigValue, ModelConfig } from "../config";
|
|
5
3
|
import { createMissingModuleError } from "../errors";
|
|
6
4
|
import { tokenize, type Token } from "../lexer";
|
|
7
5
|
import { extractModule, parseModule, parseModuleTokens } from "../parser";
|
|
8
6
|
import { isBefore } from "../resolve";
|
|
7
|
+
import { SANY_STANDARD_MODULES } from "../sany/modules";
|
|
9
8
|
import {
|
|
10
9
|
SANY_BUILTINS,
|
|
11
10
|
SANY_NODE_NAMES,
|
|
@@ -13,7 +12,6 @@ import {
|
|
|
13
12
|
TLC_MODULE_SOURCES,
|
|
14
13
|
TLC_RUNTIME_STRINGS,
|
|
15
14
|
TLC_STARTUP_STRINGS,
|
|
16
|
-
USER_STANDARD_MODULES,
|
|
17
15
|
} from "./jar-data";
|
|
18
16
|
|
|
19
17
|
type SymbolKind = "builtin" | "constant" | "variable" | "definition" | "theorem" | "module";
|
|
@@ -29,7 +27,6 @@ interface SymbolEntry {
|
|
|
29
27
|
interface SymbolTable {
|
|
30
28
|
put: (entry: SymbolEntry) => void;
|
|
31
29
|
inserted: SymbolEntry[];
|
|
32
|
-
// Where the entries the module adds itself start, after those of the modules it extends.
|
|
33
30
|
ownStart: number;
|
|
34
31
|
enumerate: () => SymbolEntry[];
|
|
35
32
|
}
|
|
@@ -66,9 +63,6 @@ const getJavaHash = (text: string) => {
|
|
|
66
63
|
return hash;
|
|
67
64
|
};
|
|
68
65
|
|
|
69
|
-
// java.util.Hashtable as SANY's Context uses it: default capacity 11, load factor 0.75, new
|
|
70
|
-
// entries at the head of their bucket, and enumeration from the last bucket to the first. Each
|
|
71
|
-
// bucket lists its entries from tail to head, so a new entry goes at the end.
|
|
72
66
|
const createSymbolTable = (): SymbolTable => {
|
|
73
67
|
let buckets: SymbolEntry[][] = Array.from({ length: 11 }, () => []);
|
|
74
68
|
let threshold = 8;
|
|
@@ -156,8 +150,6 @@ type ModuleSearch = (
|
|
|
156
150
|
visited: Set<string>,
|
|
157
151
|
) => [ModuleReferences, string] | undefined;
|
|
158
152
|
|
|
159
|
-
// The modules a module extends and instantiates, with its inner modules, as SANY's SpecObj
|
|
160
|
-
// walks them to decide which module to parse next.
|
|
161
153
|
const getModuleReferences = (
|
|
162
154
|
tokens: Token[],
|
|
163
155
|
unit: string | undefined,
|
|
@@ -182,10 +174,10 @@ const getModuleReferences = (
|
|
|
182
174
|
innerModules.set(name, inner.references);
|
|
183
175
|
references.inner.push(inner.references);
|
|
184
176
|
index = inner.end;
|
|
185
|
-
} else if (tokens[index - 1]?.text === ".") {
|
|
186
|
-
// A record field named EXTENDS or INSTANCE, as in r.EXTENDS or [r EXCEPT !.INSTANCE = 0].
|
|
187
177
|
continue;
|
|
188
|
-
}
|
|
178
|
+
}
|
|
179
|
+
if (tokens[index - 1]?.text === ".") continue;
|
|
180
|
+
if (token.text === "EXTENDS") {
|
|
189
181
|
const names = getDeclarations(tokens, index + 1);
|
|
190
182
|
references.extends.push(...names);
|
|
191
183
|
names.forEach((name) => allExtends.add(name));
|
|
@@ -212,9 +204,6 @@ const STRING_ESCAPES: Record<string, string> = {
|
|
|
212
204
|
"\f": "\\f",
|
|
213
205
|
};
|
|
214
206
|
|
|
215
|
-
// The texts SANY interns while parsing, in order. SANY reads a proof step label such as <1>2 and
|
|
216
|
-
// a module header such as ---- MODULE as one token. It interns a string literal as written, quotes
|
|
217
|
-
// included, and interns the literal's contents only during semantic analysis.
|
|
218
207
|
const getParsedTexts = (tokens: Token[]) => {
|
|
219
208
|
const texts: string[] = [];
|
|
220
209
|
for (let index = 0; index < tokens.length; index++) {
|
|
@@ -240,7 +229,6 @@ const getParsedTexts = (tokens: Token[]) => {
|
|
|
240
229
|
return texts;
|
|
241
230
|
};
|
|
242
231
|
|
|
243
|
-
// A module starts with ---- MODULE Name, so its third token is its name.
|
|
244
232
|
const getModuleName = (tokens: Token[]) => tokens[2]?.text;
|
|
245
233
|
|
|
246
234
|
const getRanges = (tokens: Token[]) => {
|
|
@@ -268,26 +256,20 @@ interface ModuleText {
|
|
|
268
256
|
getModule: () => Module;
|
|
269
257
|
}
|
|
270
258
|
|
|
271
|
-
// A module's source is read into tokens once, and parsed from them once, for every order and for
|
|
272
|
-
// the environment that evaluates it.
|
|
273
259
|
const readModuleText = (text: string | undefined): ModuleText => {
|
|
274
260
|
const tokens = text === undefined ? [] : tokenize(text);
|
|
275
|
-
|
|
261
|
+
let parsedModule: Module | undefined;
|
|
276
262
|
return {
|
|
277
263
|
tokens,
|
|
278
264
|
ranges: getRanges(tokens),
|
|
279
265
|
getModule: () =>
|
|
280
|
-
(
|
|
266
|
+
(parsedModule ??= text === undefined ? parseModule("") : parseModuleTokens(text, tokens)),
|
|
281
267
|
};
|
|
282
268
|
};
|
|
283
269
|
|
|
284
|
-
// The modules TLC reads for a spec: the root module, TLC's standard modules, the files the loader
|
|
285
|
-
// returns, the modules that follow the root module, and the modules nested in any of these. A
|
|
286
|
-
// module without a source has no tokens.
|
|
287
270
|
const createModuleSet = (source: string, loadModule: ModuleLoader) => {
|
|
288
271
|
const files = new Map<string, ParsedModule>();
|
|
289
272
|
const nestedModules = new Map<string, ParsedModule>();
|
|
290
|
-
// The read of each module text, so that the environment parses a text the order read only once.
|
|
291
273
|
const texts = new Map<string, ModuleText>();
|
|
292
274
|
const readText = (text: string | undefined) => {
|
|
293
275
|
const known = text === undefined ? undefined : texts.get(text);
|
|
@@ -302,15 +284,16 @@ const createModuleSet = (source: string, loadModule: ModuleLoader) => {
|
|
|
302
284
|
const text =
|
|
303
285
|
name === undefined
|
|
304
286
|
? source
|
|
305
|
-
: (
|
|
287
|
+
: (loadModule?.(name) ??
|
|
306
288
|
TLC_MODULE_SOURCES.get(name) ??
|
|
307
|
-
|
|
289
|
+
SANY_STANDARD_MODULES.get(name) ??
|
|
308
290
|
extractModule(source, name));
|
|
309
|
-
const
|
|
310
|
-
const
|
|
311
|
-
const
|
|
291
|
+
const moduleText = readText(text);
|
|
292
|
+
const tokens = moduleText.tokens;
|
|
293
|
+
const range = moduleText.ranges.get(getModuleName(tokens) ?? "") ?? { start: 0, end: 0 };
|
|
294
|
+
const file = { tokens, ...range, getModule: moduleText.getModule };
|
|
312
295
|
files.set(name ?? "", file);
|
|
313
|
-
ranges.forEach((nestedRange, nestedName) => {
|
|
296
|
+
moduleText.ranges.forEach((nestedRange, nestedName) => {
|
|
314
297
|
if (nestedRange.start === range.start || nestedModules.has(nestedName)) return;
|
|
315
298
|
nestedModules.set(nestedName, {
|
|
316
299
|
tokens,
|
|
@@ -328,7 +311,6 @@ const createModuleSet = (source: string, loadModule: ModuleLoader) => {
|
|
|
328
311
|
};
|
|
329
312
|
};
|
|
330
313
|
|
|
331
|
-
// SANY's Context of each module, which the root module has under undefined.
|
|
332
314
|
type ModuleSet = ReturnType<typeof createModuleSet>["getParsed"];
|
|
333
315
|
|
|
334
316
|
const createContexts = (getParsed: ModuleSet) => {
|
|
@@ -347,13 +329,19 @@ const createContexts = (getParsed: ModuleSet) => {
|
|
|
347
329
|
const recursiveNames = new Set(
|
|
348
330
|
module.definitions.filter((definition) => definition.isRecursive).map((item) => item.name),
|
|
349
331
|
);
|
|
350
|
-
const
|
|
351
|
-
|
|
332
|
+
const declarationKeywords = new Set(
|
|
333
|
+
module.units.flatMap((moduleUnit) =>
|
|
334
|
+
moduleUnit.kind === "Constants" || moduleUnit.kind === "Variables"
|
|
335
|
+
? [`${moduleUnit.location.line}:${moduleUnit.location.column}`]
|
|
336
|
+
: [],
|
|
337
|
+
),
|
|
338
|
+
);
|
|
339
|
+
let depth = 0;
|
|
340
|
+
tokens.slice(unit.start, unit.end).forEach((token, offset) => {
|
|
352
341
|
const index = unit.start + offset;
|
|
353
|
-
const token = tokens[index];
|
|
354
342
|
if (token.kind === "Separator" && tokens[index + 1]?.text === "MODULE") {
|
|
355
|
-
depth
|
|
356
|
-
if (depth
|
|
343
|
+
depth++;
|
|
344
|
+
if (depth === 2) {
|
|
357
345
|
const name = tokens[index + 2].text;
|
|
358
346
|
units.push({
|
|
359
347
|
location: getLocation(token),
|
|
@@ -362,10 +350,15 @@ const createContexts = (getParsed: ModuleSet) => {
|
|
|
362
350
|
}
|
|
363
351
|
return;
|
|
364
352
|
}
|
|
365
|
-
if (token.kind === "ModuleEnd") depth
|
|
366
|
-
if (depth
|
|
367
|
-
|
|
368
|
-
if (token.text === "
|
|
353
|
+
if (token.kind === "ModuleEnd") depth--;
|
|
354
|
+
if (depth !== 1 || token.kind !== "Keyword") return;
|
|
355
|
+
const isDeclaration = declarationKeywords.has(`${token.line}:${token.column}`);
|
|
356
|
+
if (isDeclaration && (token.text === "CONSTANT" || token.text === "CONSTANTS")) {
|
|
357
|
+
declare(index, "constant");
|
|
358
|
+
}
|
|
359
|
+
if (isDeclaration && (token.text === "VARIABLE" || token.text === "VARIABLES")) {
|
|
360
|
+
declare(index, "variable");
|
|
361
|
+
}
|
|
369
362
|
if (token.text === "RECURSIVE") {
|
|
370
363
|
const names = getDeclarations(tokens, index + 1);
|
|
371
364
|
if (names.every((name) => recursiveNames.has(name))) declare(index, "definition");
|
|
@@ -458,9 +451,6 @@ const createContexts = (getParsed: ModuleSet) => {
|
|
|
458
451
|
};
|
|
459
452
|
};
|
|
460
453
|
|
|
461
|
-
// Every string TLC interns before model checking starts, in order: values in the config, TLC's
|
|
462
|
-
// startup strings, each module's tokens in the order SpecObj.loadSpec parses the modules, string
|
|
463
|
-
// literals in semantic analysis order, and the names TLC interns for TLCGet.
|
|
464
454
|
const getStringOrder = (getParsed: ModuleSet, config: ModelConfig): string[] => {
|
|
465
455
|
const order = new Set<string>();
|
|
466
456
|
const intern = (text: string) => {
|
|
@@ -536,7 +526,6 @@ const getStringOrder = (getParsed: ModuleSet, config: ModelConfig): string[] =>
|
|
|
536
526
|
dependencies.set(module.unit, [...(dependencies.get(module.unit) ?? []), name]);
|
|
537
527
|
if (parsedUnits.has(name)) continue;
|
|
538
528
|
parsedUnits.add(name);
|
|
539
|
-
// SANY stops at the first module it can't find, in the order it reads them.
|
|
540
529
|
if (getParsed(name).tokens.length === 0) {
|
|
541
530
|
const importer = module.unit ?? getModuleName(getParsed(undefined).tokens);
|
|
542
531
|
throw createMissingModuleError(name, importer);
|
|
@@ -564,23 +553,12 @@ const getStringOrder = (getParsed: ModuleSet, config: ModelConfig): string[] =>
|
|
|
564
553
|
};
|
|
565
554
|
|
|
566
555
|
export interface TlcOrder {
|
|
567
|
-
// Every string TLC interns before model checking starts.
|
|
568
556
|
getStringOrder: (config: ModelConfig) => string[];
|
|
569
|
-
// The variables or constants of the root module in the reverse of its context enumeration, as
|
|
570
|
-
// ModuleNode.getVariableDecls and getConstantDecls return them. TLC compares variables in this
|
|
571
|
-
// order, and checks that the configuration assigns each constant in it.
|
|
572
557
|
getDeclarationOrder: (kind: "variable" | "constant") => string[];
|
|
573
|
-
// The names of the definitions each module adds to its context, in the order of
|
|
574
|
-
// ModuleNode.getOpDefs, in which TLC computes the constant definitions as it starts. An INSTANCE
|
|
575
|
-
// adds the definitions of the module it instantiates in the order that module's Hashtable
|
|
576
|
-
// enumerates them.
|
|
577
558
|
createDefinitionOrder: () => (name: string | undefined) => string[];
|
|
578
|
-
// Parses a module's source, once for the order and the environment.
|
|
579
559
|
parseModule: (source: string) => Module;
|
|
580
560
|
}
|
|
581
561
|
|
|
582
|
-
// One check reads the spec's modules once, and every order shares their tokens, parses and
|
|
583
|
-
// contexts.
|
|
584
562
|
export const createTlcOrder = (source: string, loadModule: ModuleLoader): TlcOrder => {
|
|
585
563
|
const modules = createModuleSet(source, loadModule);
|
|
586
564
|
const getParsed = modules.getParsed;
|
|
@@ -597,12 +575,11 @@ export const createTlcOrder = (source: string, loadModule: ModuleLoader): TlcOrd
|
|
|
597
575
|
.reverse(),
|
|
598
576
|
parseModule: modules.parseText,
|
|
599
577
|
createDefinitionOrder: () => {
|
|
600
|
-
const
|
|
601
|
-
|
|
602
|
-
// in the files it extends or instantiates.
|
|
603
|
-
getContext(undefined);
|
|
578
|
+
const moduleContexts = getContexts();
|
|
579
|
+
moduleContexts.getContext(undefined);
|
|
604
580
|
return (name) =>
|
|
605
|
-
|
|
581
|
+
moduleContexts
|
|
582
|
+
.getOwnEntries(name)
|
|
606
583
|
.filter((entry) => entry.kind === "definition")
|
|
607
584
|
.map((entry) => entry.name);
|
|
608
585
|
},
|
package/src/tlc/random.ts
CHANGED
|
@@ -1,9 +1,11 @@
|
|
|
1
|
+
import { toEnumeratedSet } from "../builtins";
|
|
1
2
|
import { TlaEvaluationError } from "../errors";
|
|
2
3
|
import type { TlcVersion } from "./version";
|
|
3
4
|
import {
|
|
4
5
|
createRecord,
|
|
5
6
|
createSortedFunction,
|
|
6
7
|
createTuple,
|
|
8
|
+
formatValue,
|
|
7
9
|
getFunctionDomain,
|
|
8
10
|
isEmptySet,
|
|
9
11
|
toFiniteSet,
|
|
@@ -21,16 +23,15 @@ const MULTIPLIER = 0x5deece66dn;
|
|
|
21
23
|
const SEED_MASK = (1n << 48n) - 1n;
|
|
22
24
|
const MAXIMUM_INT = 2147483647;
|
|
23
25
|
|
|
24
|
-
// java.util.Random, which TLC's RandomEnumerableValues extends.
|
|
25
26
|
export const createJavaRandom = (seed: bigint): JavaRandom => {
|
|
26
|
-
|
|
27
|
+
let state = (BigInt.asUintN(64, seed) ^ MULTIPLIER) & SEED_MASK;
|
|
27
28
|
const next = (bits: number) => {
|
|
28
|
-
state
|
|
29
|
-
return Number(BigInt.asIntN(32, state
|
|
29
|
+
state = (state * MULTIPLIER + 0xbn) & SEED_MASK;
|
|
30
|
+
return Number(BigInt.asIntN(32, state >> BigInt(48 - bits)));
|
|
30
31
|
};
|
|
31
32
|
return {
|
|
32
33
|
setSeed: (value) => {
|
|
33
|
-
state
|
|
34
|
+
state = (BigInt.asUintN(64, value) ^ MULTIPLIER) & SEED_MASK;
|
|
34
35
|
},
|
|
35
36
|
nextInt: (bound) => {
|
|
36
37
|
const first = next(31);
|
|
@@ -46,7 +47,6 @@ export const createJavaRandom = (seed: bigint): JavaRandom => {
|
|
|
46
47
|
};
|
|
47
48
|
};
|
|
48
49
|
|
|
49
|
-
// RandomGenerator.primes holds the 1341 consecutive primes from 1277011 to 1295953.
|
|
50
50
|
const PRIMES: number[] = [];
|
|
51
51
|
|
|
52
52
|
const isPrime = (candidate: number) => {
|
|
@@ -63,31 +63,26 @@ const getPrimes = () => {
|
|
|
63
63
|
return PRIMES;
|
|
64
64
|
};
|
|
65
65
|
|
|
66
|
-
const nextPrime = (random: JavaRandom) => {
|
|
66
|
+
export const nextPrime = (random: JavaRandom) => {
|
|
67
67
|
const primes = getPrimes();
|
|
68
|
-
|
|
69
|
-
while (
|
|
70
|
-
|
|
71
|
-
}
|
|
72
|
-
return primes[choice.index];
|
|
68
|
+
let index = primes.length;
|
|
69
|
+
while (index === primes.length) index = Math.floor(random.nextDouble() * primes.length);
|
|
70
|
+
return primes[index];
|
|
73
71
|
};
|
|
74
72
|
|
|
75
73
|
const getPrimeFactors = (value: number) => {
|
|
76
74
|
const factors: number[] = [];
|
|
77
|
-
|
|
78
|
-
for (let divisor = 2; divisor * divisor <= remaining
|
|
79
|
-
while (remaining
|
|
75
|
+
let remaining = value;
|
|
76
|
+
for (let divisor = 2; divisor * divisor <= remaining; divisor++) {
|
|
77
|
+
while (remaining % divisor === 0) {
|
|
80
78
|
factors.push(divisor);
|
|
81
|
-
remaining
|
|
79
|
+
remaining /= divisor;
|
|
82
80
|
}
|
|
83
81
|
}
|
|
84
|
-
if (remaining
|
|
82
|
+
if (remaining > 1) factors.push(remaining);
|
|
85
83
|
return factors;
|
|
86
84
|
};
|
|
87
85
|
|
|
88
|
-
// EnumerableValue.computeOptimalMandA: the smallest modulus m >= max(size, 9) that isn't a
|
|
89
|
-
// multiple of 4 and has a repeated prime factor, and the multiplier 1 + the product of its
|
|
90
|
-
// distinct prime factors.
|
|
91
86
|
const getModulusAndMultiplier = (size: number) => {
|
|
92
87
|
for (let modulus = Math.max(size, 9); ; modulus++) {
|
|
93
88
|
const factors = getPrimeFactors(modulus);
|
|
@@ -101,41 +96,35 @@ const getModulusAndMultiplier = (size: number) => {
|
|
|
101
96
|
}
|
|
102
97
|
};
|
|
103
98
|
|
|
104
|
-
// EnumerableValue.SubsetEnumerator: count indices below size from a full-period linear
|
|
105
|
-
// congruential generator that starts at random.nextInt(size).
|
|
106
99
|
const getSubsetIndicesMaster = (count: number, size: number, random: JavaRandom) => {
|
|
107
100
|
if (size <= 0) return [];
|
|
108
101
|
const generator = getModulusAndMultiplier(size);
|
|
109
|
-
|
|
102
|
+
let index = BigInt(random.nextInt(size));
|
|
110
103
|
const increment = BigInt(nextPrime(random));
|
|
111
104
|
return Array.from({ length: count }, () => {
|
|
112
105
|
do {
|
|
113
|
-
|
|
114
|
-
} while (
|
|
115
|
-
return
|
|
106
|
+
index = (generator.multiplier * index + increment) % generator.modulus;
|
|
107
|
+
} while (index >= size);
|
|
108
|
+
return index;
|
|
116
109
|
});
|
|
117
110
|
};
|
|
118
111
|
|
|
119
|
-
// TLC 1.7.4's EnumerableValue.SubsetEnumerator: the i-th index is (x * i + a) mod size, for a
|
|
120
|
-
// prime x above size and a = random.nextInt(size), so the first size indices are distinct.
|
|
121
112
|
const getSubsetIndices174 = (count: number, size: number, random: JavaRandom) => {
|
|
122
113
|
if (size <= 0) return [];
|
|
123
114
|
const stride = BigInt(size < 191 ? 191 : MAXIMUM_INT);
|
|
124
115
|
const offset = BigInt(random.nextInt(size));
|
|
125
116
|
return Array.from(
|
|
126
117
|
{ length: Math.min(count, size) },
|
|
127
|
-
(
|
|
118
|
+
(_value, index) => (stride * BigInt(index) + offset) % BigInt(size),
|
|
128
119
|
);
|
|
129
120
|
};
|
|
130
121
|
|
|
131
122
|
const LARGE_STRIDE = (1n << 63n) - 1n - 24n;
|
|
132
123
|
|
|
133
|
-
// SetOfFcnsOrRcdsValue.BigIntegerSubsetEnumerator, for products with more than 2^31 - 1
|
|
134
|
-
// elements.
|
|
135
124
|
const getLargeSubsetIndices = (count: number, size: bigint, random: JavaRandom) => {
|
|
136
125
|
const signed = random.nextLong();
|
|
137
126
|
const offset = BigInt.asIntN(64, signed < 0n ? -signed : signed);
|
|
138
|
-
return Array.from({ length: count }, (
|
|
127
|
+
return Array.from({ length: count }, (_value, index) => {
|
|
139
128
|
const value = (LARGE_STRIDE * BigInt(index) + offset) % size;
|
|
140
129
|
return value < 0n ? value + size : value;
|
|
141
130
|
});
|
|
@@ -181,13 +170,11 @@ const getProduct = (set: Value): Product | undefined => {
|
|
|
181
170
|
return undefined;
|
|
182
171
|
};
|
|
183
172
|
|
|
184
|
-
// TLC 1.7.4 enumerates a set of tuples to draw from it.
|
|
185
173
|
export const getEnumeratedFactors = (set: Value, version: TlcVersion) =>
|
|
186
174
|
version === "1.7.4" && typeof set === "object" && set.kind === "ProductSet"
|
|
187
175
|
? set.factors
|
|
188
176
|
: undefined;
|
|
189
177
|
|
|
190
|
-
// Enumerable#getRandomSubset, which Randomization's RandomSubset calls.
|
|
191
178
|
export const getRandomSubset = (
|
|
192
179
|
count: number,
|
|
193
180
|
set: Value,
|
|
@@ -214,18 +201,10 @@ export const getRandomSubset = (
|
|
|
214
201
|
return getSubsetIndices(count, elements.length, random).map((index) => elements[Number(index)]);
|
|
215
202
|
};
|
|
216
203
|
|
|
217
|
-
const pickElement = (elements: Value[], random: JavaRandom) => {
|
|
218
|
-
const element = elements[Math.floor(random.nextDouble() * elements.length)];
|
|
219
|
-
if (element === undefined) throw new TlaEvaluationError("RandomElement of the empty set");
|
|
220
|
-
return element;
|
|
221
|
-
};
|
|
222
|
-
|
|
223
|
-
// TLC!RandomElement chooses each component of a set of functions, records, or tuples
|
|
224
|
-
// separately, and otherwise indexes the enumerated set with nextDouble.
|
|
225
204
|
export const getRandomElement = (set: Value, random: JavaRandom): Value => {
|
|
226
205
|
if (typeof set === "object" && set.kind === "FunctionSet") {
|
|
227
206
|
// TLC builds the chosen function without the interval its domain came from.
|
|
228
|
-
const domain = [...
|
|
207
|
+
const domain = [...toEnumeratedSet(set.domain, "RandomElement", set).elements];
|
|
229
208
|
return createSortedFunction(
|
|
230
209
|
domain,
|
|
231
210
|
domain.map(() => getRandomElement(set.range, random)),
|
|
@@ -245,8 +224,17 @@ export const getRandomElement = (set: Value, random: JavaRandom): Value => {
|
|
|
245
224
|
if (typeof set === "object" && set.kind === "Interval") {
|
|
246
225
|
const size = Math.max(0, set.high - set.low + 1);
|
|
247
226
|
const offset = Math.floor(random.nextDouble() * size);
|
|
248
|
-
if (offset >= size)
|
|
227
|
+
if (offset >= size) {
|
|
228
|
+
throw new TlaEvaluationError(
|
|
229
|
+
`Attempted to retrieve out-of-bounds element from the interval value ${formatValue(set)}.`,
|
|
230
|
+
);
|
|
231
|
+
}
|
|
249
232
|
return set.low + offset;
|
|
250
233
|
}
|
|
251
|
-
|
|
234
|
+
const elements = toEnumeratedSet(set, "RandomElement").elements;
|
|
235
|
+
const index = Math.floor(random.nextDouble() * elements.length);
|
|
236
|
+
if (index >= elements.length) {
|
|
237
|
+
throw new TlaEvaluationError(`Index ${index} out of bounds for length ${elements.length}`);
|
|
238
|
+
}
|
|
239
|
+
return elements[index];
|
|
252
240
|
};
|