@tuprolog/2p-full 0.32.5 → 1.0.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 CHANGED
@@ -88,12 +88,12 @@
88
88
  protoOf(Companion_0).simpleOf = function () {
89
89
  return new SimpleBinaryDecisionDiagramBuilder();
90
90
  };
91
- protoOf(Companion_0).z30 = function (delegate) {
91
+ protoOf(Companion_0).q31 = 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.z30(delegate) : $super.z30.call(this, delegate);
96
+ return $super === VOID ? this.q31(delegate) : $super.q31.call(this, delegate);
97
97
  };
98
98
  var Companion_instance_0;
99
99
  function Companion_getInstance_0() {
@@ -206,14 +206,14 @@
206
206
  cause = cause === VOID ? null : cause;
207
207
  RuntimeException_init_$Init$(message, cause, this);
208
208
  captureStack(this, BinaryDecisionDiagramException);
209
- this.a31_1 = message;
210
- this.b31_1 = cause;
209
+ this.r31_1 = message;
210
+ this.s31_1 = cause;
211
211
  }
212
212
  protoOf(BinaryDecisionDiagramException).na = function () {
213
- return this.a31_1;
213
+ return this.r31_1;
214
214
  };
215
215
  protoOf(BinaryDecisionDiagramException).oa = function () {
216
- return this.b31_1;
216
+ return this.s31_1;
217
217
  };
218
218
  function BinaryDecisionDiagramOperationException(message, cause) {
219
219
  cause = cause === VOID ? null : cause;
@@ -221,60 +221,60 @@
221
221
  captureStack(this, BinaryDecisionDiagramOperationException);
222
222
  }
223
223
  function AnyVisitor(predicate) {
224
- this.c31_1 = predicate;
224
+ this.t31_1 = predicate;
225
225
  }
