@tuprolog/2p-full 1.4.1 → 1.5.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 +152 -152
- package/2p-core.js +2379 -2379
- package/2p-core.js.map +1 -1
- package/2p-solve-classic.js +853 -853
- package/2p-solve-classic.js.map +1 -1
- package/2p-solve-plp.js +2 -2
- package/2p-solve-problog.js +1166 -1166
- package/2p-solve-problog.js.map +1 -1
- package/2p-solve-streams.js +818 -818
- package/2p-solve.js +3245 -3250
- package/2p-solve.js.map +1 -1
- package/2p-theory.js +1352 -1352
- package/2p-unify.js +321 -321
- package/2p-utils.js +352 -352
- package/README.md +4 -3
- package/kotlin-kotlin-stdlib.js +1282 -1244
- package/kotlin-kotlin-stdlib.js.map +1 -1
- package/kt-math.js +1460 -1460
- package/okio-parent-okio-nodefilesystem.js +15 -0
- package/okio-parent-okio-nodefilesystem.js.map +1 -0
- package/okio-parent-okio.js +15 -0
- package/okio-parent-okio.js.map +1 -0
- package/package.json +1 -1
package/2p-bdd.js
CHANGED
|
@@ -17,7 +17,7 @@
|
|
|
17
17
|
var initMetadataForInterface = kotlin_kotlin.$_$.d6;
|
|
18
18
|
var initMetadataForCompanion = kotlin_kotlin.$_$.b6;
|
|
19
19
|
var VOID = kotlin_kotlin.$_$.b;
|
|
20
|
-
var RuntimeException = kotlin_kotlin.$_$.
|
|
20
|
+
var RuntimeException = kotlin_kotlin.$_$.na;
|
|
21
21
|
var RuntimeException_init_$Init$ = kotlin_kotlin.$_$.n1;
|
|
22
22
|
var captureStack = kotlin_kotlin.$_$.k5;
|
|
23
23
|
var defineProp = kotlin_kotlin.$_$.s5;
|
|
@@ -25,18 +25,18 @@
|
|
|
25
25
|
var hashCode = kotlin_kotlin.$_$.z5;
|
|
26
26
|
var LinkedHashMap_init_$Create$ = kotlin_kotlin.$_$.q;
|
|
27
27
|
var Unit_instance = kotlin_kotlin.$_$.m;
|
|
28
|
-
var ensureNotNull = kotlin_kotlin.$_$.
|
|
29
|
-
var Pair = kotlin_kotlin.$_$.
|
|
28
|
+
var ensureNotNull = kotlin_kotlin.$_$.sa;
|
|
29
|
+
var Pair = kotlin_kotlin.$_$.ma;
|
|
30
30
|
var compareTo = kotlin_kotlin.$_$.q5;
|
|
31
31
|
var equals = kotlin_kotlin.$_$.t5;
|
|
32
|
-
var THROW_CCE = kotlin_kotlin.$_$.
|
|
32
|
+
var THROW_CCE = kotlin_kotlin.$_$.oa;
|
|
33
33
|
var isComparable = kotlin_kotlin.$_$.i6;
|
|
34
34
|
var getKClassFromExpression = kotlin_kotlin.$_$.f7;
|
|
35
35
|
var getBooleanHashCode = kotlin_kotlin.$_$.v5;
|
|
36
36
|
var KProperty1 = kotlin_kotlin.$_$.h7;
|
|
37
37
|
var getPropertyCallableRef = kotlin_kotlin.$_$.x5;
|
|
38
38
|
var constructCallableReference = kotlin_kotlin.$_$.r5;
|
|
39
|
-
var lazy = kotlin_kotlin.$_$.
|
|
39
|
+
var lazy = kotlin_kotlin.$_$.ua;
|
|
40
40
|
var toString = kotlin_kotlin.$_$.s6;
|
|
41
41
|
//endregion
|
|
42
42
|
//region block: pre-declaration
|
|
@@ -89,12 +89,12 @@
|
|
|
89
89
|
protoOf(Companion_0).simpleOf = function () {
|
|
90
90
|
return new SimpleBinaryDecisionDiagramBuilder();
|
|
91
91
|
};
|
|
92
|
-
protoOf(Companion_0).
|
|
92
|
+
protoOf(Companion_0).v35 = function (delegate) {
|
|
93
93
|
return new ReducedBinaryDecisionDiagramBuilder(delegate);
|
|
94
94
|
};
|
|
95
95
|
protoOf(Companion_0).reducedOf = function (delegate, $super) {
|
|
96
96
|
delegate = delegate === VOID ? this.defaultOf() : delegate;
|
|
97
|
-
return $super === VOID ? this.
|
|
97
|
+
return $super === VOID ? this.v35(delegate) : $super.v35.call(this, delegate);
|
|
98
98
|
};
|
|
99
99
|
var Companion_instance_0;
|
|
100
100
|
function Companion_getInstance_0() {
|
|
@@ -207,16 +207,16 @@
|
|
|
207
207
|
cause = cause === VOID ? null : cause;
|
|
208
208
|
RuntimeException_init_$Init$(message, cause, this);
|
|
209
209
|
captureStack(this, BinaryDecisionDiagramException);
|
|
210
|
-
this.
|
|
211
|
-
this.
|
|
210
|
+
this.w35_1 = message;
|
|
211
|
+
this.x35_1 = cause;
|
|
212
212
|
delete this.message;
|
|
213
213
|
delete this.cause;
|
|
214
214
|
}
|
|
215
|
-
protoOf(BinaryDecisionDiagramException).o1 = function () {
|
|
216
|
-
return this.t35_1;
|
|
217
|
-
};
|
|
218
215
|
protoOf(BinaryDecisionDiagramException).p1 = function () {
|
|
219
|
-
return this.
|
|
216
|
+
return this.w35_1;
|
|
217
|
+
};
|
|
218
|
+
protoOf(BinaryDecisionDiagramException).q1 = function () {
|
|
219
|
+
return this.x35_1;
|
|
220
220
|
};
|
|
221
221
|
function BinaryDecisionDiagramOperationException(message, cause) {
|
|
222
222
|
cause = cause === VOID ? null : cause;
|
|
@@ -224,60 +224,60 @@
|
|
|
224
224
|
captureStack(this, BinaryDecisionDiagramOperationException);
|
|
225
225
|
}
|
|
226
226
|
function AnyVisitor(predicate) {
|
|
227
|
-
this.
|
|
227
|
+
this.y35_1 = predicate;
|
|
228
228
|
}
|
|
229
|
-
protoOf(AnyVisitor).
|
|
229
|
+
protoOf(AnyVisitor).z35 = function (node) {
|
|
230
230
|
return false;
|
|
231
231
|
};
|
|
232
232
|
protoOf(AnyVisitor).visitTerminal = function (node) {
|
|
233
|
-
return this.
|
|
233
|
+
return this.z35(node);
|
|
234
234
|
};
|
|
235
|
-
protoOf(AnyVisitor).
|
|
236
|
-
var result = this.
|
|
235
|
+
protoOf(AnyVisitor).a36 = function (node) {
|
|
236
|
+
var result = this.y35_1(node.f2());
|
|
237
237
|
if (!result) {
|
|
238
|
-
result = node.
|
|
238
|
+
result = node.t35().accept(this);
|
|
239
239
|
}
|
|
240
240
|
if (!result) {
|
|
241
|
-
result = node.
|
|
241
|
+
result = node.u35().accept(this);
|
|
242
242
|
}
|
|
243
243
|
return result;
|
|
244
244
|
};
|
|
245
245
|
protoOf(AnyVisitor).visitVariable = function (node) {
|
|
246
|
-
return this.
|
|
246
|
+
return this.a36(node);
|
|
247
247
|
};
|
|
248
248
|
function visitWithTable($this, first, second, computation) {
|
|
249
249
|
var firstKey = hashCode(first);
|
|
250
250
|
var secondKey = hashCode(second);
|
|
251
|
-
if (!$this.
|
|
252
|
-
var tmp0 = $this.
|
|
251
|
+
if (!$this.h36_1.g2(firstKey)) {
|
|
252
|
+
var tmp0 = $this.h36_1;
|
|
253
253
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
254
254
|
// Inline function 'kotlin.collections.set' call
|
|
255
255
|
var value = LinkedHashMap_init_$Create$();
|
|
256
|
-
tmp0.
|
|
256
|
+
tmp0.l4(firstKey, value);
|
|
257
257
|
}
|
|
258
|
-
var cached = ensureNotNull($this.
|
|
258
|
+
var cached = ensureNotNull($this.h36_1.i2(firstKey)).i2(secondKey);
|
|
259
259
|
if (!(cached == null)) {
|
|
260
260
|
return cached;
|
|
261
261
|
}
|
|
262
262
|
var result = computation();
|
|
263
263
|
// Inline function 'kotlin.collections.set' call
|
|
264
|
-
ensureNotNull($this.
|
|
264
|
+
ensureNotNull($this.h36_1.i2(firstKey)).l4(secondKey, result);
|
|
265
265
|
return result;
|
|
266
266
|
}
|
|
267
267
|
function apply($this, first, second) {
|
|
268
|
-
var truth = $this.
|
|
269
|
-
return new Pair($this.
|
|
268
|
+
var truth = $this.d36_1(first.r35(), second.r35());
|
|
269
|
+
return new Pair($this.b36_1.buildTerminal(truth), truth ? $this.f36_1 : $this.e36_1);
|
|
270
270
|
}
|
|
271
271
|
function apply_0($this, first, second) {
|
|
272
|
-
$this.
|
|
273
|
-
var lowNode = first.
|
|
274
|
-
$this.
|
|
275
|
-
var highNode = first.
|
|
276
|
-
return new Pair($this.
|
|
272
|
+
$this.c36_1 = second.t35();
|
|
273
|
+
var lowNode = first.s35($this);
|
|
274
|
+
$this.c36_1 = second.u35();
|
|
275
|
+
var highNode = first.s35($this);
|
|
276
|
+
return new Pair($this.b36_1.buildVariable(second.f2(), lowNode.first, highNode.first), $this.g36_1(second.f2(), lowNode.second, highNode.second));
|
|
277
277
|
}
|
|
278
278
|
function apply_1($this, first, second) {
|
|
279
|
-
$this.
|
|
280
|
-
return second.
|
|
279
|
+
$this.c36_1 = first;
|
|
280
|
+
return second.s35($this);
|
|
281
281
|
}
|
|
282
282
|
function apply_2($this, first, second) {
|
|
283
283
|
var newValue;
|
|
@@ -285,27 +285,27 @@
|
|
|
285
285
|
var firstHigh;
|
|
286
286
|
var secondLow;
|
|
287
287
|
var secondHigh;
|
|
288
|
-
if (compareTo(first.
|
|
289
|
-
newValue = first.
|
|
290
|
-
firstHigh = first.
|
|
291
|
-
firstLow = first.
|
|
288
|
+
if (compareTo(first.f2(), second.f2()) <= 0) {
|
|
289
|
+
newValue = first.f2();
|
|
290
|
+
firstHigh = first.u35();
|
|
291
|
+
firstLow = first.t35();
|
|
292
292
|
} else {
|
|
293
|
-
newValue = second.
|
|
293
|
+
newValue = second.f2();
|
|
294
294
|
firstLow = first;
|
|
295
295
|
firstHigh = first;
|
|
296
296
|
}
|
|
297
|
-
if (compareTo(second.
|
|
298
|
-
secondHigh = second.
|
|
299
|
-
secondLow = second.
|
|
297
|
+
if (compareTo(second.f2(), first.f2()) <= 0) {
|
|
298
|
+
secondHigh = second.u35();
|
|
299
|
+
secondLow = second.t35();
|
|
300
300
|
} else {
|
|
301
301
|
secondLow = second;
|
|
302
302
|
secondHigh = second;
|
|
303
303
|
}
|
|
304
|
-
$this.
|
|
304
|
+
$this.c36_1 = secondLow;
|
|
305
305
|
var lowNode = firstLow.accept($this);
|
|
306
|
-
$this.
|
|
306
|
+
$this.c36_1 = secondHigh;
|
|
307
307
|
var highNode = firstHigh.accept($this);
|
|
308
|
-
return new Pair($this.
|
|
308
|
+
return new Pair($this.b36_1.buildVariable(newValue, lowNode.first, highNode.first), $this.g36_1(newValue, lowNode.second, highNode.second));
|
|
309
309
|
}
|
|
310
310
|
function BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node) {
|
|
311
311
|
return function (that) {
|
|
@@ -319,11 +319,11 @@
|
|
|
319
319
|
}
|
|
320
320
|
function BinaryApplyExpansionVisitor$visit$lambda(this$0, $node) {
|
|
321
321
|
return function () {
|
|
322
|
-
var tmp = this$0.
|
|
323
|
-
tmp.
|
|
324
|
-
var tmp_0 = this$0.
|
|
325
|
-
tmp_0.
|
|
326
|
-
return this$0.
|
|
322
|
+
var tmp = this$0.i36_1;
|
|
323
|
+
tmp.j36_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node);
|
|
324
|
+
var tmp_0 = this$0.i36_1;
|
|
325
|
+
tmp_0.k36_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_0(this$0, $node);
|
|
326
|
+
return this$0.c36_1.accept(this$0.i36_1);
|
|
327
327
|
};
|
|
328
328
|
}
|
|
329
329
|
function BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node) {
|
|
@@ -338,141 +338,141 @@
|
|
|
338
338
|
}
|
|
339
339
|
function BinaryApplyExpansionVisitor$visit$lambda_0(this$0, $node) {
|
|
340
340
|
return function () {
|
|
341
|
-
var tmp = this$0.
|
|
342
|
-
tmp.
|
|
343
|
-
var tmp_0 = this$0.
|
|
344
|
-
tmp_0.
|
|
345
|
-
return this$0.
|
|
341
|
+
var tmp = this$0.i36_1;
|
|
342
|
+
tmp.j36_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node);
|
|
343
|
+
var tmp_0 = this$0.i36_1;
|
|
344
|
+
tmp_0.k36_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_2(this$0, $node);
|
|
345
|
+
return this$0.c36_1.accept(this$0.i36_1);
|
|
346
346
|
};
|
|
347
347
|
}
|
|
348
348
|
function BinaryApplyExpansionVisitor(builder, thatNode, operator, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
|
|
349
|
-
this.
|
|
350
|
-
this.
|
|
351
|
-
this.
|
|
352
|
-
this.
|
|
353
|
-
this.
|
|
354
|
-
this.
|
|
349
|
+
this.b36_1 = builder;
|
|
350
|
+
this.c36_1 = thatNode;
|
|
351
|
+
this.d36_1 = operator;
|
|
352
|
+
this.e36_1 = expansionFalseTerminal;
|
|
353
|
+
this.f36_1 = expansionTrueTerminal;
|
|
354
|
+
this.g36_1 = expansionOperator;
|
|
355
355
|
var tmp = this;
|
|
356
356
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
357
|
-
tmp.
|
|
358
|
-
this.
|
|
357
|
+
tmp.h36_1 = LinkedHashMap_init_$Create$();
|
|
358
|
+
this.i36_1 = new CastVisitor();
|
|
359
359
|
}
|
|
360
|
-
protoOf(BinaryApplyExpansionVisitor).
|
|
361
|
-
var tmp = this.
|
|
360
|
+
protoOf(BinaryApplyExpansionVisitor).z35 = function (node) {
|
|
361
|
+
var tmp = this.c36_1;
|
|
362
362
|
return visitWithTable(this, node, tmp, BinaryApplyExpansionVisitor$visit$lambda(this, node));
|
|
363
363
|
};
|
|
364
364
|
protoOf(BinaryApplyExpansionVisitor).visitTerminal = function (node) {
|
|
365
|
-
return this.
|
|
365
|
+
return this.z35(node);
|
|
366
366
|
};
|
|
367
|
-
protoOf(BinaryApplyExpansionVisitor).
|
|
368
|
-
var tmp = this.
|
|
367
|
+
protoOf(BinaryApplyExpansionVisitor).a36 = function (node) {
|
|
368
|
+
var tmp = this.c36_1;
|
|
369
369
|
return visitWithTable(this, node, tmp, BinaryApplyExpansionVisitor$visit$lambda_0(this, node));
|
|
370
370
|
};
|
|
371
371
|
protoOf(BinaryApplyExpansionVisitor).visitVariable = function (node) {
|
|
372
|
-
return this.
|
|
372
|
+
return this.a36(node);
|
|
373
373
|
};
|
|
374
374
|
function ExpansionVisitor(varOp, falseTerminal, trueTerminal) {
|
|
375
|
-
this.
|
|
376
|
-
this.
|
|
377
|
-
this.
|
|
375
|
+
this.l36_1 = varOp;
|
|
376
|
+
this.m36_1 = falseTerminal;
|
|
377
|
+
this.n36_1 = trueTerminal;
|
|
378
378
|
}
|
|
379
|
-
protoOf(ExpansionVisitor).
|
|
380
|
-
return node.
|
|
379
|
+
protoOf(ExpansionVisitor).z35 = function (node) {
|
|
380
|
+
return node.r35() ? this.n36_1 : this.m36_1;
|
|
381
381
|
};
|
|
382
382
|
protoOf(ExpansionVisitor).visitTerminal = function (node) {
|
|
383
|
-
return this.
|
|
383
|
+
return this.z35(node);
|
|
384
384
|
};
|
|
385
|
-
protoOf(ExpansionVisitor).
|
|
386
|
-
var lowValue = node.
|
|
387
|
-
var highValue = node.
|
|
388
|
-
return this.
|
|
385
|
+
protoOf(ExpansionVisitor).a36 = function (node) {
|
|
386
|
+
var lowValue = node.t35().accept(this);
|
|
387
|
+
var highValue = node.u35().accept(this);
|
|
388
|
+
return this.l36_1(node.f2(), lowValue, highValue);
|
|
389
389
|
};
|
|
390
390
|
protoOf(ExpansionVisitor).visitVariable = function (node) {
|
|
391
|
-
return this.
|
|
391
|
+
return this.a36(node);
|
|
392
392
|
};
|
|
393
393
|
function UnaryApplyExpansionVisitor(builder, operator, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
|
|
394
|
-
this.
|
|
395
|
-
this.
|
|
396
|
-
this.
|
|
397
|
-
this.
|
|
398
|
-
this.
|
|
394
|
+
this.o36_1 = builder;
|
|
395
|
+
this.p36_1 = operator;
|
|
396
|
+
this.q36_1 = expansionFalseTerminal;
|
|
397
|
+
this.r36_1 = expansionTrueTerminal;
|
|
398
|
+
this.s36_1 = expansionOperator;
|
|
399
399
|
var tmp = this;
|
|
400
400
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
401
|
-
tmp.
|
|
401
|
+
tmp.t36_1 = LinkedHashMap_init_$Create$();
|
|
402
402
|
}
|
|
403
|
-
protoOf(UnaryApplyExpansionVisitor).
|
|
404
|
-
var resTruth = this.
|
|
405
|
-
return new Pair(this.
|
|
403
|
+
protoOf(UnaryApplyExpansionVisitor).z35 = function (node) {
|
|
404
|
+
var resTruth = this.p36_1(node.r35());
|
|
405
|
+
return new Pair(this.o36_1.buildTerminal(resTruth), resTruth ? this.r36_1 : this.q36_1);
|
|
406
406
|
};
|
|
407
407
|
protoOf(UnaryApplyExpansionVisitor).visitTerminal = function (node) {
|
|
408
|
-
return this.
|
|
408
|
+
return this.z35(node);
|
|
409
409
|
};
|
|
410
|
-
protoOf(UnaryApplyExpansionVisitor).
|
|
410
|
+
protoOf(UnaryApplyExpansionVisitor).a36 = function (node) {
|
|
411
411
|
var key = hashCode(node);
|
|
412
|
-
if (this.
|
|
413
|
-
return ensureNotNull(this.
|
|
412
|
+
if (this.t36_1.g2(key)) {
|
|
413
|
+
return ensureNotNull(this.t36_1.i2(key));
|
|
414
414
|
}
|
|
415
|
-
var lowNode = node.
|
|
416
|
-
var highNode = node.
|
|
417
|
-
var result = new Pair(this.
|
|
415
|
+
var lowNode = node.t35().accept(this);
|
|
416
|
+
var highNode = node.u35().accept(this);
|
|
417
|
+
var result = new Pair(this.o36_1.buildVariable(node.f2(), lowNode.first, highNode.first), this.s36_1(node.f2(), lowNode.second, highNode.second));
|
|
418
418
|
// Inline function 'kotlin.collections.set' call
|
|
419
|
-
this.
|
|
419
|
+
this.t36_1.l4(key, result);
|
|
420
420
|
return result;
|
|
421
421
|
};
|
|
422
422
|
protoOf(UnaryApplyExpansionVisitor).visitVariable = function (node) {
|
|
423
|
-
return this.
|
|
423
|
+
return this.a36(node);
|
|
424
424
|
};
|
|
425
425
|
function ReducedBinaryDecisionDiagramBuilder(delegate) {
|
|
426
|
-
this.
|
|
426
|
+
this.u36_1 = delegate;
|
|
427
427
|
var tmp = this;
|
|
428
428
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
429
|
-
tmp.
|
|
429
|
+
tmp.v36_1 = LinkedHashMap_init_$Create$();
|
|
430
430
|
}
|
|
431
|
-
protoOf(ReducedBinaryDecisionDiagramBuilder).
|
|
431
|
+
protoOf(ReducedBinaryDecisionDiagramBuilder).w36 = function (value, low, high) {
|
|
432
432
|
if (equals(low, high)) {
|
|
433
433
|
return low;
|
|
434
434
|
}
|
|
435
|
-
var newNode = this.
|
|
435
|
+
var newNode = this.u36_1.buildVariable(value, low, high);
|
|
436
436
|
var key = hashCode(newNode);
|
|
437
|
-
var cached = this.
|
|
437
|
+
var cached = this.v36_1.i2(key);
|
|
438
438
|
var tmp;
|
|
439
439
|
if (!(cached == null)) {
|
|
440
440
|
tmp = cached;
|
|
441
441
|
} else {
|
|
442
442
|
// Inline function 'kotlin.collections.set' call
|
|
443
|
-
this.
|
|
443
|
+
this.v36_1.l4(key, newNode);
|
|
444
444
|
tmp = newNode;
|
|
445
445
|
}
|
|
446
446
|
return tmp;
|
|
447
447
|
};
|
|
448
448
|
protoOf(ReducedBinaryDecisionDiagramBuilder).buildVariable = function (value, low, high) {
|
|
449
|
-
return this.
|
|
449
|
+
return this.w36(isComparable(value) ? value : THROW_CCE(), low, high);
|
|
450
450
|
};
|
|
451
|
-
protoOf(ReducedBinaryDecisionDiagramBuilder).
|
|
452
|
-
return this.
|
|
451
|
+
protoOf(ReducedBinaryDecisionDiagramBuilder).x36 = function (truth) {
|
|
452
|
+
return this.u36_1.buildTerminal(truth);
|
|
453
453
|
};
|
|
454
454
|
protoOf(ReducedBinaryDecisionDiagramBuilder).buildTerminal = function (truth) {
|
|
455
|
-
return this.
|
|
455
|
+
return this.x36(truth);
|
|
456
456
|
};
|
|
457
457
|
function SimpleBinaryDecisionDiagramBuilder() {
|
|
458
458
|
}
|
|
459
|
-
protoOf(SimpleBinaryDecisionDiagramBuilder).
|
|
459
|
+
protoOf(SimpleBinaryDecisionDiagramBuilder).w36 = function (value, low, high) {
|
|
460
460
|
return new SimpleBinaryDecisionDiagramVariable(value, low, high);
|
|
461
461
|
};
|
|
462
462
|
protoOf(SimpleBinaryDecisionDiagramBuilder).buildVariable = function (value, low, high) {
|
|
463
|
-
return this.
|
|
463
|
+
return this.w36(isComparable(value) ? value : THROW_CCE(), low, high);
|
|
464
464
|
};
|
|
465
|
-
protoOf(SimpleBinaryDecisionDiagramBuilder).
|
|
465
|
+
protoOf(SimpleBinaryDecisionDiagramBuilder).x36 = function (truth) {
|
|
466
466
|
return new SimpleBinaryDecisionDiagramTerminal(truth);
|
|
467
467
|
};
|
|
468
468
|
protoOf(SimpleBinaryDecisionDiagramBuilder).buildTerminal = function (truth) {
|
|
469
|
-
return this.
|
|
469
|
+
return this.x36(truth);
|
|
470
470
|
};
|
|
471
471
|
function SimpleBinaryDecisionDiagramTerminal(truth) {
|
|
472
|
-
this.
|
|
472
|
+
this.y36_1 = truth;
|
|
473
473
|
}
|
|
474
|
-
protoOf(SimpleBinaryDecisionDiagramTerminal).
|
|
475
|
-
return this.
|
|
474
|
+
protoOf(SimpleBinaryDecisionDiagramTerminal).r35 = function () {
|
|
475
|
+
return this.y36_1;
|
|
476
476
|
};
|
|
477
477
|
protoOf(SimpleBinaryDecisionDiagramTerminal).equals = function (other) {
|
|
478
478
|
if (this === other)
|
|
@@ -481,31 +481,31 @@
|
|
|
481
481
|
return false;
|
|
482
482
|
if (!(other instanceof SimpleBinaryDecisionDiagramTerminal))
|
|
483
483
|
THROW_CCE();
|
|
484
|
-
if (!(this.
|
|
484
|
+
if (!(this.y36_1 === other.y36_1))
|
|
485
485
|
return false;
|
|
486
486
|
return true;
|
|
487
487
|
};
|
|
488
488
|
protoOf(SimpleBinaryDecisionDiagramTerminal).hashCode = function () {
|
|
489
|
-
return getBooleanHashCode(this.
|
|
489
|
+
return getBooleanHashCode(this.y36_1);
|
|
490
490
|
};
|
|
491
491
|
protoOf(SimpleBinaryDecisionDiagramTerminal).toString = function () {
|
|
492
|
-
return 'SimpleBinaryDecisionDiagramTerminal(truth=' + this.
|
|
492
|
+
return 'SimpleBinaryDecisionDiagramTerminal(truth=' + this.y36_1 + ')';
|
|
493
493
|
};
|
|
494
494
|
protoOf(SimpleBinaryDecisionDiagramTerminal).accept = function (visitor) {
|
|
495
|
-
return this.
|
|
495
|
+
return this.s35(visitor);
|
|
496
496
|
};
|
|
497
497
|
function _get_hashCodeCache__ny3r0q($this) {
|
|
498
|
-
var tmp0 = $this.
|
|
498
|
+
var tmp0 = $this.c37_1;
|
|
499
499
|
var tmp = KProperty1;
|
|
500
500
|
// Inline function 'kotlin.getValue' call
|
|
501
501
|
getPropertyCallableRef('hashCodeCache', 1, tmp, SimpleBinaryDecisionDiagramVariable$_get_hashCodeCache_$ref_6b1az9(), null);
|
|
502
|
-
return tmp0.
|
|
502
|
+
return tmp0.f2();
|
|
503
503
|
}
|
|
504
504
|
function SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this$0) {
|
|
505
505
|
return function () {
|
|
506
|
-
var result = hashCode(this$0.
|
|
507
|
-
result = imul(31, result) + hashCode(this$0.
|
|
508
|
-
result = imul(31, result) + hashCode(this$0.
|
|
506
|
+
var result = hashCode(this$0.z36_1);
|
|
507
|
+
result = imul(31, result) + hashCode(this$0.a37_1) | 0;
|
|
508
|
+
result = imul(31, result) + hashCode(this$0.b37_1) | 0;
|
|
509
509
|
return result;
|
|
510
510
|
};
|
|
511
511
|
}
|
|
@@ -515,20 +515,20 @@
|
|
|
515
515
|
}, 1, 0, 88);
|
|
516
516
|
}
|
|
517
517
|
function SimpleBinaryDecisionDiagramVariable(value, low, high) {
|
|
518
|
-
this.
|
|
519
|
-
this.
|
|
520
|
-
this.
|
|
518
|
+
this.z36_1 = value;
|
|
519
|
+
this.a37_1 = low;
|
|
520
|
+
this.b37_1 = high;
|
|
521
521
|
var tmp = this;
|
|
522
|
-
tmp.
|
|
522
|
+
tmp.c37_1 = lazy(SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this));
|
|
523
523
|
}
|
|
524
|
-
protoOf(SimpleBinaryDecisionDiagramVariable).
|
|
525
|
-
return this.
|
|
524
|
+
protoOf(SimpleBinaryDecisionDiagramVariable).f2 = function () {
|
|
525
|
+
return this.z36_1;
|
|
526
526
|
};
|
|
527
|
-
protoOf(SimpleBinaryDecisionDiagramVariable).
|
|
528
|
-
return this.
|
|
527
|
+
protoOf(SimpleBinaryDecisionDiagramVariable).t35 = function () {
|
|
528
|
+
return this.a37_1;
|
|
529
529
|
};
|
|
530
|
-
protoOf(SimpleBinaryDecisionDiagramVariable).
|
|
531
|
-
return this.
|
|
530
|
+
protoOf(SimpleBinaryDecisionDiagramVariable).u35 = function () {
|
|
531
|
+
return this.b37_1;
|
|
532
532
|
};
|
|
533
533
|
protoOf(SimpleBinaryDecisionDiagramVariable).equals = function (other) {
|
|
534
534
|
if (this === other)
|
|
@@ -537,11 +537,11 @@
|
|
|
537
537
|
return false;
|
|
538
538
|
if (!(other instanceof SimpleBinaryDecisionDiagramVariable))
|
|
539
539
|
THROW_CCE();
|
|
540
|
-
if (!equals(this.
|
|
540
|
+
if (!equals(this.z36_1, other.z36_1))
|
|
541
541
|
return false;
|
|
542
|
-
if (!equals(this.
|
|
542
|
+
if (!equals(this.a37_1, other.a37_1))
|
|
543
543
|
return false;
|
|
544
|
-
if (!equals(this.
|
|
544
|
+
if (!equals(this.b37_1, other.b37_1))
|
|
545
545
|
return false;
|
|
546
546
|
return true;
|
|
547
547
|
};
|
|
@@ -549,36 +549,36 @@
|
|
|
549
549
|
return _get_hashCodeCache__ny3r0q(this);
|
|
550
550
|
};
|
|
551
551
|
protoOf(SimpleBinaryDecisionDiagramVariable).toString = function () {
|
|
552
|
-
return 'SimpleBinaryDecisionDiagramVariable(value=' + toString(this.
|
|
552
|
+
return 'SimpleBinaryDecisionDiagramVariable(value=' + toString(this.z36_1) + ', low=' + toString(this.a37_1) + ', high=' + toString(this.b37_1) + ')';
|
|
553
553
|
};
|
|
554
554
|
protoOf(SimpleBinaryDecisionDiagramVariable).accept = function (visitor) {
|
|
555
|
-
return this.
|
|
555
|
+
return this.s35(visitor);
|
|
556
556
|
};
|
|
557
557
|
function CastVisitor() {
|
|
558
|
-
this.
|
|
559
|
-
this.
|
|
558
|
+
this.j36_1 = null;
|
|
559
|
+
this.k36_1 = null;
|
|
560
560
|
}
|
|
561
|
-
protoOf(CastVisitor).
|
|
562
|
-
return ensureNotNull(this.
|
|
561
|
+
protoOf(CastVisitor).z35 = function (node) {
|
|
562
|
+
return ensureNotNull(this.j36_1)(node);
|
|
563
563
|
};
|
|
564
564
|
protoOf(CastVisitor).visitTerminal = function (node) {
|
|
565
|
-
return this.
|
|
565
|
+
return this.z35(node);
|
|
566
566
|
};
|
|
567
|
-
protoOf(CastVisitor).
|
|
568
|
-
return ensureNotNull(this.
|
|
567
|
+
protoOf(CastVisitor).a36 = function (node) {
|
|
568
|
+
return ensureNotNull(this.k36_1)(node);
|
|
569
569
|
};
|
|
570
570
|
protoOf(CastVisitor).visitVariable = function (node) {
|
|
571
|
-
return this.
|
|
571
|
+
return this.a36(node);
|
|
572
572
|
};
|
|
573
573
|
//region block: post-declaration
|
|
574
574
|
defineProp(protoOf(BinaryDecisionDiagramException), 'message', function () {
|
|
575
|
-
return this.
|
|
575
|
+
return this.p1();
|
|
576
576
|
});
|
|
577
577
|
defineProp(protoOf(BinaryDecisionDiagramException), 'cause', function () {
|
|
578
|
-
return this.
|
|
578
|
+
return this.q1();
|
|
579
579
|
});
|
|
580
|
-
protoOf(SimpleBinaryDecisionDiagramTerminal).
|
|
581
|
-
protoOf(SimpleBinaryDecisionDiagramVariable).
|
|
580
|
+
protoOf(SimpleBinaryDecisionDiagramTerminal).s35 = accept;
|
|
581
|
+
protoOf(SimpleBinaryDecisionDiagramVariable).s35 = accept_0;
|
|
582
582
|
//endregion
|
|
583
583
|
//region block: init
|
|
584
584
|
Companion_instance = new Companion();
|