tla-ts 0.0.7 → 0.0.8-dev.8067c48
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/dist/deciders.cjs +16 -16
- package/dist/deciders.js +49 -49
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +23 -9
- package/dist/index.d.ts +23 -9
- 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 +32 -32
- package/dist/prove.js +34 -34
- package/dist/run.cjs +23 -23
- package/dist/run.js +28 -28
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +1 -1
- package/dist/transfer.cjs +30 -33
- package/dist/transfer.js +30 -33
- package/dist/worker.cjs +4 -1
- package/dist/worker.js +4 -1
- package/package.json +1 -1
- package/src/check.ts +37 -18
- package/src/cli/options.ts +1 -0
- package/src/cli/tlc.ts +4 -0
- package/src/codegen.ts +14 -5
- package/src/dependencies.ts +348 -24
- package/src/environment.ts +30 -16
- package/src/evaluate.ts +123 -703
- package/src/lexer.ts +140 -51
- package/src/liveness.ts +1 -15
- package/src/parallel-worker.ts +18 -4
- package/src/parallel.ts +8 -5
- package/src/parser.ts +5 -2
- package/src/search.ts +48 -32
- package/src/spec-description.ts +1 -1
- package/src/successors.ts +3 -9
- package/src/symmetry.ts +32 -143
- package/src/tlc/fingerprint.ts +69 -116
- package/src/tlc/order.ts +118 -73
- package/src/tlc/replay.ts +1 -1
- package/src/values.ts +86 -71
- package/src/worker.ts +16 -0
package/dist/index.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e.
|
|
9
|
+
Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e.h,exports.TlaError=e.g,exports.TlaEvaluationError=e._,exports.TlaSyntaxError=e.O,exports.TlaUnsupportedError=e.A,exports.check=n.m,exports.formatValue=t.jt,exports.parseConfig=n.h,exports.parseModule=t.V,exports.prove=n.r;
|
package/dist/index.d.cts
CHANGED
|
@@ -559,6 +559,13 @@ interface ModelValue {
|
|
|
559
559
|
name: string;
|
|
560
560
|
type: string | undefined;
|
|
561
561
|
rank: number;
|
|
562
|
+
hash: number;
|
|
563
|
+
fingerprint: number;
|
|
564
|
+
}
|
|
565
|
+
interface LazySet {
|
|
566
|
+
enumerated?: SetValue;
|
|
567
|
+
isCached?: boolean;
|
|
568
|
+
isFingerprinted?: boolean;
|
|
562
569
|
}
|
|
563
570
|
interface SetValue {
|
|
564
571
|
kind: "Set";
|
|
@@ -567,7 +574,7 @@ interface SetValue {
|
|
|
567
574
|
fingerprint: number;
|
|
568
575
|
isFingerprinted: boolean;
|
|
569
576
|
}
|
|
570
|
-
interface MixedSetValue {
|
|
577
|
+
interface MixedSetValue extends LazySet {
|
|
571
578
|
kind: "MixedSet";
|
|
572
579
|
elements: Value[];
|
|
573
580
|
}
|
|
@@ -590,29 +597,29 @@ interface InfiniteSetValue {
|
|
|
590
597
|
kind: "InfiniteSet";
|
|
591
598
|
name: "Nat" | "Int" | "STRING" | "Any";
|
|
592
599
|
}
|
|
593
|
-
interface SubsetValue {
|
|
600
|
+
interface SubsetValue extends LazySet {
|
|
594
601
|
kind: "Subset";
|
|
595
602
|
base: Value;
|
|
596
603
|
}
|
|
597
|
-
interface FunctionSetValue {
|
|
604
|
+
interface FunctionSetValue extends LazySet {
|
|
598
605
|
kind: "FunctionSet";
|
|
599
606
|
domain: Value;
|
|
600
607
|
range: Value;
|
|
601
608
|
}
|
|
602
|
-
interface RecordSetValue {
|
|
609
|
+
interface RecordSetValue extends LazySet {
|
|
603
610
|
kind: "RecordSet";
|
|
604
611
|
names: string[];
|
|
605
612
|
sets: Value[];
|
|
606
613
|
}
|
|
607
|
-
interface ProductSetValue {
|
|
614
|
+
interface ProductSetValue extends LazySet {
|
|
608
615
|
kind: "ProductSet";
|
|
609
616
|
factors: Value[];
|
|
610
617
|
}
|
|
611
|
-
interface SequenceSetValue {
|
|
618
|
+
interface SequenceSetValue extends LazySet {
|
|
612
619
|
kind: "SequenceSet";
|
|
613
620
|
base: Value;
|
|
614
621
|
}
|
|
615
|
-
interface SetOperationValue {
|
|
622
|
+
interface SetOperationValue extends LazySet {
|
|
616
623
|
kind: "SetOperation";
|
|
617
624
|
operator: "\\cup" | "\\cap" | "\\";
|
|
618
625
|
left: Value;
|
|
@@ -622,13 +629,13 @@ interface FilteredSetSource {
|
|
|
622
629
|
names: string;
|
|
623
630
|
predicate: string;
|
|
624
631
|
}
|
|
625
|
-
interface FilteredSetValue {
|
|
632
|
+
interface FilteredSetValue extends LazySet {
|
|
626
633
|
kind: "FilteredSet";
|
|
627
634
|
base: Value;
|
|
628
635
|
test: (element: Value) => boolean;
|
|
629
636
|
source?: FilteredSetSource;
|
|
630
637
|
}
|
|
631
|
-
interface UnionValue {
|
|
638
|
+
interface UnionValue extends LazySet {
|
|
632
639
|
kind: "Union";
|
|
633
640
|
base: Value;
|
|
634
641
|
}
|
|
@@ -646,6 +653,8 @@ interface LazyFunctionValue {
|
|
|
646
653
|
apply: (argument: Value) => Value;
|
|
647
654
|
source?: LazyFunctionSource;
|
|
648
655
|
functionClass?: FunctionClass;
|
|
656
|
+
enumerated?: FunctionValue;
|
|
657
|
+
isFingerprinted?: boolean;
|
|
649
658
|
}
|
|
650
659
|
type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
|
|
651
660
|
type FunctionClass = "lambda" | "tuple" | "record";
|
|
@@ -686,6 +695,7 @@ interface CheckOptions {
|
|
|
686
695
|
livenessCheck?: "default" | "final";
|
|
687
696
|
dump?: StateDump;
|
|
688
697
|
isTool?: boolean;
|
|
698
|
+
isContinued?: boolean;
|
|
689
699
|
isTraceRecorded?: boolean;
|
|
690
700
|
isSanyReported?: boolean;
|
|
691
701
|
isWarningEnabled?: boolean;
|
|
@@ -738,6 +748,10 @@ type CheckProgress = {
|
|
|
738
748
|
kind: "warning";
|
|
739
749
|
code: number;
|
|
740
750
|
text: string;
|
|
751
|
+
} | {
|
|
752
|
+
kind: "violation";
|
|
753
|
+
status: CheckStatus;
|
|
754
|
+
violation: Violation;
|
|
741
755
|
} | ({
|
|
742
756
|
kind: "java-override";
|
|
743
757
|
} & JavaOverride);
|
package/dist/index.d.ts
CHANGED
|
@@ -559,6 +559,13 @@ interface ModelValue {
|
|
|
559
559
|
name: string;
|
|
560
560
|
type: string | undefined;
|
|
561
561
|
rank: number;
|
|
562
|
+
hash: number;
|
|
563
|
+
fingerprint: number;
|
|
564
|
+
}
|
|
565
|
+
interface LazySet {
|
|
566
|
+
enumerated?: SetValue;
|
|
567
|
+
isCached?: boolean;
|
|
568
|
+
isFingerprinted?: boolean;
|
|
562
569
|
}
|
|
563
570
|
interface SetValue {
|
|
564
571
|
kind: "Set";
|
|
@@ -567,7 +574,7 @@ interface SetValue {
|
|
|
567
574
|
fingerprint: number;
|
|
568
575
|
isFingerprinted: boolean;
|
|
569
576
|
}
|
|
570
|
-
interface MixedSetValue {
|
|
577
|
+
interface MixedSetValue extends LazySet {
|
|
571
578
|
kind: "MixedSet";
|
|
572
579
|
elements: Value[];
|
|
573
580
|
}
|
|
@@ -590,29 +597,29 @@ interface InfiniteSetValue {
|
|
|
590
597
|
kind: "InfiniteSet";
|
|
591
598
|
name: "Nat" | "Int" | "STRING" | "Any";
|
|
592
599
|
}
|
|
593
|
-
interface SubsetValue {
|
|
600
|
+
interface SubsetValue extends LazySet {
|
|
594
601
|
kind: "Subset";
|
|
595
602
|
base: Value;
|
|
596
603
|
}
|
|
597
|
-
interface FunctionSetValue {
|
|
604
|
+
interface FunctionSetValue extends LazySet {
|
|
598
605
|
kind: "FunctionSet";
|
|
599
606
|
domain: Value;
|
|
600
607
|
range: Value;
|
|
601
608
|
}
|
|
602
|
-
interface RecordSetValue {
|
|
609
|
+
interface RecordSetValue extends LazySet {
|
|
603
610
|
kind: "RecordSet";
|
|
604
611
|
names: string[];
|
|
605
612
|
sets: Value[];
|
|
606
613
|
}
|
|
607
|
-
interface ProductSetValue {
|
|
614
|
+
interface ProductSetValue extends LazySet {
|
|
608
615
|
kind: "ProductSet";
|
|
609
616
|
factors: Value[];
|
|
610
617
|
}
|
|
611
|
-
interface SequenceSetValue {
|
|
618
|
+
interface SequenceSetValue extends LazySet {
|
|
612
619
|
kind: "SequenceSet";
|
|
613
620
|
base: Value;
|
|
614
621
|
}
|
|
615
|
-
interface SetOperationValue {
|
|
622
|
+
interface SetOperationValue extends LazySet {
|
|
616
623
|
kind: "SetOperation";
|
|
617
624
|
operator: "\\cup" | "\\cap" | "\\";
|
|
618
625
|
left: Value;
|
|
@@ -622,13 +629,13 @@ interface FilteredSetSource {
|
|
|
622
629
|
names: string;
|
|
623
630
|
predicate: string;
|
|
624
631
|
}
|
|
625
|
-
interface FilteredSetValue {
|
|
632
|
+
interface FilteredSetValue extends LazySet {
|
|
626
633
|
kind: "FilteredSet";
|
|
627
634
|
base: Value;
|
|
628
635
|
test: (element: Value) => boolean;
|
|
629
636
|
source?: FilteredSetSource;
|
|
630
637
|
}
|
|
631
|
-
interface UnionValue {
|
|
638
|
+
interface UnionValue extends LazySet {
|
|
632
639
|
kind: "Union";
|
|
633
640
|
base: Value;
|
|
634
641
|
}
|
|
@@ -646,6 +653,8 @@ interface LazyFunctionValue {
|
|
|
646
653
|
apply: (argument: Value) => Value;
|
|
647
654
|
source?: LazyFunctionSource;
|
|
648
655
|
functionClass?: FunctionClass;
|
|
656
|
+
enumerated?: FunctionValue;
|
|
657
|
+
isFingerprinted?: boolean;
|
|
649
658
|
}
|
|
650
659
|
type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
|
|
651
660
|
type FunctionClass = "lambda" | "tuple" | "record";
|
|
@@ -686,6 +695,7 @@ interface CheckOptions {
|
|
|
686
695
|
livenessCheck?: "default" | "final";
|
|
687
696
|
dump?: StateDump;
|
|
688
697
|
isTool?: boolean;
|
|
698
|
+
isContinued?: boolean;
|
|
689
699
|
isTraceRecorded?: boolean;
|
|
690
700
|
isSanyReported?: boolean;
|
|
691
701
|
isWarningEnabled?: boolean;
|
|
@@ -738,6 +748,10 @@ type CheckProgress = {
|
|
|
738
748
|
kind: "warning";
|
|
739
749
|
code: number;
|
|
740
750
|
text: string;
|
|
751
|
+
} | {
|
|
752
|
+
kind: "violation";
|
|
753
|
+
status: CheckStatus;
|
|
754
|
+
violation: Violation;
|
|
741
755
|
} | ({
|
|
742
756
|
kind: "java-override";
|
|
743
757
|
} & JavaOverride);
|
package/dist/index.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{
|
|
9
|
+
import{A as e,O as t,_ as n,g as r,h as i}from"./worker.js";import{V as a,jt as o}from"./transfer.js";import{h as s,m as c,r as l}from"./prove.js";export{i as TlaConfigError,r as TlaError,n as TlaEvaluationError,t as TlaSyntaxError,e as TlaUnsupportedError,c as check,o as formatValue,s as parseConfig,a as parseModule,l as prove};
|
package/dist/parallel-worker.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(
|
|
9
|
+
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.N(n.source,a);t.zt(s.getStringOrder(n.config)),t.Bt(n.version);let c=t.Pt(),l=t.M(n.config,{source:n.source,loadModule:a,order:s,loadClass:e=>o.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isWarningEnabled:n.isWarningEnabled,version:n.version}).environment,u=t.h(n.config,l,()=>s.getDeclarationOrder(`variable`)),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.Tt(),m=t.t(l.variables.length),h={fingerprints:n.fingerprints},g=n.requests,_=n.remaining,v=u.isSymmetric?t.r():void 0,y=/* @__PURE__ */ new Int32Array(2),b={resume:()=>{},loot:e=>{}};n.ports.forEach(e=>{e?.addEventListener(`message`,e=>b.loot(e.data)),e?.start?.()});let x={states:m(n.seed).map(p)},S=e.t(),C=(e,r)=>{let i=Atomics.load(g,f)-1,a=Math.floor((e.end-e.origin-1)/2),o=t.n(),s=e.states.slice(e.end-a,e.end),c=a>0&&s.every(o.encode);c&&(e.end-=a);let l=c?o.finish():t.n().finish();n.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(g,f,r),Atomics.notify(g,f)},w=e=>{Atomics.store(_,f,0),Atomics.compareExchange(g,f,0,-1)!==0&&C(e,-1)},T=e=>{Atomics.store(_,f,e.end-e.origin),Atomics.store(g,f,0)},E=e=>{for(;e.origin<e.end;e.origin++){let r=e.states[e.origin];if(!e.successors){if(performance.now()>=e.breakAt)return`break`;if(Atomics.load(g,f)>0&&C(e,0),Atomics.store(_,f,e.end-e.origin-1),e.successors=t.st(d,r,l,u.spec.scope),e.generated+=e.successors.length,e.successors.length===0&&n.config.checkDeadlock)return}let i=e.successors;for(;e.index<i.length;e.index++){if(t.s(h.fingerprints))return`paused`;let n=i[e.index];if(u.findViolatedActionProperty(r,n.state))return;if(!u.satisfiesActionConstraints(r,n.state)){if(u.findViolatedInvariant(n.state,r))return;continue}if(v&&(t.c(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.c(a,y),t.o(h.fingerprints,y[0],y[1])){if(u.findViolatedInvariant(n.state,r))return;u.satisfiesConstraints(n.state,r)&&(e.next.push(n.state),e.fingerprintStates.push(a),e.added++)}}e.outDegrees[Math.min(e.added,31)]++,e.successors=void 0,e.index=0,e.added=0}return`done`},D=async e=>{let t=/* @__PURE__ */ new Set;for(;;){let r=n.ports.reduce((e,n,r)=>!n||t.has(r)||Atomics.load(_,r)<2?e:e===void 0||Atomics.load(_,r)>Atomics.load(_,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(g,r,0,f+1);if(i===-1&&t.add(r),i>0&&Atomics.wait(g,r,i),i!==0)continue;let a=await new Promise(e=>b.loot=e);if(a.count===0)t.add(r);else return e.states=m(a).map(p),e.origin=0,e.end=e.states.length,T(e),!0}},O=e=>r.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),k=async()=>{let e={states:x.states,origin:0,end:x.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=E(e);if(t===void 0)return;if(t===`break`)await S(),e.breakAt=performance.now()+100;else if(w(e),t===`paused`){let t=new Promise(e=>b.resume=e);O({type:`paused`}),await t,T(e)}else if(!await D(e))break}if(t.Pt()===c)return x.states=e.next,Atomics.store(_,f,x.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:u.getStoredFingerprints(e.next,e.fingerprintStates)}},A=()=>{k().then(e=>O(e??{type:`abort`}),()=>O({type:`abort`}))};r.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&A(),t.type===`resize`&&(h.fingerprints=t.fingerprints,b.resume())}),Atomics.store(_,f,x.states.length),O({type:`ready`})};e.n().then(e=>{let t=r=>{let i=r.data;if(i.type===`start`){e.removeEventListener?.(`message`,t);try{n(i,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
|
package/dist/parallel-worker.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{
|
|
9
|
+
import{n as e,t}from"./worker.js";import{Bt as n,M as r,N as i,Pt as a,Tt as o,c as s,h as c,n as l,o as u,r as d,s as f,st as p,t as m,zt as h}from"./transfer.js";const g=(e,g)=>{let _=new Map(e.modules),v=e=>_.get(e),y=new Map(e.classes),b=i(e.source,v);h(b.getStringOrder(e.config)),n(e.version);let x=a(),S=r(e.config,{source:e.source,loadModule:v,order:b,loadClass:e=>y.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version}).environment,C=c(e.config,S,()=>b.getDeclarationOrder(`variable`)),w=C?.spec.next;if(!C||w===void 0)return g.postMessage({type:`abort`});let T=e.index,E=o(),D=m(S.variables.length),O={fingerprints:e.fingerprints},k=e.requests,A=e.remaining,j=C.isSymmetric?d():void 0,M=/* @__PURE__ */ new Int32Array(2),N={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>N.loot(e.data)),e?.start?.()});let P={states:D(e.seed).map(E)},F=t(),I=(t,n)=>{let r=Atomics.load(k,T)-1,i=Math.floor((t.end-t.origin-1)/2),a=l(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let c=s?a.finish():l().finish();e.ports[r]?.postMessage(c,[c.words.buffer]),Atomics.store(k,T,n),Atomics.notify(k,T)},L=e=>{Atomics.store(A,T,0),Atomics.compareExchange(k,T,0,-1)!==0&&I(e,-1)},R=e=>{Atomics.store(A,T,e.end-e.origin),Atomics.store(k,T,0)},z=t=>{for(;t.origin<t.end;t.origin++){let n=t.states[t.origin];if(!t.successors){if(performance.now()>=t.breakAt)return`break`;if(Atomics.load(k,T)>0&&I(t,0),Atomics.store(A,T,t.end-t.origin-1),t.successors=p(w,n,S,C.spec.scope),t.generated+=t.successors.length,t.successors.length===0&&e.config.checkDeadlock)return}let r=t.successors;for(;t.index<r.length;t.index++){if(f(O.fingerprints))return`paused`;let e=r[t.index];if(C.findViolatedActionProperty(n,e.state))return;if(!C.satisfiesActionConstraints(n,e.state)){if(C.findViolatedInvariant(e.state,n))return;continue}if(j&&(s(e.state,M),!j.insert(M[0],M[1])))continue;E(e.state);let i=C.getFingerprintState(e.state);if(s(i,M),u(O.fingerprints,M[0],M[1])){if(C.findViolatedInvariant(e.state,n))return;C.satisfiesConstraints(e.state,n)&&(t.next.push(e.state),t.fingerprintStates.push(i),t.added++)}}t.outDegrees[Math.min(t.added,31)]++,t.successors=void 0,t.index=0,t.added=0}return`done`},B=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(A,r)<2?e:e===void 0||Atomics.load(A,r)>Atomics.load(A,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(k,r,0,T+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(k,r,i),i!==0)continue;let a=await new Promise(e=>N.loot=e);if(a.count===0)n.add(r);else return t.states=D(a).map(E),t.origin=0,t.end=t.states.length,R(t),!0}},V=e=>g.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),H=async()=>{let e={states:P.states,origin:0,end:P.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=z(e);if(t===void 0)return;if(t===`break`)await F(),e.breakAt=performance.now()+100;else if(L(e),t===`paused`){let t=new Promise(e=>N.resume=e);V({type:`paused`}),await t,R(e)}else if(!await B(e))break}if(a()===x)return P.states=e.next,Atomics.store(A,T,P.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:C.getStoredFingerprints(e.next,e.fingerprintStates)}},U=()=>{H().then(e=>V(e??{type:`abort`}),()=>V({type:`abort`}))};g.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&U(),t.type===`resize`&&(O.fingerprints=t.fingerprints,N.resume())}),Atomics.store(A,T,P.states.length),V({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{g(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
|
package/dist/prove-worker.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs"),t=require("./deciders.cjs"),n=n=>{try{return t.t(n.prover,n.text,{timeLimitMs:n.timeLimitMs})}catch(t){if(t instanceof e.
|
|
9
|
+
const e=require("./worker.cjs"),t=require("./deciders.cjs"),n=n=>{try{return t.t(n.prover,n.text,{timeLimitMs:n.timeLimitMs})}catch(t){if(t instanceof e.T)return{error:t.message};throw t}};e.n().then(e=>{e.addEventListener(`message`,t=>e.postMessage(n(t.data))),e.start?.()});
|
package/dist/prove-worker.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{
|
|
9
|
+
import{T as e,n as t}from"./worker.js";import{t as n}from"./deciders.js";const r=t=>{try{return n(t.prover,t.text,{timeLimitMs:t.timeLimitMs})}catch(t){if(t instanceof e)return{error:t.message};throw t}};t().then(e=>{e.addEventListener(`message`,t=>e.postMessage(r(t.data))),e.start?.()});
|