226
- protoOf(AnyVisitor).d31 = function (node) {
226
+ protoOf(AnyVisitor).u31 = function (node) {
227
227
  return false;
228
228
  };
229
229
  protoOf(AnyVisitor).visitTerminal = function (node) {
230
- return this.d31(node);
230
+ return this.u31(node);
231
231
  };
232
- protoOf(AnyVisitor).e31 = function (node) {
233
- var result = this.c31_1(node.r2());
232
+ protoOf(AnyVisitor).v31 = function (node) {
233
+ var result = this.t31_1(node.r2());
234
234
  if (!result) {
235
- result = node.x30().accept(this);
235
+ result = node.o31().accept(this);
236
236
  }
237
237
  if (!result) {
238
- result = node.y30().accept(this);
238
+ result = node.p31().accept(this);
239
239
  }
240
240
  return result;
241
241
  };
242
242
  protoOf(AnyVisitor).visitVariable = function (node) {
243
- return this.e31(node);
243
+ return this.v31(node);
244
244
  };
245
245
  function visitWithTable($this, first, second, computation) {
246
246
  var firstKey = hashCode(first);
247
247
  var secondKey = hashCode(second);
248
- if (!$this.l31_1.u2(firstKey)) {
248
+ if (!$this.c32_1.u2(firstKey)) {
249
249
  // Inline function 'kotlin.collections.set' call
250
- var this_0 = $this.l31_1;
250
+ var this_0 = $this.c32_1;
251
251
  // Inline function 'kotlin.collections.mutableMapOf' call
252
252
  var value = LinkedHashMap_init_$Create$();
253
253
  this_0.n2(firstKey, value);
254
254
  }
255
- var cached = ensureNotNull($this.l31_1.x2(firstKey)).x2(secondKey);
255
+ var cached = ensureNotNull($this.c32_1.x2(firstKey)).x2(secondKey);
256
256
  if (!(cached == null)) {
257
257
  return cached;
258
258
  }
259
259
  var result = computation();
260
260
  // Inline function 'kotlin.collections.set' call
261
- ensureNotNull($this.l31_1.x2(firstKey)).n2(secondKey, result);
261
+ ensureNotNull($this.c32_1.x2(firstKey)).n2(secondKey, result);
262
262
  return result;
263
263
  }
264
264
  function apply($this, first, second) {
265
- var truth = $this.h31_1(first.v30(), second.v30());
266
- return new Pair($this.f31_1.buildTerminal(truth), truth ? $this.j31_1 : $this.i31_1);
265
+ var truth = $this.y31_1(first.m31(), second.m31());
266
+ return new Pair($this.w31_1.buildTerminal(truth), truth ? $this.a32_1 : $this.z31_1);
267
267
  }
268
268
  function apply_0($this, first, second) {
269
- $this.g31_1 = second.x30();
270
- var lowNode = first.w30($this);
271
- $this.g31_1 = second.y30();
272
- var highNode = first.w30($this);
273
- return new Pair($this.f31_1.buildVariable(second.r2(), lowNode.ye_1, highNode.ye_1), $this.k31_1(second.r2(), lowNode.ze_1, highNode.ze_1));
269
+ $this.x31_1 = second.o31();
270
+ var lowNode = first.n31($this);
271
+ $this.x31_1 = second.p31();
272
+ var highNode = first.n31($this);
273
+ return new Pair($this.w31_1.buildVariable(second.r2(), lowNode.ye_1, highNode.ye_1), $this.b32_1(second.r2(), lowNode.ze_1, highNode.ze_1));
274
274
  }
275
275
  function apply_1($this, first, second) {
276
- $this.g31_1 = first;
277
- return second.w30($this);
276
+ $this.x31_1 = first;
277
+ return second.n31($this);
278
278
  }
279
279
  function apply_2($this, first, second) {
280
280
  var newValue;
@@ -284,25 +284,25 @@
284
284
  var secondHigh;
285
285
  if (compareTo(first.r2(), second.r2()) <= 0) {
286
286
  newValue = first.r2();
287
- firstHigh = first.y30();
288
- firstLow = first.x30();
287
+ firstHigh = first.p31();
288
+ firstLow = first.o31();
289
289
  } else {
290
290
  newValue = second.r2();
291
291
  firstLow = first;
292
292
  firstHigh = first;
293
293
  }
294
294
  if (compareTo(second.r2(), first.r2()) <= 0) {
295
- secondHigh = second.y30();
296
- secondLow = second.x30();
295
+ secondHigh = second.p31();
296
+ secondLow = second.o31();
297
297
  } else {
298
298
  secondLow = second;
299
299
  secondHigh = second;
300
300
  }
301
- $this.g31_1 = secondLow;
301
+ $this.x31_1 = secondLow;
302
302
  var lowNode = firstLow.accept($this);
303
- $this.g31_1 = secondHigh;
303
+ $this.x31_1 = secondHigh;
304
304
  var highNode = firstHigh.accept($this);
305
- return new Pair($this.f31_1.buildVariable(newValue, lowNode.ye_1, highNode.ye_1), $this.k31_1(newValue, lowNode.ze_1, highNode.ze_1));
305
+ return new Pair($this.w31_1.buildVariable(newValue, lowNode.ye_1, highNode.ye_1), $this.b32_1(newValue, lowNode.ze_1, highNode.ze_1));
306
306
  }
307
307
  function BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node) {
308
308
  return function (that) {
@@ -316,11 +316,11 @@
316
316
  }
317
317
  function BinaryApplyExpansionVisitor$visit$lambda(this$0, $node) {
318
318
  return function () {
319
- var tmp = this$0.m31_1;
320
- tmp.n31_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node);
321
- var tmp_0 = this$0.m31_1;
322
- tmp_0.o31_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_0(this$0, $node);
323
- return this$0.g31_1.accept(this$0.m31_1);
319
+ var tmp = this$0.d32_1;
320
+ tmp.e32_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node);
321
+ var tmp_0 = this$0.d32_1;
322
+ tmp_0.f32_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_0(this$0, $node);
323
+ return this$0.x31_1.accept(this$0.d32_1);
324
324
  };
325
325
  }
326
326
  function BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node) {
@@ -335,141 +335,141 @@
335
335
  }
336
336
  function BinaryApplyExpansionVisitor$visit$lambda_0(this$0, $node) {
337
337
  return function () {
338
- var tmp = this$0.m31_1;
339
- tmp.n31_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node);
340
- var tmp_0 = this$0.m31_1;
341
- tmp_0.o31_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_2(this$0, $node);
342
- return this$0.g31_1.accept(this$0.m31_1);
338
+ var tmp = this$0.d32_1;
339
+ tmp.e32_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node);
340
+ var tmp_0 = this$0.d32_1;
341
+ tmp_0.f32_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_2(this$0, $node);
342
+ return this$0.x31_1.accept(this$0.d32_1);
343
343
  };
344
344
  }
