@tuprolog/2p-full 0.32.4 → 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 +136 -136
- package/2p-core.js +379 -412
- package/2p-core.js.map +1 -1
- package/2p-io-lib.js +463 -463
- package/2p-oop-lib.js +594 -594
- package/2p-oop-lib.js.map +1 -1
- package/2p-parser-core.js +114 -114
- package/2p-parser-core.js.map +1 -1
- package/2p-parser-theory.js +11 -11
- package/2p-repl.js +63 -63
- package/2p-repl.js.map +1 -1
- package/2p-solve-classic.js +794 -794
- package/2p-solve-classic.js.map +1 -1
- package/2p-solve-plp.js +1 -1
- package/2p-solve-problog.js +922 -922
- package/2p-solve-problog.js.map +1 -1
- package/2p-solve-streams.js +641 -641
- package/2p-solve.js +2877 -2867
- package/2p-solve.js.map +1 -1
- package/2p-test-dsl.js +15 -0
- package/2p-test-dsl.js.map +1 -0
- package/2p-theory.js +1342 -1065
- package/2p-theory.js.map +1 -1
- package/2p-unify.js +160 -160
- package/2p-utils.js +3 -3
- package/2p-utils.js.map +1 -1
- package/clikt-clikt-js-ir.js +1010 -1010
- package/kotlin-kotlin-stdlib.js +31 -31
- package/kotlin-kotlin-stdlib.js.map +1 -1
- package/kotlin-kotlin-test-kotlin-test-js-ir.js +15 -0
- package/kotlin-kotlin-test-kotlin-test-js-ir.js.map +1 -0
- package/package.json +1 -1
package/2p-unify.js
CHANGED
|
@@ -57,16 +57,16 @@
|
|
|
57
57
|
//endregion
|
|
58
58
|
//region block: pre-declaration
|
|
59
59
|
function mgu(term1, term2) {
|
|
60
|
-
return this.
|
|
60
|
+
return this.y1j(term1, term2, true);
|
|
61
61
|
}
|
|
62
62
|
function matchWithOccurCheck(term1, term2, occurCheckEnabled) {
|
|
63
|
-
return !(this.
|
|
63
|
+
return !(this.y1j(term1, term2, occurCheckEnabled) === Companion_getInstance().failed());
|
|
64
64
|
}
|
|
65
65
|
function match(term1, term2) {
|
|
66
66
|
return this.matchWithOccurCheck(term1, term2, true);
|
|
67
67
|
}
|
|
68
68
|
function unifyWithOccurCheck(term1, term2, occurCheckEnabled) {
|
|
69
|
-
var substitution = this.
|
|
69
|
+
var substitution = this.y1j(term1, term2, occurCheckEnabled);
|
|
70
70
|
return substitution.x12() ? null : term1.getSubstituted(substitution, []);
|
|
71
71
|
}
|
|
72
72
|
function unify(term1, term2) {
|
|
@@ -90,14 +90,14 @@
|
|
|
90
90
|
//endregion
|
|
91
91
|
function _get_contextEquations__x0dd77($this) {
|
|
92
92
|
// Inline function 'kotlin.getValue' call
|
|
93
|
-
var this_0 = $this.
|
|
93
|
+
var this_0 = $this.h1j_1;
|
|
94
94
|
contextEquations$factory();
|
|
95
95
|
return this_0.r2();
|
|
96
96
|
}
|
|
97
97
|
function occurrenceCheck($this, variable, term) {
|
|
98
98
|
var tmp;
|
|
99
99
|
if (term.mx()) {
|
|
100
|
-
tmp = $this.
|
|
100
|
+
tmp = $this.i1j(variable, term);
|
|
101
101
|
} else if (term.ww()) {
|
|
102
102
|
var tmp$ret$1;
|
|
103
103
|
$l$block: {
|
|
@@ -121,7 +121,7 @@
|
|
|
121
121
|
}
|
|
122
122
|
function equationsFor($this, term1, term2) {
|
|
123
123
|
var tmp = Companion_instance_0;
|
|
124
|
-
return tmp.
|
|
124
|
+
return tmp.j1j(term1, term2, AbstractUnificator$checkTermsEquality$ref($this));
|
|
125
125
|
}
|
|
126
126
|
function equationsFor_0($this, substitution1, substitution2) {
|
|
127
127
|
var tmp = Companion_instance_0;
|
|
@@ -156,26 +156,26 @@
|
|
|
156
156
|
var eqIterator = equations.z1();
|
|
157
157
|
while (eqIterator.s()) {
|
|
158
158
|
var eq = eqIterator.u();
|
|
159
|
-
if (eq.
|
|
159
|
+
if (eq.o1j()) {
|
|
160
160
|
return Companion_getInstance().failed();
|
|
161
|
-
} else if (eq.
|
|
161
|
+
} else if (eq.p1j()) {
|
|
162
162
|
eqIterator.t();
|
|
163
163
|
changed = true;
|
|
164
|
-
} else if (eq.
|
|
165
|
-
var assignment = eq.
|
|
166
|
-
if (occurCheckEnabled ? occurrenceCheck($this, assignment.
|
|
164
|
+
} else if (eq.w1j()) {
|
|
165
|
+
var assignment = eq.r1j();
|
|
166
|
+
if (occurCheckEnabled ? occurrenceCheck($this, assignment.u1j_1, eq.n1j()) : false) {
|
|
167
167
|
return Companion_getInstance().failed();
|
|
168
168
|
} else {
|
|
169
169
|
changed = changed ? true : applySubstitutionToEquations($this, assignment.toSubstitution(), equations, eqIterator.n1());
|
|
170
170
|
}
|
|
171
|
-
} else if (eq.
|
|
171
|
+
} else if (eq.q1j()) {
|
|
172
172
|
eqIterator.t();
|
|
173
|
-
var tmp0_iterator = equationsFor($this, eq.
|
|
173
|
+
var tmp0_iterator = equationsFor($this, eq.m1j(), eq.n1j()).r();
|
|
174
174
|
insertion: while (tmp0_iterator.s()) {
|
|
175
175
|
var it = tmp0_iterator.u();
|
|
176
|
-
if (it.
|
|
176
|
+
if (it.p1j())
|
|
177
177
|
continue insertion;
|
|
178
|
-
else if (it.
|
|
178
|
+
else if (it.o1j())
|
|
179
179
|
return Companion_getInstance().failed();
|
|
180
180
|
else {
|
|
181
181
|
eqIterator.q1(it);
|
|
@@ -192,7 +192,7 @@
|
|
|
192
192
|
while (tmp0_iterator_0.s()) {
|
|
193
193
|
var element = tmp0_iterator_0.u();
|
|
194
194
|
// Inline function 'it.unibo.tuprolog.unify.AbstractUnificator.mgu.<anonymous>' call
|
|
195
|
-
if (element.
|
|
195
|
+
if (element.w1j()) {
|
|
196
196
|
destination.o(element);
|
|
197
197
|
}
|
|
198
198
|
}
|
|
@@ -204,15 +204,15 @@
|
|
|
204
204
|
return toCollection(items, tmp$ret$0);
|
|
205
205
|
}
|
|
206
206
|
function applySubstitutionToEquations$handleIndex($equations, $substitution, this$0, changed, i) {
|
|
207
|
-
if ($equations.c1(i).
|
|
207
|
+
if ($equations.c1(i).o1j() ? true : $equations.c1(i).p1j())
|
|
208
208
|
return Unit_instance;
|
|
209
209
|
var currentEq = $equations.c1(i);
|
|
210
210
|
var tmp0_container = currentEq.apply($substitution).toPair();
|
|
211
211
|
var newLhs = tmp0_container.me();
|
|
212
212
|
var newRhs = tmp0_container.ne();
|
|
213
|
-
if (!currentEq.
|
|
213
|
+
if (!currentEq.m1j().equals(newLhs) ? true : !currentEq.n1j().equals(newRhs)) {
|
|
214
214
|
var tmp = Companion_instance_0;
|
|
215
|
-
$equations.m(i, tmp.
|
|
215
|
+
$equations.m(i, tmp.x1j(newLhs, newRhs, AbstractUnificator$checkTermsEquality$ref_0(this$0)));
|
|
216
216
|
changed._v = true;
|
|
217
217
|
}
|
|
218
218
|
}
|
|
@@ -223,7 +223,7 @@
|
|
|
223
223
|
}
|
|
224
224
|
function AbstractUnificator$checkTermsEquality$ref($boundThis) {
|
|
225
225
|
var l = function (p0, p1) {
|
|
226
|
-
return $boundThis.
|
|
226
|
+
return $boundThis.i1j(p0, p1);
|
|
227
227
|
};
|
|
228
228
|
l.callableName = 'checkTermsEquality';
|
|
229
229
|
return l;
|
|
@@ -234,27 +234,27 @@
|
|
|
234
234
|
}
|
|
235
235
|
function AbstractUnificator$checkTermsEquality$ref_0($boundThis) {
|
|
236
236
|
var l = function (p0, p1) {
|
|
237
|
-
return $boundThis.
|
|
237
|
+
return $boundThis.i1j(p0, p1);
|
|
238
238
|
};
|
|
239
239
|
l.callableName = 'checkTermsEquality';
|
|
240
240
|
return l;
|
|
241
241
|
}
|
|
242
242
|
function AbstractUnificator(context) {
|
|
243
243
|
context = context === VOID ? Companion_getInstance().empty() : context;
|
|
244
|
-
this.
|
|
244
|
+
this.g1j_1 = context;
|
|
245
245
|
var tmp = this;
|
|
246
|
-
tmp.
|
|
246
|
+
tmp.h1j_1 = lazy(AbstractUnificator$contextEquations$delegate$lambda(this));
|
|
247
247
|
}
|
|
248
248
|
protoOf(AbstractUnificator).uc = function () {
|
|
249
|
-
return this.
|
|
249
|
+
return this.g1j_1;
|
|
250
250
|
};
|
|
251
|
-
protoOf(AbstractUnificator).
|
|
251
|
+
protoOf(AbstractUnificator).y1j = function (term1, term2, occurCheckEnabled) {
|
|
252
252
|
if (this.uc().x12())
|
|
253
253
|
return Companion_getInstance().failed();
|
|
254
254
|
var equations = newDeque(this, plus(asSequence_0(_get_contextEquations__x0dd77(this)), equationsFor(this, term1, term2)));
|
|
255
255
|
return mgu_0(this, equations, occurCheckEnabled);
|
|
256
256
|
};
|
|
257
|
-
protoOf(AbstractUnificator).
|
|
257
|
+
protoOf(AbstractUnificator).z1j = function (substitution1, substitution2, occurCheckEnabled) {
|
|
258
258
|
if ((this.uc().x12() ? true : substitution1.x12()) ? true : substitution2.x12())
|
|
259
259
|
return Companion_getInstance().failed();
|
|
260
260
|
if (!occurCheckEnabled) {
|
|
@@ -267,7 +267,7 @@
|
|
|
267
267
|
return mgu_0(this, equations, occurCheckEnabled);
|
|
268
268
|
};
|
|
269
269
|
protoOf(AbstractUnificator).mergeWithOccurCheck = function (substitution1, substitution2, occurCheckEnabled) {
|
|
270
|
-
return this.
|
|
270
|
+
return this.z1j(substitution1, substitution2, occurCheckEnabled);
|
|
271
271
|
};
|
|
272
272
|
function contextEquations$factory() {
|
|
273
273
|
return getPropertyCallableRef('contextEquations', 1, KProperty1, function (receiver) {
|
|
@@ -275,37 +275,37 @@
|
|
|
275
275
|
}, null);
|
|
276
276
|
}
|
|
277
277
|
function CachedUnificator(decorated, cacheCapacity) {
|
|
278
|
-
this.
|
|
279
|
-
this.
|
|
278
|
+
this.a1k_1 = decorated;
|
|
279
|
+
this.b1k_1 = Companion_instance.rq(cacheCapacity);
|
|
280
280
|
}
|
|
281
|
-
protoOf(CachedUnificator).
|
|
281
|
+
protoOf(CachedUnificator).y1j = function (term1, term2, occurCheckEnabled) {
|
|
282
282
|
var mguRequest = new Triple(term1, term2, occurCheckEnabled);
|
|
283
|
-
var cached = this.
|
|
283
|
+
var cached = this.b1k_1.x2(mguRequest);
|
|
284
284
|
var tmp;
|
|
285
285
|
if (cached instanceof Some) {
|
|
286
286
|
tmp = cached.uq_1;
|
|
287
287
|
} else {
|
|
288
|
-
var mguResult = this.
|
|
289
|
-
this.
|
|
288
|
+
var mguResult = this.a1k_1.y1j(term1, term2, occurCheckEnabled);
|
|
289
|
+
this.b1k_1.sq(mguRequest, mguResult);
|
|
290
290
|
tmp = mguResult;
|
|
291
291
|
}
|
|
292
292
|
return tmp;
|
|
293
293
|
};
|
|
294
|
-
protoOf(CachedUnificator).
|
|
294
|
+
protoOf(CachedUnificator).z1j = function (substitution1, substitution2, occurCheckEnabled) {
|
|
295
295
|
var mguRequest = new Triple(substitution1, substitution2, occurCheckEnabled);
|
|
296
|
-
var cached = this.
|
|
296
|
+
var cached = this.b1k_1.x2(mguRequest);
|
|
297
297
|
var tmp;
|
|
298
298
|
if (cached instanceof Some) {
|
|
299
299
|
tmp = cached.uq_1;
|
|
300
300
|
} else {
|
|
301
|
-
var mguResult = this.
|
|
302
|
-
this.
|
|
301
|
+
var mguResult = this.a1k_1.mergeWithOccurCheck(substitution1, substitution2, occurCheckEnabled);
|
|
302
|
+
this.b1k_1.sq(mguRequest, mguResult);
|
|
303
303
|
tmp = mguResult;
|
|
304
304
|
}
|
|
305
305
|
return tmp;
|
|
306
306
|
};
|
|
307
307
|
protoOf(CachedUnificator).mergeWithOccurCheck = function (substitution1, substitution2, occurCheckEnabled) {
|
|
308
|
-
return this.
|
|
308
|
+
return this.z1j(substitution1, substitution2, occurCheckEnabled);
|
|
309
309
|
};
|
|
310
310
|
function allOfLists($this, lhs, rhs, equalityChecker) {
|
|
311
311
|
var tmp = zip(lhs.unfold(), rhs.unfold());
|
|
@@ -338,7 +338,7 @@
|
|
|
338
338
|
}
|
|
339
339
|
function Equation$Companion$from$lambda($equalityChecker) {
|
|
340
340
|
return function (it) {
|
|
341
|
-
return Companion_instance_0.
|
|
341
|
+
return Companion_instance_0.c1k(it, $equalityChecker);
|
|
342
342
|
};
|
|
343
343
|
}
|
|
344
344
|
function Term$equals$ref_2() {
|
|
@@ -366,14 +366,14 @@
|
|
|
366
366
|
return function (_name_for_destructuring_parameter_0__wldtmu) {
|
|
367
367
|
var l = _name_for_destructuring_parameter_0__wldtmu.me();
|
|
368
368
|
var r = _name_for_destructuring_parameter_0__wldtmu.ne();
|
|
369
|
-
return (l.dx() ? r.dx() : false) ? sequenceOf([Companion_instance_0.
|
|
369
|
+
return (l.dx() ? r.dx() : false) ? sequenceOf([Companion_instance_0.x1j(l.castToCons().wy(), r.castToCons().wy(), $equalityChecker)]) : (l.cx() ? r.cx() : false) ? sequenceOf([Companion_instance_0.x1j(l.castToList(), r.castToList(), $equalityChecker)]) : Companion_instance_0.j1j(l, r, $equalityChecker);
|
|
370
370
|
};
|
|
371
371
|
}
|
|
372
372
|
function Equation$Companion$allOfTuples$lambda($equalityChecker) {
|
|
373
373
|
return function (_name_for_destructuring_parameter_0__wldtmu) {
|
|
374
374
|
var l = _name_for_destructuring_parameter_0__wldtmu.me();
|
|
375
375
|
var r = _name_for_destructuring_parameter_0__wldtmu.ne();
|
|
376
|
-
return (l.bx() ? r.bx() : false) ? sequenceOf([Companion_instance_0.
|
|
376
|
+
return (l.bx() ? r.bx() : false) ? sequenceOf([Companion_instance_0.x1j(l.castToTuple().ky(), r.castToTuple().ky(), $equalityChecker)]) : Companion_instance_0.j1j(l, r, $equalityChecker);
|
|
377
377
|
};
|
|
378
378
|
}
|
|
379
379
|
function Term$equals$ref_5() {
|
|
@@ -385,29 +385,29 @@
|
|
|
385
385
|
}
|
|
386
386
|
function Equation$Companion$allOf$lambda($equalityChecker) {
|
|
387
387
|
return function (it) {
|
|
388
|
-
return Companion_instance_0.
|
|
388
|
+
return Companion_instance_0.c1k(it, $equalityChecker);
|
|
389
389
|
};
|
|
390
390
|
}
|
|
391
391
|
function Identity(lhs, rhs) {
|
|
392
392
|
Equation.call(this, lhs, rhs);
|
|
393
|
-
this.
|
|
394
|
-
this.
|
|
393
|
+
this.f1k_1 = lhs;
|
|
394
|
+
this.g1k_1 = rhs;
|
|
395
395
|
}
|
|
396
|
-
protoOf(Identity).
|
|
397
|
-
return this.
|
|
396
|
+
protoOf(Identity).m1j = function () {
|
|
397
|
+
return this.f1k_1;
|
|
398
398
|
};
|
|
399
|
-
protoOf(Identity).
|
|
400
|
-
return this.
|
|
399
|
+
protoOf(Identity).n1j = function () {
|
|
400
|
+
return this.g1k_1;
|
|
401
401
|
};
|
|
402
|
-
protoOf(Identity).
|
|
402
|
+
protoOf(Identity).p1j = function () {
|
|
403
403
|
return true;
|
|
404
404
|
};
|
|
405
405
|
protoOf(Identity).toString = function () {
|
|
406
|
-
return 'Identity(lhs=' + this.
|
|
406
|
+
return 'Identity(lhs=' + this.f1k_1 + ', rhs=' + this.g1k_1 + ')';
|
|
407
407
|
};
|
|
408
408
|
protoOf(Identity).hashCode = function () {
|
|
409
|
-
var result = this.
|
|
410
|
-
result = imul(result, 31) + this.
|
|
409
|
+
var result = this.f1k_1.hashCode();
|
|
410
|
+
result = imul(result, 31) + this.g1k_1.hashCode() | 0;
|
|
411
411
|
return result;
|
|
412
412
|
};
|
|
413
413
|
protoOf(Identity).equals = function (other) {
|
|
@@ -416,44 +416,44 @@
|
|
|
416
416
|
if (!(other instanceof Identity))
|
|
417
417
|
return false;
|
|
418
418
|
var tmp0_other_with_cast = other instanceof Identity ? other : THROW_CCE();
|
|
419
|
-
if (!this.
|
|
419
|
+
if (!this.f1k_1.equals(tmp0_other_with_cast.f1k_1))
|
|
420
420
|
return false;
|
|
421
|
-
if (!this.
|
|
421
|
+
if (!this.g1k_1.equals(tmp0_other_with_cast.g1k_1))
|
|
422
422
|
return false;
|
|
423
423
|
return true;
|
|
424
424
|
};
|
|
425
425
|
function Assignment(lhs, rhs) {
|
|
426
426
|
Equation.call(this, lhs, rhs);
|
|
427
|
-
this.
|
|
428
|
-
this.
|
|
427
|
+
this.u1j_1 = lhs;
|
|
428
|
+
this.v1j_1 = rhs;
|
|
429
429
|
}
|
|
430
|
-
protoOf(Assignment).
|
|
431
|
-
return this.
|
|
430
|
+
protoOf(Assignment).m1j = function () {
|
|
431
|
+
return this.u1j_1;
|
|
432
432
|
};
|
|
433
|
-
protoOf(Assignment).
|
|
434
|
-
return this.
|
|
433
|
+
protoOf(Assignment).n1j = function () {
|
|
434
|
+
return this.v1j_1;
|
|
435
435
|
};
|
|
436
436
|
protoOf(Assignment).toSubstitution = function () {
|
|
437
|
-
return Companion_getInstance().unifier(this.
|
|
437
|
+
return Companion_getInstance().unifier(this.u1j_1, this.v1j_1);
|
|
438
438
|
};
|
|
439
|
-
protoOf(Assignment).
|
|
440
|
-
return to(this.
|
|
439
|
+
protoOf(Assignment).j1k = function () {
|
|
440
|
+
return to(this.u1j_1, this.v1j_1);
|
|
441
441
|
};
|
|
442
442
|
protoOf(Assignment).toPair = function () {
|
|
443
|
-
return this.
|
|
443
|
+
return this.j1k();
|
|
444
444
|
};
|
|
445
|
-
protoOf(Assignment).
|
|
445
|
+
protoOf(Assignment).w1j = function () {
|
|
446
446
|
return true;
|
|
447
447
|
};
|
|
448
|
-
protoOf(Assignment).
|
|
448
|
+
protoOf(Assignment).h1k = function () {
|
|
449
449
|
return this;
|
|
450
450
|
};
|
|
451
451
|
protoOf(Assignment).toString = function () {
|
|
452
|
-
return 'Assignment(lhs=' + this.
|
|
452
|
+
return 'Assignment(lhs=' + this.u1j_1 + ', rhs=' + this.v1j_1 + ')';
|
|
453
453
|
};
|
|
454
454
|
protoOf(Assignment).hashCode = function () {
|
|
455
|
-
var result = this.
|
|
456
|
-
result = imul(result, 31) + this.
|
|
455
|
+
var result = this.u1j_1.hashCode();
|
|
456
|
+
result = imul(result, 31) + this.v1j_1.hashCode() | 0;
|
|
457
457
|
return result;
|
|
458
458
|
};
|
|
459
459
|
protoOf(Assignment).equals = function (other) {
|
|
@@ -462,32 +462,32 @@
|
|
|
462
462
|
if (!(other instanceof Assignment))
|
|
463
463
|
return false;
|
|
464
464
|
var tmp0_other_with_cast = other instanceof Assignment ? other : THROW_CCE();
|
|
465
|
-
if (!this.
|
|
465
|
+
if (!this.u1j_1.equals(tmp0_other_with_cast.u1j_1))
|
|
466
466
|
return false;
|
|
467
|
-
if (!this.
|
|
467
|
+
if (!this.v1j_1.equals(tmp0_other_with_cast.v1j_1))
|
|
468
468
|
return false;
|
|
469
469
|
return true;
|
|
470
470
|
};
|
|
471
471
|
function Comparison(lhs, rhs) {
|
|
472
472
|
Equation.call(this, lhs, rhs);
|
|
473
|
-
this.
|
|
474
|
-
this.
|
|
473
|
+
this.m1k_1 = lhs;
|
|
474
|
+
this.n1k_1 = rhs;
|
|
475
475
|
}
|
|
476
|
-
protoOf(Comparison).
|
|
477
|
-
return this.
|
|
476
|
+
protoOf(Comparison).m1j = function () {
|
|
477
|
+
return this.m1k_1;
|
|
478
478
|
};
|
|
479
|
-
protoOf(Comparison).
|
|
480
|
-
return this.
|
|
479
|
+
protoOf(Comparison).n1j = function () {
|
|
480
|
+
return this.n1k_1;
|
|
481
481
|
};
|
|
482
|
-
protoOf(Comparison).
|
|
482
|
+
protoOf(Comparison).q1j = function () {
|
|
483
483
|
return true;
|
|
484
484
|
};
|
|
485
485
|
protoOf(Comparison).toString = function () {
|
|
486
|
-
return 'Comparison(lhs=' + this.
|
|
486
|
+
return 'Comparison(lhs=' + this.m1k_1 + ', rhs=' + this.n1k_1 + ')';
|
|
487
487
|
};
|
|
488
488
|
protoOf(Comparison).hashCode = function () {
|
|
489
|
-
var result = this.
|
|
490
|
-
result = imul(result, 31) + this.
|
|
489
|
+
var result = this.m1k_1.hashCode();
|
|
490
|
+
result = imul(result, 31) + this.n1k_1.hashCode() | 0;
|
|
491
491
|
return result;
|
|
492
492
|
};
|
|
493
493
|
protoOf(Comparison).equals = function (other) {
|
|
@@ -496,32 +496,32 @@
|
|
|
496
496
|
if (!(other instanceof Comparison))
|
|
497
497
|
return false;
|
|
498
498
|
var tmp0_other_with_cast = other instanceof Comparison ? other : THROW_CCE();
|
|
499
|
-
if (!this.
|
|
499
|
+
if (!this.m1k_1.equals(tmp0_other_with_cast.m1k_1))
|
|
500
500
|
return false;
|
|
501
|
-
if (!this.
|
|
501
|
+
if (!this.n1k_1.equals(tmp0_other_with_cast.n1k_1))
|
|
502
502
|
return false;
|
|
503
503
|
return true;
|
|
504
504
|
};
|
|
505
505
|
function Contradiction(lhs, rhs) {
|
|
506
506
|
Equation.call(this, lhs, rhs);
|
|
507
|
-
this.
|
|
508
|
-
this.
|
|
507
|
+
this.q1k_1 = lhs;
|
|
508
|
+
this.r1k_1 = rhs;
|
|
509
509
|
}
|
|
510
|
-
protoOf(Contradiction).
|
|
511
|
-
return this.
|
|
510
|
+
protoOf(Contradiction).m1j = function () {
|
|
511
|
+
return this.q1k_1;
|
|
512
512
|
};
|
|
513
|
-
protoOf(Contradiction).
|
|
514
|
-
return this.
|
|
513
|
+
protoOf(Contradiction).n1j = function () {
|
|
514
|
+
return this.r1k_1;
|
|
515
515
|
};
|
|
516
|
-
protoOf(Contradiction).
|
|
516
|
+
protoOf(Contradiction).o1j = function () {
|
|
517
517
|
return true;
|
|
518
518
|
};
|
|
519
519
|
protoOf(Contradiction).toString = function () {
|
|
520
|
-
return 'Contradiction(lhs=' + this.
|
|
520
|
+
return 'Contradiction(lhs=' + this.q1k_1 + ', rhs=' + this.r1k_1 + ')';
|
|
521
521
|
};
|
|
522
522
|
protoOf(Contradiction).hashCode = function () {
|
|
523
|
-
var result = this.
|
|
524
|
-
result = imul(result, 31) + this.
|
|
523
|
+
var result = this.q1k_1.hashCode();
|
|
524
|
+
result = imul(result, 31) + this.r1k_1.hashCode() | 0;
|
|
525
525
|
return result;
|
|
526
526
|
};
|
|
527
527
|
protoOf(Contradiction).equals = function (other) {
|
|
@@ -530,15 +530,15 @@
|
|
|
530
530
|
if (!(other instanceof Contradiction))
|
|
531
531
|
return false;
|
|
532
532
|
var tmp0_other_with_cast = other instanceof Contradiction ? other : THROW_CCE();
|
|
533
|
-
if (!this.
|
|
533
|
+
if (!this.q1k_1.equals(tmp0_other_with_cast.q1k_1))
|
|
534
534
|
return false;
|
|
535
|
-
if (!this.
|
|
535
|
+
if (!this.r1k_1.equals(tmp0_other_with_cast.r1k_1))
|
|
536
536
|
return false;
|
|
537
537
|
return true;
|
|
538
538
|
};
|
|
539
539
|
function Companion() {
|
|
540
540
|
}
|
|
541
|
-
protoOf(Companion).
|
|
541
|
+
protoOf(Companion).x1j = function (lhs, rhs, equalityChecker) {
|
|
542
542
|
var tmp;
|
|
543
543
|
if (lhs.mx() ? rhs.mx() : false) {
|
|
544
544
|
var tmp_0;
|
|
@@ -585,10 +585,10 @@
|
|
|
585
585
|
tmp = equalityChecker;
|
|
586
586
|
}
|
|
587
587
|
equalityChecker = tmp;
|
|
588
|
-
return $super === VOID ? this.
|
|
588
|
+
return $super === VOID ? this.x1j(lhs, rhs, equalityChecker) : $super.x1j.call(this, lhs, rhs, equalityChecker);
|
|
589
589
|
};
|
|
590
|
-
protoOf(Companion).
|
|
591
|
-
return this.
|
|
590
|
+
protoOf(Companion).s1k = function (pair, equalityChecker) {
|
|
591
|
+
return this.x1j(pair.ye_1, pair.ze_1, equalityChecker);
|
|
592
592
|
};
|
|
593
593
|
protoOf(Companion).ofPair = function (pair, equalityChecker, $super) {
|
|
594
594
|
var tmp;
|
|
@@ -598,9 +598,9 @@
|
|
|
598
598
|
tmp = equalityChecker;
|
|
599
599
|
}
|
|
600
600
|
equalityChecker = tmp;
|
|
601
|
-
return $super === VOID ? this.
|
|
601
|
+
return $super === VOID ? this.s1k(pair, equalityChecker) : $super.s1k.call(this, pair, equalityChecker);
|
|
602
602
|
};
|
|
603
|
-
protoOf(Companion).
|
|
603
|
+
protoOf(Companion).t1k = function (pairs, equalityChecker) {
|
|
604
604
|
return flatMap(pairs, Equation$Companion$from$lambda(equalityChecker));
|
|
605
605
|
};
|
|
606
606
|
protoOf(Companion).fromSequence = function (pairs, equalityChecker, $super) {
|
|
@@ -611,10 +611,10 @@
|
|
|
611
611
|
tmp = equalityChecker;
|
|
612
612
|
}
|
|
613
613
|
equalityChecker = tmp;
|
|
614
|
-
return $super === VOID ? this.
|
|
614
|
+
return $super === VOID ? this.t1k(pairs, equalityChecker) : $super.t1k.call(this, pairs, equalityChecker);
|
|
615
615
|
};
|
|
616
|
-
protoOf(Companion).
|
|
617
|
-
return this.
|
|
616
|
+
protoOf(Companion).u1k = function (pairs, equalityChecker) {
|
|
617
|
+
return this.t1k(asSequence_0(pairs), equalityChecker);
|
|
618
618
|
};
|
|
619
619
|
protoOf(Companion).fromIterable = function (pairs, equalityChecker, $super) {
|
|
620
620
|
var tmp;
|
|
@@ -624,10 +624,10 @@
|
|
|
624
624
|
tmp = equalityChecker;
|
|
625
625
|
}
|
|
626
626
|
equalityChecker = tmp;
|
|
627
|
-
return $super === VOID ? this.
|
|
627
|
+
return $super === VOID ? this.u1k(pairs, equalityChecker) : $super.u1k.call(this, pairs, equalityChecker);
|
|
628
628
|
};
|
|
629
|
-
protoOf(Companion).
|
|
630
|
-
return this.
|
|
629
|
+
protoOf(Companion).v1k = function (pairs, equalityChecker) {
|
|
630
|
+
return this.t1k(sequenceOf(pairs.slice()), equalityChecker);
|
|
631
631
|
};
|
|
632
632
|
protoOf(Companion).from = function (pairs, equalityChecker, $super) {
|
|
633
633
|
var tmp;
|
|
@@ -637,10 +637,10 @@
|
|
|
637
637
|
tmp = equalityChecker;
|
|
638
638
|
}
|
|
639
639
|
equalityChecker = tmp;
|
|
640
|
-
return $super === VOID ? this.
|
|
640
|
+
return $super === VOID ? this.v1k(pairs, equalityChecker) : $super.v1k.call(this, pairs, equalityChecker);
|
|
641
641
|
};
|
|
642
|
-
protoOf(Companion).
|
|
643
|
-
return this.
|
|
642
|
+
protoOf(Companion).c1k = function (pair, equalityChecker) {
|
|
643
|
+
return this.j1j(pair.ye_1, pair.ze_1, equalityChecker);
|
|
644
644
|
};
|
|
645
645
|
protoOf(Companion).allOfPair = function (pair, equalityChecker, $super) {
|
|
646
646
|
var tmp;
|
|
@@ -650,12 +650,12 @@
|
|
|
650
650
|
tmp = equalityChecker;
|
|
651
651
|
}
|
|
652
652
|
equalityChecker = tmp;
|
|
653
|
-
return $super === VOID ? this.
|
|
653
|
+
return $super === VOID ? this.c1k(pair, equalityChecker) : $super.c1k.call(this, pair, equalityChecker);
|
|
654
654
|
};
|
|
655
|
-
protoOf(Companion).
|
|
655
|
+
protoOf(Companion).j1j = function (lhs, rhs, equalityChecker) {
|
|
656
656
|
var tmp;
|
|
657
657
|
if (lhs.lw() ? rhs.lw() : false) {
|
|
658
|
-
tmp = sequenceOf([this.
|
|
658
|
+
tmp = sequenceOf([this.x1j(lhs, rhs, equalityChecker)]);
|
|
659
659
|
} else if (lhs.cx() ? rhs.cx() : false) {
|
|
660
660
|
tmp = allOfLists(this, lhs.castToList(), rhs.castToList(), equalityChecker);
|
|
661
661
|
} else if (lhs.bx() ? rhs.bx() : false) {
|
|
@@ -668,11 +668,11 @@
|
|
|
668
668
|
var tmp_1 = zip(lhsStruct.jx(), rhsStruct.jx());
|
|
669
669
|
tmp_0 = flatMap(tmp_1, Equation$Companion$allOf$lambda(equalityChecker));
|
|
670
670
|
} else {
|
|
671
|
-
tmp_0 = sequenceOf([this.
|
|
671
|
+
tmp_0 = sequenceOf([this.x1j(lhs, rhs, equalityChecker)]);
|
|
672
672
|
}
|
|
673
673
|
tmp = tmp_0;
|
|
674
674
|
} else {
|
|
675
|
-
tmp = sequenceOf([this.
|
|
675
|
+
tmp = sequenceOf([this.x1j(lhs, rhs, equalityChecker)]);
|
|
676
676
|
}
|
|
677
677
|
return tmp;
|
|
678
678
|
};
|
|
@@ -684,7 +684,7 @@
|
|
|
684
684
|
tmp = equalityChecker;
|
|
685
685
|
}
|
|
686
686
|
equalityChecker = tmp;
|
|
687
|
-
return $super === VOID ? this.
|
|
687
|
+
return $super === VOID ? this.j1j(lhs, rhs, equalityChecker) : $super.j1j.call(this, lhs, rhs, equalityChecker);
|
|
688
688
|
};
|
|
689
689
|
var Companion_instance_0;
|
|
690
690
|
function Companion_getInstance_1() {
|
|
@@ -698,26 +698,26 @@
|
|
|
698
698
|
return l;
|
|
699
699
|
}
|
|
700
700
|
function Equation(lhs, rhs) {
|
|
701
|
-
this.
|
|
702
|
-
this.
|
|
701
|
+
this.k1j_1 = lhs;
|
|
702
|
+
this.l1j_1 = rhs;
|
|
703
703
|
}
|
|
704
|
-
protoOf(Equation).
|
|
705
|
-
return this.
|
|
704
|
+
protoOf(Equation).m1j = function () {
|
|
705
|
+
return this.k1j_1;
|
|
706
706
|
};
|
|
707
|
-
protoOf(Equation).
|
|
708
|
-
return this.
|
|
707
|
+
protoOf(Equation).n1j = function () {
|
|
708
|
+
return this.l1j_1;
|
|
709
709
|
};
|
|
710
|
-
protoOf(Equation).
|
|
710
|
+
protoOf(Equation).p1j = function () {
|
|
711
711
|
return false;
|
|
712
712
|
};
|
|
713
|
-
protoOf(Equation).
|
|
713
|
+
protoOf(Equation).w1j = function () {
|
|
714
714
|
return false;
|
|
715
715
|
};
|
|
716
|
-
protoOf(Equation).
|
|
716
|
+
protoOf(Equation).h1k = function () {
|
|
717
717
|
return null;
|
|
718
718
|
};
|
|
719
|
-
protoOf(Equation).
|
|
720
|
-
var tmp0_elvis_lhs = this.
|
|
719
|
+
protoOf(Equation).r1j = function () {
|
|
720
|
+
var tmp0_elvis_lhs = this.h1k();
|
|
721
721
|
var tmp;
|
|
722
722
|
if (tmp0_elvis_lhs == null) {
|
|
723
723
|
throw ClassCastException_init_$Create$('Cannot cast ' + this + ' to ' + getKClass(Assignment).s6());
|
|
@@ -726,26 +726,26 @@
|
|
|
726
726
|
}
|
|
727
727
|
return tmp;
|
|
728
728
|
};
|
|
729
|
-
protoOf(Equation).
|
|
729
|
+
protoOf(Equation).q1j = function () {
|
|
730
730
|
return false;
|
|
731
731
|
};
|
|
732
|
-
protoOf(Equation).
|
|
732
|
+
protoOf(Equation).o1j = function () {
|
|
733
733
|
return false;
|
|
734
734
|
};
|
|
735
|
-
protoOf(Equation).
|
|
736
|
-
return Companion_getInstance_0().of('=', [this.
|
|
735
|
+
protoOf(Equation).p1i = function () {
|
|
736
|
+
return Companion_getInstance_0().of('=', [this.m1j(), this.n1j()]);
|
|
737
737
|
};
|
|
738
738
|
protoOf(Equation).toTerm = function () {
|
|
739
|
-
return this.
|
|
739
|
+
return this.p1i();
|
|
740
740
|
};
|
|
741
741
|
protoOf(Equation).toPair = function () {
|
|
742
|
-
return new Pair(this.
|
|
742
|
+
return new Pair(this.m1j(), this.n1j());
|
|
743
743
|
};
|
|
744
744
|
protoOf(Equation).swap = function () {
|
|
745
|
-
return Companion_instance_0.of(this.
|
|
745
|
+
return Companion_instance_0.of(this.n1j(), this.m1j());
|
|
746
746
|
};
|
|
747
|
-
protoOf(Equation).
|
|
748
|
-
return Companion_instance_0.
|
|
747
|
+
protoOf(Equation).i1k = function (substitution, equalityChecker) {
|
|
748
|
+
return Companion_instance_0.x1j(this.m1j().getSubstituted(substitution, []), this.n1j().getSubstituted(substitution, []), equalityChecker);
|
|
749
749
|
};
|
|
750
750
|
protoOf(Equation).apply = function (substitution, equalityChecker, $super) {
|
|
751
751
|
var tmp;
|
|
@@ -755,7 +755,7 @@
|
|
|
755
755
|
tmp = equalityChecker;
|
|
756
756
|
}
|
|
757
757
|
equalityChecker = tmp;
|
|
758
|
-
return $super === VOID ? this.
|
|
758
|
+
return $super === VOID ? this.i1k(substitution, equalityChecker) : $super.i1k.call(this, substitution, equalityChecker);
|
|
759
759
|
};
|
|
760
760
|
function toEquations(_this__u8e3s4) {
|
|
761
761
|
// Inline function 'kotlin.collections.map' call
|
|
@@ -782,12 +782,12 @@
|
|
|
782
782
|
}
|
|
783
783
|
function toAssignmentPair(_this__u8e3s4) {
|
|
784
784
|
var tmp;
|
|
785
|
-
if (_this__u8e3s4.
|
|
786
|
-
tmp = _this__u8e3s4.
|
|
787
|
-
} else if (_this__u8e3s4.
|
|
788
|
-
tmp = to(_this__u8e3s4.
|
|
789
|
-
} else if (_this__u8e3s4.
|
|
790
|
-
tmp = to(_this__u8e3s4.
|
|
785
|
+
if (_this__u8e3s4.w1j()) {
|
|
786
|
+
tmp = _this__u8e3s4.r1j().j1k();
|
|
787
|
+
} else if (_this__u8e3s4.m1j().mx()) {
|
|
788
|
+
tmp = to(_this__u8e3s4.m1j().castToVar(), _this__u8e3s4.n1j());
|
|
789
|
+
} else if (_this__u8e3s4.n1j().mx()) {
|
|
790
|
+
tmp = to(_this__u8e3s4.n1j().castToVar(), _this__u8e3s4.m1j());
|
|
791
791
|
} else {
|
|
792
792
|
throw IllegalArgumentException_init_$Create$('Equation contains no variables: ' + _this__u8e3s4);
|
|
793
793
|
}
|
|
@@ -802,7 +802,7 @@
|
|
|
802
802
|
function Unificator$Companion$naive$1($context) {
|
|
803
803
|
AbstractUnificator.call(this, $context);
|
|
804
804
|
}
|
|
805
|
-
protoOf(Unificator$Companion$naive$1).
|
|
805
|
+
protoOf(Unificator$Companion$naive$1).i1j = function (first, second) {
|
|
806
806
|
var tmp;
|
|
807
807
|
if (first.rx() ? second.rx() : false) {
|
|
808
808
|
tmp = first.castToInteger().r2().yk(second.castToInteger().r2()) === 0;
|
|
@@ -816,32 +816,32 @@
|
|
|
816
816
|
function Unificator$Companion$strict$1($context) {
|
|
817
817
|
AbstractUnificator.call(this, $context);
|
|
818
818
|
}
|
|
819
|
-
protoOf(Unificator$Companion$strict$1).
|
|
819
|
+
protoOf(Unificator$Companion$strict$1).i1j = function (first, second) {
|
|
820
820
|
return first.equals(second);
|
|
821
821
|
};
|
|
822
822
|
function Companion_0() {
|
|
823
823
|
Companion_instance_1 = this;
|
|
824
824
|
var tmp = this;
|
|
825
|
-
tmp.
|
|
826
|
-
this.
|
|
825
|
+
tmp.a1l_1 = lazy(Unificator$Companion$default$delegate$lambda);
|
|
826
|
+
this.b1l_1 = 32;
|
|
827
827
|
}
|
|
828
|
-
protoOf(Companion_0).
|
|
828
|
+
protoOf(Companion_0).c1l = function () {
|
|
829
829
|
// Inline function 'kotlin.getValue' call
|
|
830
|
-
var this_0 = this.
|
|
830
|
+
var this_0 = this.a1l_1;
|
|
831
831
|
default$factory();
|
|
832
832
|
return this_0.r2();
|
|
833
833
|
};
|
|
834
834
|
protoOf(Companion_0).mguWith = function (_this__u8e3s4, other) {
|
|
835
|
-
return this.
|
|
835
|
+
return this.c1l().mgu(_this__u8e3s4, other);
|
|
836
836
|
};
|
|
837
837
|
protoOf(Companion_0).matches = function (_this__u8e3s4, other) {
|
|
838
|
-
return this.
|
|
838
|
+
return this.c1l().match(_this__u8e3s4, other);
|
|
839
839
|
};
|
|
840
840
|
protoOf(Companion_0).unifyWith = function (_this__u8e3s4, other) {
|
|
841
|
-
return this.
|
|
841
|
+
return this.c1l().unify(_this__u8e3s4, other);
|
|
842
842
|
};
|
|
843
843
|
protoOf(Companion_0).mergeWith = function (_this__u8e3s4, other) {
|
|
844
|
-
return this.
|
|
844
|
+
return this.c1l().merge(_this__u8e3s4, other);
|
|
845
845
|
};
|
|
846
846
|
protoOf(Companion_0).naiveWithContext = function (context) {
|
|
847
847
|
return new Unificator$Companion$naive$1(context);
|
|
@@ -855,10 +855,10 @@
|
|
|
855
855
|
protoOf(Companion_0).strict = function () {
|
|
856
856
|
return this.strictWithContext(Companion_getInstance().empty());
|
|
857
857
|
};
|
|
858
|
-
protoOf(Companion_0).
|
|
858
|
+
protoOf(Companion_0).d1l = function (other, capacity) {
|
|
859
859
|
var tmp;
|
|
860
860
|
if (other instanceof CachedUnificator) {
|
|
861
|
-
tmp = new CachedUnificator(other.
|
|
861
|
+
tmp = new CachedUnificator(other.a1k_1, capacity);
|
|
862
862
|
} else {
|
|
863
863
|
tmp = new CachedUnificator(other, capacity);
|
|
864
864
|
}
|
|
@@ -866,7 +866,7 @@
|
|
|
866
866
|
};
|
|
867
867
|
protoOf(Companion_0).cached = function (other, capacity, $super) {
|
|
868
868
|
capacity = capacity === VOID ? 32 : capacity;
|
|
869
|
-
return $super === VOID ? this.
|
|
869
|
+
return $super === VOID ? this.d1l(other, capacity) : $super.d1l.call(this, other, capacity);
|
|
870
870
|
};
|
|
871
871
|
var Companion_instance_1;
|
|
872
872
|
function Companion_getInstance_2() {
|
|
@@ -878,7 +878,7 @@
|
|
|
878
878
|
}
|
|
879
879
|
function default$factory() {
|
|
880
880
|
return getPropertyCallableRef('default', 1, KProperty1, function (receiver) {
|
|
881
|
-
return receiver.
|
|
881
|
+
return receiver.c1l();
|
|
882
882
|
}, null);
|
|
883
883
|
}
|
|
884
884
|
//region block: post-declaration
|
|
@@ -896,12 +896,12 @@
|
|
|
896
896
|
protoOf(CachedUnificator).merge = merge;
|
|
897
897
|
protoOf(Equation).br = castTo;
|
|
898
898
|
defineProp(protoOf(Equation), 'lhs', function () {
|
|
899
|
-
return this.
|
|
899
|
+
return this.m1j();
|
|
900
900
|
});
|
|
901
901
|
defineProp(protoOf(Equation), 'rhs', function () {
|
|
902
|
-
return this.
|
|
902
|
+
return this.n1j();
|
|
903
903
|
});
|
|
904
|
-
defineProp(protoOf(Companion_0), 'default', protoOf(Companion_0).
|
|
904
|
+
defineProp(protoOf(Companion_0), 'default', protoOf(Companion_0).c1l);
|
|
905
905
|
//endregion
|
|
906
906
|
//region block: init
|
|
907
907
|
Companion_instance_0 = new Companion();
|