@tuprolog/2p-full 0.31.21 → 0.32.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.
Files changed (43) hide show
  1. package/2p-bdd.js +198 -215
  2. package/2p-bdd.js.map +1 -1
  3. package/2p-core.js +3282 -5092
  4. package/2p-core.js.map +1 -1
  5. package/2p-full.js +6 -6
  6. package/2p-io-lib.js +874 -1121
  7. package/2p-io-lib.js.map +1 -1
  8. package/2p-oop-lib.js +1140 -1327
  9. package/2p-oop-lib.js.map +1 -1
  10. package/2p-parser-core.js +438 -609
  11. package/2p-parser-core.js.map +1 -1
  12. package/2p-parser-js.js +7 -8
  13. package/2p-parser-js.js.map +1 -1
  14. package/2p-parser-theory.js +35 -39
  15. package/2p-parser-theory.js.map +1 -1
  16. package/2p-repl.js +152 -179
  17. package/2p-repl.js.map +1 -1
  18. package/2p-solve-classic.js +1141 -1371
  19. package/2p-solve-classic.js.map +1 -1
  20. package/2p-solve-plp.js +9 -14
  21. package/2p-solve-plp.js.map +1 -1
  22. package/2p-solve-problog.js +1689 -1981
  23. package/2p-solve-problog.js.map +1 -1
  24. package/2p-solve-streams.js +1206 -1372
  25. package/2p-solve-streams.js.map +1 -1
  26. package/2p-solve.js +4880 -6148
  27. package/2p-solve.js.map +1 -1
  28. package/2p-theory.js +1820 -2246
  29. package/2p-theory.js.map +1 -1
  30. package/2p-unify.js +290 -330
  31. package/2p-unify.js.map +1 -1
  32. package/2p-utils.js +483 -557
  33. package/2p-utils.js.map +1 -1
  34. package/clikt-clikt-js-ir.js +2243 -3266
  35. package/clikt-clikt-js-ir.js.map +1 -1
  36. package/{kotlin-kotlin-stdlib-js-ir.js → kotlin-kotlin-stdlib.js} +9559 -10329
  37. package/kotlin-kotlin-stdlib.js.map +1 -0
  38. package/kotlin_org_jetbrains_kotlin_kotlin_dom_api_compat.js +15 -0
  39. package/kotlin_org_jetbrains_kotlin_kotlin_dom_api_compat.js.map +1 -0
  40. package/kt-math.js +2926 -4247
  41. package/kt-math.js.map +1 -1
  42. package/package.json +9 -3
  43. package/kotlin-kotlin-stdlib-js-ir.js.map +0 -1