345
345
  function BinaryApplyExpansionVisitor(builder, thatNode, operator, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
346
- this.f31_1 = builder;
347
- this.g31_1 = thatNode;
348
- this.h31_1 = operator;
349
- this.i31_1 = expansionFalseTerminal;
350
- this.j31_1 = expansionTrueTerminal;
351
- this.k31_1 = expansionOperator;
346
+ this.w31_1 = builder;
347
+ this.x31_1 = thatNode;
348
+ this.y31_1 = operator;
349
+ this.z31_1 = expansionFalseTerminal;
350
+ this.a32_1 = expansionTrueTerminal;
351
+ this.b32_1 = expansionOperator;
352
352
  var tmp = this;
353
353
  // Inline function 'kotlin.collections.mutableMapOf' call
354
- tmp.l31_1 = LinkedHashMap_init_$Create$();
355
- this.m31_1 = new CastVisitor();
354
+ tmp.c32_1 = LinkedHashMap_init_$Create$();
355
+ this.d32_1 = new CastVisitor();
356
356
  }
357
- protoOf(BinaryApplyExpansionVisitor).d31 = function (node) {
358
- var tmp = this.g31_1;
357
+ protoOf(BinaryApplyExpansionVisitor).u31 = function (node) {
358
+ var tmp = this.x31_1;
359
359
  return visitWithTable(this, node, tmp, BinaryApplyExpansionVisitor$visit$lambda(this, node));
360
360
  };
361
361
  protoOf(BinaryApplyExpansionVisitor).visitTerminal = function (node) {
362
- return this.d31(node);
362
+ return this.u31(node);
363
363
  };
364
- protoOf(BinaryApplyExpansionVisitor).e31 = function (node) {
365
- var tmp = this.g31_1;
364
+ protoOf(BinaryApplyExpansionVisitor).v31 = function (node) {
365
+ var tmp = this.x31_1;
366
366
  return visitWithTable(this, node, tmp, BinaryApplyExpansionVisitor$visit$lambda_0(this, node));
367
367
  };
368
368
  protoOf(BinaryApplyExpansionVisitor).visitVariable = function (node) {
369
- return this.e31(node);
369
+ return this.v31(node);
370
370
  };
371
371
  function ExpansionVisitor(varOp, falseTerminal, trueTerminal) {
372
- this.p31_1 = varOp;
373
- this.q31_1 = falseTerminal;
374
- this.r31_1 = trueTerminal;
372
+ this.g32_1 = varOp;
373
+ this.h32_1 = falseTerminal;
374
+ this.i32_1 = trueTerminal;
375
375
  }
376
- protoOf(ExpansionVisitor).d31 = function (node) {
377
- return node.v30() ? this.r31_1 : this.q31_1;
376
+ protoOf(ExpansionVisitor).u31 = function (node) {
377
+ return node.m31() ? this.i32_1 : this.h32_1;
378
378
  };
379
379
  protoOf(ExpansionVisitor).visitTerminal = function (node) {
380
- return this.d31(node);
380
+ return this.u31(node);
381
381
  };
382
- protoOf(ExpansionVisitor).e31 = function (node) {
383
- var lowValue = node.x30().accept(this);
384
- var highValue = node.y30().accept(this);
385
- return this.p31_1(node.r2(), lowValue, highValue);
382
+ protoOf(ExpansionVisitor).v31 = function (node) {
383
+ var lowValue = node.o31().accept(this);
384
+ var highValue = node.p31().accept(this);
385
+ return this.g32_1(node.r2(), lowValue, highValue);
386
386
  };
387
387
  protoOf(ExpansionVisitor).visitVariable = function (node) {
388
- return this.e31(node);
388
+ return this.v31(node);
389
389
  };
390
390
  function UnaryApplyExpansionVisitor(builder, operator, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
391
- this.s31_1 = builder;
392
- this.t31_1 = operator;
393
- this.u31_1 = expansionFalseTerminal;
394
- this.v31_1 = expansionTrueTerminal;
395
- this.w31_1 = expansionOperator;
391
+ this.j32_1 = builder;
392
+ this.k32_1 = operator;
393
+ this.l32_1 = expansionFalseTerminal;
394
+ this.m32_1 = expansionTrueTerminal;
395
+ this.n32_1 = expansionOperator;
396
396
  var tmp = this;
397
397
  // Inline function 'kotlin.collections.mutableMapOf' call
398
- tmp.x31_1 = LinkedHashMap_init_$Create$();
398
+ tmp.o32_1 = LinkedHashMap_init_$Create$();
399
399
  }
400
- protoOf(UnaryApplyExpansionVisitor).d31 = function (node) {
401
- var resTruth = this.t31_1(node.v30());
402
- return new Pair(this.s31_1.buildTerminal(resTruth), resTruth ? this.v31_1 : this.u31_1);
400
+ protoOf(UnaryApplyExpansionVisitor).u31 = function (node) {
401
+ var resTruth = this.k32_1(node.m31());
402
+ return new Pair(this.j32_1.buildTerminal(resTruth), resTruth ? this.m32_1 : this.l32_1);
403
403
  };
404
404
  protoOf(UnaryApplyExpansionVisitor).visitTerminal = function (node) {
405
- return this.d31(node);
405
+ return this.u31(node);
406
406
  };
407
- protoOf(UnaryApplyExpansionVisitor).e31 = function (node) {
407
+ protoOf(UnaryApplyExpansionVisitor).v31 = function (node) {
408
408
  var key = hashCode(node);
409
- if (this.x31_1.u2(key)) {
410
- return ensureNotNull(this.x31_1.x2(key));
409
+ if (this.o32_1.u2(key)) {
410
+ return ensureNotNull(this.o32_1.x2(key));
411
411
  }
412
- var lowNode = node.x30().accept(this);
413
- var highNode = node.y30().accept(this);
414
- var result = new Pair(this.s31_1.buildVariable(node.r2(), lowNode.ye_1, highNode.ye_1), this.w31_1(node.r2(), lowNode.ze_1, highNode.ze_1));
412
+ var lowNode = node.o31().accept(this);
413
+ var highNode = node.p31().accept(this);
414
+ var result = new Pair(this.j32_1.buildVariable(node.r2(), lowNode.ye_1, highNode.ye_1), this.n32_1(node.r2(), lowNode.ze_1, highNode.ze_1));
415
415
  // Inline function 'kotlin.collections.set' call
416
- this.x31_1.n2(key, result);
416
+ this.o32_1.n2(key, result);
417
417
  return result;
418
418
  };
419
419
  protoOf(UnaryApplyExpansionVisitor).visitVariable = function (node) {
420
- return this.e31(node);
420
+ return this.v31(node);
421
421
  };
422
422
  function ReducedBinaryDecisionDiagramBuilder(delegate) {
423
- this.y31_1 = delegate;
423
+ this.p32_1 = delegate;
424
424
  var tmp = this;
425
425
  // Inline function 'kotlin.collections.mutableMapOf' call
426
- tmp.z31_1 = LinkedHashMap_init_$Create$();
426
+ tmp.q32_1 = LinkedHashMap_init_$Create$();
427
427
  }
428
- protoOf(ReducedBinaryDecisionDiagramBuilder).a32 = function (value, low, high) {
428
+ protoOf(ReducedBinaryDecisionDiagramBuilder).r32 = function (value, low, high) {
429
429
  if (equals(low, high)) {
430
430
  return low;
431
431
  }
432
- var newNode = this.y31_1.buildVariable(value, low, high);
432
+ var newNode = this.p32_1.buildVariable(value, low, high);
433
433
  var key = hashCode(newNode);
434
- var cached = this.z31_1.x2(key);
434
+ var cached = this.q32_1.x2(key);
435
435
  var tmp;
436
436
  if (!(cached == null)) {
437
437
  tmp = cached;
438
438
  } else {
439
439
  // Inline function 'kotlin.collections.set' call
440
- this.z31_1.n2(key, newNode);
440
+ this.q32_1.n2(key, newNode);
441
441
  tmp = newNode;
442
442
  }
443
443
  return tmp;
444
444
  };
445
445
  protoOf(ReducedBinaryDecisionDiagramBuilder).buildVariable = function (value, low, high) {
446
- return this.a32(isComparable(value) ? value : THROW_CCE(), low, high);
446
+ return this.r32(isComparable(value) ? value : THROW_CCE(), low, high);
447
447
  };
448
- protoOf(ReducedBinaryDecisionDiagramBuilder).b32 = function (truth) {
449
- return this.y31_1.buildTerminal(truth);
448
+ protoOf(ReducedBinaryDecisionDiagramBuilder).s32 = function (truth) {
449
+ return this.p32_1.buildTerminal(truth);
450
450
  };
451
451
  protoOf(ReducedBinaryDecisionDiagramBuilder).buildTerminal = function (truth) {
452
- return this.b32(truth);
452
+ return this.s32(truth);
453
453
  };
454
454
  function SimpleBinaryDecisionDiagramBuilder() {
455
455
  }
456
- protoOf(SimpleBinaryDecisionDiagramBuilder).a32 = function (value, low, high) {
456
+ protoOf(SimpleBinaryDecisionDiagramBuilder).r32 = function (value, low, high) {
457
457
  return new SimpleBinaryDecisionDiagramVariable(value, low, high);
458
458
  };
459
459
  protoOf(SimpleBinaryDecisionDiagramBuilder).buildVariable = function (value, low, high) {
460
- return this.a32(isComparable(value) ? value : THROW_CCE(), low, high);
460
+ return this.r32(isComparable(value) ? value : THROW_CCE(), low, high);
461
461
  };
462
- protoOf(SimpleBinaryDecisionDiagramBuilder).b32 = function (truth) {
462
+ protoOf(SimpleBinaryDecisionDiagramBuilder).s32 = function (truth) {
463
463
  return new SimpleBinaryDecisionDiagramTerminal(truth);
464
464
  };
465
465
  protoOf(SimpleBinaryDecisionDiagramBuilder).buildTerminal = function (truth) {
466
- return this.b32(truth);
466
+ return this.s32(truth);
467
467
  };
468
468
  function SimpleBinaryDecisionDiagramTerminal(truth) {
469
- this.c32_1 = truth;
469
+ this.t32_1 = truth;
470
470
  }
471
- protoOf(SimpleBinaryDecisionDiagramTerminal).v30 = function () {
472
- return this.c32_1;
471
+ protoOf(SimpleBinaryDecisionDiagramTerminal).m31 = function () {
472
+ return this.t32_1;
473
473
  };
474
474
  protoOf(SimpleBinaryDecisionDiagramTerminal).equals = function (other) {
475
475
  if (this === other)
@@ -478,48 +478,48 @@
478
478
  return false;
479
479
  if (!(other instanceof SimpleBinaryDecisionDiagramTerminal))
480
480
  THROW_CCE();
481
- if (!(this.c32_1 === other.c32_1))
481
+ if (!(this.t32_1 === other.t32_1))
482
482
  return false;
483
483
  return true;
484
484
  };
485
485
  protoOf(SimpleBinaryDecisionDiagramTerminal).hashCode = function () {
486
- return getBooleanHashCode(this.c32_1);
486
+ return getBooleanHashCode(this.t32_1);
487
487
  };
488
488
  protoOf(SimpleBinaryDecisionDiagramTerminal).toString = function () {
489
- return 'SimpleBinaryDecisionDiagramTerminal(truth=' + this.c32_1 + ')';
489
+ return 'SimpleBinaryDecisionDiagramTerminal(truth=' + this.t32_1 + ')';
490
490
  };
491
491
  protoOf(SimpleBinaryDecisionDiagramTerminal).accept = function (visitor) {
492
- return this.w30(visitor);
492
+ return this.n31(visitor);
493
493
  };
494
494
  function _get_hashCodeCache__ny3r0q($this) {
495
495
  // Inline function 'kotlin.getValue' call
496
- var this_0 = $this.g32_1;
496
+ var this_0 = $this.x32_1;
497
497
  hashCodeCache$factory();
498
498
  return this_0.r2();
499
499
  }
500
500
  function SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this$0) {
501
501
  return function () {
502
- var result = hashCode(this$0.d32_1);
503
- result = imul(31, result) + hashCode(this$0.e32_1) | 0;
504
- result = imul(31, result) + hashCode(this$0.f32_1) | 0;
502
+ var result = hashCode(this$0.u32_1);
503
+ result = imul(31, result) + hashCode(this$0.v32_1) | 0;
504
+ result = imul(31, result) + hashCode(this$0.w32_1) | 0;
505
505
  return result;
506
506
  };
507
507
  }
508
508
  function SimpleBinaryDecisionDiagramVariable(value, low, high) {
509
- this.d32_1 = value;
510
- this.e32_1 = low;
511
- this.f32_1 = high;
509
+ this.u32_1 = value;
510
+ this.v32_1 = low;
511
+ this.w32_1 = high;
512
512
  var tmp = this;
513
- tmp.g32_1 = lazy(SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this));
513
+ tmp.x32_1 = lazy(SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this));
514
514
  }
515
515
  protoOf(SimpleBinaryDecisionDiagramVariable).r2 = function () {
516
- return this.d32_1;
516
+ return this.u32_1;
517
517
  };
518
- protoOf(SimpleBinaryDecisionDiagramVariable).x30 = function () {
519
- return this.e32_1;
518
+ protoOf(SimpleBinaryDecisionDiagramVariable).o31 = function () {
519
+ return this.v32_1;
520
520
  };
521
- protoOf(SimpleBinaryDecisionDiagramVariable).y30 = function () {
522
- return this.f32_1;
521
+ protoOf(SimpleBinaryDecisionDiagramVariable).p31 = function () {
522
+ return this.w32_1;
523
523
  };
524
524
  protoOf(SimpleBinaryDecisionDiagramVariable).equals = function (other) {
525
525
  if (this === other)
@@ -528,11 +528,11 @@
528
528
  return false;
529
529
  if (!(other instanceof SimpleBinaryDecisionDiagramVariable))
530
530
  THROW_CCE();
531
- if (!equals(this.d32_1, other.d32_1))
531
+ if (!equals(this.u32_1, other.u32_1))
532
532
  return false;
533
- if (!equals(this.e32_1, other.e32_1))
533
+ if (!equals(this.v32_1, other.v32_1))
534
534
  return false;
535
- if (!equals(this.f32_1, other.f32_1))
535
+ if (!equals(this.w32_1, other.w32_1))
536
536
  return false;
537
537
  return true;
538
538
  };
@@ -540,10 +540,10 @@
540
540
  return _get_hashCodeCache__ny3r0q(this);
541
541
  };
542
542
  protoOf(SimpleBinaryDecisionDiagramVariable).toString = function () {
543
- return 'SimpleBinaryDecisionDiagramVariable(value=' + this.d32_1 + ', low=' + this.e32_1 + ', high=' + this.f32_1 + ')';
543
+ return 'SimpleBinaryDecisionDiagramVariable(value=' + this.u32_1 + ', low=' + this.v32_1 + ', high=' + this.w32_1 + ')';
544
544
  };
545
545
  protoOf(SimpleBinaryDecisionDiagramVariable).accept = function (visitor) {
546
- return this.w30(visitor);
546
+ return this.n31(visitor);
547
547
  };
548
548
  function hashCodeCache$factory() {
549
549
  return getPropertyCallableRef('hashCodeCache', 1, KProperty1, function (receiver) {
@@ -551,20 +551,20 @@
551
551
  }, null);
552
552
  }
553
553
  function CastVisitor() {
554
- this.n31_1 = null;
555
- this.o31_1 = null;
554
+ this.e32_1 = null;
555
+ this.f32_1 = null;
556
556
  }
557
- protoOf(CastVisitor).d31 = function (node) {
558
- return ensureNotNull(this.n31_1)(node);
557
+ protoOf(CastVisitor).u31 = function (node) {
558
+ return ensureNotNull(this.e32_1)(node);
559
559
  };
560
560
  protoOf(CastVisitor).visitTerminal = function (node) {
561
- return this.d31(node);
561
+ return this.u31(node);
562
562
  };
563
- protoOf(CastVisitor).e31 = function (node) {
564
- return ensureNotNull(this.o31_1)(node);
563
+ protoOf(CastVisitor).v31 = function (node) {
564
+ return ensureNotNull(this.f32_1)(node);
565
565
  };
566
566
  protoOf(CastVisitor).visitVariable = function (node) {
567
- return this.e31(node);
567
+ return this.v31(node);
568
568
  };
569
569
  //region block: post-declaration
570
570
  defineProp(protoOf(BinaryDecisionDiagramException), 'message', function () {
@@ -573,8 +573,8 @@
573
573
  defineProp(protoOf(BinaryDecisionDiagramException), 'cause', function () {
574
574
  return this.oa();
575
575
  });
576
- protoOf(SimpleBinaryDecisionDiagramTerminal).w30 = accept;
577
- protoOf(SimpleBinaryDecisionDiagramVariable).w30 = accept_0;
576
+ protoOf(SimpleBinaryDecisionDiagramTerminal).n31 = accept;
577
+ protoOf(SimpleBinaryDecisionDiagramVariable).n31 = accept_0;
578
578
  //endregion
579
579
  //region block: init
580
580
  Companion_instance = new Companion();