@tuprolog/2p-full 0.31.1 → 0.31.3
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 +141 -141
- package/2p-core.js +1 -1
- package/2p-io-lib.js +479 -479
- package/2p-oop-lib.js +606 -606
- package/2p-parser-core.js +116 -116
- package/2p-parser-theory.js +9 -9
- package/2p-repl.js +56 -56
- package/2p-solve-classic.js +760 -760
- package/2p-solve-problog.js +751 -751
- package/2p-solve-streams.js +549 -549
- package/2p-solve.js +2549 -2438
- package/2p-solve.js.map +1 -1
- package/clikt-clikt-js-ir.js +1034 -1026
- package/clikt-clikt-js-ir.js.map +1 -1
- package/kotlin-kotlin-stdlib-js-ir.js +6 -6
- package/kotlin-kotlin-stdlib-js-ir.js.map +1 -1
- package/package.json +4 -4
package/2p-bdd.js
CHANGED
|
@@ -78,15 +78,15 @@
|
|
|
78
78
|
return new SimpleBinaryDecisionDiagramBuilder();
|
|
79
79
|
};
|
|
80
80
|
Companion_0.prototype.reducedOf = function (delegate) {
|
|
81
|
-
return this.
|
|
81
|
+
return this.c32(delegate === void 1 ? this.defaultOf() : delegate);
|
|
82
82
|
};
|
|
83
|
-
Companion_0.prototype.
|
|
83
|
+
Companion_0.prototype.c32 = function (delegate) {
|
|
84
84
|
return new ReducedBinaryDecisionDiagramBuilder(delegate);
|
|
85
85
|
};
|
|
86
|
-
Companion_0.prototype.
|
|
86
|
+
Companion_0.prototype.d32 = function (delegate, $mask0, $handler) {
|
|
87
87
|
if (!(($mask0 & 1) === 0))
|
|
88
88
|
delegate = this.defaultOf();
|
|
89
|
-
return this.
|
|
89
|
+
return this.c32(delegate);
|
|
90
90
|
};
|
|
91
91
|
var Companion_instance_0;
|
|
92
92
|
function Companion_getInstance_0() {
|
|
@@ -139,13 +139,13 @@
|
|
|
139
139
|
function applyThenExpansion$lambda($this_applyThenExpansion, $unaryOp, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator) {
|
|
140
140
|
return function () {
|
|
141
141
|
var tmp = Companion_getInstance_0();
|
|
142
|
-
return $this_applyThenExpansion.accept(new UnaryApplyExpansionVisitor(tmp.
|
|
142
|
+
return $this_applyThenExpansion.accept(new UnaryApplyExpansionVisitor(tmp.d32(null, 1, null), $unaryOp, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator));
|
|
143
143
|
};
|
|
144
144
|
}
|
|
145
145
|
function applyThenExpansion$lambda_0($this_applyThenExpansion, $that, $binaryOp, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator) {
|
|
146
146
|
return function () {
|
|
147
147
|
var tmp = Companion_getInstance_0();
|
|
148
|
-
return $this_applyThenExpansion.accept(new BinaryApplyExpansionVisitor(tmp.
|
|
148
|
+
return $this_applyThenExpansion.accept(new BinaryApplyExpansionVisitor(tmp.d32(null, 1, null), $that, $binaryOp, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator));
|
|
149
149
|
};
|
|
150
150
|
}
|
|
151
151
|
function bddTerminalOf(value) {
|
|
@@ -162,7 +162,7 @@
|
|
|
162
162
|
}
|
|
163
163
|
function map(_this__u8e3s4, mapper) {
|
|
164
164
|
var tmp = Companion_getInstance_0();
|
|
165
|
-
var builder = tmp.
|
|
165
|
+
var builder = tmp.d32(null, 1, null);
|
|
166
166
|
return runOperationAndCatchErrors(map$lambda(_this__u8e3s4, builder, mapper));
|
|
167
167
|
}
|
|
168
168
|
function runOperationAndCatchErrors(action) {
|
|
@@ -200,15 +200,15 @@
|
|
|
200
200
|
}
|
|
201
201
|
function BinaryDecisionDiagramException(message, cause) {
|
|
202
202
|
RuntimeException_init_$Init$(message, cause, this);
|
|
203
|
-
this.
|
|
204
|
-
this.
|
|
203
|
+
this.e32_1 = message;
|
|
204
|
+
this.f32_1 = cause;
|
|
205
205
|
captureStack(this, BinaryDecisionDiagramException);
|
|
206
206
|
}
|
|
207
207
|
BinaryDecisionDiagramException.prototype.k1 = function () {
|
|
208
|
-
return this.
|
|
208
|
+
return this.e32_1;
|
|
209
209
|
};
|
|
210
210
|
BinaryDecisionDiagramException.prototype.l1 = function () {
|
|
211
|
-
return this.
|
|
211
|
+
return this.f32_1;
|
|
212
212
|
};
|
|
213
213
|
Object.defineProperty(BinaryDecisionDiagramException.prototype, 'message', {
|
|
214
214
|
configurable: true,
|
|
@@ -227,63 +227,63 @@
|
|
|
227
227
|
captureStack(this, BinaryDecisionDiagramOperationException);
|
|
228
228
|
}
|
|
229
229
|
function AnyVisitor(predicate) {
|
|
230
|
-
this.
|
|
230
|
+
this.g32_1 = predicate;
|
|
231
231
|
}
|
|
232
|
-
AnyVisitor.prototype.
|
|
232
|
+
AnyVisitor.prototype.h32 = function (node) {
|
|
233
233
|
return false;
|
|
234
234
|
};
|
|
235
235
|
AnyVisitor.prototype.visitTerminal = function (node) {
|
|
236
|
-
return this.
|
|
236
|
+
return this.h32(node);
|
|
237
237
|
};
|
|
238
|
-
AnyVisitor.prototype.
|
|
239
|
-
var result = this.
|
|
238
|
+
AnyVisitor.prototype.i32 = function (node) {
|
|
239
|
+
var result = this.g32_1(node.b1());
|
|
240
240
|
if (!result) {
|
|
241
|
-
result = node.
|
|
241
|
+
result = node.a32().accept(this);
|
|
242
242
|
}
|
|
243
243
|
if (!result) {
|
|
244
|
-
result = node.
|
|
244
|
+
result = node.b32().accept(this);
|
|
245
245
|
}
|
|
246
246
|
return result;
|
|
247
247
|
};
|
|
248
248
|
AnyVisitor.prototype.visitVariable = function (node) {
|
|
249
|
-
return this.
|
|
249
|
+
return this.i32(node);
|
|
250
250
|
};
|
|
251
251
|
function visitWithTable($this, first, second, computation) {
|
|
252
252
|
var firstKey = hashCode(first);
|
|
253
253
|
var secondKey = hashCode(second);
|
|
254
|
-
if (!$this.
|
|
254
|
+
if (!$this.p32_1.u2(firstKey)) {
|
|
255
255
|
// Inline function 'kotlin.collections.set' call
|
|
256
|
-
var tmp0_set = $this.
|
|
256
|
+
var tmp0_set = $this.p32_1;
|
|
257
257
|
var tmp$ret$0;
|
|
258
258
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
259
259
|
tmp$ret$0 = LinkedHashMap_init_$Create$();
|
|
260
260
|
var tmp1_set = tmp$ret$0;
|
|
261
261
|
tmp0_set.w3(firstKey, tmp1_set);
|
|
262
262
|
}
|
|
263
|
-
var cached = ensureNotNull($this.
|
|
263
|
+
var cached = ensureNotNull($this.p32_1.a3(firstKey)).a3(secondKey);
|
|
264
264
|
if (!(cached == null)) {
|
|
265
265
|
return cached;
|
|
266
266
|
}
|
|
267
267
|
var result = computation();
|
|
268
268
|
// Inline function 'kotlin.collections.set' call
|
|
269
|
-
var tmp2_set = ensureNotNull($this.
|
|
269
|
+
var tmp2_set = ensureNotNull($this.p32_1.a3(firstKey));
|
|
270
270
|
tmp2_set.w3(secondKey, result);
|
|
271
271
|
return result;
|
|
272
272
|
}
|
|
273
273
|
function apply($this, first, second) {
|
|
274
|
-
var truth = $this.
|
|
275
|
-
return new Pair($this.
|
|
274
|
+
var truth = $this.l32_1(first.y31(), second.y31());
|
|
275
|
+
return new Pair($this.j32_1.buildTerminal(truth), truth ? $this.n32_1 : $this.m32_1);
|
|
276
276
|
}
|
|
277
277
|
function apply_0($this, first, second) {
|
|
278
|
-
$this.
|
|
279
|
-
var lowNode = first.
|
|
280
|
-
$this.
|
|
281
|
-
var highNode = first.
|
|
282
|
-
return new Pair($this.
|
|
278
|
+
$this.k32_1 = second.a32();
|
|
279
|
+
var lowNode = first.z31($this);
|
|
280
|
+
$this.k32_1 = second.b32();
|
|
281
|
+
var highNode = first.z31($this);
|
|
282
|
+
return new Pair($this.j32_1.buildVariable(second.b1(), lowNode.g4_1, highNode.g4_1), $this.o32_1(second.b1(), lowNode.h4_1, highNode.h4_1));
|
|
283
283
|
}
|
|
284
284
|
function apply_1($this, first, second) {
|
|
285
|
-
$this.
|
|
286
|
-
return second.
|
|
285
|
+
$this.k32_1 = first;
|
|
286
|
+
return second.z31($this);
|
|
287
287
|
}
|
|
288
288
|
function apply_2($this, first, second) {
|
|
289
289
|
var newValue;
|
|
@@ -293,25 +293,25 @@
|
|
|
293
293
|
var secondHigh;
|
|
294
294
|
if (compareTo(first.b1(), second.b1()) <= 0) {
|
|
295
295
|
newValue = first.b1();
|
|
296
|
-
firstHigh = first.
|
|
297
|
-
firstLow = first.
|
|
296
|
+
firstHigh = first.b32();
|
|
297
|
+
firstLow = first.a32();
|
|
298
298
|
} else {
|
|
299
299
|
newValue = second.b1();
|
|
300
300
|
firstLow = first;
|
|
301
301
|
firstHigh = first;
|
|
302
302
|
}
|
|
303
303
|
if (compareTo(second.b1(), first.b1()) <= 0) {
|
|
304
|
-
secondHigh = second.
|
|
305
|
-
secondLow = second.
|
|
304
|
+
secondHigh = second.b32();
|
|
305
|
+
secondLow = second.a32();
|
|
306
306
|
} else {
|
|
307
307
|
secondLow = second;
|
|
308
308
|
secondHigh = second;
|
|
309
309
|
}
|
|
310
|
-
$this.
|
|
310
|
+
$this.k32_1 = secondLow;
|
|
311
311
|
var lowNode = firstLow.accept($this);
|
|
312
|
-
$this.
|
|
312
|
+
$this.k32_1 = secondHigh;
|
|
313
313
|
var highNode = firstHigh.accept($this);
|
|
314
|
-
return new Pair($this.
|
|
314
|
+
return new Pair($this.j32_1.buildVariable(newValue, lowNode.g4_1, highNode.g4_1), $this.o32_1(newValue, lowNode.h4_1, highNode.h4_1));
|
|
315
315
|
}
|
|
316
316
|
function BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node) {
|
|
317
317
|
return function (that) {
|
|
@@ -325,11 +325,11 @@
|
|
|
325
325
|
}
|
|
326
326
|
function BinaryApplyExpansionVisitor$visit$lambda(this$0, $node) {
|
|
327
327
|
return function () {
|
|
328
|
-
var tmp = this$0.
|
|
329
|
-
tmp.
|
|
330
|
-
var tmp_0 = this$0.
|
|
331
|
-
tmp_0.
|
|
332
|
-
return this$0.
|
|
328
|
+
var tmp = this$0.q32_1;
|
|
329
|
+
tmp.r32_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node);
|
|
330
|
+
var tmp_0 = this$0.q32_1;
|
|
331
|
+
tmp_0.s32_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_0(this$0, $node);
|
|
332
|
+
return this$0.k32_1.accept(this$0.q32_1);
|
|
333
333
|
};
|
|
334
334
|
}
|
|
335
335
|
function BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node) {
|
|
@@ -344,149 +344,149 @@
|
|
|
344
344
|
}
|
|
345
345
|
function BinaryApplyExpansionVisitor$visit$lambda_0(this$0, $node) {
|
|
346
346
|
return function () {
|
|
347
|
-
var tmp = this$0.
|
|
348
|
-
tmp.
|
|
349
|
-
var tmp_0 = this$0.
|
|
350
|
-
tmp_0.
|
|
351
|
-
return this$0.
|
|
347
|
+
var tmp = this$0.q32_1;
|
|
348
|
+
tmp.r32_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node);
|
|
349
|
+
var tmp_0 = this$0.q32_1;
|
|
350
|
+
tmp_0.s32_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_2(this$0, $node);
|
|
351
|
+
return this$0.k32_1.accept(this$0.q32_1);
|
|
352
352
|
};
|
|
353
353
|
}
|
|
354
354
|
function BinaryApplyExpansionVisitor(builder, thatNode, operator, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
|
|
355
|
-
this.
|
|
356
|
-
this.
|
|
357
|
-
this.
|
|
358
|
-
this.
|
|
359
|
-
this.
|
|
360
|
-
this.
|
|
355
|
+
this.j32_1 = builder;
|
|
356
|
+
this.k32_1 = thatNode;
|
|
357
|
+
this.l32_1 = operator;
|
|
358
|
+
this.m32_1 = expansionFalseTerminal;
|
|
359
|
+
this.n32_1 = expansionTrueTerminal;
|
|
360
|
+
this.o32_1 = expansionOperator;
|
|
361
361
|
var tmp = this;
|
|
362
362
|
var tmp$ret$0;
|
|
363
363
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
364
364
|
tmp$ret$0 = LinkedHashMap_init_$Create$();
|
|
365
|
-
tmp.
|
|
366
|
-
this.
|
|
365
|
+
tmp.p32_1 = tmp$ret$0;
|
|
366
|
+
this.q32_1 = new CastVisitor();
|
|
367
367
|
}
|
|
368
|
-
BinaryApplyExpansionVisitor.prototype.
|
|
369
|
-
var tmp = this.
|
|
368
|
+
BinaryApplyExpansionVisitor.prototype.h32 = function (node) {
|
|
369
|
+
var tmp = this.k32_1;
|
|
370
370
|
return visitWithTable(this, node, tmp, BinaryApplyExpansionVisitor$visit$lambda(this, node));
|
|
371
371
|
};
|
|
372
372
|
BinaryApplyExpansionVisitor.prototype.visitTerminal = function (node) {
|
|
373
|
-
return this.
|
|
373
|
+
return this.h32(node);
|
|
374
374
|
};
|
|
375
|
-
BinaryApplyExpansionVisitor.prototype.
|
|
376
|
-
var tmp = this.
|
|
375
|
+
BinaryApplyExpansionVisitor.prototype.i32 = function (node) {
|
|
376
|
+
var tmp = this.k32_1;
|
|
377
377
|
return visitWithTable(this, node, tmp, BinaryApplyExpansionVisitor$visit$lambda_0(this, node));
|
|
378
378
|
};
|
|
379
379
|
BinaryApplyExpansionVisitor.prototype.visitVariable = function (node) {
|
|
380
|
-
return this.
|
|
380
|
+
return this.i32(node);
|
|
381
381
|
};
|
|
382
382
|
function ExpansionVisitor(varOp, falseTerminal, trueTerminal) {
|
|
383
|
-
this.
|
|
384
|
-
this.
|
|
385
|
-
this.
|
|
383
|
+
this.t32_1 = varOp;
|
|
384
|
+
this.u32_1 = falseTerminal;
|
|
385
|
+
this.v32_1 = trueTerminal;
|
|
386
386
|
}
|
|
387
|
-
ExpansionVisitor.prototype.
|
|
388
|
-
return node.
|
|
387
|
+
ExpansionVisitor.prototype.h32 = function (node) {
|
|
388
|
+
return node.y31() ? this.v32_1 : this.u32_1;
|
|
389
389
|
};
|
|
390
390
|
ExpansionVisitor.prototype.visitTerminal = function (node) {
|
|
391
|
-
return this.
|
|
391
|
+
return this.h32(node);
|
|
392
392
|
};
|
|
393
|
-
ExpansionVisitor.prototype.
|
|
394
|
-
var lowValue = node.
|
|
395
|
-
var highValue = node.
|
|
396
|
-
return this.
|
|
393
|
+
ExpansionVisitor.prototype.i32 = function (node) {
|
|
394
|
+
var lowValue = node.a32().accept(this);
|
|
395
|
+
var highValue = node.b32().accept(this);
|
|
396
|
+
return this.t32_1(node.b1(), lowValue, highValue);
|
|
397
397
|
};
|
|
398
398
|
ExpansionVisitor.prototype.visitVariable = function (node) {
|
|
399
|
-
return this.
|
|
399
|
+
return this.i32(node);
|
|
400
400
|
};
|
|
401
401
|
function UnaryApplyExpansionVisitor(builder, operator, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
|
|
402
|
-
this.
|
|
403
|
-
this.
|
|
404
|
-
this.
|
|
405
|
-
this.
|
|
406
|
-
this.
|
|
402
|
+
this.w32_1 = builder;
|
|
403
|
+
this.x32_1 = operator;
|
|
404
|
+
this.y32_1 = expansionFalseTerminal;
|
|
405
|
+
this.z32_1 = expansionTrueTerminal;
|
|
406
|
+
this.a33_1 = expansionOperator;
|
|
407
407
|
var tmp = this;
|
|
408
408
|
var tmp$ret$0;
|
|
409
409
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
410
410
|
tmp$ret$0 = LinkedHashMap_init_$Create$();
|
|
411
|
-
tmp.
|
|
411
|
+
tmp.b33_1 = tmp$ret$0;
|
|
412
412
|
}
|
|
413
|
-
UnaryApplyExpansionVisitor.prototype.
|
|
414
|
-
var resTruth = this.
|
|
415
|
-
return new Pair(this.
|
|
413
|
+
UnaryApplyExpansionVisitor.prototype.h32 = function (node) {
|
|
414
|
+
var resTruth = this.x32_1(node.y31());
|
|
415
|
+
return new Pair(this.w32_1.buildTerminal(resTruth), resTruth ? this.z32_1 : this.y32_1);
|
|
416
416
|
};
|
|
417
417
|
UnaryApplyExpansionVisitor.prototype.visitTerminal = function (node) {
|
|
418
|
-
return this.
|
|
418
|
+
return this.h32(node);
|
|
419
419
|
};
|
|
420
|
-
UnaryApplyExpansionVisitor.prototype.
|
|
420
|
+
UnaryApplyExpansionVisitor.prototype.i32 = function (node) {
|
|
421
421
|
var key = hashCode(node);
|
|
422
|
-
if (this.
|
|
423
|
-
return ensureNotNull(this.
|
|
422
|
+
if (this.b33_1.u2(key)) {
|
|
423
|
+
return ensureNotNull(this.b33_1.a3(key));
|
|
424
424
|
}
|
|
425
|
-
var lowNode = node.
|
|
426
|
-
var highNode = node.
|
|
427
|
-
var result = new Pair(this.
|
|
425
|
+
var lowNode = node.a32().accept(this);
|
|
426
|
+
var highNode = node.b32().accept(this);
|
|
427
|
+
var result = new Pair(this.w32_1.buildVariable(node.b1(), lowNode.g4_1, highNode.g4_1), this.a33_1(node.b1(), lowNode.h4_1, highNode.h4_1));
|
|
428
428
|
// Inline function 'kotlin.collections.set' call
|
|
429
|
-
var tmp0_set = this.
|
|
429
|
+
var tmp0_set = this.b33_1;
|
|
430
430
|
tmp0_set.w3(key, result);
|
|
431
431
|
return result;
|
|
432
432
|
};
|
|
433
433
|
UnaryApplyExpansionVisitor.prototype.visitVariable = function (node) {
|
|
434
|
-
return this.
|
|
434
|
+
return this.i32(node);
|
|
435
435
|
};
|
|
436
436
|
function ReducedBinaryDecisionDiagramBuilder(delegate) {
|
|
437
|
-
this.
|
|
437
|
+
this.c33_1 = delegate;
|
|
438
438
|
var tmp = this;
|
|
439
439
|
var tmp$ret$0;
|
|
440
440
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
441
441
|
tmp$ret$0 = LinkedHashMap_init_$Create$();
|
|
442
|
-
tmp.
|
|
442
|
+
tmp.d33_1 = tmp$ret$0;
|
|
443
443
|
}
|
|
444
|
-
ReducedBinaryDecisionDiagramBuilder.prototype.
|
|
444
|
+
ReducedBinaryDecisionDiagramBuilder.prototype.e33 = function (value, low, high) {
|
|
445
445
|
if (equals(low, high)) {
|
|
446
446
|
return low;
|
|
447
447
|
}
|
|
448
|
-
var newNode = this.
|
|
448
|
+
var newNode = this.c33_1.buildVariable(value, low, high);
|
|
449
449
|
var key = hashCode(newNode);
|
|
450
|
-
var cached = this.
|
|
450
|
+
var cached = this.d33_1.a3(key);
|
|
451
451
|
var tmp;
|
|
452
452
|
if (!(cached == null)) {
|
|
453
453
|
tmp = cached;
|
|
454
454
|
} else {
|
|
455
455
|
// Inline function 'kotlin.collections.set' call
|
|
456
|
-
var tmp0_set = this.
|
|
456
|
+
var tmp0_set = this.d33_1;
|
|
457
457
|
tmp0_set.w3(key, newNode);
|
|
458
458
|
tmp = newNode;
|
|
459
459
|
}
|
|
460
460
|
return tmp;
|
|
461
461
|
};
|
|
462
462
|
ReducedBinaryDecisionDiagramBuilder.prototype.buildVariable = function (value, low, high) {
|
|
463
|
-
return this.
|
|
463
|
+
return this.e33(isComparable(value) ? value : THROW_CCE(), low, high);
|
|
464
464
|
};
|
|
465
|
-
ReducedBinaryDecisionDiagramBuilder.prototype.
|
|
466
|
-
return this.
|
|
465
|
+
ReducedBinaryDecisionDiagramBuilder.prototype.f33 = function (truth) {
|
|
466
|
+
return this.c33_1.buildTerminal(truth);
|
|
467
467
|
};
|
|
468
468
|
ReducedBinaryDecisionDiagramBuilder.prototype.buildTerminal = function (truth) {
|
|
469
|
-
return this.
|
|
469
|
+
return this.f33(truth);
|
|
470
470
|
};
|
|
471
471
|
function SimpleBinaryDecisionDiagramBuilder() {
|
|
472
472
|
}
|
|
473
|
-
SimpleBinaryDecisionDiagramBuilder.prototype.
|
|
473
|
+
SimpleBinaryDecisionDiagramBuilder.prototype.e33 = function (value, low, high) {
|
|
474
474
|
return new SimpleBinaryDecisionDiagramVariable(value, low, high);
|
|
475
475
|
};
|
|
476
476
|
SimpleBinaryDecisionDiagramBuilder.prototype.buildVariable = function (value, low, high) {
|
|
477
|
-
return this.
|
|
477
|
+
return this.e33(isComparable(value) ? value : THROW_CCE(), low, high);
|
|
478
478
|
};
|
|
479
|
-
SimpleBinaryDecisionDiagramBuilder.prototype.
|
|
479
|
+
SimpleBinaryDecisionDiagramBuilder.prototype.f33 = function (truth) {
|
|
480
480
|
return new SimpleBinaryDecisionDiagramTerminal(truth);
|
|
481
481
|
};
|
|
482
482
|
SimpleBinaryDecisionDiagramBuilder.prototype.buildTerminal = function (truth) {
|
|
483
|
-
return this.
|
|
483
|
+
return this.f33(truth);
|
|
484
484
|
};
|
|
485
485
|
function SimpleBinaryDecisionDiagramTerminal(truth) {
|
|
486
|
-
this.
|
|
486
|
+
this.g33_1 = truth;
|
|
487
487
|
}
|
|
488
|
-
SimpleBinaryDecisionDiagramTerminal.prototype.
|
|
489
|
-
return this.
|
|
488
|
+
SimpleBinaryDecisionDiagramTerminal.prototype.y31 = function () {
|
|
489
|
+
return this.g33_1;
|
|
490
490
|
};
|
|
491
491
|
SimpleBinaryDecisionDiagramTerminal.prototype.equals = function (other) {
|
|
492
492
|
if (this === other)
|
|
@@ -497,49 +497,49 @@
|
|
|
497
497
|
other;
|
|
498
498
|
else
|
|
499
499
|
THROW_CCE();
|
|
500
|
-
if (!(this.
|
|
500
|
+
if (!(this.g33_1 === other.g33_1))
|
|
501
501
|
return false;
|
|
502
502
|
return true;
|
|
503
503
|
};
|
|
504
504
|
SimpleBinaryDecisionDiagramTerminal.prototype.hashCode = function () {
|
|
505
|
-
return this.
|
|
505
|
+
return this.g33_1 | 0;
|
|
506
506
|
};
|
|
507
507
|
SimpleBinaryDecisionDiagramTerminal.prototype.toString = function () {
|
|
508
|
-
return 'SimpleBinaryDecisionDiagramTerminal(truth=' + this.
|
|
508
|
+
return 'SimpleBinaryDecisionDiagramTerminal(truth=' + this.g33_1 + ')';
|
|
509
509
|
};
|
|
510
510
|
SimpleBinaryDecisionDiagramTerminal.prototype.accept = function (visitor) {
|
|
511
|
-
return this.
|
|
511
|
+
return this.z31(visitor);
|
|
512
512
|
};
|
|
513
513
|
function _get_hashCodeCache__ny3r0q($this) {
|
|
514
514
|
var tmp$ret$0;
|
|
515
515
|
// Inline function 'kotlin.getValue' call
|
|
516
516
|
var tmp0_getValue = hashCodeCache$factory();
|
|
517
|
-
tmp$ret$0 = $this.
|
|
517
|
+
tmp$ret$0 = $this.k33_1.b1();
|
|
518
518
|
return tmp$ret$0;
|
|
519
519
|
}
|
|
520
520
|
function SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this$0) {
|
|
521
521
|
return function () {
|
|
522
|
-
var result = hashCode(this$0.
|
|
523
|
-
result = imul(31, result) + hashCode(this$0.
|
|
524
|
-
result = imul(31, result) + hashCode(this$0.
|
|
522
|
+
var result = hashCode(this$0.h33_1);
|
|
523
|
+
result = imul(31, result) + hashCode(this$0.i33_1) | 0;
|
|
524
|
+
result = imul(31, result) + hashCode(this$0.j33_1) | 0;
|
|
525
525
|
return result;
|
|
526
526
|
};
|
|
527
527
|
}
|
|
528
528
|
function SimpleBinaryDecisionDiagramVariable(value, low, high) {
|
|
529
|
-
this.
|
|
530
|
-
this.
|
|
531
|
-
this.
|
|
529
|
+
this.h33_1 = value;
|
|
530
|
+
this.i33_1 = low;
|
|
531
|
+
this.j33_1 = high;
|
|
532
532
|
var tmp = this;
|
|
533
|
-
tmp.
|
|
533
|
+
tmp.k33_1 = lazy(SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this));
|
|
534
534
|
}
|
|
535
535
|
SimpleBinaryDecisionDiagramVariable.prototype.b1 = function () {
|
|
536
|
-
return this.
|
|
536
|
+
return this.h33_1;
|
|
537
537
|
};
|
|
538
|
-
SimpleBinaryDecisionDiagramVariable.prototype.
|
|
539
|
-
return this.
|
|
538
|
+
SimpleBinaryDecisionDiagramVariable.prototype.a32 = function () {
|
|
539
|
+
return this.i33_1;
|
|
540
540
|
};
|
|
541
|
-
SimpleBinaryDecisionDiagramVariable.prototype.
|
|
542
|
-
return this.
|
|
541
|
+
SimpleBinaryDecisionDiagramVariable.prototype.b32 = function () {
|
|
542
|
+
return this.j33_1;
|
|
543
543
|
};
|
|
544
544
|
SimpleBinaryDecisionDiagramVariable.prototype.equals = function (other) {
|
|
545
545
|
if (this === other)
|
|
@@ -550,11 +550,11 @@
|
|
|
550
550
|
other;
|
|
551
551
|
else
|
|
552
552
|
THROW_CCE();
|
|
553
|
-
if (!equals(this.
|
|
553
|
+
if (!equals(this.h33_1, other.h33_1))
|
|
554
554
|
return false;
|
|
555
|
-
if (!equals(this.
|
|
555
|
+
if (!equals(this.i33_1, other.i33_1))
|
|
556
556
|
return false;
|
|
557
|
-
if (!equals(this.
|
|
557
|
+
if (!equals(this.j33_1, other.j33_1))
|
|
558
558
|
return false;
|
|
559
559
|
return true;
|
|
560
560
|
};
|
|
@@ -562,10 +562,10 @@
|
|
|
562
562
|
return _get_hashCodeCache__ny3r0q(this);
|
|
563
563
|
};
|
|
564
564
|
SimpleBinaryDecisionDiagramVariable.prototype.toString = function () {
|
|
565
|
-
return 'SimpleBinaryDecisionDiagramVariable(value=' + this.
|
|
565
|
+
return 'SimpleBinaryDecisionDiagramVariable(value=' + this.h33_1 + ', low=' + this.i33_1 + ', high=' + this.j33_1 + ')';
|
|
566
566
|
};
|
|
567
567
|
SimpleBinaryDecisionDiagramVariable.prototype.accept = function (visitor) {
|
|
568
|
-
return this.
|
|
568
|
+
return this.z31(visitor);
|
|
569
569
|
};
|
|
570
570
|
function hashCodeCache$factory() {
|
|
571
571
|
return getPropertyCallableRef('hashCodeCache', 1, KProperty1, function (receiver) {
|
|
@@ -573,24 +573,24 @@
|
|
|
573
573
|
}, null);
|
|
574
574
|
}
|
|
575
575
|
function CastVisitor() {
|
|
576
|
-
this.
|
|
577
|
-
this.
|
|
576
|
+
this.r32_1 = null;
|
|
577
|
+
this.s32_1 = null;
|
|
578
578
|
}
|
|
579
|
-
CastVisitor.prototype.
|
|
580
|
-
return ensureNotNull(this.
|
|
579
|
+
CastVisitor.prototype.h32 = function (node) {
|
|
580
|
+
return ensureNotNull(this.r32_1)(node);
|
|
581
581
|
};
|
|
582
582
|
CastVisitor.prototype.visitTerminal = function (node) {
|
|
583
|
-
return this.
|
|
583
|
+
return this.h32(node);
|
|
584
584
|
};
|
|
585
|
-
CastVisitor.prototype.
|
|
586
|
-
return ensureNotNull(this.
|
|
585
|
+
CastVisitor.prototype.i32 = function (node) {
|
|
586
|
+
return ensureNotNull(this.s32_1)(node);
|
|
587
587
|
};
|
|
588
588
|
CastVisitor.prototype.visitVariable = function (node) {
|
|
589
|
-
return this.
|
|
589
|
+
return this.i32(node);
|
|
590
590
|
};
|
|
591
591
|
//region block: post-declaration
|
|
592
|
-
SimpleBinaryDecisionDiagramTerminal.prototype.
|
|
593
|
-
SimpleBinaryDecisionDiagramVariable.prototype.
|
|
592
|
+
SimpleBinaryDecisionDiagramTerminal.prototype.z31 = accept;
|
|
593
|
+
SimpleBinaryDecisionDiagramVariable.prototype.z31 = accept_0;
|
|
594
594
|
//endregion
|
|
595
595
|
//region block: exports
|
|
596
596
|
_.$_$ = _.$_$ || {};
|