package/2p-bdd.js CHANGED
@@ -1,41 +1,42 @@
1
1
  (function (root, factory) {
2
2
  if (typeof define === 'function' && define.amd)
3
- define(['exports', './kotlin-kotlin-stdlib-js-ir.js'], factory);
3
+ define(['exports', './kotlin-kotlin-stdlib.js'], factory);
4
4
  else if (typeof exports === 'object')
5
- factory(module.exports, require('./kotlin-kotlin-stdlib-js-ir.js'));
5
+ factory(module.exports, require('./kotlin-kotlin-stdlib.js'));
6
6
  else {
7
- if (typeof this['kotlin-kotlin-stdlib-js-ir'] === 'undefined') {
8
- throw new Error("Error loading module '2p-bdd'. Its dependency 'kotlin-kotlin-stdlib-js-ir' was not found. Please, check whether 'kotlin-kotlin-stdlib-js-ir' is loaded prior to '2p-bdd'.");
7
+ if (typeof this['kotlin-kotlin-stdlib'] === 'undefined') {
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
- root['2p-bdd'] = factory(typeof this['2p-bdd'] === 'undefined' ? {} : this['2p-bdd'], this['kotlin-kotlin-stdlib-js-ir']);
10
+ root['2p-bdd'] = factory(typeof this['2p-bdd'] === 'undefined' ? {} : this['2p-bdd'], this['kotlin-kotlin-stdlib']);
11
11
  }
12
12
  }(this, function (_, kotlin_kotlin) {
13
13
  'use strict';
14
14
  //region block: imports
15
15
  var imul = Math.imul;
16
- var protoOf = kotlin_kotlin.$_$.s6;
17
- var interfaceMeta = kotlin_kotlin.$_$.c6;
18
- var VOID = kotlin_kotlin.$_$.gc;
19
- var setMetadataFor = kotlin_kotlin.$_$.t6;
20
- var objectMeta = kotlin_kotlin.$_$.r6;
21
- var RuntimeException = kotlin_kotlin.$_$.sb;
22
- var RuntimeException_init_$Init$ = kotlin_kotlin.$_$.f1;
23
- var captureStack = kotlin_kotlin.$_$.o5;
24
- var defineProp = kotlin_kotlin.$_$.v5;
25
- var classMeta = kotlin_kotlin.$_$.t5;
26
- var hashCode = kotlin_kotlin.$_$.b6;
27
- var LinkedHashMap_init_$Create$ = kotlin_kotlin.$_$.i;
28
- var Unit_getInstance = kotlin_kotlin.$_$.v1;
29
- var ensureNotNull = kotlin_kotlin.$_$.wb;
30
- var Pair = kotlin_kotlin.$_$.rb;
31
- var compareTo = kotlin_kotlin.$_$.u5;
32
- var equals = kotlin_kotlin.$_$.w5;
33
- var THROW_CCE = kotlin_kotlin.$_$.tb;
34
- var isComparable = kotlin_kotlin.$_$.f6;
16
+ var protoOf = kotlin_kotlin.$_$.u6;
17
+ var interfaceMeta = kotlin_kotlin.$_$.f6;
18
+ var setMetadataFor = kotlin_kotlin.$_$.v6;
19
+ var objectMeta = kotlin_kotlin.$_$.t6;
20
+ var VOID = kotlin_kotlin.$_$.d;
21
+ var RuntimeException = kotlin_kotlin.$_$.ub;
22
+ var RuntimeException_init_$Init$ = kotlin_kotlin.$_$.i1;
23
+ var captureStack = kotlin_kotlin.$_$.q5;
24
+ var defineProp = kotlin_kotlin.$_$.x5;
25
+ var classMeta = kotlin_kotlin.$_$.v5;
26
+ var hashCode = kotlin_kotlin.$_$.e6;
27
+ var LinkedHashMap_init_$Create$ = kotlin_kotlin.$_$.j;
28
+ var Unit_instance = kotlin_kotlin.$_$.y1;
29
+ var ensureNotNull = kotlin_kotlin.$_$.yb;
30
+ var Pair = kotlin_kotlin.$_$.tb;
31
+ var compareTo = kotlin_kotlin.$_$.w5;
32
+ var equals = kotlin_kotlin.$_$.y5;
33
+ var THROW_CCE = kotlin_kotlin.$_$.vb;
34
+ var isComparable = kotlin_kotlin.$_$.i6;
35
35
  var getKClassFromExpression = kotlin_kotlin.$_$.b;
36
- var lazy = kotlin_kotlin.$_$.yb;
37
- var KProperty1 = kotlin_kotlin.$_$.o7;
38
- var getPropertyCallableRef = kotlin_kotlin.$_$.z5;
36
+ var getBooleanHashCode = kotlin_kotlin.$_$.a6;
37
+ var lazy = kotlin_kotlin.$_$.ac;
38
+ var KProperty1 = kotlin_kotlin.$_$.q7;
39
+ var getPropertyCallableRef = kotlin_kotlin.$_$.c6;
39
40
  //endregion
40
41
  //region block: pre-declaration
41
42
  function accept(visitor) {
@@ -48,42 +49,38 @@
48
49
  setMetadataFor(Variable, 'Variable', interfaceMeta);
49
50
  setMetadataFor(Companion, 'Companion', objectMeta);
50
51
  setMetadataFor(Companion_0, 'Companion', objectMeta);
51
- setMetadataFor(BinaryDecisionDiagramException, 'BinaryDecisionDiagramException', classMeta, RuntimeException);
52
+ setMetadataFor(BinaryDecisionDiagramException, 'BinaryDecisionDiagramException', classMeta, RuntimeException, VOID, BinaryDecisionDiagramException);
52
53
  setMetadataFor(BinaryDecisionDiagramOperationException, 'BinaryDecisionDiagramOperationException', classMeta, BinaryDecisionDiagramException);
53
54
  setMetadataFor(AnyVisitor, 'AnyVisitor', classMeta);
54
55
  setMetadataFor(BinaryApplyExpansionVisitor, 'BinaryApplyExpansionVisitor', classMeta);
55
56
  setMetadataFor(ExpansionVisitor, 'ExpansionVisitor', classMeta);
56
57
  setMetadataFor(UnaryApplyExpansionVisitor, 'UnaryApplyExpansionVisitor', classMeta);
57
58
  setMetadataFor(ReducedBinaryDecisionDiagramBuilder, 'ReducedBinaryDecisionDiagramBuilder', classMeta);
58
- setMetadataFor(SimpleBinaryDecisionDiagramBuilder, 'SimpleBinaryDecisionDiagramBuilder', classMeta);
59
+ setMetadataFor(SimpleBinaryDecisionDiagramBuilder, 'SimpleBinaryDecisionDiagramBuilder', classMeta, VOID, VOID, SimpleBinaryDecisionDiagramBuilder);
59
60
  setMetadataFor(SimpleBinaryDecisionDiagramTerminal, 'SimpleBinaryDecisionDiagramTerminal', classMeta, VOID, [Terminal]);
60
61
  setMetadataFor(SimpleBinaryDecisionDiagramVariable, 'SimpleBinaryDecisionDiagramVariable', classMeta, VOID, [Variable]);
61
- setMetadataFor(CastVisitor, 'CastVisitor', classMeta);
62
+ setMetadataFor(CastVisitor, 'CastVisitor', classMeta, VOID, VOID, CastVisitor);
62
63
  //endregion
63
64
  function Terminal() {
64
65
  }
65
66
  function Variable() {
66
67
  }
67
68
  function Companion() {
68
- Companion_instance = this;
69
69
  }
70
70
  protoOf(Companion).variableOf = function (value) {
71
71
  return this.variableOfWithNodes(value, this.terminalOf(false), this.terminalOf(true));
72
72
  };
73
73
  protoOf(Companion).variableOfWithNodes = function (value, low, high) {
74
- return Companion_getInstance_0().defaultOf().buildVariable(value, low, high);
74
+ return Companion_instance_0.defaultOf().buildVariable(value, low, high);
75
75
  };
76
76
  protoOf(Companion).terminalOf = function (truth) {
77
- return Companion_getInstance_0().defaultOf().buildTerminal(truth);
77
+ return Companion_instance_0.defaultOf().buildTerminal(truth);
78
78
  };
79
79
  var Companion_instance;
80
80
  function Companion_getInstance() {
81
- if (Companion_instance == null)
82
- new Companion();
83
81
  return Companion_instance;
84
82
  }
85
83
  function Companion_0() {
86
- Companion_instance_0 = this;
87
84
  }
88
85
  protoOf(Companion_0).defaultOf = function () {
89
86
  return createDefaultBinaryDecisionDiagramBuilder();
@@ -91,21 +88,19 @@
91
88
  protoOf(Companion_0).simpleOf = function () {
92
89
  return new SimpleBinaryDecisionDiagramBuilder();
93
90
  };
94
- protoOf(Companion_0).w2z = function (delegate) {
91
+ protoOf(Companion_0).z30 = function (delegate) {
95
92
  return new ReducedBinaryDecisionDiagramBuilder(delegate);
96
93
  };
97
94
  protoOf(Companion_0).reducedOf = function (delegate, $super) {
98
95
  delegate = delegate === VOID ? this.defaultOf() : delegate;
99
- return $super === VOID ? this.w2z(delegate) : $super.w2z.call(this, delegate);
96
+ return $super === VOID ? this.z30(delegate) : $super.z30.call(this, delegate);
100
97
  };
101
98
  var Companion_instance_0;
102
99
  function Companion_getInstance_0() {
103
- if (Companion_instance_0 == null)
104
- new Companion_0();
105
100
  return Companion_instance_0;
106
101
  }
107
102
  function createDefaultBinaryDecisionDiagramBuilder() {
108
- return Companion_getInstance_0().simpleOf();
103
+ return Companion_instance_0.simpleOf();
109
104
  }
110
105
  function notThenExpansion(_this__u8e3s4, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
111
106
  return runOperationAndCatchErrors(notThenExpansion$lambda(_this__u8e3s4, expansionFalseTerminal, expansionTrueTerminal, expansionOperator));
@@ -148,19 +143,19 @@
148
143
  }
149
144
  function applyThenExpansion$lambda($this_applyThenExpansion, $unaryOp, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator) {
150
145
  return function () {
151
- return $this_applyThenExpansion.accept(new UnaryApplyExpansionVisitor(Companion_getInstance_0().reducedOf(), $unaryOp, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator));
146
+ return $this_applyThenExpansion.accept(new UnaryApplyExpansionVisitor(Companion_instance_0.reducedOf(), $unaryOp, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator));
152
147
  };
153
148
  }
154
149
  function applyThenExpansion$lambda_0($this_applyThenExpansion, $that, $binaryOp, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator) {
155
150
  return function () {
156
- return $this_applyThenExpansion.accept(new BinaryApplyExpansionVisitor(Companion_getInstance_0().reducedOf(), $that, $binaryOp, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator));
151
+ return $this_applyThenExpansion.accept(new BinaryApplyExpansionVisitor(Companion_instance_0.reducedOf(), $that, $binaryOp, $expansionFalseTerminal, $expansionTrueTerminal, $expansionOperator));
157
152
  };
158
153
  }
159
154
  function bddTerminalOf(value) {
160
- return Companion_getInstance().terminalOf(value);
155
+ return Companion_instance.terminalOf(value);
161
156
  }
162
157
  function bddOf(value) {
163
- return Companion_getInstance().variableOf(value);
158
+ return Companion_instance.variableOf(value);
164
159
  }
165
160
  function expansion(_this__u8e3s4, falseTerminal, trueTerminal, operator) {
166
161
  return runOperationAndCatchErrors(expansion$lambda(_this__u8e3s4, operator, falseTerminal, trueTerminal));
@@ -169,7 +164,7 @@
169
164
  return runOperationAndCatchErrors(any$lambda(_this__u8e3s4, predicate));
170
165
  }
171
166
  function map(_this__u8e3s4, mapper) {
172
- var builder = Companion_getInstance_0().reducedOf();
167
+ var builder = Companion_instance_0.reducedOf();
173
168
  return runOperationAndCatchErrors(map$lambda(_this__u8e3s4, builder, mapper));
174
169
  }
175
170
  function runOperationAndCatchErrors(action) {
@@ -211,84 +206,75 @@
211
206
  cause = cause === VOID ? null : cause;
212
207
  RuntimeException_init_$Init$(message, cause, this);
213
208
  captureStack(this, BinaryDecisionDiagramException);
214
- this.x2z_1 = message;
215
- this.y2z_1 = cause;
209
+ this.a31_1 = message;
210
+ this.b31_1 = cause;
216
211
  }
217
- protoOf(BinaryDecisionDiagramException).p1 = function () {
218
- return this.x2z_1;
212
+ protoOf(BinaryDecisionDiagramException).na = function () {
213
+ return this.a31_1;
219
214
  };
220
- protoOf(BinaryDecisionDiagramException).q1 = function () {
221
- return this.y2z_1;
215
+ protoOf(BinaryDecisionDiagramException).oa = function () {
216
+ return this.b31_1;
222
217
  };
223
- defineProp(protoOf(BinaryDecisionDiagramException), 'message', function () {
224
- return this.p1();
225
- });
226
- defineProp(protoOf(BinaryDecisionDiagramException), 'cause', function () {
227
- return this.q1();
228
- });
229
218
  function BinaryDecisionDiagramOperationException(message, cause) {
230
219
  cause = cause === VOID ? null : cause;
231
220
  BinaryDecisionDiagramException.call(this, message, cause);
232
221
  captureStack(this, BinaryDecisionDiagramOperationException);
233
222
  }
234
223
  function AnyVisitor(predicate) {
235
- this.z2z_1 = predicate;
224
+ this.c31_1 = predicate;
236
225
  }
237
- protoOf(AnyVisitor).a30 = function (node) {
226
+ protoOf(AnyVisitor).d31 = function (node) {
238
227
  return false;
239
228
  };
240
229
  protoOf(AnyVisitor).visitTerminal = function (node) {
241
- return this.a30(node);
230
+ return this.d31(node);
242
231
  };
243
- protoOf(AnyVisitor).b30 = function (node) {
244
- var result = this.z2z_1(node.b1());
232
+ protoOf(AnyVisitor).e31 = function (node) {
233
+ var result = this.c31_1(node.r2());
245
234
  if (!result) {
246
- result = node.u2z().accept(this);
235
+ result = node.x30().accept(this);
247
236
  }
248
237
  if (!result) {
249
- result = node.v2z().accept(this);
238
+ result = node.y30().accept(this);
250
239
  }
251
240
  return result;
252
241
  };
253
242
  protoOf(AnyVisitor).visitVariable = function (node) {
254
- return this.b30(node);
243
+ return this.e31(node);
255
244
  };
256
245
  function visitWithTable($this, first, second, computation) {
257
246
  var firstKey = hashCode(first);
258
247
  var secondKey = hashCode(second);
259
- if (!$this.i30_1.z2(firstKey)) {
248
+ if (!$this.l31_1.u2(firstKey)) {
260
249
  // Inline function 'kotlin.collections.set' call
261
- var tmp0_set = $this.i30_1;
262
- var tmp$ret$0;
250
+ var this_0 = $this.l31_1;
263
251
  // Inline function 'kotlin.collections.mutableMapOf' call
264
- tmp$ret$0 = LinkedHashMap_init_$Create$();
265
- var tmp1_set = tmp$ret$0;
266
- tmp0_set.a4(firstKey, tmp1_set);
252
+ var value = LinkedHashMap_init_$Create$();
253
+ this_0.n2(firstKey, value);
267
254
  }
268
- var cached = ensureNotNull($this.i30_1.f3(firstKey)).f3(secondKey);
255
+ var cached = ensureNotNull($this.l31_1.x2(firstKey)).x2(secondKey);
269
256
  if (!(cached == null)) {
270
257
  return cached;
271
258
  }
272
259
  var result = computation();
273
260
  // Inline function 'kotlin.collections.set' call
274
- var tmp2_set = ensureNotNull($this.i30_1.f3(firstKey));
275
- tmp2_set.a4(secondKey, result);
261
+ ensureNotNull($this.l31_1.x2(firstKey)).n2(secondKey, result);
276
262
  return result;
277
263
  }
278
264
  function apply($this, first, second) {
279
- var truth = $this.e30_1(first.s2z(), second.s2z());
280
- return new Pair($this.c30_1.buildTerminal(truth), truth ? $this.g30_1 : $this.f30_1);
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);
281
267
  }
282
268
  function apply_0($this, first, second) {
283
- $this.d30_1 = second.u2z();
284
- var lowNode = first.t2z($this);
285
- $this.d30_1 = second.v2z();
286
- var highNode = first.t2z($this);
287
- return new Pair($this.c30_1.buildVariable(second.b1(), lowNode.k4_1, highNode.k4_1), $this.h30_1(second.b1(), lowNode.l4_1, highNode.l4_1));
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));
288
274
  }
289
275
  function apply_1($this, first, second) {
290
- $this.d30_1 = first;
291
- return second.t2z($this);
276
+ $this.g31_1 = first;
277
+ return second.w30($this);
292
278
  }
293
279
  function apply_2($this, first, second) {
294
280
  var newValue;
@@ -296,27 +282,27 @@
296
282
  var firstHigh;
297
283
  var secondLow;
298
284
  var secondHigh;
299
- if (compareTo(first.b1(), second.b1()) <= 0) {
300
- newValue = first.b1();
301
- firstHigh = first.v2z();
302
- firstLow = first.u2z();
285
+ if (compareTo(first.r2(), second.r2()) <= 0) {
286
+ newValue = first.r2();
287
+ firstHigh = first.y30();
288
+ firstLow = first.x30();
303
289
  } else {
304
- newValue = second.b1();
290
+ newValue = second.r2();
305
291
  firstLow = first;
306
292
  firstHigh = first;
307
293
  }
308
- if (compareTo(second.b1(), first.b1()) <= 0) {
309
- secondHigh = second.v2z();
310
- secondLow = second.u2z();
294
+ if (compareTo(second.r2(), first.r2()) <= 0) {
295
+ secondHigh = second.y30();
296
+ secondLow = second.x30();
311
297
  } else {
312
298
  secondLow = second;
313
299
  secondHigh = second;
314
300
  }
315
- $this.d30_1 = secondLow;
301
+ $this.g31_1 = secondLow;
316
302
  var lowNode = firstLow.accept($this);
317
- $this.d30_1 = secondHigh;
303
+ $this.g31_1 = secondHigh;
318
304
  var highNode = firstHigh.accept($this);
319
- return new Pair($this.c30_1.buildVariable(newValue, lowNode.k4_1, highNode.k4_1), $this.h30_1(newValue, lowNode.l4_1, highNode.l4_1));
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));
320
306
  }
321
307
  function BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node) {
322
308
  return function (that) {
@@ -330,11 +316,11 @@
330
316
  }
331
317
  function BinaryApplyExpansionVisitor$visit$lambda(this$0, $node) {
332
318
  return function () {
333
- var tmp = this$0.j30_1;
334
- tmp.k30_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda(this$0, $node);
335
- var tmp_0 = this$0.j30_1;
336
- tmp_0.l30_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_0(this$0, $node);
337
- return this$0.d30_1.accept(this$0.j30_1);
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);
338
324
  };
339
325
  }
340
326
  function BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node) {
@@ -349,217 +335,204 @@
349
335
  }
350
336
  function BinaryApplyExpansionVisitor$visit$lambda_0(this$0, $node) {
351
337
  return function () {
352
- var tmp = this$0.j30_1;
353
- tmp.k30_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_1(this$0, $node);
354
- var tmp_0 = this$0.j30_1;
355
- tmp_0.l30_1 = BinaryApplyExpansionVisitor$visit$lambda$lambda_2(this$0, $node);
356
- return this$0.d30_1.accept(this$0.j30_1);
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);
357
343
  };
358
344
  }
359
345
  function BinaryApplyExpansionVisitor(builder, thatNode, operator, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
360
- this.c30_1 = builder;
361
- this.d30_1 = thatNode;
362
- this.e30_1 = operator;
363
- this.f30_1 = expansionFalseTerminal;
364
- this.g30_1 = expansionTrueTerminal;
365
- this.h30_1 = 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;
366
352
  var tmp = this;
367
- var tmp$ret$0;
368
353
  // Inline function 'kotlin.collections.mutableMapOf' call
369
- tmp$ret$0 = LinkedHashMap_init_$Create$();
370
- tmp.i30_1 = tmp$ret$0;
371
- this.j30_1 = new CastVisitor();
354
+ tmp.l31_1 = LinkedHashMap_init_$Create$();
355
+ this.m31_1 = new CastVisitor();
372
356
  }
373
- protoOf(BinaryApplyExpansionVisitor).a30 = function (node) {
374
- var tmp = this.d30_1;
357
+ protoOf(BinaryApplyExpansionVisitor).d31 = function (node) {
358
+ var tmp = this.g31_1;
375
359
  return visitWithTable(this, node, tmp, BinaryApplyExpansionVisitor$visit$lambda(this, node));
376
360
  };
377
361
  protoOf(BinaryApplyExpansionVisitor).visitTerminal = function (node) {
378
- return this.a30(node);
362
+ return this.d31(node);
379
363
  };
380
- protoOf(BinaryApplyExpansionVisitor).b30 = function (node) {
381
- var tmp = this.d30_1;
364
+ protoOf(BinaryApplyExpansionVisitor).e31 = function (node) {
365
+ var tmp = this.g31_1;
382
366
  return visitWithTable(this, node, tmp, BinaryApplyExpansionVisitor$visit$lambda_0(this, node));
383
367
  };
384
368
  protoOf(BinaryApplyExpansionVisitor).visitVariable = function (node) {
385
- return this.b30(node);
369
+ return this.e31(node);
386
370
  };
387
371
  function ExpansionVisitor(varOp, falseTerminal, trueTerminal) {
388
- this.m30_1 = varOp;
389
- this.n30_1 = falseTerminal;
390
- this.o30_1 = trueTerminal;
372
+ this.p31_1 = varOp;
373
+ this.q31_1 = falseTerminal;
374
+ this.r31_1 = trueTerminal;
391
375
  }
392
- protoOf(ExpansionVisitor).a30 = function (node) {
393
- return node.s2z() ? this.o30_1 : this.n30_1;
376
+ protoOf(ExpansionVisitor).d31 = function (node) {
377
+ return node.v30() ? this.r31_1 : this.q31_1;
394
378
  };
395
379
  protoOf(ExpansionVisitor).visitTerminal = function (node) {
396
- return this.a30(node);
380
+ return this.d31(node);
397
381
  };
398
- protoOf(ExpansionVisitor).b30 = function (node) {
399
- var lowValue = node.u2z().accept(this);
400
- var highValue = node.v2z().accept(this);
401
- return this.m30_1(node.b1(), lowValue, highValue);
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);
402
386
  };
403
387
  protoOf(ExpansionVisitor).visitVariable = function (node) {
404
- return this.b30(node);
388
+ return this.e31(node);
405
389
  };
406
390
  function UnaryApplyExpansionVisitor(builder, operator, expansionFalseTerminal, expansionTrueTerminal, expansionOperator) {
407
- this.p30_1 = builder;
408
- this.q30_1 = operator;
409
- this.r30_1 = expansionFalseTerminal;
410
- this.s30_1 = expansionTrueTerminal;
411
- this.t30_1 = 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;
412
396
  var tmp = this;
413
- var tmp$ret$0;
414
397
  // Inline function 'kotlin.collections.mutableMapOf' call
415
- tmp$ret$0 = LinkedHashMap_init_$Create$();
416
- tmp.u30_1 = tmp$ret$0;
398
+ tmp.x31_1 = LinkedHashMap_init_$Create$();
417
399
  }
418
- protoOf(UnaryApplyExpansionVisitor).a30 = function (node) {
419
- var resTruth = this.q30_1(node.s2z());
420
- return new Pair(this.p30_1.buildTerminal(resTruth), resTruth ? this.s30_1 : this.r30_1);
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);
421
403
  };
422
404
  protoOf(UnaryApplyExpansionVisitor).visitTerminal = function (node) {
423
- return this.a30(node);
405
+ return this.d31(node);
424
406
  };
425
- protoOf(UnaryApplyExpansionVisitor).b30 = function (node) {
407
+ protoOf(UnaryApplyExpansionVisitor).e31 = function (node) {
426
408
  var key = hashCode(node);
427
- if (this.u30_1.z2(key)) {
428
- return ensureNotNull(this.u30_1.f3(key));
409
+ if (this.x31_1.u2(key)) {
410
+ return ensureNotNull(this.x31_1.x2(key));
429
411
  }
430
- var lowNode = node.u2z().accept(this);
431
- var highNode = node.v2z().accept(this);
432
- var result = new Pair(this.p30_1.buildVariable(node.b1(), lowNode.k4_1, highNode.k4_1), this.t30_1(node.b1(), lowNode.l4_1, highNode.l4_1));
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));
433
415
  // Inline function 'kotlin.collections.set' call
434
- var tmp0_set = this.u30_1;
435
- tmp0_set.a4(key, result);
416
+ this.x31_1.n2(key, result);
436
417
  return result;
437
418
  };
438
419
  protoOf(UnaryApplyExpansionVisitor).visitVariable = function (node) {
439
- return this.b30(node);
420
+ return this.e31(node);
440
421
  };
441
422
  function ReducedBinaryDecisionDiagramBuilder(delegate) {
442
- this.v30_1 = delegate;
423
+ this.y31_1 = delegate;
443
424
  var tmp = this;
444
- var tmp$ret$0;
445
425
  // Inline function 'kotlin.collections.mutableMapOf' call
446
- tmp$ret$0 = LinkedHashMap_init_$Create$();
447
- tmp.w30_1 = tmp$ret$0;
426
+ tmp.z31_1 = LinkedHashMap_init_$Create$();
448
427
  }
449
- protoOf(ReducedBinaryDecisionDiagramBuilder).x30 = function (value, low, high) {
428
+ protoOf(ReducedBinaryDecisionDiagramBuilder).a32 = function (value, low, high) {
450
429
  if (equals(low, high)) {
451
430
  return low;
452
431
  }
453
- var newNode = this.v30_1.buildVariable(value, low, high);
432
+ var newNode = this.y31_1.buildVariable(value, low, high);
454
433
  var key = hashCode(newNode);
455
- var cached = this.w30_1.f3(key);
434
+ var cached = this.z31_1.x2(key);
456
435
  var tmp;
457
436
  if (!(cached == null)) {
458
437
  tmp = cached;
459
438
  } else {
460
439
  // Inline function 'kotlin.collections.set' call
461
- var tmp0_set = this.w30_1;
462
- tmp0_set.a4(key, newNode);
440
+ this.z31_1.n2(key, newNode);
463
441
  tmp = newNode;
464
442
  }
465
443
  return tmp;
466
444
  };
467
445
  protoOf(ReducedBinaryDecisionDiagramBuilder).buildVariable = function (value, low, high) {
468
- return this.x30(isComparable(value) ? value : THROW_CCE(), low, high);
446
+ return this.a32(isComparable(value) ? value : THROW_CCE(), low, high);
469
447
  };
470
- protoOf(ReducedBinaryDecisionDiagramBuilder).y30 = function (truth) {
471
- return this.v30_1.buildTerminal(truth);
448
+ protoOf(ReducedBinaryDecisionDiagramBuilder).b32 = function (truth) {
449
+ return this.y31_1.buildTerminal(truth);
472
450
  };
473
451
  protoOf(ReducedBinaryDecisionDiagramBuilder).buildTerminal = function (truth) {
474
- return this.y30(truth);
452
+ return this.b32(truth);
475
453
  };
476
454
  function SimpleBinaryDecisionDiagramBuilder() {
477
455
  }
478
- protoOf(SimpleBinaryDecisionDiagramBuilder).x30 = function (value, low, high) {
456
+ protoOf(SimpleBinaryDecisionDiagramBuilder).a32 = function (value, low, high) {
479
457
  return new SimpleBinaryDecisionDiagramVariable(value, low, high);
480
458
  };
481
459
  protoOf(SimpleBinaryDecisionDiagramBuilder).buildVariable = function (value, low, high) {
482
- return this.x30(isComparable(value) ? value : THROW_CCE(), low, high);
460
+ return this.a32(isComparable(value) ? value : THROW_CCE(), low, high);
483
461
  };
484
- protoOf(SimpleBinaryDecisionDiagramBuilder).y30 = function (truth) {
462
+ protoOf(SimpleBinaryDecisionDiagramBuilder).b32 = function (truth) {
485
463
  return new SimpleBinaryDecisionDiagramTerminal(truth);
486
464
  };
487
465
  protoOf(SimpleBinaryDecisionDiagramBuilder).buildTerminal = function (truth) {
488
- return this.y30(truth);
466
+ return this.b32(truth);
489
467
  };
490
468
  function SimpleBinaryDecisionDiagramTerminal(truth) {
491
- this.z30_1 = truth;
469
+ this.c32_1 = truth;
492
470
  }
493
- protoOf(SimpleBinaryDecisionDiagramTerminal).s2z = function () {
494
- return this.z30_1;
471
+ protoOf(SimpleBinaryDecisionDiagramTerminal).v30 = function () {
472
+ return this.c32_1;
495
473
  };
496
474
  protoOf(SimpleBinaryDecisionDiagramTerminal).equals = function (other) {
497
475
  if (this === other)
498
476
  return true;
499
477
  if (other == null ? true : !getKClassFromExpression(this).equals(getKClassFromExpression(other)))
500
478
  return false;
501
- if (other instanceof SimpleBinaryDecisionDiagramTerminal)
502
- other;
503
- else
479
+ if (!(other instanceof SimpleBinaryDecisionDiagramTerminal))
504
480
  THROW_CCE();
505
- if (!(this.z30_1 === other.z30_1))
481
+ if (!(this.c32_1 === other.c32_1))
506
482
  return false;
507
483
  return true;
508
484
  };
509
485
  protoOf(SimpleBinaryDecisionDiagramTerminal).hashCode = function () {
510
- return this.z30_1 | 0;
486
+ return getBooleanHashCode(this.c32_1);
511
487
  };
512
488
  protoOf(SimpleBinaryDecisionDiagramTerminal).toString = function () {
513
- return 'SimpleBinaryDecisionDiagramTerminal(truth=' + this.z30_1 + ')';
489
+ return 'SimpleBinaryDecisionDiagramTerminal(truth=' + this.c32_1 + ')';
514
490
  };
515
491
  protoOf(SimpleBinaryDecisionDiagramTerminal).accept = function (visitor) {
516
- return this.t2z(visitor);
492
+ return this.w30(visitor);
517
493
  };
518
494
  function _get_hashCodeCache__ny3r0q($this) {
519
- var tmp$ret$0;
520
495
  // Inline function 'kotlin.getValue' call
521
- var tmp0_getValue = hashCodeCache$factory();
522
- tmp$ret$0 = $this.d31_1.b1();
523
- return tmp$ret$0;
496
+ var this_0 = $this.g32_1;
497
+ hashCodeCache$factory();
498
+ return this_0.r2();
524
499
  }
525
500
  function SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this$0) {
526
501
  return function () {
527
- var result = hashCode(this$0.a31_1);
528
- result = imul(31, result) + hashCode(this$0.b31_1) | 0;
529
- result = imul(31, result) + hashCode(this$0.c31_1) | 0;
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;
530
505
  return result;
531
506
  };
532
507
  }
533
508
  function SimpleBinaryDecisionDiagramVariable(value, low, high) {
534
- this.a31_1 = value;
535
- this.b31_1 = low;
536
- this.c31_1 = high;
509
+ this.d32_1 = value;
510
+ this.e32_1 = low;
511
+ this.f32_1 = high;
537
512
  var tmp = this;
538
- tmp.d31_1 = lazy(SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this));
513
+ tmp.g32_1 = lazy(SimpleBinaryDecisionDiagramVariable$hashCodeCache$delegate$lambda(this));
539
514
  }
540
- protoOf(SimpleBinaryDecisionDiagramVariable).b1 = function () {
541
- return this.a31_1;
515
+ protoOf(SimpleBinaryDecisionDiagramVariable).r2 = function () {
516
+ return this.d32_1;
542
517
  };
543
- protoOf(SimpleBinaryDecisionDiagramVariable).u2z = function () {
544
- return this.b31_1;
518
+ protoOf(SimpleBinaryDecisionDiagramVariable).x30 = function () {
519
+ return this.e32_1;
545
520
  };
546
- protoOf(SimpleBinaryDecisionDiagramVariable).v2z = function () {
547
- return this.c31_1;
521
+ protoOf(SimpleBinaryDecisionDiagramVariable).y30 = function () {
522
+ return this.f32_1;
548
523
  };
549
524
  protoOf(SimpleBinaryDecisionDiagramVariable).equals = function (other) {
550
525
  if (this === other)
551
526
  return true;
552
527
  if (other == null ? true : !getKClassFromExpression(this).equals(getKClassFromExpression(other)))
553
528
  return false;
554
- if (other instanceof SimpleBinaryDecisionDiagramVariable)
555
- other;
556
- else
529
+ if (!(other instanceof SimpleBinaryDecisionDiagramVariable))
557
530
  THROW_CCE();
558
- if (!equals(this.a31_1, other.a31_1))
531
+ if (!equals(this.d32_1, other.d32_1))
559
532
  return false;
560
- if (!equals(this.b31_1, other.b31_1))
533
+ if (!equals(this.e32_1, other.e32_1))
561
534
  return false;
562
- if (!equals(this.c31_1, other.c31_1))
535
+ if (!equals(this.f32_1, other.f32_1))
563
536
  return false;
564
537
  return true;
565
538
  };
@@ -567,10 +540,10 @@
567
540
  return _get_hashCodeCache__ny3r0q(this);
568
541
  };
569
542
  protoOf(SimpleBinaryDecisionDiagramVariable).toString = function () {
570
- return 'SimpleBinaryDecisionDiagramVariable(value=' + this.a31_1 + ', low=' + this.b31_1 + ', high=' + this.c31_1 + ')';
543
+ return 'SimpleBinaryDecisionDiagramVariable(value=' + this.d32_1 + ', low=' + this.e32_1 + ', high=' + this.f32_1 + ')';
571
544
  };
572
545
  protoOf(SimpleBinaryDecisionDiagramVariable).accept = function (visitor) {
573
- return this.t2z(visitor);
546
+ return this.w30(visitor);
574
547
  };
575
548
  function hashCodeCache$factory() {
576
549
  return getPropertyCallableRef('hashCodeCache', 1, KProperty1, function (receiver) {
@@ -578,24 +551,34 @@
578
551
  }, null);
579
552
  }
580
553
  function CastVisitor() {
581
- this.k30_1 = null;
582
- this.l30_1 = null;
554
+ this.n31_1 = null;
555
+ this.o31_1 = null;
583
556
  }
584
- protoOf(CastVisitor).a30 = function (node) {
585
- return ensureNotNull(this.k30_1)(node);
557
+ protoOf(CastVisitor).d31 = function (node) {
558
+ return ensureNotNull(this.n31_1)(node);
586
559
  };
587
560
  protoOf(CastVisitor).visitTerminal = function (node) {
588
- return this.a30(node);
561
+ return this.d31(node);
589
562
  };
590
- protoOf(CastVisitor).b30 = function (node) {
591
- return ensureNotNull(this.l30_1)(node);
563
+ protoOf(CastVisitor).e31 = function (node) {
564
+ return ensureNotNull(this.o31_1)(node);
592
565
  };
593
566
  protoOf(CastVisitor).visitVariable = function (node) {
594
- return this.b30(node);
567
+ return this.e31(node);
595
568
  };
596
569
  //region block: post-declaration
597
- protoOf(SimpleBinaryDecisionDiagramTerminal).t2z = accept;
598
- protoOf(SimpleBinaryDecisionDiagramVariable).t2z = accept_0;
570
+ defineProp(protoOf(BinaryDecisionDiagramException), 'message', function () {
571
+ return this.na();
572
+ });
573
+ defineProp(protoOf(BinaryDecisionDiagramException), 'cause', function () {
574
+ return this.oa();
575
+ });
576
+ protoOf(SimpleBinaryDecisionDiagramTerminal).w30 = accept;
577
+ protoOf(SimpleBinaryDecisionDiagramVariable).w30 = accept_0;
578
+ //endregion
579
+ //region block: init
580
+ Companion_instance = new Companion();
581
+ Companion_instance_0 = new Companion_0();
599
582
  //endregion
600
583
  //region block: exports
601
584
  _.$_$ = _.$_$ || {};