@tuprolog/2p-full 1.0.4 → 1.1.0
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/2p-bdd.js +204 -201
- package/2p-bdd.js.map +1 -1
- package/2p-core.js +3668 -4128
- package/2p-core.js.map +1 -1
- package/2p-datalog.js +3 -3
- package/2p-datalog.js.map +1 -1
- package/2p-dsl-core.js +3 -3
- package/2p-dsl-core.js.map +1 -1
- package/2p-dsl-solve.js +3 -3
- package/2p-dsl-solve.js.map +1 -1
- package/2p-dsl-theory.js +3 -3
- package/2p-dsl-theory.js.map +1 -1
- package/2p-dsl-unify.js +3 -3
- package/2p-dsl-unify.js.map +1 -1
- package/2p-full.js +9 -19
- package/2p-full.js.map +1 -1
- package/2p-io-lib.js +6 -3321
- package/2p-io-lib.js.map +1 -1
- package/2p-oop-lib.js +6 -3435
- package/2p-oop-lib.js.map +1 -1
- package/2p-parser-core.js +6 -1266
- package/2p-parser-core.js.map +1 -1
- package/2p-parser-js.js +6 -30
- package/2p-parser-js.js.map +1 -1
- package/2p-parser-theory.js +6 -126
- package/2p-parser-theory.js.map +1 -1
- package/2p-repl.js +6 -499
- package/2p-repl.js.map +1 -1
- package/2p-serialize-core.js +3 -3
- package/2p-serialize-core.js.map +1 -1
- package/2p-serialize-theory.js +3 -3
- package/2p-serialize-theory.js.map +1 -1
- package/2p-solve-classic.js +1216 -1203
- package/2p-solve-classic.js.map +1 -1
- package/2p-solve-concurrent.js +3 -3
- package/2p-solve-concurrent.js.map +1 -1
- package/2p-solve-plp.js +8 -8
- package/2p-solve-plp.js.map +1 -1
- package/2p-solve-problog.js +2095 -2140
- package/2p-solve-problog.js.map +1 -1
- package/2p-solve-streams.js +1244 -1333
- package/2p-solve-streams.js.map +1 -1
- package/2p-solve.js +5185 -6393
- package/2p-solve.js.map +1 -1
- package/2p-test-dsl.js +3 -3
- package/2p-test-dsl.js.map +1 -1
- package/2p-theory.js +2091 -1992
- package/2p-theory.js.map +1 -1
- package/2p-unify.js +315 -300
- package/2p-unify.js.map +1 -1
- package/2p-utils.js +625 -635
- package/2p-utils.js.map +1 -1
- package/clikt-clikt-mordant.js +15 -0
- package/clikt-clikt-mordant.js.map +1 -0
- package/clikt-clikt.js +15 -0
- package/clikt-clikt.js.map +1 -0
- package/colormath-root-colormath.js +15 -0
- package/colormath-root-colormath.js.map +1 -0
- package/kotlin-kotlin-stdlib.js +6829 -8585
- package/kotlin-kotlin-stdlib.js.map +1 -1
- package/kotlin-kotlin-test.js +15 -0
- package/kotlin-kotlin-test.js.map +1 -0
- package/kotlin_org_jetbrains_kotlin_kotlin_dom_api_compat.js +3 -3
- package/kotlin_org_jetbrains_kotlin_kotlin_dom_api_compat.js.map +1 -1
- package/kotlinx-atomicfu.js +15 -0
- package/kotlinx-atomicfu.js.map +1 -0
- package/kotlinx-coroutines-core.js +15 -0
- package/kotlinx-coroutines-core.js.map +1 -0
- package/kt-math.js +3143 -3508
- package/kt-math.js.map +1 -1
- package/mordant-mordant-omnibus.js +15 -0
- package/mordant-mordant-omnibus.js.map +1 -0
- package/mordant-mordant.js +19 -0
- package/mordant-mordant.js.map +1 -0
- package/package.json +2 -3
- package/88b0986a7186d029-atomicfu-js-ir.js +0 -15
- package/88b0986a7186d029-atomicfu-js-ir.js.map +0 -1
- package/clikt-clikt-js-ir.js +0 -6006
- package/clikt-clikt-js-ir.js.map +0 -1
- package/kotlin-kotlin-test-kotlin-test-js-ir.js +0 -15
- package/kotlin-kotlin-test-kotlin-test-js-ir.js.map +0 -1
- package/kotlin-kotlinx-atomicfu-runtime-js-ir.js +0 -15
- package/kotlin-kotlinx-atomicfu-runtime-js-ir.js.map +0 -1
- package/kotlinx.coroutines-kotlinx-coroutines-core-js-ir.js +0 -15
- package/kotlinx.coroutines-kotlinx-coroutines-core-js-ir.js.map +0 -1
package/2p-bdd.js
CHANGED
|
@@ -1,65 +1,65 @@
|
|
|
1
|
-
(function (
|
|
1
|
+
(function (factory) {
|
|
2
2
|
if (typeof define === 'function' && define.amd)
|
|
3
3
|
define(['exports', './kotlin-kotlin-stdlib.js'], factory);
|
|
4
4
|
else if (typeof exports === 'object')
|
|
5
5
|
factory(module.exports, require('./kotlin-kotlin-stdlib.js'));
|
|
6
6
|
else {
|
|
7
|
-
if (typeof
|
|
7
|
+
if (typeof globalThis['kotlin-kotlin-stdlib'] === 'undefined') {
|
|
8
8
|
throw new Error("Error loading module '2p-bdd'. Its dependency 'kotlin-kotlin-stdlib' was not found. Please, check whether 'kotlin-kotlin-stdlib' is loaded prior to '2p-bdd'.");
|
|
9
9
|
}
|
|
10
|
-
|
|
10
|
+
globalThis['2p-bdd'] = factory(typeof globalThis['2p-bdd'] === 'undefined' ? {} : globalThis['2p-bdd'], globalThis['kotlin-kotlin-stdlib']);
|
|
11
11
|
}
|
|
12
|
-
}(
|
|
12
|
+
}(function (_, kotlin_kotlin) {
|
|
13
13
|
'use strict';
|
|
14
14
|
//region block: imports
|
|
15
15
|
var imul = Math.imul;
|
|
16
|
-
var protoOf = kotlin_kotlin.$_$.
|
|
17
|
-
var
|
|
18
|
-
var
|
|
19
|
-
var
|
|
20
|
-
var
|
|
21
|
-
var
|
|
22
|
-
var
|
|
23
|
-
var
|
|
24
|
-
var
|
|
25
|
-
var
|
|
26
|
-
var
|
|
27
|
-
var
|
|
28
|
-
var
|
|
29
|
-
var
|
|
30
|
-
var
|
|
31
|
-
var
|
|
32
|
-
var
|
|
33
|
-
var
|
|
34
|
-
var
|
|
35
|
-
var
|
|
36
|
-
var
|
|
37
|
-
var
|
|
38
|
-
var
|
|
39
|
-
var
|
|
16
|
+
var protoOf = kotlin_kotlin.$_$.k6;
|
|
17
|
+
var initMetadataForInterface = kotlin_kotlin.$_$.w5;
|
|
18
|
+
var initMetadataForCompanion = kotlin_kotlin.$_$.u5;
|
|
19
|
+
var VOID = kotlin_kotlin.$_$.b;
|
|
20
|
+
var RuntimeException = kotlin_kotlin.$_$.da;
|
|
21
|
+
var RuntimeException_init_$Init$ = kotlin_kotlin.$_$.c1;
|
|
22
|
+
var captureStack = kotlin_kotlin.$_$.e5;
|
|
23
|
+
var defineProp = kotlin_kotlin.$_$.l5;
|
|
24
|
+
var initMetadataForClass = kotlin_kotlin.$_$.t5;
|
|
25
|
+
var hashCode = kotlin_kotlin.$_$.s5;
|
|
26
|
+
var LinkedHashMap_init_$Create$ = kotlin_kotlin.$_$.f;
|
|
27
|
+
var Unit_instance = kotlin_kotlin.$_$.k1;
|
|
28
|
+
var ensureNotNull = kotlin_kotlin.$_$.ha;
|
|
29
|
+
var Pair = kotlin_kotlin.$_$.ca;
|
|
30
|
+
var compareTo = kotlin_kotlin.$_$.k5;
|
|
31
|
+
var equals = kotlin_kotlin.$_$.m5;
|
|
32
|
+
var THROW_CCE = kotlin_kotlin.$_$.ea;
|
|
33
|
+
var isComparable = kotlin_kotlin.$_$.b6;
|
|
34
|
+
var getKClassFromExpression = kotlin_kotlin.$_$.a7;
|
|
35
|
+
var getBooleanHashCode = kotlin_kotlin.$_$.o5;
|
|
36
|
+
var KProperty1 = kotlin_kotlin.$_$.c7;
|
|
37
|
+
var getPropertyCallableRef = kotlin_kotlin.$_$.q5;
|
|
38
|
+
var lazy = kotlin_kotlin.$_$.ja;
|
|
39
|
+
var toString = kotlin_kotlin.$_$.n6;
|
|
40
40
|
//endregion
|
|
41
41
|
//region block: pre-declaration
|
|
42
42
|
function accept(visitor) {
|
|
43
43
|
return visitor.visitTerminal(this);
|
|
44
44
|
}
|
|
45
|
-
|
|
45
|
+
initMetadataForInterface(Terminal, 'Terminal');
|
|
46
46
|
function accept_0(visitor) {
|
|
47
47
|
return visitor.visitVariable(this);
|
|
48
48
|
}
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
49
|
+
initMetadataForInterface(Variable, 'Variable');
|
|
50
|
+
initMetadataForCompanion(Companion);
|
|
51
|
+
initMetadataForCompanion(Companion_0);
|
|
52
|
+
initMetadataForClass(BinaryDecisionDiagramException, 'BinaryDecisionDiagramException', BinaryDecisionDiagramException, RuntimeException);
|
|
53
|
+
initMetadataForClass(BinaryDecisionDiagramOperationException, 'BinaryDecisionDiagramOperationException', VOID, BinaryDecisionDiagramException);
|
|
54
|
+
initMetadataForClass(AnyVisitor, 'AnyVisitor');
|
|
55
|
+
initMetadataForClass(BinaryApplyExpansionVisitor, 'BinaryApplyExpansionVisitor');
|
|
56
|
+
initMetadataForClass(ExpansionVisitor, 'ExpansionVisitor');
|
|
57
|
+
initMetadataForClass(UnaryApplyExpansionVisitor, 'UnaryApplyExpansionVisitor');
|
|
58
|
+
initMetadataForClass(ReducedBinaryDecisionDiagramBuilder, 'ReducedBinaryDecisionDiagramBuilder');
|
|
59
|
+
initMetadataForClass(SimpleBinaryDecisionDiagramBuilder, 'SimpleBinaryDecisionDiagramBuilder', SimpleBinaryDecisionDiagramBuilder);
|
|
60
|
+
initMetadataForClass(SimpleBinaryDecisionDiagramTerminal, 'SimpleBinaryDecisionDiagramTerminal', VOID, VOID, [Terminal]);
|
|
61
|
+
initMetadataForClass(SimpleBinaryDecisionDiagramVariable, 'SimpleBinaryDecisionDiagramVariable', VOID, VOID, [Variable]);
|
|
62
|
+
initMetadataForClass(CastVisitor, 'CastVisitor', CastVisitor);
|
|
63
63
|
//endregion
|
|
64
64
|
function Terminal() {
|
|
65
65
|
}
|
|
@@ -88,12 +88,12 @@
|
|
|
88
88
|
protoOf(Companion_0).simpleOf = function () {
|
|
89
89
|
return new SimpleBinaryDecisionDiagramBuilder();
|
|
90
90
|
};
|
|
91
|
-
protoOf(Companion_0).
|
|
91
|
+
protoOf(Companion_0).o33 = function (delegate) {
|
|
92
92
|
return new ReducedBinaryDecisionDiagramBuilder(delegate);
|
|
93
93
|
};
|
|
94
94
|
protoOf(Companion_0).reducedOf = function (delegate, $super) {
|
|
95
95
|
delegate = delegate === VOID ? this.defaultOf() : delegate;
|
|
96
|
-
return $super === VOID ? this.
|
|
96
|
+
return $super === VOID ? this.o33(delegate) : $super.o33.call(this, delegate);
|
|
97
97
|
};
|
|
98
98
|
var Companion_instance_0;
|
|
99
99
|
function Companion_getInstance_0() {
|
|
@@ -126,7 +126,7 @@
|
|
|
126
126
|
};
|
|
127
127
|
}
|
|
128
128
|
function andThenExpansion$lambda$lambda(a, b) {
|
|
129
|
-
return a
|
|
129
|
+
return a && b;
|
|
130
130
|
}
|
|
131
131
|
function andThenExpansion$lambda($this_andThenExpansion, $that, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator) {
|
|
132
132
|
return function () {
|
|
@@ -134,7 +134,7 @@
|
|
|
134
134
|
};
|
|
135
135
|
}
|
|
136
136
|
function orThenExpansion$lambda$lambda(a, b) {
|
|
137
|
-
return a
|
|
137
|
+
return a || b;
|
|
138
138
|
}
|
|
139
139
|
function orThenExpansion$lambda($this_orThenExpansion, $that, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator) {
|
|
140
140
|
return function () {
|
|
@@ -206,14 +206,16 @@
|
|
|
206
206
|
cause = cause === VOID ? null : cause;
|
|
207
207
|
RuntimeException_init_$Init$(message, cause, this);
|
|
208
208
|
captureStack(this, BinaryDecisionDiagramException);
|
|
209
|
-
this.
|
|
210
|
-
this.
|
|
209
|
+
this.p33_1 = message;
|
|
210
|
+
this.q33_1 = cause;
|
|
211
|
+
delete this.message;
|
|
212
|
+
delete this.cause;
|
|
211
213
|
}
|
|
212
|
-
protoOf(BinaryDecisionDiagramException).
|
|
213
|
-
return this.
|
|
214
|
+
protoOf(BinaryDecisionDiagramException).e = function () {
|
|
215
|
+
return this.p33_1;
|
|
214
216
|
};
|
|
215
|
-
protoOf(BinaryDecisionDiagramException).
|
|
216
|
-
return this.
|
|
217
|
+
protoOf(BinaryDecisionDiagramException).f = function () {
|
|
218
|
+
return this.q33_1;
|
|
217
219
|
};
|
|
218
220
|
function BinaryDecisionDiagramOperationException(message, cause) {
|
|
219
221
|
cause = cause === VOID ? null : cause;
|
|
@@ -221,60 +223,60 @@
|
|
|
221
223
|
captureStack(this, BinaryDecisionDiagramOperationException);
|
|
222
224
|
}
|
|
223
225
|
function AnyVisitor(predicate) {
|
|
224
|
-
this.
|
|
226
|
+
this.r33_1 = predicate;
|
|
225
227
|
}
|
|
226
|
-
protoOf(AnyVisitor).
|
|
228
|
+
protoOf(AnyVisitor).s33 = function (node) {
|
|
227
229
|
return false;
|
|
228
230
|
};
|
|
229
231
|
protoOf(AnyVisitor).visitTerminal = function (node) {
|
|
230
|
-
return this.
|
|
232
|
+
return this.s33(node);
|
|
231
233
|
};
|
|
232
|
-
protoOf(AnyVisitor).
|
|
233
|
-
var result = this.
|
|
234
|
+
protoOf(AnyVisitor).t33 = function (node) {
|
|
235
|
+
var result = this.r33_1(node.e2());
|
|
234
236
|
if (!result) {
|
|
235
|
-
result = node.
|
|
237
|
+
result = node.m33().accept(this);
|
|
236
238
|
}
|
|
237
239
|
if (!result) {
|
|
238
|
-
result = node.
|
|
240
|
+
result = node.n33().accept(this);
|
|
239
241
|
}
|
|
240
242
|
return result;
|
|
241
243
|
};
|
|
242
244
|
protoOf(AnyVisitor).visitVariable = function (node) {
|
|
243
|
-
return this.
|
|
245
|
+
return this.t33(node);
|
|
244
246
|
};
|
|
245
247
|
function visitWithTable($this, first, second, computation) {
|
|
246
248
|
var firstKey = hashCode(first);
|
|
247
249
|
var secondKey = hashCode(second);
|
|
248
|
-
if (!$this.
|
|
249
|
-
|
|
250
|
-
var this_0 = $this.c32_1;
|
|
250
|
+
if (!$this.a34_1.f2(firstKey)) {
|
|
251
|
+
var tmp0 = $this.a34_1;
|
|
251
252
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
253
|
+
// Inline function 'kotlin.collections.set' call
|
|
252
254
|
var value = LinkedHashMap_init_$Create$();
|
|
253
|
-
|
|
255
|
+
tmp0.k4(firstKey, value);
|
|
254
256
|
}
|
|
255
|
-
var cached = ensureNotNull($this.
|
|
257
|
+
var cached = ensureNotNull($this.a34_1.h2(firstKey)).h2(secondKey);
|
|
256
258
|
if (!(cached == null)) {
|
|
257
259
|
return cached;
|
|
258
260
|
}
|
|
259
261
|
var result = computation();
|
|
260
262
|
// Inline function 'kotlin.collections.set' call
|
|
261
|
-
ensureNotNull($this.
|
|
263
|
+
ensureNotNull($this.a34_1.h2(firstKey)).k4(secondKey, result);
|
|
262
264
|
return result;
|
|
263
265
|
}
|
|
264
266
|
function apply($this, first, second) {
|
|
265
|
-
var truth = $this.
|
|
266
|
-
return new Pair($this.
|
|
267
|
+
var truth = $this.w33_1(first.k33(), second.k33());
|
|
268
|
+
return new Pair($this.u33_1.buildTerminal(truth), truth ? $this.y33_1 : $this.x33_1);
|
|
267
269
|
}
|
|
268
270
|
function apply_0($this, first, second) {
|
|
269
|
-
$this.
|
|
270
|
-
var lowNode = first.
|
|
271
|
-
$this.
|
|
272
|
-
var highNode = first.
|
|
273
|
-
return new Pair($this.
|
|
271
|
+
$this.v33_1 = second.m33();
|
|
272
|
+
var lowNode = first.l33($this);
|
|
273
|
+
$this.v33_1 = second.n33();
|
|
274
|
+
var highNode = first.l33($this);
|
|
275
|
+
return new Pair($this.u33_1.buildVariable(second.e2(), lowNode.xc_1, highNode.xc_1), $this.z33_1(second.e2(), lowNode.yc_1, highNode.yc_1));
|
|
274
276
|
}
|
|
275
277
|
function apply_1($this, first, second) {
|
|
276
|
-
$this.
|
|
277
|
-
return second.
|
|
278
|
+
$this.v33_1 = first;
|
|
279
|
+
return second.l33($this);
|
|
278
280
|
}
|
|
279
281
|
function apply_2($this, first, second) {
|
|
280
282
|
var newValue;
|
|
@@ -282,27 +284,27 @@
|
|
|
282
284
|
var firstHigh;
|
|
283
285
|
var secondLow;
|
|
284
286
|
var secondHigh;
|
|
285
|
-
if (compareTo(first.
|
|
286
|
-
newValue = first.
|
|
287
|
-
firstHigh = first.
|
|
288
|
-
firstLow = first.
|
|
287
|
+
if (compareTo(first.e2(), second.e2()) <= 0) {
|
|
288
|
+
newValue = first.e2();
|
|
289
|
+
firstHigh = first.n33();
|
|
290
|
+
firstLow = first.m33();
|
|
289
291
|
} else {
|
|
290
|
-
newValue = second.
|
|
292
|
+
newValue = second.e2();
|
|
291
293
|
firstLow = first;
|
|
292
294
|
firstHigh = first;
|
|
293
295
|
}
|
|
294
|
-
if (compareTo(second.
|
|
295
|
-
secondHigh = second.
|
|
296
|
-
secondLow = second.
|
|
296
|
+
if (compareTo(second.e2(), first.e2()) <= 0) {
|
|
297
|
+
secondHigh = second.n33();
|
|
298
|
+
secondLow = second.m33();
|
|
297
299
|
} else {
|
|
298
300
|
secondLow = second;
|
|
299
301
|
secondHigh = second;
|
|
300
302
|
}
|
|
301
|
-
$this.
|
|
303
|
+
$this.v33_1 = secondLow;
|
|
302
304
|
var lowNode = firstLow.accept($this);
|
|
303
|
-
$this.
|
|
305
|
+
$this.v33_1 = secondHigh;
|
|
304
306
|
var highNode = firstHigh.accept($this);
|
|
305
|
-
return new Pair($this.
|
|
307
|
+
return new Pair($this.u33_1.buildVariable(newValue, lowNode.xc_1, highNode.xc_1), $this.z33_1(newValue, lowNode.yc_1, highNode.yc_1));
|
|
306
308
|
}
|
|
307
309
|
function BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node) {
|
|
308
310
|
return function (that) {
|
|
@@ -316,11 +318,11 @@
|
|
|
316
318
|
}
|
|
317
319
|
function BinaryApplyExpansionVisitor$visit$lambda(this$0, $node) {
|
|
318
320
|
return function () {
|
|
319
|
-
var tmp = this$0.
|
|
320
|
-
tmp.
|
|
321
|
-
var tmp_0 = this$0.
|
|
322
|
-
tmp_0.
|
|
323
|
-
return this$0.
|
|
321
|
+
var tmp = this$0.b34_1;
|
|
322
|
+
tmp.c34_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node);
|
|
323
|
+
var tmp_0 = this$0.b34_1;
|
|
324
|
+
tmp_0.d34_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_0(this$0, $node);
|
|
325
|
+
return this$0.v33_1.accept(this$0.b34_1);
|
|
324
326
|
};
|
|
325
327
|
}
|
|
326
328
|
function BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node) {
|
|
@@ -335,204 +337,210 @@
|
|
|
335
337
|
}
|
|
336
338
|
function BinaryApplyExpansionVisitor$visit$lambda_0(this$0, $node) {
|
|
337
339
|
return function () {
|
|
338
|
-
var tmp = this$0.
|
|
339
|
-
tmp.
|
|
340
|
-
var tmp_0 = this$0.
|
|
341
|
-
tmp_0.
|
|
342
|
-
return this$0.
|
|
340
|
+
var tmp = this$0.b34_1;
|
|
341
|
+
tmp.c34_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node);
|
|
342
|
+
var tmp_0 = this$0.b34_1;
|
|
343
|
+
tmp_0.d34_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_2(this$0, $node);
|
|
344
|
+
return this$0.v33_1.accept(this$0.b34_1);
|
|
343
345
|
};
|
|
344
346
|
}
|
|
345
347
|
function BinaryApplyExpansionVisitor(builder, thatNode, operator, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
|
|
346
|
-
this.
|
|
347
|
-
this.
|
|
348
|
-
this.
|
|
349
|
-
this.
|
|
350
|
-
this.
|
|
351
|
-
this.
|
|
348
|
+
this.u33_1 = builder;
|
|
349
|
+
this.v33_1 = thatNode;
|
|
350
|
+
this.w33_1 = operator;
|
|
351
|
+
this.x33_1 = expansionFalseTerminal;
|
|
352
|
+
this.y33_1 = expansionTrueTerminal;
|
|
353
|
+
this.z33_1 = expansionOperator;
|
|
352
354
|
var tmp = this;
|
|
353
355
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
354
|
-
tmp.
|
|
355
|
-
this.
|
|
356
|
+
tmp.a34_1 = LinkedHashMap_init_$Create$();
|
|
357
|
+
this.b34_1 = new CastVisitor();
|
|
356
358
|
}
|
|
357
|
-
protoOf(BinaryApplyExpansionVisitor).
|
|
358
|
-
var tmp = this.
|
|
359
|
+
protoOf(BinaryApplyExpansionVisitor).s33 = function (node) {
|
|
360
|
+
var tmp = this.v33_1;
|
|
359
361
|
return visitWithTable(this, node, tmp, BinaryApplyExpansionVisitor$visit$lambda(this, node));
|
|
360
362
|
};
|
|
361
363
|
protoOf(BinaryApplyExpansionVisitor).visitTerminal = function (node) {
|
|
362
|
-
return this.
|
|
364
|
+
return this.s33(node);
|
|
363
365
|
};
|
|
364
|
-
protoOf(BinaryApplyExpansionVisitor).
|
|
365
|
-
var tmp = this.
|
|
366
|
+
protoOf(BinaryApplyExpansionVisitor).t33 = function (node) {
|
|
367
|
+
var tmp = this.v33_1;
|
|
366
368
|
return visitWithTable(this, node, tmp, BinaryApplyExpansionVisitor$visit$lambda_0(this, node));
|
|
367
369
|
};
|
|
368
370
|
protoOf(BinaryApplyExpansionVisitor).visitVariable = function (node) {
|
|
369
|
-
return this.
|
|
371
|
+
return this.t33(node);
|
|
370
372
|
};
|
|
371
373
|
function ExpansionVisitor(varOp, falseTerminal, trueTerminal) {
|
|
372
|
-
this.
|
|
373
|
-
this.
|
|
374
|
-
this.
|
|
374
|
+
this.e34_1 = varOp;
|
|
375
|
+
this.f34_1 = falseTerminal;
|
|
376
|
+
this.g34_1 = trueTerminal;
|
|
375
377
|
}
|
|
376
|
-
protoOf(ExpansionVisitor).
|
|
377
|
-
return node.
|
|
378
|
+
protoOf(ExpansionVisitor).s33 = function (node) {
|
|
379
|
+
return node.k33() ? this.g34_1 : this.f34_1;
|
|
378
380
|
};
|
|
379
381
|
protoOf(ExpansionVisitor).visitTerminal = function (node) {
|
|
380
|
-
return this.
|
|
382
|
+
return this.s33(node);
|
|
381
383
|
};
|
|
382
|
-
protoOf(ExpansionVisitor).
|
|
383
|
-
var lowValue = node.
|
|
384
|
-
var highValue = node.
|
|
385
|
-
return this.
|
|
384
|
+
protoOf(ExpansionVisitor).t33 = function (node) {
|
|
385
|
+
var lowValue = node.m33().accept(this);
|
|
386
|
+
var highValue = node.n33().accept(this);
|
|
387
|
+
return this.e34_1(node.e2(), lowValue, highValue);
|
|
386
388
|
};
|
|
387
389
|
protoOf(ExpansionVisitor).visitVariable = function (node) {
|
|
388
|
-
return this.
|
|
390
|
+
return this.t33(node);
|
|
389
391
|
};
|
|
390
392
|
function UnaryApplyExpansionVisitor(builder, operator, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
|
|
391
|
-
this.
|
|
392
|
-
this.
|
|
393
|
-
this.
|
|
394
|
-
this.
|
|
395
|
-
this.
|
|
393
|
+
this.h34_1 = builder;
|
|
394
|
+
this.i34_1 = operator;
|
|
395
|
+
this.j34_1 = expansionFalseTerminal;
|
|
396
|
+
this.k34_1 = expansionTrueTerminal;
|
|
397
|
+
this.l34_1 = expansionOperator;
|
|
396
398
|
var tmp = this;
|
|
397
399
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
398
|
-
tmp.
|
|
400
|
+
tmp.m34_1 = LinkedHashMap_init_$Create$();
|
|
399
401
|
}
|
|
400
|
-
protoOf(UnaryApplyExpansionVisitor).
|
|
401
|
-
var resTruth = this.
|
|
402
|
-
return new Pair(this.
|
|
402
|
+
protoOf(UnaryApplyExpansionVisitor).s33 = function (node) {
|
|
403
|
+
var resTruth = this.i34_1(node.k33());
|
|
404
|
+
return new Pair(this.h34_1.buildTerminal(resTruth), resTruth ? this.k34_1 : this.j34_1);
|
|
403
405
|
};
|
|
404
406
|
protoOf(UnaryApplyExpansionVisitor).visitTerminal = function (node) {
|
|
405
|
-
return this.
|
|
407
|
+
return this.s33(node);
|
|
406
408
|
};
|
|
407
|
-
protoOf(UnaryApplyExpansionVisitor).
|
|
409
|
+
protoOf(UnaryApplyExpansionVisitor).t33 = function (node) {
|
|
408
410
|
var key = hashCode(node);
|
|
409
|
-
if (this.
|
|
410
|
-
return ensureNotNull(this.
|
|
411
|
+
if (this.m34_1.f2(key)) {
|
|
412
|
+
return ensureNotNull(this.m34_1.h2(key));
|
|
411
413
|
}
|
|
412
|
-
var lowNode = node.
|
|
413
|
-
var highNode = node.
|
|
414
|
-
var result = new Pair(this.
|
|
414
|
+
var lowNode = node.m33().accept(this);
|
|
415
|
+
var highNode = node.n33().accept(this);
|
|
416
|
+
var result = new Pair(this.h34_1.buildVariable(node.e2(), lowNode.xc_1, highNode.xc_1), this.l34_1(node.e2(), lowNode.yc_1, highNode.yc_1));
|
|
415
417
|
// Inline function 'kotlin.collections.set' call
|
|
416
|
-
this.
|
|
418
|
+
this.m34_1.k4(key, result);
|
|
417
419
|
return result;
|
|
418
420
|
};
|
|
419
421
|
protoOf(UnaryApplyExpansionVisitor).visitVariable = function (node) {
|
|
420
|
-
return this.
|
|
422
|
+
return this.t33(node);
|
|
421
423
|
};
|
|
422
424
|
function ReducedBinaryDecisionDiagramBuilder(delegate) {
|
|
423
|
-
this.
|
|
425
|
+
this.n34_1 = delegate;
|
|
424
426
|
var tmp = this;
|
|
425
427
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
426
|
-
tmp.
|
|
428
|
+
tmp.o34_1 = LinkedHashMap_init_$Create$();
|
|
427
429
|
}
|
|
428
|
-
protoOf(ReducedBinaryDecisionDiagramBuilder).
|
|
430
|
+
protoOf(ReducedBinaryDecisionDiagramBuilder).p34 = function (value, low, high) {
|
|
429
431
|
if (equals(low, high)) {
|
|
430
432
|
return low;
|
|
431
433
|
}
|
|
432
|
-
var newNode = this.
|
|
434
|
+
var newNode = this.n34_1.buildVariable(value, low, high);
|
|
433
435
|
var key = hashCode(newNode);
|
|
434
|
-
var cached = this.
|
|
436
|
+
var cached = this.o34_1.h2(key);
|
|
435
437
|
var tmp;
|
|
436
438
|
if (!(cached == null)) {
|
|
437
439
|
tmp = cached;
|
|
438
440
|
} else {
|
|
439
441
|
// Inline function 'kotlin.collections.set' call
|
|
440
|
-
this.
|
|
442
|
+
this.o34_1.k4(key, newNode);
|
|
441
443
|
tmp = newNode;
|
|
442
444
|
}
|
|
443
445
|
return tmp;
|
|
444
446
|
};
|
|
445
447
|
protoOf(ReducedBinaryDecisionDiagramBuilder).buildVariable = function (value, low, high) {
|
|
446
|
-
return this.
|
|
448
|
+
return this.p34(isComparable(value) ? value : THROW_CCE(), low, high);
|
|
447
449
|
};
|
|
448
|
-
protoOf(ReducedBinaryDecisionDiagramBuilder).
|
|
449
|
-
return this.
|
|
450
|
+
protoOf(ReducedBinaryDecisionDiagramBuilder).q34 = function (truth) {
|
|
451
|
+
return this.n34_1.buildTerminal(truth);
|
|
450
452
|
};
|
|
451
453
|
protoOf(ReducedBinaryDecisionDiagramBuilder).buildTerminal = function (truth) {
|
|
452
|
-
return this.
|
|
454
|
+
return this.q34(truth);
|
|
453
455
|
};
|
|
454
456
|
function SimpleBinaryDecisionDiagramBuilder() {
|
|
455
457
|
}
|
|
456
|
-
protoOf(SimpleBinaryDecisionDiagramBuilder).
|
|
458
|
+
protoOf(SimpleBinaryDecisionDiagramBuilder).p34 = function (value, low, high) {
|
|
457
459
|
return new SimpleBinaryDecisionDiagramVariable(value, low, high);
|
|
458
460
|
};
|
|
459
461
|
protoOf(SimpleBinaryDecisionDiagramBuilder).buildVariable = function (value, low, high) {
|
|
460
|
-
return this.
|
|
462
|
+
return this.p34(isComparable(value) ? value : THROW_CCE(), low, high);
|
|
461
463
|
};
|
|
462
|
-
protoOf(SimpleBinaryDecisionDiagramBuilder).
|
|
464
|
+
protoOf(SimpleBinaryDecisionDiagramBuilder).q34 = function (truth) {
|
|
463
465
|
return new SimpleBinaryDecisionDiagramTerminal(truth);
|
|
464
466
|
};
|
|
465
467
|
protoOf(SimpleBinaryDecisionDiagramBuilder).buildTerminal = function (truth) {
|
|
466
|
-
return this.
|
|
468
|
+
return this.q34(truth);
|
|
467
469
|
};
|
|
468
470
|
function SimpleBinaryDecisionDiagramTerminal(truth) {
|
|
469
|
-
this.
|
|
471
|
+
this.r34_1 = truth;
|
|
470
472
|
}
|
|
471
|
-
protoOf(SimpleBinaryDecisionDiagramTerminal).
|
|
472
|
-
return this.
|
|
473
|
+
protoOf(SimpleBinaryDecisionDiagramTerminal).k33 = function () {
|
|
474
|
+
return this.r34_1;
|
|
473
475
|
};
|
|
474
476
|
protoOf(SimpleBinaryDecisionDiagramTerminal).equals = function (other) {
|
|
475
477
|
if (this === other)
|
|
476
478
|
return true;
|
|
477
|
-
if (other == null
|
|
479
|
+
if (other == null || !getKClassFromExpression(this).equals(getKClassFromExpression(other)))
|
|
478
480
|
return false;
|
|
479
481
|
if (!(other instanceof SimpleBinaryDecisionDiagramTerminal))
|
|
480
482
|
THROW_CCE();
|
|
481
|
-
if (!(this.
|
|
483
|
+
if (!(this.r34_1 === other.r34_1))
|
|
482
484
|
return false;
|
|
483
485
|
return true;
|
|
484
486
|
};
|
|
485
487
|
protoOf(SimpleBinaryDecisionDiagramTerminal).hashCode = function () {
|
|
486
|
-
return getBooleanHashCode(this.
|
|
488
|
+
return getBooleanHashCode(this.r34_1);
|
|
487
489
|
};
|
|
488
490
|
protoOf(SimpleBinaryDecisionDiagramTerminal).toString = function () {
|
|
489
|
-
return 'SimpleBinaryDecisionDiagramTerminal(truth=' + this.
|
|
491
|
+
return 'SimpleBinaryDecisionDiagramTerminal(truth=' + this.r34_1 + ')';
|
|
490
492
|
};
|
|
491
493
|
protoOf(SimpleBinaryDecisionDiagramTerminal).accept = function (visitor) {
|
|
492
|
-
return this.
|
|
494
|
+
return this.l33(visitor);
|
|
493
495
|
};
|
|
494
496
|
function _get_hashCodeCache__ny3r0q($this) {
|
|
497
|
+
var tmp0 = $this.v34_1;
|
|
498
|
+
var tmp = KProperty1;
|
|
495
499
|
// Inline function 'kotlin.getValue' call
|
|
496
|
-
|
|
497
|
-
|
|
498
|
-
return this_0.r2();
|
|
500
|
+
getPropertyCallableRef('hashCodeCache', 1, tmp, SimpleBinaryDecisionDiagramVariable$_get_hashCodeCache_$ref_6b1az9(), null);
|
|
501
|
+
return tmp0.e2();
|
|
499
502
|
}
|
|
500
503
|
function SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this$0) {
|
|
501
504
|
return function () {
|
|
502
|
-
var result = hashCode(this$0.
|
|
503
|
-
result = imul(31, result) + hashCode(this$0.
|
|
504
|
-
result = imul(31, result) + hashCode(this$0.
|
|
505
|
+
var result = hashCode(this$0.s34_1);
|
|
506
|
+
result = imul(31, result) + hashCode(this$0.t34_1) | 0;
|
|
507
|
+
result = imul(31, result) + hashCode(this$0.u34_1) | 0;
|
|
505
508
|
return result;
|
|
506
509
|
};
|
|
507
510
|
}
|
|
511
|
+
function SimpleBinaryDecisionDiagramVariable$_get_hashCodeCache_$ref_6b1az9() {
|
|
512
|
+
return function (p0) {
|
|
513
|
+
return _get_hashCodeCache__ny3r0q(p0);
|
|
514
|
+
};
|
|
515
|
+
}
|
|
508
516
|
function SimpleBinaryDecisionDiagramVariable(value, low, high) {
|
|
509
|
-
this.
|
|
510
|
-
this.
|
|
511
|
-
this.
|
|
517
|
+
this.s34_1 = value;
|
|
518
|
+
this.t34_1 = low;
|
|
519
|
+
this.u34_1 = high;
|
|
512
520
|
var tmp = this;
|
|
513
|
-
tmp.
|
|
521
|
+
tmp.v34_1 = lazy(SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this));
|
|
514
522
|
}
|
|
515
|
-
protoOf(SimpleBinaryDecisionDiagramVariable).
|
|
516
|
-
return this.
|
|
523
|
+
protoOf(SimpleBinaryDecisionDiagramVariable).e2 = function () {
|
|
524
|
+
return this.s34_1;
|
|
517
525
|
};
|
|
518
|
-
protoOf(SimpleBinaryDecisionDiagramVariable).
|
|
519
|
-
return this.
|
|
526
|
+
protoOf(SimpleBinaryDecisionDiagramVariable).m33 = function () {
|
|
527
|
+
return this.t34_1;
|
|
520
528
|
};
|
|
521
|
-
protoOf(SimpleBinaryDecisionDiagramVariable).
|
|
522
|
-
return this.
|
|
529
|
+
protoOf(SimpleBinaryDecisionDiagramVariable).n33 = function () {
|
|
530
|
+
return this.u34_1;
|
|
523
531
|
};
|
|
524
532
|
protoOf(SimpleBinaryDecisionDiagramVariable).equals = function (other) {
|
|
525
533
|
if (this === other)
|
|
526
534
|
return true;
|
|
527
|
-
if (other == null
|
|
535
|
+
if (other == null || !getKClassFromExpression(this).equals(getKClassFromExpression(other)))
|
|
528
536
|
return false;
|
|
529
537
|
if (!(other instanceof SimpleBinaryDecisionDiagramVariable))
|
|
530
538
|
THROW_CCE();
|
|
531
|
-
if (!equals(this.
|
|
539
|
+
if (!equals(this.s34_1, other.s34_1))
|
|
532
540
|
return false;
|
|
533
|
-
if (!equals(this.
|
|
541
|
+
if (!equals(this.t34_1, other.t34_1))
|
|
534
542
|
return false;
|
|
535
|
-
if (!equals(this.
|
|
543
|
+
if (!equals(this.u34_1, other.u34_1))
|
|
536
544
|
return false;
|
|
537
545
|
return true;
|
|
538
546
|
};
|
|
@@ -540,41 +548,36 @@
|
|
|
540
548
|
return _get_hashCodeCache__ny3r0q(this);
|
|
541
549
|
};
|
|
542
550
|
protoOf(SimpleBinaryDecisionDiagramVariable).toString = function () {
|
|
543
|
-
return 'SimpleBinaryDecisionDiagramVariable(value=' + this.
|
|
551
|
+
return 'SimpleBinaryDecisionDiagramVariable(value=' + toString(this.s34_1) + ', low=' + toString(this.t34_1) + ', high=' + toString(this.u34_1) + ')';
|
|
544
552
|
};
|
|
545
553
|
protoOf(SimpleBinaryDecisionDiagramVariable).accept = function (visitor) {
|
|
546
|
-
return this.
|
|
554
|
+
return this.l33(visitor);
|
|
547
555
|
};
|
|
548
|
-
function hashCodeCache$factory() {
|
|
549
|
-
return getPropertyCallableRef('hashCodeCache', 1, KProperty1, function (receiver) {
|
|
550
|
-
return _get_hashCodeCache__ny3r0q(receiver);
|
|
551
|
-
}, null);
|
|
552
|
-
}
|
|
553
556
|
function CastVisitor() {
|
|
554
|
-
this.
|
|
555
|
-
this.
|
|
557
|
+
this.c34_1 = null;
|
|
558
|
+
this.d34_1 = null;
|
|
556
559
|
}
|
|
557
|
-
protoOf(CastVisitor).
|
|
558
|
-
return ensureNotNull(this.
|
|
560
|
+
protoOf(CastVisitor).s33 = function (node) {
|
|
561
|
+
return ensureNotNull(this.c34_1)(node);
|
|
559
562
|
};
|
|
560
563
|
protoOf(CastVisitor).visitTerminal = function (node) {
|
|
561
|
-
return this.
|
|
564
|
+
return this.s33(node);
|
|
562
565
|
};
|
|
563
|
-
protoOf(CastVisitor).
|
|
564
|
-
return ensureNotNull(this.
|
|
566
|
+
protoOf(CastVisitor).t33 = function (node) {
|
|
567
|
+
return ensureNotNull(this.d34_1)(node);
|
|
565
568
|
};
|
|
566
569
|
protoOf(CastVisitor).visitVariable = function (node) {
|
|
567
|
-
return this.
|
|
570
|
+
return this.t33(node);
|
|
568
571
|
};
|
|
569
572
|
//region block: post-declaration
|
|
570
573
|
defineProp(protoOf(BinaryDecisionDiagramException), 'message', function () {
|
|
571
|
-
return this.
|
|
574
|
+
return this.e();
|
|
572
575
|
});
|
|
573
576
|
defineProp(protoOf(BinaryDecisionDiagramException), 'cause', function () {
|
|
574
|
-
return this.
|
|
577
|
+
return this.f();
|
|
575
578
|
});
|
|
576
|
-
protoOf(SimpleBinaryDecisionDiagramTerminal).
|
|
577
|
-
protoOf(SimpleBinaryDecisionDiagramVariable).
|
|
579
|
+
protoOf(SimpleBinaryDecisionDiagramTerminal).l33 = accept;
|
|
580
|
+
protoOf(SimpleBinaryDecisionDiagramVariable).l33 = accept_0;
|
|
578
581
|
//endregion
|
|
579
582
|
//region block: init
|
|
580
583
|
Companion_instance = new Companion();
|