@tuprolog/2p-full 1.3.1 → 1.4.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 +1017 -863
- package/2p-core.js.map +1 -1
- package/2p-solve-classic.js +792 -792
- package/2p-solve-plp.js +1 -1
- package/2p-solve-problog.js +894 -894
- package/2p-solve-streams.js +619 -619
- package/2p-solve.js +2658 -2658
- package/2p-solve.js.map +1 -1
- package/2p-theory.js +1204 -1204
- package/2p-theory.js.map +1 -1
- package/2p-unify.js +520 -194
- package/2p-unify.js.map +1 -1
- package/README.md +3 -3
- package/kotlin-kotlin-stdlib.js +7 -7
- package/package.json +1 -1
package/2p-theory.js
CHANGED
|
@@ -137,13 +137,13 @@
|
|
|
137
137
|
return this.addLast(clause);
|
|
138
138
|
}
|
|
139
139
|
function add_1(clause) {
|
|
140
|
-
return this.
|
|
140
|
+
return this.d1l(clause);
|
|
141
141
|
}
|
|
142
142
|
function retrieve(clause) {
|
|
143
143
|
return this.retrieveFirst(clause);
|
|
144
144
|
}
|
|
145
145
|
function retrieve_0(clause) {
|
|
146
|
-
return this.
|
|
146
|
+
return this.g1l(clause);
|
|
147
147
|
}
|
|
148
148
|
initMetadataForInterface(ClauseQueue, 'ClauseQueue');
|
|
149
149
|
initMetadataForCompanion(Companion_0);
|
|
@@ -162,7 +162,7 @@
|
|
|
162
162
|
return this.e2();
|
|
163
163
|
}
|
|
164
164
|
function plus_1(traversed) {
|
|
165
|
-
return Companion_instance_7.
|
|
165
|
+
return Companion_instance_7.h1o(this.mp(), this.v1m(), plus(this.d1o(), traversed));
|
|
166
166
|
}
|
|
167
167
|
initMetadataForInterface(IndexedClause, 'IndexedClause', VOID, VOID, [LongIndexed]);
|
|
168
168
|
initMetadataForClass(IndexedClause$Companion$wrap$1, VOID, VOID, VOID, [IndexedClause]);
|
|
@@ -190,11 +190,11 @@
|
|
|
190
190
|
return false;
|
|
191
191
|
}
|
|
192
192
|
function get_rules() {
|
|
193
|
-
var tmp = asSequence(this.
|
|
193
|
+
var tmp = asSequence(this.b1l());
|
|
194
194
|
return asIterable(filterNotNull(map(tmp, Theory$_get_rules_$lambda_c39n1s)));
|
|
195
195
|
}
|
|
196
196
|
function get_directives() {
|
|
197
|
-
var tmp = asSequence(this.
|
|
197
|
+
var tmp = asSequence(this.b1l());
|
|
198
198
|
return asIterable(filterNotNull(map(tmp, Theory$_get_directives_$lambda_zbsn17)));
|
|
199
199
|
}
|
|
200
200
|
function plus_2(clause) {
|
|
@@ -215,28 +215,28 @@
|
|
|
215
215
|
initMetadataForInterface(Theory, 'Theory', VOID, VOID, [Taggable]);
|
|
216
216
|
initMetadataForClass(AbstractTheory, 'AbstractTheory', VOID, VOID, [Theory]);
|
|
217
217
|
function emptyTheory() {
|
|
218
|
-
return this.emptyTheoryWithUnificator(this.
|
|
218
|
+
return this.emptyTheoryWithUnificator(this.r1k());
|
|
219
219
|
}
|
|
220
220
|
function theoryOfIterable(clauses) {
|
|
221
|
-
return this.theoryOfIterableWithUnificator(clauses, this.
|
|
221
|
+
return this.theoryOfIterableWithUnificator(clauses, this.r1k());
|
|
222
222
|
}
|
|
223
223
|
function theoryOf(clauses) {
|
|
224
|
-
return this.theoryOfWithUnificator(this.
|
|
224
|
+
return this.theoryOfWithUnificator(this.r1k(), clauses.slice());
|
|
225
225
|
}
|
|
226
226
|
function theoryOfSequence(clauses) {
|
|
227
|
-
return this.theoryOfSequenceWithUnificator(clauses, this.
|
|
227
|
+
return this.theoryOfSequenceWithUnificator(clauses, this.r1k());
|
|
228
228
|
}
|
|
229
229
|
function emptyMutableTheory() {
|
|
230
|
-
return this.emptyMutableTheoryWithUnificator(this.
|
|
230
|
+
return this.emptyMutableTheoryWithUnificator(this.r1k());
|
|
231
231
|
}
|
|
232
232
|
function mutableTheoryOfIterable(clauses) {
|
|
233
|
-
return this.mutableTheoryOfIterableWithUnificator(clauses, this.
|
|
233
|
+
return this.mutableTheoryOfIterableWithUnificator(clauses, this.r1k());
|
|
234
234
|
}
|
|
235
235
|
function mutableTheoryOf(clauses) {
|
|
236
|
-
return this.mutableTheoryOfWithUnificator(this.
|
|
236
|
+
return this.mutableTheoryOfWithUnificator(this.r1k(), clauses.slice());
|
|
237
237
|
}
|
|
238
238
|
function mutableTheoryOfSequence(clauses) {
|
|
239
|
-
return this.mutableTheoryOfSequenceWithUnificator(clauses, this.
|
|
239
|
+
return this.mutableTheoryOfSequenceWithUnificator(clauses, this.r1k());
|
|
240
240
|
}
|
|
241
241
|
initMetadataForInterface(TheoryFactory, 'TheoryFactory');
|
|
242
242
|
initMetadataForObject(Default, 'Default', VOID, VOID, [TheoryFactory]);
|
|
@@ -251,16 +251,16 @@
|
|
|
251
251
|
return this;
|
|
252
252
|
}
|
|
253
253
|
function assertAFact_0(struct) {
|
|
254
|
-
return this.
|
|
254
|
+
return this.w1r(Companion_instance_3.of(struct));
|
|
255
255
|
}
|
|
256
256
|
function assertZFact_0(struct) {
|
|
257
|
-
return this.
|
|
257
|
+
return this.a1s(Companion_instance_3.of(struct));
|
|
258
258
|
}
|
|
259
259
|
function retractByHead_0(head) {
|
|
260
|
-
return this.
|
|
260
|
+
return this.x1s(Companion_instance_2.of(head, [Companion_getInstance().anonymous()]));
|
|
261
261
|
}
|
|
262
262
|
function retractAllByHead_0(head) {
|
|
263
|
-
return this.
|
|
263
|
+
return this.j1l(Companion_instance_2.of(head, [Companion_getInstance().anonymous()]));
|
|
264
264
|
}
|
|
265
265
|
initMetadataForInterface(MutableTheory, 'MutableTheory', VOID, VOID, [Theory]);
|
|
266
266
|
initMetadataForClass(RetractResult, 'RetractResult');
|
|
@@ -277,39 +277,39 @@
|
|
|
277
277
|
initMetadataForClass(MutableListedTheory, 'MutableListedTheory', VOID, AbstractListedTheory, [MutableTheory]);
|
|
278
278
|
//endregion
|
|
279
279
|
function AbstractClauseCollection(rete) {
|
|
280
|
-
this.
|
|
280
|
+
this.q1k_1 = rete;
|
|
281
281
|
}
|
|
282
|
-
protoOf(AbstractClauseCollection).
|
|
283
|
-
return this.
|
|
282
|
+
protoOf(AbstractClauseCollection).r1k = function () {
|
|
283
|
+
return this.q1k_1.r1k();
|
|
284
284
|
};
|
|
285
285
|
protoOf(AbstractClauseCollection).s = function () {
|
|
286
|
-
return this.
|
|
286
|
+
return this.q1k_1.s();
|
|
287
287
|
};
|
|
288
|
-
protoOf(AbstractClauseCollection).
|
|
289
|
-
return asIterable(this.
|
|
288
|
+
protoOf(AbstractClauseCollection).t1k = function () {
|
|
289
|
+
return asIterable(this.q1k_1.u1k());
|
|
290
290
|
};
|
|
291
|
-
protoOf(AbstractClauseCollection).
|
|
292
|
-
return asIterable(this.
|
|
291
|
+
protoOf(AbstractClauseCollection).v1k = function () {
|
|
292
|
+
return asIterable(this.q1k_1.v1k());
|
|
293
293
|
};
|
|
294
294
|
protoOf(AbstractClauseCollection).h = function () {
|
|
295
|
-
return this.
|
|
295
|
+
return this.q1k_1.w1k();
|
|
296
296
|
};
|
|
297
297
|
protoOf(AbstractClauseCollection).isEmpty = function () {
|
|
298
298
|
return this.h();
|
|
299
299
|
};
|
|
300
|
-
protoOf(AbstractClauseCollection).
|
|
300
|
+
protoOf(AbstractClauseCollection).x1k = function () {
|
|
301
301
|
return !this.h();
|
|
302
302
|
};
|
|
303
303
|
protoOf(AbstractClauseCollection).isNonEmpty = function () {
|
|
304
|
-
return this.
|
|
304
|
+
return this.x1k();
|
|
305
305
|
};
|
|
306
|
-
protoOf(AbstractClauseCollection).
|
|
307
|
-
return any(this.
|
|
306
|
+
protoOf(AbstractClauseCollection).y1k = function (element) {
|
|
307
|
+
return any(this.q1k_1.z1k(element));
|
|
308
308
|
};
|
|
309
309
|
protoOf(AbstractClauseCollection).contains = function (element) {
|
|
310
|
-
return this.
|
|
310
|
+
return this.y1k(element);
|
|
311
311
|
};
|
|
312
|
-
protoOf(AbstractClauseCollection).
|
|
312
|
+
protoOf(AbstractClauseCollection).a1l = function (elements) {
|
|
313
313
|
var tmp0 = asSequence(elements);
|
|
314
314
|
var tmp$ret$0;
|
|
315
315
|
$l$block: {
|
|
@@ -317,7 +317,7 @@
|
|
|
317
317
|
var _iterator__ex2g4s = tmp0.n();
|
|
318
318
|
while (_iterator__ex2g4s.q()) {
|
|
319
319
|
var element = _iterator__ex2g4s.r();
|
|
320
|
-
if (!this.
|
|
320
|
+
if (!this.y1k(element)) {
|
|
321
321
|
tmp$ret$0 = false;
|
|
322
322
|
break $l$block;
|
|
323
323
|
}
|
|
@@ -327,10 +327,10 @@
|
|
|
327
327
|
return tmp$ret$0;
|
|
328
328
|
};
|
|
329
329
|
protoOf(AbstractClauseCollection).containsAll = function (elements) {
|
|
330
|
-
return this.
|
|
330
|
+
return this.a1l(elements);
|
|
331
331
|
};
|
|
332
332
|
protoOf(AbstractClauseCollection).n = function () {
|
|
333
|
-
return this.
|
|
333
|
+
return this.q1k_1.b1l().n();
|
|
334
334
|
};
|
|
335
335
|
protoOf(AbstractClauseCollection).toString = function () {
|
|
336
336
|
return '' + getKClassFromExpression(this).b9() + '(' + joinToString(this, ', ') + ')';
|
|
@@ -340,82 +340,82 @@
|
|
|
340
340
|
AbstractMutableReteClauseCollection.call($this);
|
|
341
341
|
return $this;
|
|
342
342
|
}
|
|
343
|
-
protoOf(AbstractMutableReteClauseCollection).
|
|
344
|
-
this.
|
|
345
|
-
return this.
|
|
343
|
+
protoOf(AbstractMutableReteClauseCollection).d1l = function (clause) {
|
|
344
|
+
this.q1k_1.e1l(clause);
|
|
345
|
+
return this.s1k();
|
|
346
346
|
};
|
|
347
347
|
protoOf(AbstractMutableReteClauseCollection).add = function (clause) {
|
|
348
|
-
return this.
|
|
348
|
+
return this.d1l(clause);
|
|
349
349
|
};
|
|
350
|
-
protoOf(AbstractMutableReteClauseCollection).
|
|
350
|
+
protoOf(AbstractMutableReteClauseCollection).f1l = function (clauses) {
|
|
351
351
|
// Inline function 'kotlin.collections.forEach' call
|
|
352
352
|
var _iterator__ex2g4s = clauses.n();
|
|
353
353
|
while (_iterator__ex2g4s.q()) {
|
|
354
354
|
var element = _iterator__ex2g4s.r();
|
|
355
|
-
this.
|
|
355
|
+
this.q1k_1.e1l(element);
|
|
356
356
|
}
|
|
357
|
-
return this.
|
|
357
|
+
return this.s1k();
|
|
358
358
|
};
|
|
359
359
|
protoOf(AbstractMutableReteClauseCollection).addAll = function (clauses) {
|
|
360
|
-
return this.
|
|
360
|
+
return this.f1l(clauses);
|
|
361
361
|
};
|
|
362
|
-
protoOf(AbstractMutableReteClauseCollection).
|
|
363
|
-
var retracted = this.
|
|
364
|
-
return none(retracted) ? new Failure(this.
|
|
362
|
+
protoOf(AbstractMutableReteClauseCollection).g1l = function (clause) {
|
|
363
|
+
var retracted = this.q1k_1.h1l(clause);
|
|
364
|
+
return none(retracted) ? new Failure(this.s1k()) : new Success(this.s1k(), toList(retracted));
|
|
365
365
|
};
|
|
366
366
|
protoOf(AbstractMutableReteClauseCollection).retrieve = function (clause) {
|
|
367
|
-
return this.
|
|
367
|
+
return this.g1l(clause);
|
|
368
368
|
};
|
|
369
|
-
protoOf(AbstractMutableReteClauseCollection).
|
|
370
|
-
var retracted = this.
|
|
371
|
-
return none(retracted) ? new Failure(this.
|
|
369
|
+
protoOf(AbstractMutableReteClauseCollection).i1l = function (clause) {
|
|
370
|
+
var retracted = this.q1k_1.j1l(clause);
|
|
371
|
+
return none(retracted) ? new Failure(this.s1k()) : new Success(this.s1k(), toList(retracted));
|
|
372
372
|
};
|
|
373
373
|
protoOf(AbstractMutableReteClauseCollection).retrieveAll = function (clause) {
|
|
374
|
-
return this.
|
|
374
|
+
return this.i1l(clause);
|
|
375
375
|
};
|
|
376
376
|
function AbstractMutableReteClauseCollection() {
|
|
377
377
|
}
|
|
378
378
|
function AbstractReteClauseCollection(rete) {
|
|
379
379
|
AbstractClauseCollection.call(this, rete);
|
|
380
380
|
}
|
|
381
|
-
protoOf(AbstractReteClauseCollection).
|
|
381
|
+
protoOf(AbstractReteClauseCollection).d1l = function (clause) {
|
|
382
382
|
// Inline function 'kotlin.apply' call
|
|
383
|
-
var this_0 = this.
|
|
384
|
-
this_0.
|
|
385
|
-
return this.
|
|
383
|
+
var this_0 = this.q1k_1.m1l();
|
|
384
|
+
this_0.e1l(TheoryUtils_instance.n1l(clause));
|
|
385
|
+
return this.l1l(this_0);
|
|
386
386
|
};
|
|
387
387
|
protoOf(AbstractReteClauseCollection).add = function (clause) {
|
|
388
|
-
return this.
|
|
388
|
+
return this.d1l(clause);
|
|
389
389
|
};
|
|
390
|
-
protoOf(AbstractReteClauseCollection).
|
|
390
|
+
protoOf(AbstractReteClauseCollection).f1l = function (clauses) {
|
|
391
391
|
// Inline function 'kotlin.apply' call
|
|
392
|
-
var this_0 = this.
|
|
392
|
+
var this_0 = this.q1k_1.m1l();
|
|
393
393
|
// Inline function 'kotlin.collections.forEach' call
|
|
394
394
|
var _iterator__ex2g4s = clauses.n();
|
|
395
395
|
while (_iterator__ex2g4s.q()) {
|
|
396
396
|
var element = _iterator__ex2g4s.r();
|
|
397
|
-
this_0.
|
|
397
|
+
this_0.e1l(TheoryUtils_instance.n1l(element));
|
|
398
398
|
}
|
|
399
|
-
return this.
|
|
399
|
+
return this.l1l(this_0);
|
|
400
400
|
};
|
|
401
401
|
protoOf(AbstractReteClauseCollection).addAll = function (clauses) {
|
|
402
|
-
return this.
|
|
402
|
+
return this.f1l(clauses);
|
|
403
403
|
};
|
|
404
|
-
protoOf(AbstractReteClauseCollection).
|
|
405
|
-
var newTheory = this.
|
|
406
|
-
var retracted = newTheory.
|
|
407
|
-
return none(retracted) ? new Failure(this.
|
|
404
|
+
protoOf(AbstractReteClauseCollection).g1l = function (clause) {
|
|
405
|
+
var newTheory = this.q1k_1.m1l();
|
|
406
|
+
var retracted = newTheory.h1l(clause);
|
|
407
|
+
return none(retracted) ? new Failure(this.s1k()) : new Success(this.l1l(newTheory), toList(retracted));
|
|
408
408
|
};
|
|
409
409
|
protoOf(AbstractReteClauseCollection).retrieve = function (clause) {
|
|
410
|
-
return this.
|
|
410
|
+
return this.g1l(clause);
|
|
411
411
|
};
|
|
412
|
-
protoOf(AbstractReteClauseCollection).
|
|
413
|
-
var newTheory = this.
|
|
414
|
-
var retracted = newTheory.
|
|
415
|
-
return none(retracted) ? new Failure(this.
|
|
412
|
+
protoOf(AbstractReteClauseCollection).i1l = function (clause) {
|
|
413
|
+
var newTheory = this.q1k_1.m1l();
|
|
414
|
+
var retracted = newTheory.j1l(clause);
|
|
415
|
+
return none(retracted) ? new Failure(this.s1k()) : new Success(this.l1l(newTheory), toList(retracted));
|
|
416
416
|
};
|
|
417
417
|
protoOf(AbstractReteClauseCollection).retrieveAll = function (clause) {
|
|
418
|
-
return this.
|
|
418
|
+
return this.i1l(clause);
|
|
419
419
|
};
|
|
420
420
|
function Companion() {
|
|
421
421
|
}
|
|
@@ -499,27 +499,27 @@
|
|
|
499
499
|
}
|
|
500
500
|
function Success(collection, clauses) {
|
|
501
501
|
RetrieveResult.call(this);
|
|
502
|
-
this.
|
|
503
|
-
this.
|
|
502
|
+
this.r1l_1 = collection;
|
|
503
|
+
this.s1l_1 = clauses;
|
|
504
504
|
}
|
|
505
|
-
protoOf(Success).
|
|
506
|
-
return this.
|
|
505
|
+
protoOf(Success).t1l = function () {
|
|
506
|
+
return this.r1l_1;
|
|
507
507
|
};
|
|
508
|
-
protoOf(Success).
|
|
509
|
-
return this.
|
|
508
|
+
protoOf(Success).b1l = function () {
|
|
509
|
+
return this.s1l_1;
|
|
510
510
|
};
|
|
511
511
|
protoOf(Success).d10 = function () {
|
|
512
512
|
return true;
|
|
513
513
|
};
|
|
514
|
-
protoOf(Success).
|
|
515
|
-
return first(this.
|
|
514
|
+
protoOf(Success).u1l = function () {
|
|
515
|
+
return first(this.s1l_1);
|
|
516
516
|
};
|
|
517
517
|
protoOf(Success).toString = function () {
|
|
518
|
-
return 'Success(collection=' + toString(this.
|
|
518
|
+
return 'Success(collection=' + toString(this.r1l_1) + ', clauses=' + toString(this.s1l_1) + ')';
|
|
519
519
|
};
|
|
520
520
|
protoOf(Success).hashCode = function () {
|
|
521
|
-
var result = hashCode(this.
|
|
522
|
-
result = imul(result, 31) + hashCode(this.
|
|
521
|
+
var result = hashCode(this.r1l_1);
|
|
522
|
+
result = imul(result, 31) + hashCode(this.s1l_1) | 0;
|
|
523
523
|
return result;
|
|
524
524
|
};
|
|
525
525
|
protoOf(Success).equals = function (other) {
|
|
@@ -527,40 +527,40 @@
|
|
|
527
527
|
return true;
|
|
528
528
|
if (!(other instanceof Success))
|
|
529
529
|
return false;
|
|
530
|
-
if (!equals(this.
|
|
530
|
+
if (!equals(this.r1l_1, other.r1l_1))
|
|
531
531
|
return false;
|
|
532
|
-
if (!equals(this.
|
|
532
|
+
if (!equals(this.s1l_1, other.s1l_1))
|
|
533
533
|
return false;
|
|
534
534
|
return true;
|
|
535
535
|
};
|
|
536
536
|
function Failure(collection) {
|
|
537
537
|
RetrieveResult.call(this);
|
|
538
|
-
this.
|
|
538
|
+
this.w1l_1 = collection;
|
|
539
539
|
}
|
|
540
|
-
protoOf(Failure).
|
|
541
|
-
return this.
|
|
540
|
+
protoOf(Failure).t1l = function () {
|
|
541
|
+
return this.w1l_1;
|
|
542
542
|
};
|
|
543
|
-
protoOf(Failure).
|
|
543
|
+
protoOf(Failure).v1l = function () {
|
|
544
544
|
return true;
|
|
545
545
|
};
|
|
546
|
-
protoOf(Failure).
|
|
546
|
+
protoOf(Failure).b1l = function () {
|
|
547
547
|
return null;
|
|
548
548
|
};
|
|
549
|
-
protoOf(Failure).
|
|
549
|
+
protoOf(Failure).u1l = function () {
|
|
550
550
|
return null;
|
|
551
551
|
};
|
|
552
552
|
protoOf(Failure).toString = function () {
|
|
553
|
-
return 'Failure(collection=' + toString(this.
|
|
553
|
+
return 'Failure(collection=' + toString(this.w1l_1) + ')';
|
|
554
554
|
};
|
|
555
555
|
protoOf(Failure).hashCode = function () {
|
|
556
|
-
return hashCode(this.
|
|
556
|
+
return hashCode(this.w1l_1);
|
|
557
557
|
};
|
|
558
558
|
protoOf(Failure).equals = function (other) {
|
|
559
559
|
if (this === other)
|
|
560
560
|
return true;
|
|
561
561
|
if (!(other instanceof Failure))
|
|
562
562
|
return false;
|
|
563
|
-
if (!equals(this.
|
|
563
|
+
if (!equals(this.w1l_1, other.w1l_1))
|
|
564
564
|
return false;
|
|
565
565
|
return true;
|
|
566
566
|
};
|
|
@@ -569,12 +569,12 @@
|
|
|
569
569
|
protoOf(RetrieveResult).d10 = function () {
|
|
570
570
|
return false;
|
|
571
571
|
};
|
|
572
|
-
protoOf(RetrieveResult).
|
|
572
|
+
protoOf(RetrieveResult).v1l = function () {
|
|
573
573
|
return false;
|
|
574
574
|
};
|
|
575
575
|
function MutableReteClauseQueue_init_$Init$(unificator, clauses, $this) {
|
|
576
|
-
MutableReteClauseQueue.call($this, Companion_instance_6.
|
|
577
|
-
TheoryUtils_instance.
|
|
576
|
+
MutableReteClauseQueue.call($this, Companion_instance_6.x1l(unificator, clauses));
|
|
577
|
+
TheoryUtils_instance.y1l(clauses);
|
|
578
578
|
return $this;
|
|
579
579
|
}
|
|
580
580
|
function MutableReteClauseQueue_init_$Create$(unificator, clauses) {
|
|
@@ -584,43 +584,43 @@
|
|
|
584
584
|
AbstractMutableReteClauseCollection_init_$Init$(rete, this);
|
|
585
585
|
// Inline function 'kotlin.require' call
|
|
586
586
|
// Inline function 'kotlin.require' call
|
|
587
|
-
if (!rete.
|
|
587
|
+
if (!rete.z1l()) {
|
|
588
588
|
var message = 'Failed requirement.';
|
|
589
589
|
throw IllegalArgumentException_init_$Create$(toString(message));
|
|
590
590
|
}
|
|
591
591
|
}
|
|
592
|
-
protoOf(MutableReteClauseQueue).
|
|
593
|
-
return this.
|
|
592
|
+
protoOf(MutableReteClauseQueue).b1m = function (clause) {
|
|
593
|
+
return this.q1k_1.z1k(clause);
|
|
594
594
|
};
|
|
595
595
|
protoOf(MutableReteClauseQueue).getFifoOrdered = function (clause) {
|
|
596
|
-
return this.
|
|
596
|
+
return this.b1m(clause);
|
|
597
597
|
};
|
|
598
|
-
protoOf(MutableReteClauseQueue).
|
|
599
|
-
return asSequence(asReversed(toList(this.
|
|
598
|
+
protoOf(MutableReteClauseQueue).c1m = function (clause) {
|
|
599
|
+
return asSequence(asReversed(toList(this.b1m(clause))));
|
|
600
600
|
};
|
|
601
601
|
protoOf(MutableReteClauseQueue).getLifoOrdered = function (clause) {
|
|
602
|
-
return this.
|
|
602
|
+
return this.c1m(clause);
|
|
603
603
|
};
|
|
604
|
-
protoOf(MutableReteClauseQueue).
|
|
605
|
-
this.
|
|
604
|
+
protoOf(MutableReteClauseQueue).o1l = function (clause) {
|
|
605
|
+
this.q1k_1.d1m(clause);
|
|
606
606
|
return this;
|
|
607
607
|
};
|
|
608
608
|
protoOf(MutableReteClauseQueue).addFirst = function (clause) {
|
|
609
|
-
return this.
|
|
609
|
+
return this.o1l(clause);
|
|
610
610
|
};
|
|
611
|
-
protoOf(MutableReteClauseQueue).
|
|
612
|
-
this.
|
|
611
|
+
protoOf(MutableReteClauseQueue).p1l = function (clause) {
|
|
612
|
+
this.q1k_1.e1l(clause);
|
|
613
613
|
return this;
|
|
614
614
|
};
|
|
615
615
|
protoOf(MutableReteClauseQueue).addLast = function (clause) {
|
|
616
|
-
return this.
|
|
616
|
+
return this.p1l(clause);
|
|
617
617
|
};
|
|
618
|
-
protoOf(MutableReteClauseQueue).
|
|
619
|
-
var retracted = this.
|
|
618
|
+
protoOf(MutableReteClauseQueue).q1l = function (clause) {
|
|
619
|
+
var retracted = this.q1k_1.h1l(clause);
|
|
620
620
|
return none(retracted) ? new Failure(this) : new Success(this, toList(retracted));
|
|
621
621
|
};
|
|
622
622
|
protoOf(MutableReteClauseQueue).retrieveFirst = function (clause) {
|
|
623
|
-
return this.
|
|
623
|
+
return this.q1l(clause);
|
|
624
624
|
};
|
|
625
625
|
protoOf(MutableReteClauseQueue).equals = function (other) {
|
|
626
626
|
var tmp;
|
|
@@ -634,19 +634,19 @@
|
|
|
634
634
|
protoOf(MutableReteClauseQueue).hashCode = function () {
|
|
635
635
|
return Companion_instance_5.computeHashCode(this);
|
|
636
636
|
};
|
|
637
|
-
protoOf(MutableReteClauseQueue).
|
|
637
|
+
protoOf(MutableReteClauseQueue).s1k = function () {
|
|
638
638
|
return this;
|
|
639
639
|
};
|
|
640
640
|
function _get_hashCodeCache__ny3r0q($this) {
|
|
641
|
-
var tmp0 = $this.
|
|
641
|
+
var tmp0 = $this.f1m_1;
|
|
642
642
|
var tmp = KProperty1;
|
|
643
643
|
// Inline function 'kotlin.getValue' call
|
|
644
644
|
getPropertyCallableRef('hashCodeCache', 1, tmp, ReteClauseQueue$_get_hashCodeCache_$ref_rnll9p(), null);
|
|
645
645
|
return tmp0.e2();
|
|
646
646
|
}
|
|
647
647
|
function ReteClauseQueue_init_$Init$(unificator, clauses, $this) {
|
|
648
|
-
ReteClauseQueue.call($this, Companion_instance_6.
|
|
649
|
-
TheoryUtils_instance.
|
|
648
|
+
ReteClauseQueue.call($this, Companion_instance_6.x1l(unificator, clauses));
|
|
649
|
+
TheoryUtils_instance.y1l(clauses);
|
|
650
650
|
return $this;
|
|
651
651
|
}
|
|
652
652
|
function ReteClauseQueue_init_$Create$(unificator, clauses) {
|
|
@@ -665,63 +665,63 @@
|
|
|
665
665
|
function ReteClauseQueue(rete) {
|
|
666
666
|
AbstractReteClauseCollection.call(this, rete);
|
|
667
667
|
var tmp = this;
|
|
668
|
-
tmp.
|
|
668
|
+
tmp.f1m_1 = lazy(ReteClauseQueue$hashCodeCache$delegate$lambda(this));
|
|
669
669
|
// Inline function 'kotlin.require' call
|
|
670
670
|
// Inline function 'kotlin.require' call
|
|
671
|
-
if (!rete.
|
|
671
|
+
if (!rete.z1l()) {
|
|
672
672
|
var message = 'Failed requirement.';
|
|
673
673
|
throw IllegalArgumentException_init_$Create$(toString(message));
|
|
674
674
|
}
|
|
675
675
|
}
|
|
676
|
-
protoOf(ReteClauseQueue).
|
|
676
|
+
protoOf(ReteClauseQueue).o1l = function (clause) {
|
|
677
677
|
// Inline function 'kotlin.apply' call
|
|
678
|
-
var this_0 = this.
|
|
679
|
-
this_0.
|
|
678
|
+
var this_0 = this.q1k_1.m1l();
|
|
679
|
+
this_0.d1m(TheoryUtils_instance.n1l(clause));
|
|
680
680
|
return new ReteClauseQueue(this_0);
|
|
681
681
|
};
|
|
682
682
|
protoOf(ReteClauseQueue).addFirst = function (clause) {
|
|
683
|
-
return this.
|
|
683
|
+
return this.o1l(clause);
|
|
684
684
|
};
|
|
685
|
-
protoOf(ReteClauseQueue).
|
|
685
|
+
protoOf(ReteClauseQueue).p1l = function (clause) {
|
|
686
686
|
// Inline function 'kotlin.apply' call
|
|
687
|
-
var this_0 = this.
|
|
688
|
-
this_0.
|
|
687
|
+
var this_0 = this.q1k_1.m1l();
|
|
688
|
+
this_0.e1l(TheoryUtils_instance.n1l(clause));
|
|
689
689
|
return new ReteClauseQueue(this_0);
|
|
690
690
|
};
|
|
691
691
|
protoOf(ReteClauseQueue).addLast = function (clause) {
|
|
692
|
-
return this.
|
|
692
|
+
return this.p1l(clause);
|
|
693
693
|
};
|
|
694
|
-
protoOf(ReteClauseQueue).
|
|
695
|
-
return this.
|
|
694
|
+
protoOf(ReteClauseQueue).b1m = function (clause) {
|
|
695
|
+
return this.q1k_1.z1k(clause);
|
|
696
696
|
};
|
|
697
697
|
protoOf(ReteClauseQueue).getFifoOrdered = function (clause) {
|
|
698
|
-
return this.
|
|
698
|
+
return this.b1m(clause);
|
|
699
699
|
};
|
|
700
|
-
protoOf(ReteClauseQueue).
|
|
701
|
-
return asSequence(asReversed(toList(this.
|
|
700
|
+
protoOf(ReteClauseQueue).c1m = function (clause) {
|
|
701
|
+
return asSequence(asReversed(toList(this.b1m(clause))));
|
|
702
702
|
};
|
|
703
703
|
protoOf(ReteClauseQueue).getLifoOrdered = function (clause) {
|
|
704
|
-
return this.
|
|
704
|
+
return this.c1m(clause);
|
|
705
705
|
};
|
|
706
|
-
protoOf(ReteClauseQueue).
|
|
707
|
-
return this.
|
|
706
|
+
protoOf(ReteClauseQueue).d1l = function (clause) {
|
|
707
|
+
return this.p1l(clause);
|
|
708
708
|
};
|
|
709
709
|
protoOf(ReteClauseQueue).add = function (clause) {
|
|
710
|
-
return this.
|
|
710
|
+
return this.d1l(clause);
|
|
711
711
|
};
|
|
712
|
-
protoOf(ReteClauseQueue).
|
|
713
|
-
return protoOf(AbstractReteClauseCollection).
|
|
712
|
+
protoOf(ReteClauseQueue).g1l = function (clause) {
|
|
713
|
+
return protoOf(AbstractReteClauseCollection).g1l.call(this, clause);
|
|
714
714
|
};
|
|
715
715
|
protoOf(ReteClauseQueue).retrieve = function (clause) {
|
|
716
|
-
return this.
|
|
716
|
+
return this.g1l(clause);
|
|
717
717
|
};
|
|
718
|
-
protoOf(ReteClauseQueue).
|
|
719
|
-
return protoOf(AbstractReteClauseCollection).
|
|
718
|
+
protoOf(ReteClauseQueue).q1l = function (clause) {
|
|
719
|
+
return protoOf(AbstractReteClauseCollection).g1l.call(this, clause);
|
|
720
720
|
};
|
|
721
721
|
protoOf(ReteClauseQueue).retrieveFirst = function (clause) {
|
|
722
|
-
return this.
|
|
722
|
+
return this.q1l(clause);
|
|
723
723
|
};
|
|
724
|
-
protoOf(ReteClauseQueue).
|
|
724
|
+
protoOf(ReteClauseQueue).l1l = function (rete) {
|
|
725
725
|
return new ReteClauseQueue(rete);
|
|
726
726
|
};
|
|
727
727
|
protoOf(ReteClauseQueue).equals = function (other) {
|
|
@@ -742,13 +742,13 @@
|
|
|
742
742
|
protoOf(ReteClauseQueue).hashCode = function () {
|
|
743
743
|
return _get_hashCodeCache__ny3r0q(this);
|
|
744
744
|
};
|
|
745
|
-
protoOf(ReteClauseQueue).
|
|
745
|
+
protoOf(ReteClauseQueue).s1k = function () {
|
|
746
746
|
return this;
|
|
747
747
|
};
|
|
748
748
|
function AbstractReteNode$removeAllLazily$slambda($source, this$0, $clause, resultContinuation) {
|
|
749
|
-
this.
|
|
750
|
-
this.
|
|
751
|
-
this.
|
|
749
|
+
this.o1m_1 = $source;
|
|
750
|
+
this.p1m_1 = this$0;
|
|
751
|
+
this.q1m_1 = $clause;
|
|
752
752
|
CoroutineImpl.call(this, resultContinuation);
|
|
753
753
|
}
|
|
754
754
|
protoOf(AbstractReteNode$removeAllLazily$slambda).bq = function ($this$sequence, $completion) {
|
|
@@ -768,21 +768,21 @@
|
|
|
768
768
|
switch (tmp) {
|
|
769
769
|
case 0:
|
|
770
770
|
this.c8_1 = 5;
|
|
771
|
-
this.
|
|
771
|
+
this.s1m_1 = this.o1m_1.n();
|
|
772
772
|
this.b8_1 = 1;
|
|
773
773
|
continue $sm;
|
|
774
774
|
case 1:
|
|
775
|
-
if (!this.
|
|
775
|
+
if (!this.s1m_1.q()) {
|
|
776
776
|
this.b8_1 = 4;
|
|
777
777
|
continue $sm;
|
|
778
778
|
}
|
|
779
779
|
|
|
780
|
-
var it = this.
|
|
781
|
-
if (this.
|
|
782
|
-
it.
|
|
783
|
-
this.
|
|
780
|
+
var it = this.s1m_1.r();
|
|
781
|
+
if (this.p1m_1.r1k().match(this.q1m_1, it.v1m())) {
|
|
782
|
+
it.t1m();
|
|
783
|
+
this.s1m_1.b3();
|
|
784
784
|
this.b8_1 = 2;
|
|
785
|
-
suspendResult = this.
|
|
785
|
+
suspendResult = this.r1m_1.bd(it, this);
|
|
786
786
|
if (suspendResult === get_COROUTINE_SUSPENDED()) {
|
|
787
787
|
return suspendResult;
|
|
788
788
|
}
|
|
@@ -815,8 +815,8 @@
|
|
|
815
815
|
while (true);
|
|
816
816
|
};
|
|
817
817
|
protoOf(AbstractReteNode$removeAllLazily$slambda).cq = function ($this$sequence, completion) {
|
|
818
|
-
var i = new AbstractReteNode$removeAllLazily$slambda(this.
|
|
819
|
-
i.
|
|
818
|
+
var i = new AbstractReteNode$removeAllLazily$slambda(this.o1m_1, this.p1m_1, this.q1m_1, completion);
|
|
819
|
+
i.r1m_1 = $this$sequence;
|
|
820
820
|
return i;
|
|
821
821
|
};
|
|
822
822
|
function AbstractReteNode$removeAllLazily$slambda_0($source, this$0, $clause, resultContinuation) {
|
|
@@ -826,29 +826,29 @@
|
|
|
826
826
|
}, 1);
|
|
827
827
|
}
|
|
828
828
|
function AbstractReteNode(unificator) {
|
|
829
|
-
this.
|
|
829
|
+
this.u1m_1 = unificator;
|
|
830
830
|
}
|
|
831
|
-
protoOf(AbstractReteNode).
|
|
832
|
-
return this.
|
|
831
|
+
protoOf(AbstractReteNode).r1k = function () {
|
|
832
|
+
return this.u1m_1;
|
|
833
833
|
};
|
|
834
|
-
protoOf(AbstractReteNode).
|
|
834
|
+
protoOf(AbstractReteNode).w1m = function (source, clause) {
|
|
835
835
|
return sequence(AbstractReteNode$removeAllLazily$slambda_0(source, this, clause, null));
|
|
836
836
|
};
|
|
837
837
|
function ReteNode$assertA$ref() {
|
|
838
838
|
return constructCallableReference(function (p0, p1) {
|
|
839
|
-
p0.
|
|
839
|
+
p0.x1m(p1);
|
|
840
840
|
return Unit_instance;
|
|
841
841
|
}, 2, 0, 30, 'assertA');
|
|
842
842
|
}
|
|
843
843
|
function ReteNode$assertZ$ref() {
|
|
844
844
|
return constructCallableReference(function (p0, p1) {
|
|
845
|
-
p0.
|
|
845
|
+
p0.y1m(p1);
|
|
846
846
|
return Unit_instance;
|
|
847
847
|
}, 2, 0, 31, 'assertZ');
|
|
848
848
|
}
|
|
849
849
|
function Companion_1() {
|
|
850
850
|
}
|
|
851
|
-
protoOf(Companion_1).
|
|
851
|
+
protoOf(Companion_1).x1l = function (unificator, clauses) {
|
|
852
852
|
return new RootNode(unificator, clauses, true);
|
|
853
853
|
};
|
|
854
854
|
var Companion_instance_6;
|
|
@@ -859,17 +859,17 @@
|
|
|
859
859
|
return sequence(Utils$firstArguments$slambda_0($receiver, null));
|
|
860
860
|
}
|
|
861
861
|
function Utils$firstArguments$slambda($this_firstArguments, resultContinuation) {
|
|
862
|
-
this.
|
|
862
|
+
this.j1n_1 = $this_firstArguments;
|
|
863
863
|
CoroutineImpl.call(this, resultContinuation);
|
|
864
864
|
}
|
|
865
|
-
protoOf(Utils$firstArguments$slambda).
|
|
866
|
-
var tmp = this.
|
|
865
|
+
protoOf(Utils$firstArguments$slambda).m1n = function ($this$sequence, $completion) {
|
|
866
|
+
var tmp = this.n1n($this$sequence, $completion);
|
|
867
867
|
tmp.d8_1 = Unit_instance;
|
|
868
868
|
tmp.e8_1 = null;
|
|
869
869
|
return tmp.j8();
|
|
870
870
|
};
|
|
871
871
|
protoOf(Utils$firstArguments$slambda).a9 = function (p1, $completion) {
|
|
872
|
-
return this.
|
|
872
|
+
return this.m1n(p1 instanceof SequenceScope ? p1 : THROW_CCE(), $completion);
|
|
873
873
|
};
|
|
874
874
|
protoOf(Utils$firstArguments$slambda).j8 = function () {
|
|
875
875
|
var suspendResult = this.d8_1;
|
|
@@ -879,29 +879,29 @@
|
|
|
879
879
|
switch (tmp) {
|
|
880
880
|
case 0:
|
|
881
881
|
this.c8_1 = 5;
|
|
882
|
-
this.
|
|
882
|
+
this.l1n_1 = this.j1n_1;
|
|
883
883
|
this.b8_1 = 1;
|
|
884
884
|
continue $sm;
|
|
885
885
|
case 1:
|
|
886
|
-
if (!this.
|
|
886
|
+
if (!this.l1n_1.du()) {
|
|
887
887
|
this.b8_1 = 3;
|
|
888
888
|
continue $sm;
|
|
889
889
|
}
|
|
890
890
|
|
|
891
891
|
this.b8_1 = 2;
|
|
892
|
-
suspendResult = this.
|
|
892
|
+
suspendResult = this.k1n_1.bd(this.l1n_1, this);
|
|
893
893
|
if (suspendResult === get_COROUTINE_SUSPENDED()) {
|
|
894
894
|
return suspendResult;
|
|
895
895
|
}
|
|
896
896
|
|
|
897
897
|
continue $sm;
|
|
898
898
|
case 2:
|
|
899
|
-
this.
|
|
899
|
+
this.l1n_1 = this.l1n_1.castToStruct().getArgAt(0);
|
|
900
900
|
this.b8_1 = 1;
|
|
901
901
|
continue $sm;
|
|
902
902
|
case 3:
|
|
903
903
|
this.b8_1 = 4;
|
|
904
|
-
suspendResult = this.
|
|
904
|
+
suspendResult = this.k1n_1.bd(this.l1n_1, this);
|
|
905
905
|
if (suspendResult === get_COROUTINE_SUSPENDED()) {
|
|
906
906
|
return suspendResult;
|
|
907
907
|
}
|
|
@@ -923,58 +923,58 @@
|
|
|
923
923
|
}
|
|
924
924
|
while (true);
|
|
925
925
|
};
|
|
926
|
-
protoOf(Utils$firstArguments$slambda).
|
|
927
|
-
var i = new Utils$firstArguments$slambda(this.
|
|
928
|
-
i.
|
|
926
|
+
protoOf(Utils$firstArguments$slambda).n1n = function ($this$sequence, completion) {
|
|
927
|
+
var i = new Utils$firstArguments$slambda(this.j1n_1, completion);
|
|
928
|
+
i.k1n_1 = $this$sequence;
|
|
929
929
|
return i;
|
|
930
930
|
};
|
|
931
931
|
function Utils$firstArguments$slambda_0($this_firstArguments, resultContinuation) {
|
|
932
932
|
var i = new Utils$firstArguments$slambda($this_firstArguments, resultContinuation);
|
|
933
933
|
return constructCallableReference(function ($this$sequence, $completion) {
|
|
934
|
-
return i.
|
|
934
|
+
return i.m1n($this$sequence, $completion);
|
|
935
935
|
}, 1);
|
|
936
936
|
}
|
|
937
937
|
function Utils() {
|
|
938
938
|
}
|
|
939
|
-
protoOf(Utils).
|
|
939
|
+
protoOf(Utils).o1n = function (_this__u8e3s4, nestingLevel) {
|
|
940
940
|
// Inline function 'kotlin.let' call
|
|
941
941
|
return takeFirstAfterSkipping(firstArguments(this, _this__u8e3s4), nestingLevel).castToStruct().rt();
|
|
942
942
|
};
|
|
943
|
-
protoOf(Utils).
|
|
943
|
+
protoOf(Utils).p1n = function (_this__u8e3s4, nestingLevel) {
|
|
944
944
|
// Inline function 'kotlin.let' call
|
|
945
945
|
return takeFirstAfterSkipping(firstArguments(this, _this__u8e3s4), nestingLevel).castToStruct().xt();
|
|
946
946
|
};
|
|
947
|
-
protoOf(Utils).
|
|
947
|
+
protoOf(Utils).q1n = function (_this__u8e3s4, nestingLevel) {
|
|
948
948
|
return takeFirstAfterSkipping(firstArguments(this, _this__u8e3s4), nestingLevel);
|
|
949
949
|
};
|
|
950
|
-
protoOf(Utils).
|
|
951
|
-
return this.
|
|
950
|
+
protoOf(Utils).r1n = function (args) {
|
|
951
|
+
return this.s1n(listOf(args.slice()));
|
|
952
952
|
};
|
|
953
|
-
protoOf(Utils).
|
|
954
|
-
return this.
|
|
953
|
+
protoOf(Utils).t1n = function (sequence) {
|
|
954
|
+
return this.s1n(asIterable(sequence));
|
|
955
955
|
};
|
|
956
|
-
protoOf(Utils).
|
|
956
|
+
protoOf(Utils).s1n = function (iterable) {
|
|
957
957
|
return mergeSequences(iterable, SituatedIndexedClause$compareTo$ref());
|
|
958
958
|
};
|
|
959
|
-
protoOf(Utils).
|
|
960
|
-
return this.
|
|
959
|
+
protoOf(Utils).u1n = function (args) {
|
|
960
|
+
return this.v1n(sequenceOf(args.slice()));
|
|
961
961
|
};
|
|
962
|
-
protoOf(Utils).
|
|
962
|
+
protoOf(Utils).v1n = function (sequence) {
|
|
963
963
|
return flatten(sequence);
|
|
964
964
|
};
|
|
965
|
-
protoOf(Utils).
|
|
966
|
-
return this.
|
|
965
|
+
protoOf(Utils).w1n = function (iterable) {
|
|
966
|
+
return this.v1n(asSequence(iterable));
|
|
967
967
|
};
|
|
968
|
-
protoOf(Utils).
|
|
969
|
-
return this.
|
|
968
|
+
protoOf(Utils).x1n = function (args) {
|
|
969
|
+
return this.y1n(sequenceOf(args.slice()));
|
|
970
970
|
};
|
|
971
|
-
protoOf(Utils).
|
|
971
|
+
protoOf(Utils).y1n = function (sequence) {
|
|
972
972
|
return flatten(sequence);
|
|
973
973
|
};
|
|
974
|
-
protoOf(Utils).
|
|
975
|
-
return this.
|
|
974
|
+
protoOf(Utils).z1n = function (iterable) {
|
|
975
|
+
return this.y1n(asSequence(iterable));
|
|
976
976
|
};
|
|
977
|
-
protoOf(Utils).
|
|
977
|
+
protoOf(Utils).a1o = function (a, b) {
|
|
978
978
|
return a == null && b == null ? null : a == null ? b : b == null ? a : a.hr(b) < 0 ? a : b;
|
|
979
979
|
};
|
|
980
980
|
var Utils_instance;
|
|
@@ -982,24 +982,24 @@
|
|
|
982
982
|
return Utils_instance;
|
|
983
983
|
}
|
|
984
984
|
function IndexedClause$Companion$wrap$1($traversed, $indexedClause) {
|
|
985
|
-
this.
|
|
986
|
-
this.
|
|
985
|
+
this.c1o_1 = $indexedClause;
|
|
986
|
+
this.b1o_1 = listOf($traversed.slice());
|
|
987
987
|
}
|
|
988
988
|
protoOf(IndexedClause$Companion$wrap$1).mp = function () {
|
|
989
|
-
return this.
|
|
989
|
+
return this.c1o_1.mp();
|
|
990
990
|
};
|
|
991
991
|
protoOf(IndexedClause$Companion$wrap$1).e2 = function () {
|
|
992
|
-
return this.
|
|
992
|
+
return this.c1o_1.e2();
|
|
993
993
|
};
|
|
994
|
-
protoOf(IndexedClause$Companion$wrap$1).
|
|
995
|
-
return this.
|
|
994
|
+
protoOf(IndexedClause$Companion$wrap$1).d1o = function () {
|
|
995
|
+
return this.b1o_1;
|
|
996
996
|
};
|
|
997
|
-
protoOf(IndexedClause$Companion$wrap$1).
|
|
997
|
+
protoOf(IndexedClause$Companion$wrap$1).t1m = function () {
|
|
998
998
|
// Inline function 'kotlin.collections.forEach' call
|
|
999
|
-
var _iterator__ex2g4s = this.
|
|
999
|
+
var _iterator__ex2g4s = this.b1o_1.n();
|
|
1000
1000
|
while (_iterator__ex2g4s.q()) {
|
|
1001
1001
|
var element = _iterator__ex2g4s.r();
|
|
1002
|
-
element.
|
|
1002
|
+
element.a1n();
|
|
1003
1003
|
}
|
|
1004
1004
|
};
|
|
1005
1005
|
protoOf(IndexedClause$Companion$wrap$1).d = function (other) {
|
|
@@ -1007,17 +1007,17 @@
|
|
|
1007
1007
|
};
|
|
1008
1008
|
function Companion_2() {
|
|
1009
1009
|
}
|
|
1010
|
-
protoOf(Companion_2).
|
|
1010
|
+
protoOf(Companion_2).f1o = function (indexedClause, traversed) {
|
|
1011
1011
|
return new IndexedClause$Companion$wrap$1(traversed, indexedClause);
|
|
1012
1012
|
};
|
|
1013
|
-
protoOf(Companion_2).
|
|
1014
|
-
return this.
|
|
1013
|
+
protoOf(Companion_2).g1o = function (index, clause, traversed) {
|
|
1014
|
+
return this.f1o(Companion_instance_0.gr(index, clause), traversed.slice());
|
|
1015
1015
|
};
|
|
1016
|
-
protoOf(Companion_2).
|
|
1016
|
+
protoOf(Companion_2).h1o = function (index, clause, traversed) {
|
|
1017
1017
|
var tmp = Companion_instance_0.gr(index, clause);
|
|
1018
1018
|
// Inline function 'kotlin.collections.toTypedArray' call
|
|
1019
1019
|
var tmp$ret$0 = copyToArray(traversed);
|
|
1020
|
-
return this.
|
|
1020
|
+
return this.f1o(tmp, tmp$ret$0.slice());
|
|
1021
1021
|
};
|
|
1022
1022
|
var Companion_instance_7;
|
|
1023
1023
|
function Companion_getInstance_5() {
|
|
@@ -1026,24 +1026,24 @@
|
|
|
1026
1026
|
function IndexedClause() {
|
|
1027
1027
|
}
|
|
1028
1028
|
function SituatedIndexedClause$Companion$of$1($indexed, $index) {
|
|
1029
|
-
this.
|
|
1030
|
-
this.
|
|
1029
|
+
this.i1o_1 = $indexed;
|
|
1030
|
+
this.j1o_1 = $index;
|
|
1031
1031
|
}
|
|
1032
1032
|
protoOf(SituatedIndexedClause$Companion$of$1).mp = function () {
|
|
1033
|
-
return this.
|
|
1033
|
+
return this.i1o_1.mp();
|
|
1034
1034
|
};
|
|
1035
1035
|
protoOf(SituatedIndexedClause$Companion$of$1).e2 = function () {
|
|
1036
|
-
return this.
|
|
1036
|
+
return this.i1o_1.e2();
|
|
1037
1037
|
};
|
|
1038
|
-
protoOf(SituatedIndexedClause$Companion$of$1).
|
|
1039
|
-
this.
|
|
1040
|
-
this.
|
|
1038
|
+
protoOf(SituatedIndexedClause$Companion$of$1).k1o = function () {
|
|
1039
|
+
this.j1o_1.l1o(this);
|
|
1040
|
+
this.t1m();
|
|
1041
1041
|
};
|
|
1042
|
-
protoOf(SituatedIndexedClause$Companion$of$1).
|
|
1043
|
-
return this.
|
|
1042
|
+
protoOf(SituatedIndexedClause$Companion$of$1).d1o = function () {
|
|
1043
|
+
return this.i1o_1.d1o();
|
|
1044
1044
|
};
|
|
1045
|
-
protoOf(SituatedIndexedClause$Companion$of$1).
|
|
1046
|
-
this.
|
|
1045
|
+
protoOf(SituatedIndexedClause$Companion$of$1).t1m = function () {
|
|
1046
|
+
this.i1o_1.t1m();
|
|
1047
1047
|
};
|
|
1048
1048
|
protoOf(SituatedIndexedClause$Companion$of$1).equals = function (other) {
|
|
1049
1049
|
if (this === other)
|
|
@@ -1059,7 +1059,7 @@
|
|
|
1059
1059
|
};
|
|
1060
1060
|
function Companion_3() {
|
|
1061
1061
|
}
|
|
1062
|
-
protoOf(Companion_3).
|
|
1062
|
+
protoOf(Companion_3).m1o = function (indexed, index) {
|
|
1063
1063
|
return new SituatedIndexedClause$Companion$of$1(indexed, index);
|
|
1064
1064
|
};
|
|
1065
1065
|
var Companion_instance_8;
|
|
@@ -1076,11 +1076,11 @@
|
|
|
1076
1076
|
function AbstractIndexingLeaf(unificator) {
|
|
1077
1077
|
AbstractReteNode.call(this, unificator);
|
|
1078
1078
|
}
|
|
1079
|
-
protoOf(AbstractIndexingLeaf).
|
|
1079
|
+
protoOf(AbstractIndexingLeaf).a1n = function () {
|
|
1080
1080
|
};
|
|
1081
1081
|
function extractFirst($this, clause) {
|
|
1082
1082
|
// Inline function 'kotlin.collections.mapNotNull' call
|
|
1083
|
-
var tmp0 = $this.
|
|
1083
|
+
var tmp0 = $this.v1o_1.j2();
|
|
1084
1084
|
// Inline function 'kotlin.collections.mapNotNullTo' call
|
|
1085
1085
|
var destination = ArrayList_init_$Create$_0();
|
|
1086
1086
|
// Inline function 'kotlin.collections.forEach' call
|
|
@@ -1105,7 +1105,7 @@
|
|
|
1105
1105
|
var _iterator__ex2g4s = index.n();
|
|
1106
1106
|
while (_iterator__ex2g4s.q()) {
|
|
1107
1107
|
var item = _iterator__ex2g4s.r();
|
|
1108
|
-
if ($this.
|
|
1108
|
+
if ($this.r1k().match(clause, item.v1m())) {
|
|
1109
1109
|
tmp$ret$0 = index_0;
|
|
1110
1110
|
break $l$block;
|
|
1111
1111
|
}
|
|
@@ -1123,74 +1123,74 @@
|
|
|
1123
1123
|
return tmp;
|
|
1124
1124
|
}
|
|
1125
1125
|
function extractGlobalSequence($this, clause) {
|
|
1126
|
-
var tmp = $this.
|
|
1126
|
+
var tmp = $this.r1o(clause);
|
|
1127
1127
|
return map(tmp, AtomIndex$extractGlobalSequence$lambda);
|
|
1128
1128
|
}
|
|
1129
1129
|
function nestedFirstArgument($this, $receiver) {
|
|
1130
|
-
return Utils_instance.
|
|
1130
|
+
return Utils_instance.q1n(ensureNotNull($receiver.dw()), $this.u1o_1 + 1 | 0);
|
|
1131
1131
|
}
|
|
1132
1132
|
function asInnerAtom($this, $receiver) {
|
|
1133
1133
|
return nestedFirstArgument($this, $receiver).castToAtom();
|
|
1134
1134
|
}
|
|
1135
1135
|
function asInnerAtom_0($this, $receiver) {
|
|
1136
|
-
return nestedFirstArgument($this, $receiver.
|
|
1136
|
+
return nestedFirstArgument($this, $receiver.v1m()).castToAtom();
|
|
1137
1137
|
}
|
|
1138
1138
|
function asInnerAtom_1($this, $receiver) {
|
|
1139
|
-
return nestedFirstArgument($this, $receiver.
|
|
1139
|
+
return nestedFirstArgument($this, $receiver.v1m()).castToAtom();
|
|
1140
1140
|
}
|
|
1141
1141
|
function AtomIndex$_get_size_$lambda_ygjfwe(it) {
|
|
1142
1142
|
return it.s();
|
|
1143
1143
|
}
|
|
1144
1144
|
function AtomIndex$get$lambda(this$0, $clause) {
|
|
1145
1145
|
return function (it) {
|
|
1146
|
-
return this$0.
|
|
1146
|
+
return this$0.r1k().match($clause, it.v1m());
|
|
1147
1147
|
};
|
|
1148
1148
|
}
|
|
1149
1149
|
function AtomIndex$get$lambda_0(it) {
|
|
1150
|
-
return it.
|
|
1150
|
+
return it.v1m();
|
|
1151
1151
|
}
|
|
1152
1152
|
function AtomIndex$getIndexed$lambda(this$0, $clause) {
|
|
1153
1153
|
return function (it) {
|
|
1154
|
-
return this$0.
|
|
1154
|
+
return this$0.r1k().match($clause, it.v1m());
|
|
1155
1155
|
};
|
|
1156
1156
|
}
|
|
1157
1157
|
function AtomIndex$retractAllIndexed$lambda(this$0, $clause) {
|
|
1158
1158
|
return function (it) {
|
|
1159
|
-
return this$0.
|
|
1159
|
+
return this$0.w1m(it, $clause);
|
|
1160
1160
|
};
|
|
1161
1161
|
}
|
|
1162
1162
|
function AtomIndex$retractAll$lambda(it) {
|
|
1163
|
-
return it.
|
|
1163
|
+
return it.v1m();
|
|
1164
1164
|
}
|
|
1165
1165
|
function AtomIndex$getCache$lambda(it) {
|
|
1166
1166
|
return asSequence(it);
|
|
1167
1167
|
}
|
|
1168
1168
|
function AtomIndex$extractGlobalIndexedSequence$lambda(this$0, $clause) {
|
|
1169
1169
|
return function (it) {
|
|
1170
|
-
return this$0.
|
|
1170
|
+
return this$0.r1k().match($clause, it.v1m());
|
|
1171
1171
|
};
|
|
1172
1172
|
}
|
|
1173
1173
|
function AtomIndex$extractGlobalSequence$lambda(it) {
|
|
1174
|
-
return it.
|
|
1174
|
+
return it.v1m();
|
|
1175
1175
|
}
|
|
1176
1176
|
function AtomIndex(unificator, ordered, nestingLevel) {
|
|
1177
1177
|
AbstractIndexingLeaf.call(this, unificator);
|
|
1178
|
-
this.
|
|
1179
|
-
this.
|
|
1178
|
+
this.t1o_1 = ordered;
|
|
1179
|
+
this.u1o_1 = nestingLevel;
|
|
1180
1180
|
var tmp = this;
|
|
1181
1181
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
1182
|
-
tmp.
|
|
1182
|
+
tmp.v1o_1 = LinkedHashMap_init_$Create$();
|
|
1183
1183
|
}
|
|
1184
1184
|
protoOf(AtomIndex).s = function () {
|
|
1185
|
-
var tmp = asSequence(this.
|
|
1185
|
+
var tmp = asSequence(this.v1o_1.j2());
|
|
1186
1186
|
return sum(map(tmp, AtomIndex$_get_size_$lambda_ygjfwe));
|
|
1187
1187
|
};
|
|
1188
|
-
protoOf(AtomIndex).
|
|
1188
|
+
protoOf(AtomIndex).w1k = function () {
|
|
1189
1189
|
var tmp;
|
|
1190
|
-
if (this.
|
|
1190
|
+
if (this.v1o_1.h()) {
|
|
1191
1191
|
tmp = true;
|
|
1192
1192
|
} else {
|
|
1193
|
-
var tmp0 = this.
|
|
1193
|
+
var tmp0 = this.v1o_1.j2();
|
|
1194
1194
|
var tmp$ret$0;
|
|
1195
1195
|
$l$block_0: {
|
|
1196
1196
|
// Inline function 'kotlin.collections.all' call
|
|
@@ -1218,10 +1218,10 @@
|
|
|
1218
1218
|
}
|
|
1219
1219
|
return tmp;
|
|
1220
1220
|
};
|
|
1221
|
-
protoOf(AtomIndex).
|
|
1221
|
+
protoOf(AtomIndex).z1k = function (clause) {
|
|
1222
1222
|
var tmp;
|
|
1223
1223
|
if (nestedFirstArgument(this, clause).st()) {
|
|
1224
|
-
var tmp0_safe_receiver = this.
|
|
1224
|
+
var tmp0_safe_receiver = this.v1o_1.h2(asInnerAtom(this, clause));
|
|
1225
1225
|
var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : asSequence(tmp0_safe_receiver);
|
|
1226
1226
|
var tmp_0;
|
|
1227
1227
|
if (tmp1_safe_receiver == null) {
|
|
@@ -1243,12 +1243,12 @@
|
|
|
1243
1243
|
}
|
|
1244
1244
|
return tmp;
|
|
1245
1245
|
};
|
|
1246
|
-
protoOf(AtomIndex).
|
|
1247
|
-
if (this.
|
|
1246
|
+
protoOf(AtomIndex).x1m = function (clause) {
|
|
1247
|
+
if (this.t1o_1) {
|
|
1248
1248
|
// Inline function 'kotlin.let' call
|
|
1249
1249
|
var it = asInnerAtom_1(this, clause);
|
|
1250
1250
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1251
|
-
var this_0 = this.
|
|
1251
|
+
var this_0 = this.v1o_1;
|
|
1252
1252
|
var value = this_0.h2(it);
|
|
1253
1253
|
var tmp;
|
|
1254
1254
|
if (value == null) {
|
|
@@ -1259,16 +1259,16 @@
|
|
|
1259
1259
|
tmp = value;
|
|
1260
1260
|
}
|
|
1261
1261
|
var tmp$ret$2 = tmp;
|
|
1262
|
-
addFirst(tmp$ret$2, Companion_instance_8.
|
|
1262
|
+
addFirst(tmp$ret$2, Companion_instance_8.m1o(clause.e1o(this), this));
|
|
1263
1263
|
} else {
|
|
1264
|
-
this.
|
|
1264
|
+
this.y1m(clause);
|
|
1265
1265
|
}
|
|
1266
1266
|
};
|
|
1267
|
-
protoOf(AtomIndex).
|
|
1267
|
+
protoOf(AtomIndex).y1m = function (clause) {
|
|
1268
1268
|
// Inline function 'kotlin.let' call
|
|
1269
1269
|
var it = asInnerAtom_1(this, clause);
|
|
1270
1270
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1271
|
-
var this_0 = this.
|
|
1271
|
+
var this_0 = this.v1o_1;
|
|
1272
1272
|
var value = this_0.h2(it);
|
|
1273
1273
|
var tmp;
|
|
1274
1274
|
if (value == null) {
|
|
@@ -1278,13 +1278,13 @@
|
|
|
1278
1278
|
} else {
|
|
1279
1279
|
tmp = value;
|
|
1280
1280
|
}
|
|
1281
|
-
tmp.l(Companion_instance_8.
|
|
1281
|
+
tmp.l(Companion_instance_8.m1o(clause.e1o(this), this));
|
|
1282
1282
|
};
|
|
1283
|
-
protoOf(AtomIndex).
|
|
1283
|
+
protoOf(AtomIndex).o1o = function (clause) {
|
|
1284
1284
|
var tmp;
|
|
1285
1285
|
if (nestedFirstArgument(this, clause).st()) {
|
|
1286
1286
|
// Inline function 'kotlin.let' call
|
|
1287
|
-
var it = this.
|
|
1287
|
+
var it = this.v1o_1.h2(asInnerAtom(this, clause));
|
|
1288
1288
|
var tmp_0;
|
|
1289
1289
|
if (it == null) {
|
|
1290
1290
|
tmp_0 = null;
|
|
@@ -1297,10 +1297,10 @@
|
|
|
1297
1297
|
}
|
|
1298
1298
|
return tmp;
|
|
1299
1299
|
};
|
|
1300
|
-
protoOf(AtomIndex).
|
|
1300
|
+
protoOf(AtomIndex).p1o = function (clause) {
|
|
1301
1301
|
var tmp;
|
|
1302
1302
|
if (nestedFirstArgument(this, clause).st()) {
|
|
1303
|
-
var tmp0_safe_receiver = this.
|
|
1303
|
+
var tmp0_safe_receiver = this.v1o_1.h2(asInnerAtom(this, clause));
|
|
1304
1304
|
var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : asSequence(tmp0_safe_receiver);
|
|
1305
1305
|
var tmp_0;
|
|
1306
1306
|
if (tmp1_safe_receiver == null) {
|
|
@@ -1311,36 +1311,36 @@
|
|
|
1311
1311
|
var tmp2_elvis_lhs = tmp_0;
|
|
1312
1312
|
tmp = tmp2_elvis_lhs == null ? emptySequence() : tmp2_elvis_lhs;
|
|
1313
1313
|
} else {
|
|
1314
|
-
tmp = this.
|
|
1314
|
+
tmp = this.r1o(clause);
|
|
1315
1315
|
}
|
|
1316
1316
|
return tmp;
|
|
1317
1317
|
};
|
|
1318
|
-
protoOf(AtomIndex).
|
|
1319
|
-
ensureNotNull(this.
|
|
1318
|
+
protoOf(AtomIndex).l1o = function (indexed) {
|
|
1319
|
+
ensureNotNull(this.v1o_1.h2(asInnerAtom_0(this, indexed))).z2(indexed);
|
|
1320
1320
|
};
|
|
1321
|
-
protoOf(AtomIndex).
|
|
1321
|
+
protoOf(AtomIndex).q1o = function (clause) {
|
|
1322
1322
|
var tmp;
|
|
1323
1323
|
if (nestedFirstArgument(this, clause).st()) {
|
|
1324
|
-
var partialIndex = this.
|
|
1325
|
-
tmp = partialIndex == null ? emptySequence() : this.
|
|
1324
|
+
var partialIndex = this.v1o_1.h2(asInnerAtom(this, clause));
|
|
1325
|
+
tmp = partialIndex == null ? emptySequence() : this.w1m(partialIndex, clause);
|
|
1326
1326
|
} else {
|
|
1327
1327
|
var tmp_0 = Utils_instance;
|
|
1328
|
-
var tmp_1 = asSequence(this.
|
|
1329
|
-
tmp = tmp_0.
|
|
1328
|
+
var tmp_1 = asSequence(this.v1o_1.j2());
|
|
1329
|
+
tmp = tmp_0.t1n(map(tmp_1, AtomIndex$retractAllIndexed$lambda(this, clause)));
|
|
1330
1330
|
}
|
|
1331
1331
|
return buffered(tmp);
|
|
1332
1332
|
};
|
|
1333
|
-
protoOf(AtomIndex).
|
|
1334
|
-
var tmp = this.
|
|
1333
|
+
protoOf(AtomIndex).j1l = function (clause) {
|
|
1334
|
+
var tmp = this.q1o(clause);
|
|
1335
1335
|
return map(tmp, AtomIndex$retractAll$lambda);
|
|
1336
1336
|
};
|
|
1337
|
-
protoOf(AtomIndex).
|
|
1337
|
+
protoOf(AtomIndex).z1m = function () {
|
|
1338
1338
|
var tmp = Utils_instance;
|
|
1339
|
-
var tmp_0 = asSequence(this.
|
|
1340
|
-
return tmp.
|
|
1339
|
+
var tmp_0 = asSequence(this.v1o_1.j2());
|
|
1340
|
+
return tmp.t1n(map(tmp_0, AtomIndex$getCache$lambda));
|
|
1341
1341
|
};
|
|
1342
|
-
protoOf(AtomIndex).
|
|
1343
|
-
var tmp = this.
|
|
1342
|
+
protoOf(AtomIndex).r1o = function (clause) {
|
|
1343
|
+
var tmp = this.z1m();
|
|
1344
1344
|
return filter(tmp, AtomIndex$extractGlobalIndexedSequence$lambda(this, clause));
|
|
1345
1345
|
};
|
|
1346
1346
|
function retractAllOrdered($this, clause) {
|
|
@@ -1348,20 +1348,20 @@
|
|
|
1348
1348
|
if (isGlobal($this, clause)) {
|
|
1349
1349
|
var tmp_0 = Utils_instance;
|
|
1350
1350
|
// Inline function 'kotlin.collections.map' call
|
|
1351
|
-
var this_0 = $this.
|
|
1351
|
+
var this_0 = $this.z1o_1.j2();
|
|
1352
1352
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1353
1353
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
1354
1354
|
var _iterator__ex2g4s = this_0.n();
|
|
1355
1355
|
while (_iterator__ex2g4s.q()) {
|
|
1356
1356
|
var item = _iterator__ex2g4s.r();
|
|
1357
|
-
var tmp$ret$2 = item.
|
|
1357
|
+
var tmp$ret$2 = item.q1o(clause);
|
|
1358
1358
|
destination.l(tmp$ret$2);
|
|
1359
1359
|
}
|
|
1360
|
-
var tmp_1 = tmp_0.
|
|
1360
|
+
var tmp_1 = tmp_0.s1n(destination);
|
|
1361
1361
|
tmp = map(tmp_1, CompoundIndex$retractAllOrdered$lambda);
|
|
1362
1362
|
} else {
|
|
1363
|
-
var tmp0_safe_receiver = $this.
|
|
1364
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
1363
|
+
var tmp0_safe_receiver = $this.z1o_1.h2(nestedFunctor($this, clause));
|
|
1364
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.j1l(clause);
|
|
1365
1365
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
1366
1366
|
}
|
|
1367
1367
|
return tmp;
|
|
@@ -1371,60 +1371,60 @@
|
|
|
1371
1371
|
if (isGlobal($this, clause)) {
|
|
1372
1372
|
var tmp_0 = Utils_instance;
|
|
1373
1373
|
// Inline function 'kotlin.collections.map' call
|
|
1374
|
-
var this_0 = $this.
|
|
1374
|
+
var this_0 = $this.z1o_1.j2();
|
|
1375
1375
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1376
1376
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
1377
1377
|
var _iterator__ex2g4s = this_0.n();
|
|
1378
1378
|
while (_iterator__ex2g4s.q()) {
|
|
1379
1379
|
var item = _iterator__ex2g4s.r();
|
|
1380
|
-
var tmp$ret$2 = item.
|
|
1380
|
+
var tmp$ret$2 = item.j1l(clause);
|
|
1381
1381
|
destination.l(tmp$ret$2);
|
|
1382
1382
|
}
|
|
1383
|
-
tmp = tmp_0.
|
|
1383
|
+
tmp = tmp_0.z1n(destination);
|
|
1384
1384
|
} else {
|
|
1385
|
-
var tmp0_safe_receiver = $this.
|
|
1386
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
1385
|
+
var tmp0_safe_receiver = $this.z1o_1.h2(nestedFunctor($this, clause));
|
|
1386
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.j1l(clause);
|
|
1387
1387
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
1388
1388
|
}
|
|
1389
1389
|
return tmp;
|
|
1390
1390
|
}
|
|
1391
1391
|
function nestedFunctor($this, $receiver) {
|
|
1392
|
-
return Utils_instance.
|
|
1392
|
+
return Utils_instance.p1n(ensureNotNull($receiver.dw()), $this.y1o_1);
|
|
1393
1393
|
}
|
|
1394
1394
|
function nestedFunctor_0($this, $receiver) {
|
|
1395
|
-
return Utils_instance.
|
|
1395
|
+
return Utils_instance.p1n(ensureNotNull($receiver.v1m().dw()), $this.y1o_1);
|
|
1396
1396
|
}
|
|
1397
1397
|
function isGlobal($this, $receiver) {
|
|
1398
|
-
return Utils_instance.
|
|
1398
|
+
return Utils_instance.q1n(ensureNotNull($receiver.dw()), $this.y1o_1).tu();
|
|
1399
1399
|
}
|
|
1400
1400
|
function regenerateCache($this) {
|
|
1401
1401
|
var tmp;
|
|
1402
|
-
if ($this.
|
|
1402
|
+
if ($this.x1o_1) {
|
|
1403
1403
|
var tmp_0 = Utils_instance;
|
|
1404
1404
|
// Inline function 'kotlin.collections.map' call
|
|
1405
|
-
var this_0 = $this.
|
|
1405
|
+
var this_0 = $this.z1o_1.j2();
|
|
1406
1406
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1407
1407
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
1408
1408
|
var _iterator__ex2g4s = this_0.n();
|
|
1409
1409
|
while (_iterator__ex2g4s.q()) {
|
|
1410
1410
|
var item = _iterator__ex2g4s.r();
|
|
1411
|
-
var tmp$ret$2 = item.
|
|
1411
|
+
var tmp$ret$2 = item.z1m();
|
|
1412
1412
|
destination.l(tmp$ret$2);
|
|
1413
1413
|
}
|
|
1414
|
-
tmp = tmp_0.
|
|
1414
|
+
tmp = tmp_0.s1n(destination);
|
|
1415
1415
|
} else {
|
|
1416
1416
|
var tmp_1 = Utils_instance;
|
|
1417
1417
|
// Inline function 'kotlin.collections.map' call
|
|
1418
|
-
var this_1 = $this.
|
|
1418
|
+
var this_1 = $this.z1o_1.j2();
|
|
1419
1419
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1420
1420
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
1421
1421
|
var _iterator__ex2g4s_0 = this_1.n();
|
|
1422
1422
|
while (_iterator__ex2g4s_0.q()) {
|
|
1423
1423
|
var item_0 = _iterator__ex2g4s_0.r();
|
|
1424
|
-
var tmp$ret$5 = item_0.
|
|
1424
|
+
var tmp$ret$5 = item_0.z1m();
|
|
1425
1425
|
destination_0.l(tmp$ret$5);
|
|
1426
1426
|
}
|
|
1427
|
-
tmp = tmp_1.
|
|
1427
|
+
tmp = tmp_1.w1n(destination_0);
|
|
1428
1428
|
}
|
|
1429
1429
|
return dequeOf_0(tmp);
|
|
1430
1430
|
}
|
|
@@ -1439,41 +1439,41 @@
|
|
|
1439
1439
|
}
|
|
1440
1440
|
function CompoundIndex$get$lambda($clause) {
|
|
1441
1441
|
return function (it) {
|
|
1442
|
-
return it.
|
|
1442
|
+
return it.p1o($clause);
|
|
1443
1443
|
};
|
|
1444
1444
|
}
|
|
1445
1445
|
function CompoundIndex$get$lambda_0(it) {
|
|
1446
|
-
return it.
|
|
1446
|
+
return it.v1m();
|
|
1447
1447
|
}
|
|
1448
1448
|
function CompoundIndex$get$lambda_1($clause) {
|
|
1449
1449
|
return function (it) {
|
|
1450
|
-
return it.
|
|
1450
|
+
return it.z1k($clause);
|
|
1451
1451
|
};
|
|
1452
1452
|
}
|
|
1453
1453
|
function CompoundIndex$retractAllOrdered$lambda(it) {
|
|
1454
|
-
return it.
|
|
1454
|
+
return it.v1m();
|
|
1455
1455
|
}
|
|
1456
1456
|
function CompoundIndex(unificator, ordered, nestingLevel) {
|
|
1457
1457
|
AbstractReteNode.call(this, unificator);
|
|
1458
|
-
this.
|
|
1459
|
-
this.
|
|
1458
|
+
this.x1o_1 = ordered;
|
|
1459
|
+
this.y1o_1 = nestingLevel;
|
|
1460
1460
|
var tmp = this;
|
|
1461
1461
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
1462
|
-
tmp.
|
|
1462
|
+
tmp.z1o_1 = LinkedHashMap_init_$Create$();
|
|
1463
1463
|
var tmp_0 = this;
|
|
1464
1464
|
var tmp_1 = Companion_instance_1;
|
|
1465
|
-
tmp_0.
|
|
1465
|
+
tmp_0.a1p_1 = tmp_1.yo(CompoundIndex$regenerateCache$ref(this));
|
|
1466
1466
|
}
|
|
1467
1467
|
protoOf(CompoundIndex).s = function () {
|
|
1468
|
-
var tmp = asSequence(this.
|
|
1468
|
+
var tmp = asSequence(this.z1o_1.j2());
|
|
1469
1469
|
return sum(map(tmp, CompoundIndex$_get_size_$lambda_91vt0k));
|
|
1470
1470
|
};
|
|
1471
|
-
protoOf(CompoundIndex).
|
|
1471
|
+
protoOf(CompoundIndex).w1k = function () {
|
|
1472
1472
|
var tmp;
|
|
1473
|
-
if (this.
|
|
1473
|
+
if (this.z1o_1.h()) {
|
|
1474
1474
|
tmp = true;
|
|
1475
1475
|
} else {
|
|
1476
|
-
var tmp0 = this.
|
|
1476
|
+
var tmp0 = this.z1o_1.j2();
|
|
1477
1477
|
var tmp$ret$0;
|
|
1478
1478
|
$l$block_0: {
|
|
1479
1479
|
// Inline function 'kotlin.collections.all' call
|
|
@@ -1490,7 +1490,7 @@
|
|
|
1490
1490
|
var _iterator__ex2g4s = tmp0.n();
|
|
1491
1491
|
while (_iterator__ex2g4s.q()) {
|
|
1492
1492
|
var element = _iterator__ex2g4s.r();
|
|
1493
|
-
if (!element.
|
|
1493
|
+
if (!element.w1k()) {
|
|
1494
1494
|
tmp$ret$0 = false;
|
|
1495
1495
|
break $l$block_0;
|
|
1496
1496
|
}
|
|
@@ -1501,91 +1501,91 @@
|
|
|
1501
1501
|
}
|
|
1502
1502
|
return tmp;
|
|
1503
1503
|
};
|
|
1504
|
-
protoOf(CompoundIndex).
|
|
1504
|
+
protoOf(CompoundIndex).z1k = function (clause) {
|
|
1505
1505
|
var tmp;
|
|
1506
1506
|
if (isGlobal(this, clause)) {
|
|
1507
1507
|
var tmp_0;
|
|
1508
|
-
if (this.
|
|
1508
|
+
if (this.x1o_1) {
|
|
1509
1509
|
var tmp_1 = Utils_instance;
|
|
1510
|
-
var tmp_2 = asSequence(this.
|
|
1511
|
-
var tmp_3 = tmp_1.
|
|
1510
|
+
var tmp_2 = asSequence(this.z1o_1.j2());
|
|
1511
|
+
var tmp_3 = tmp_1.r1n([flatMap(tmp_2, CompoundIndex$get$lambda(clause))]);
|
|
1512
1512
|
tmp_0 = map(tmp_3, CompoundIndex$get$lambda_0);
|
|
1513
1513
|
} else {
|
|
1514
1514
|
var tmp_4 = Utils_instance;
|
|
1515
|
-
var tmp_5 = asSequence(this.
|
|
1516
|
-
tmp_0 = tmp_4.
|
|
1515
|
+
var tmp_5 = asSequence(this.z1o_1.j2());
|
|
1516
|
+
tmp_0 = tmp_4.x1n([flatMap(tmp_5, CompoundIndex$get$lambda_1(clause))]);
|
|
1517
1517
|
}
|
|
1518
1518
|
tmp = tmp_0;
|
|
1519
1519
|
} else {
|
|
1520
|
-
var tmp0_safe_receiver = this.
|
|
1521
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
1520
|
+
var tmp0_safe_receiver = this.z1o_1.h2(nestedFunctor(this, clause));
|
|
1521
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.z1k(clause);
|
|
1522
1522
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
1523
1523
|
}
|
|
1524
1524
|
return tmp;
|
|
1525
1525
|
};
|
|
1526
|
-
protoOf(CompoundIndex).
|
|
1526
|
+
protoOf(CompoundIndex).x1m = function (clause) {
|
|
1527
1527
|
// Inline function 'kotlin.let' call
|
|
1528
1528
|
var it = nestedFunctor_0(this, clause);
|
|
1529
|
-
if (this.
|
|
1529
|
+
if (this.x1o_1) {
|
|
1530
1530
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1531
|
-
var this_0 = this.
|
|
1531
|
+
var this_0 = this.z1o_1;
|
|
1532
1532
|
var value = this_0.h2(it);
|
|
1533
1533
|
var tmp;
|
|
1534
1534
|
if (value == null) {
|
|
1535
|
-
var answer = new FunctorIndexingNode(this.
|
|
1535
|
+
var answer = new FunctorIndexingNode(this.r1k(), this.x1o_1, this.y1o_1);
|
|
1536
1536
|
this_0.k4(it, answer);
|
|
1537
1537
|
tmp = answer;
|
|
1538
1538
|
} else {
|
|
1539
1539
|
tmp = value;
|
|
1540
1540
|
}
|
|
1541
|
-
tmp.
|
|
1541
|
+
tmp.x1m(clause.e1o(this));
|
|
1542
1542
|
} else {
|
|
1543
|
-
this.
|
|
1543
|
+
this.y1m(clause);
|
|
1544
1544
|
}
|
|
1545
1545
|
return Unit_instance;
|
|
1546
1546
|
};
|
|
1547
|
-
protoOf(CompoundIndex).
|
|
1547
|
+
protoOf(CompoundIndex).y1m = function (clause) {
|
|
1548
1548
|
// Inline function 'kotlin.let' call
|
|
1549
1549
|
var it = nestedFunctor_0(this, clause);
|
|
1550
1550
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1551
|
-
var this_0 = this.
|
|
1551
|
+
var this_0 = this.z1o_1;
|
|
1552
1552
|
var value = this_0.h2(it);
|
|
1553
1553
|
var tmp;
|
|
1554
1554
|
if (value == null) {
|
|
1555
|
-
var answer = new FunctorIndexingNode(this.
|
|
1555
|
+
var answer = new FunctorIndexingNode(this.r1k(), this.x1o_1, this.y1o_1);
|
|
1556
1556
|
this_0.k4(it, answer);
|
|
1557
1557
|
tmp = answer;
|
|
1558
1558
|
} else {
|
|
1559
1559
|
tmp = value;
|
|
1560
1560
|
}
|
|
1561
|
-
tmp.
|
|
1561
|
+
tmp.y1m(clause.e1o(this));
|
|
1562
1562
|
return Unit_instance;
|
|
1563
1563
|
};
|
|
1564
|
-
protoOf(CompoundIndex).
|
|
1564
|
+
protoOf(CompoundIndex).j1l = function (clause) {
|
|
1565
1565
|
var tmp;
|
|
1566
|
-
if (this.
|
|
1566
|
+
if (this.x1o_1) {
|
|
1567
1567
|
tmp = retractAllOrdered(this, clause);
|
|
1568
1568
|
} else {
|
|
1569
1569
|
tmp = retractAllUnordered(this, clause);
|
|
1570
1570
|
}
|
|
1571
1571
|
return tmp;
|
|
1572
1572
|
};
|
|
1573
|
-
protoOf(CompoundIndex).
|
|
1574
|
-
return asSequence(this.
|
|
1573
|
+
protoOf(CompoundIndex).z1m = function () {
|
|
1574
|
+
return asSequence(this.a1p_1.e2());
|
|
1575
1575
|
};
|
|
1576
|
-
protoOf(CompoundIndex).
|
|
1576
|
+
protoOf(CompoundIndex).o1o = function (clause) {
|
|
1577
1577
|
var tmp;
|
|
1578
1578
|
if (isGlobal(this, clause)) {
|
|
1579
1579
|
var tmp_0 = Utils_instance;
|
|
1580
1580
|
// Inline function 'kotlin.collections.mapNotNull' call
|
|
1581
|
-
var tmp0 = this.
|
|
1581
|
+
var tmp0 = this.z1o_1.j2();
|
|
1582
1582
|
// Inline function 'kotlin.collections.mapNotNullTo' call
|
|
1583
1583
|
var destination = ArrayList_init_$Create$_0();
|
|
1584
1584
|
// Inline function 'kotlin.collections.forEach' call
|
|
1585
1585
|
var _iterator__ex2g4s = tmp0.n();
|
|
1586
1586
|
while (_iterator__ex2g4s.q()) {
|
|
1587
1587
|
var element = _iterator__ex2g4s.r();
|
|
1588
|
-
var tmp0_safe_receiver = element.
|
|
1588
|
+
var tmp0_safe_receiver = element.o1o(clause);
|
|
1589
1589
|
if (tmp0_safe_receiver == null)
|
|
1590
1590
|
null;
|
|
1591
1591
|
else {
|
|
@@ -1593,128 +1593,128 @@
|
|
|
1593
1593
|
destination.l(tmp0_safe_receiver);
|
|
1594
1594
|
}
|
|
1595
1595
|
}
|
|
1596
|
-
tmp = firstOrNull(tmp_0.
|
|
1596
|
+
tmp = firstOrNull(tmp_0.t1n(sequenceOf_0(asSequence(destination))));
|
|
1597
1597
|
} else {
|
|
1598
|
-
var tmp0_safe_receiver_0 = this.
|
|
1599
|
-
tmp = tmp0_safe_receiver_0 == null ? null : tmp0_safe_receiver_0.
|
|
1598
|
+
var tmp0_safe_receiver_0 = this.z1o_1.h2(nestedFunctor(this, clause));
|
|
1599
|
+
tmp = tmp0_safe_receiver_0 == null ? null : tmp0_safe_receiver_0.o1o(clause);
|
|
1600
1600
|
}
|
|
1601
1601
|
return tmp;
|
|
1602
1602
|
};
|
|
1603
|
-
protoOf(CompoundIndex).
|
|
1603
|
+
protoOf(CompoundIndex).p1o = function (clause) {
|
|
1604
1604
|
var tmp;
|
|
1605
1605
|
if (isGlobal(this, clause)) {
|
|
1606
1606
|
var tmp_0 = Utils_instance;
|
|
1607
1607
|
// Inline function 'kotlin.collections.map' call
|
|
1608
|
-
var this_0 = this.
|
|
1608
|
+
var this_0 = this.z1o_1.j2();
|
|
1609
1609
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1610
1610
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
1611
1611
|
var _iterator__ex2g4s = this_0.n();
|
|
1612
1612
|
while (_iterator__ex2g4s.q()) {
|
|
1613
1613
|
var item = _iterator__ex2g4s.r();
|
|
1614
|
-
var tmp$ret$2 = item.
|
|
1614
|
+
var tmp$ret$2 = item.r1o(clause);
|
|
1615
1615
|
destination.l(tmp$ret$2);
|
|
1616
1616
|
}
|
|
1617
|
-
tmp = tmp_0.
|
|
1617
|
+
tmp = tmp_0.s1n(destination);
|
|
1618
1618
|
} else {
|
|
1619
|
-
var tmp0_safe_receiver = this.
|
|
1620
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
1619
|
+
var tmp0_safe_receiver = this.z1o_1.h2(nestedFunctor(this, clause));
|
|
1620
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.p1o(clause);
|
|
1621
1621
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
1622
1622
|
}
|
|
1623
1623
|
return tmp;
|
|
1624
1624
|
};
|
|
1625
|
-
protoOf(CompoundIndex).
|
|
1625
|
+
protoOf(CompoundIndex).q1o = function (clause) {
|
|
1626
1626
|
var tmp;
|
|
1627
1627
|
if (isGlobal(this, clause)) {
|
|
1628
1628
|
var tmp_0 = Utils_instance;
|
|
1629
1629
|
// Inline function 'kotlin.collections.map' call
|
|
1630
|
-
var this_0 = this.
|
|
1630
|
+
var this_0 = this.z1o_1.j2();
|
|
1631
1631
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1632
1632
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
1633
1633
|
var _iterator__ex2g4s = this_0.n();
|
|
1634
1634
|
while (_iterator__ex2g4s.q()) {
|
|
1635
1635
|
var item = _iterator__ex2g4s.r();
|
|
1636
|
-
var tmp$ret$2 = item.
|
|
1636
|
+
var tmp$ret$2 = item.q1o(clause);
|
|
1637
1637
|
destination.l(tmp$ret$2);
|
|
1638
1638
|
}
|
|
1639
|
-
tmp = tmp_0.
|
|
1639
|
+
tmp = tmp_0.s1n(destination);
|
|
1640
1640
|
} else {
|
|
1641
|
-
var tmp0_safe_receiver = this.
|
|
1642
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
1641
|
+
var tmp0_safe_receiver = this.z1o_1.h2(nestedFunctor(this, clause));
|
|
1642
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.q1o(clause);
|
|
1643
1643
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
1644
1644
|
}
|
|
1645
1645
|
return tmp;
|
|
1646
1646
|
};
|
|
1647
|
-
protoOf(CompoundIndex).
|
|
1647
|
+
protoOf(CompoundIndex).r1o = function (clause) {
|
|
1648
1648
|
var tmp;
|
|
1649
|
-
if (this.
|
|
1649
|
+
if (this.x1o_1) {
|
|
1650
1650
|
var tmp_0 = Utils_instance;
|
|
1651
1651
|
// Inline function 'kotlin.collections.map' call
|
|
1652
|
-
var this_0 = this.
|
|
1652
|
+
var this_0 = this.z1o_1.j2();
|
|
1653
1653
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1654
1654
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
1655
1655
|
var _iterator__ex2g4s = this_0.n();
|
|
1656
1656
|
while (_iterator__ex2g4s.q()) {
|
|
1657
1657
|
var item = _iterator__ex2g4s.r();
|
|
1658
|
-
var tmp$ret$2 = item.
|
|
1658
|
+
var tmp$ret$2 = item.r1o(clause);
|
|
1659
1659
|
destination.l(tmp$ret$2);
|
|
1660
1660
|
}
|
|
1661
|
-
tmp = tmp_0.
|
|
1661
|
+
tmp = tmp_0.s1n(destination);
|
|
1662
1662
|
} else {
|
|
1663
1663
|
var tmp_1 = Utils_instance;
|
|
1664
1664
|
// Inline function 'kotlin.collections.map' call
|
|
1665
|
-
var this_1 = this.
|
|
1665
|
+
var this_1 = this.z1o_1.j2();
|
|
1666
1666
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1667
1667
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
1668
1668
|
var _iterator__ex2g4s_0 = this_1.n();
|
|
1669
1669
|
while (_iterator__ex2g4s_0.q()) {
|
|
1670
1670
|
var item_0 = _iterator__ex2g4s_0.r();
|
|
1671
|
-
var tmp$ret$5 = item_0.
|
|
1671
|
+
var tmp$ret$5 = item_0.r1o(clause);
|
|
1672
1672
|
destination_0.l(tmp$ret$5);
|
|
1673
1673
|
}
|
|
1674
|
-
tmp = tmp_1.
|
|
1674
|
+
tmp = tmp_1.w1n(destination_0);
|
|
1675
1675
|
}
|
|
1676
1676
|
return tmp;
|
|
1677
1677
|
};
|
|
1678
|
-
protoOf(CompoundIndex).
|
|
1679
|
-
this.
|
|
1678
|
+
protoOf(CompoundIndex).a1n = function () {
|
|
1679
|
+
this.a1p_1.ap();
|
|
1680
1680
|
};
|
|
1681
1681
|
function DirectiveIndex$retractFirst$lambda(it) {
|
|
1682
|
-
return it.
|
|
1682
|
+
return it.v1m();
|
|
1683
1683
|
}
|
|
1684
1684
|
function DirectiveIndex$retractAll$lambda(it) {
|
|
1685
|
-
return it.
|
|
1685
|
+
return it.v1m();
|
|
1686
1686
|
}
|
|
1687
1687
|
function DirectiveIndex$getCache$lambda(it) {
|
|
1688
1688
|
var tmp = Companion_instance_8;
|
|
1689
|
-
return tmp.
|
|
1689
|
+
return tmp.m1o(it, new DirectiveIndex$getCache$1$1());
|
|
1690
1690
|
}
|
|
1691
1691
|
function DirectiveIndex$getCache$1$1() {
|
|
1692
1692
|
}
|
|
1693
|
-
protoOf(DirectiveIndex$getCache$1$1).
|
|
1693
|
+
protoOf(DirectiveIndex$getCache$1$1).l1o = function (indexed) {
|
|
1694
1694
|
// Inline function 'kotlin.TODO' call
|
|
1695
1695
|
var reason = 'Directives are adapted as a SituatedIndexedClause, but they are not actually stored with this type. Given their particular semantic, try retracting directly with a proper query, or opening a pull request implementing this indexing class as a proper typed data structure';
|
|
1696
1696
|
throw new NotImplementedError('An operation is not implemented: ' + reason);
|
|
1697
1697
|
};
|
|
1698
1698
|
function DirectiveIndex(unificator, ordered) {
|
|
1699
1699
|
AbstractReteNode.call(this, unificator);
|
|
1700
|
-
this.
|
|
1701
|
-
this.
|
|
1700
|
+
this.c1p_1 = ordered;
|
|
1701
|
+
this.d1p_1 = dequeOf([]);
|
|
1702
1702
|
}
|
|
1703
1703
|
protoOf(DirectiveIndex).s = function () {
|
|
1704
|
-
return this.
|
|
1704
|
+
return this.d1p_1.s();
|
|
1705
1705
|
};
|
|
1706
|
-
protoOf(DirectiveIndex).
|
|
1707
|
-
return this.
|
|
1706
|
+
protoOf(DirectiveIndex).w1k = function () {
|
|
1707
|
+
return this.d1p_1.h();
|
|
1708
1708
|
};
|
|
1709
|
-
protoOf(DirectiveIndex).
|
|
1709
|
+
protoOf(DirectiveIndex).z1k = function (clause) {
|
|
1710
1710
|
// Inline function 'kotlin.collections.filter' call
|
|
1711
|
-
var tmp0 = this.
|
|
1711
|
+
var tmp0 = this.d1p_1;
|
|
1712
1712
|
// Inline function 'kotlin.collections.filterTo' call
|
|
1713
1713
|
var destination = ArrayList_init_$Create$_0();
|
|
1714
1714
|
var _iterator__ex2g4s = tmp0.n();
|
|
1715
1715
|
while (_iterator__ex2g4s.q()) {
|
|
1716
1716
|
var element = _iterator__ex2g4s.r();
|
|
1717
|
-
if (this.
|
|
1717
|
+
if (this.r1k().match(clause, element.v1m())) {
|
|
1718
1718
|
destination.l(element);
|
|
1719
1719
|
}
|
|
1720
1720
|
}
|
|
@@ -1724,38 +1724,38 @@
|
|
|
1724
1724
|
var _iterator__ex2g4s_0 = destination.n();
|
|
1725
1725
|
while (_iterator__ex2g4s_0.q()) {
|
|
1726
1726
|
var item = _iterator__ex2g4s_0.r();
|
|
1727
|
-
var tmp$ret$5 = item.
|
|
1727
|
+
var tmp$ret$5 = item.v1m();
|
|
1728
1728
|
destination_0.l(tmp$ret$5);
|
|
1729
1729
|
}
|
|
1730
1730
|
return asSequence(destination_0);
|
|
1731
1731
|
};
|
|
1732
|
-
protoOf(DirectiveIndex).
|
|
1733
|
-
if (this.
|
|
1734
|
-
addFirst(this.
|
|
1732
|
+
protoOf(DirectiveIndex).x1m = function (clause) {
|
|
1733
|
+
if (this.c1p_1) {
|
|
1734
|
+
addFirst(this.d1p_1, clause.e1o(this));
|
|
1735
1735
|
} else {
|
|
1736
|
-
this.
|
|
1736
|
+
this.y1m(clause);
|
|
1737
1737
|
}
|
|
1738
1738
|
};
|
|
1739
|
-
protoOf(DirectiveIndex).
|
|
1740
|
-
this.
|
|
1739
|
+
protoOf(DirectiveIndex).y1m = function (clause) {
|
|
1740
|
+
this.d1p_1.l(clause.e1o(this));
|
|
1741
1741
|
};
|
|
1742
|
-
protoOf(DirectiveIndex).
|
|
1743
|
-
var tmp = this.
|
|
1742
|
+
protoOf(DirectiveIndex).h1l = function (clause) {
|
|
1743
|
+
var tmp = this.w1m(this.d1p_1, clause);
|
|
1744
1744
|
return buffered(take(map(tmp, DirectiveIndex$retractFirst$lambda), 1));
|
|
1745
1745
|
};
|
|
1746
|
-
protoOf(DirectiveIndex).
|
|
1747
|
-
var tmp = this.
|
|
1746
|
+
protoOf(DirectiveIndex).j1l = function (clause) {
|
|
1747
|
+
var tmp = this.w1m(this.d1p_1, clause);
|
|
1748
1748
|
return buffered(map(tmp, DirectiveIndex$retractAll$lambda));
|
|
1749
1749
|
};
|
|
1750
|
-
protoOf(DirectiveIndex).
|
|
1751
|
-
var tmp = asSequence(this.
|
|
1750
|
+
protoOf(DirectiveIndex).z1m = function () {
|
|
1751
|
+
var tmp = asSequence(this.d1p_1);
|
|
1752
1752
|
return map(tmp, DirectiveIndex$getCache$lambda);
|
|
1753
1753
|
};
|
|
1754
|
-
protoOf(DirectiveIndex).
|
|
1754
|
+
protoOf(DirectiveIndex).a1n = function () {
|
|
1755
1755
|
};
|
|
1756
1756
|
function extractFirst_1($this, clause) {
|
|
1757
1757
|
// Inline function 'kotlin.collections.mapNotNull' call
|
|
1758
|
-
var tmp0 = $this.
|
|
1758
|
+
var tmp0 = $this.h1p_1.j2();
|
|
1759
1759
|
// Inline function 'kotlin.collections.mapNotNullTo' call
|
|
1760
1760
|
var destination = ArrayList_init_$Create$_0();
|
|
1761
1761
|
// Inline function 'kotlin.collections.forEach' call
|
|
@@ -1780,7 +1780,7 @@
|
|
|
1780
1780
|
var _iterator__ex2g4s = index.n();
|
|
1781
1781
|
while (_iterator__ex2g4s.q()) {
|
|
1782
1782
|
var item = _iterator__ex2g4s.r();
|
|
1783
|
-
if ($this.
|
|
1783
|
+
if ($this.r1k().match(clause, item.v1m())) {
|
|
1784
1784
|
tmp$ret$0 = index_0;
|
|
1785
1785
|
break $l$block;
|
|
1786
1786
|
}
|
|
@@ -1798,74 +1798,74 @@
|
|
|
1798
1798
|
return tmp;
|
|
1799
1799
|
}
|
|
1800
1800
|
function extractGlobalSequence_0($this, clause) {
|
|
1801
|
-
var tmp = $this.
|
|
1801
|
+
var tmp = $this.r1o(clause);
|
|
1802
1802
|
return map(tmp, NumericIndex$extractGlobalSequence$lambda);
|
|
1803
1803
|
}
|
|
1804
1804
|
function nestedFirstArgument_0($this, $receiver) {
|
|
1805
|
-
return Utils_instance.
|
|
1805
|
+
return Utils_instance.q1n(ensureNotNull($receiver.dw()), $this.g1p_1 + 1 | 0);
|
|
1806
1806
|
}
|
|
1807
1807
|
function asInnerNumeric($this, $receiver) {
|
|
1808
1808
|
return nestedFirstArgument_0($this, $receiver).castToNumeric();
|
|
1809
1809
|
}
|
|
1810
1810
|
function asInnerNumeric_0($this, $receiver) {
|
|
1811
|
-
return nestedFirstArgument_0($this, $receiver.
|
|
1811
|
+
return nestedFirstArgument_0($this, $receiver.v1m()).castToNumeric();
|
|
1812
1812
|
}
|
|
1813
1813
|
function asInnerNumeric_1($this, $receiver) {
|
|
1814
|
-
return nestedFirstArgument_0($this, $receiver.
|
|
1814
|
+
return nestedFirstArgument_0($this, $receiver.v1m()).castToNumeric();
|
|
1815
1815
|
}
|
|
1816
1816
|
function NumericIndex$_get_size_$lambda_exo30i(it) {
|
|
1817
1817
|
return it.s();
|
|
1818
1818
|
}
|
|
1819
1819
|
function NumericIndex$get$lambda(this$0, $clause) {
|
|
1820
1820
|
return function (it) {
|
|
1821
|
-
return this$0.
|
|
1821
|
+
return this$0.r1k().match($clause, it.v1m());
|
|
1822
1822
|
};
|
|
1823
1823
|
}
|
|
1824
1824
|
function NumericIndex$get$lambda_0(it) {
|
|
1825
|
-
return it.
|
|
1825
|
+
return it.v1m();
|
|
1826
1826
|
}
|
|
1827
1827
|
function NumericIndex$getIndexed$lambda(this$0, $clause) {
|
|
1828
1828
|
return function (it) {
|
|
1829
|
-
return this$0.
|
|
1829
|
+
return this$0.r1k().match($clause, it.v1m());
|
|
1830
1830
|
};
|
|
1831
1831
|
}
|
|
1832
1832
|
function NumericIndex$retractAllIndexed$lambda(this$0, $clause) {
|
|
1833
1833
|
return function (it) {
|
|
1834
|
-
return this$0.
|
|
1834
|
+
return this$0.w1m(it, $clause);
|
|
1835
1835
|
};
|
|
1836
1836
|
}
|
|
1837
1837
|
function NumericIndex$retractAll$lambda(it) {
|
|
1838
|
-
return it.
|
|
1838
|
+
return it.v1m();
|
|
1839
1839
|
}
|
|
1840
1840
|
function NumericIndex$getCache$lambda(it) {
|
|
1841
1841
|
return asSequence(it);
|
|
1842
1842
|
}
|
|
1843
1843
|
function NumericIndex$extractGlobalIndexedSequence$lambda(this$0, $clause) {
|
|
1844
1844
|
return function (it) {
|
|
1845
|
-
return this$0.
|
|
1845
|
+
return this$0.r1k().match($clause, it.v1m());
|
|
1846
1846
|
};
|
|
1847
1847
|
}
|
|
1848
1848
|
function NumericIndex$extractGlobalSequence$lambda(it) {
|
|
1849
|
-
return it.
|
|
1849
|
+
return it.v1m();
|
|
1850
1850
|
}
|
|
1851
1851
|
function NumericIndex(unificator, ordered, nestingLevel) {
|
|
1852
1852
|
AbstractIndexingLeaf.call(this, unificator);
|
|
1853
|
-
this.
|
|
1854
|
-
this.
|
|
1853
|
+
this.f1p_1 = ordered;
|
|
1854
|
+
this.g1p_1 = nestingLevel;
|
|
1855
1855
|
var tmp = this;
|
|
1856
1856
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
1857
|
-
tmp.
|
|
1857
|
+
tmp.h1p_1 = LinkedHashMap_init_$Create$();
|
|
1858
1858
|
}
|
|
1859
1859
|
protoOf(NumericIndex).s = function () {
|
|
1860
|
-
var tmp = asSequence(this.
|
|
1860
|
+
var tmp = asSequence(this.h1p_1.j2());
|
|
1861
1861
|
return sum(map(tmp, NumericIndex$_get_size_$lambda_exo30i));
|
|
1862
1862
|
};
|
|
1863
|
-
protoOf(NumericIndex).
|
|
1863
|
+
protoOf(NumericIndex).w1k = function () {
|
|
1864
1864
|
var tmp;
|
|
1865
|
-
if (this.
|
|
1865
|
+
if (this.h1p_1.h()) {
|
|
1866
1866
|
tmp = true;
|
|
1867
1867
|
} else {
|
|
1868
|
-
var tmp0 = this.
|
|
1868
|
+
var tmp0 = this.h1p_1.j2();
|
|
1869
1869
|
var tmp$ret$0;
|
|
1870
1870
|
$l$block_0: {
|
|
1871
1871
|
// Inline function 'kotlin.collections.all' call
|
|
@@ -1893,10 +1893,10 @@
|
|
|
1893
1893
|
}
|
|
1894
1894
|
return tmp;
|
|
1895
1895
|
};
|
|
1896
|
-
protoOf(NumericIndex).
|
|
1896
|
+
protoOf(NumericIndex).z1k = function (clause) {
|
|
1897
1897
|
var tmp;
|
|
1898
1898
|
if (nestedFirstArgument_0(this, clause).xu()) {
|
|
1899
|
-
var tmp0_safe_receiver = this.
|
|
1899
|
+
var tmp0_safe_receiver = this.h1p_1.h2(asInnerNumeric(this, clause));
|
|
1900
1900
|
var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : asSequence(tmp0_safe_receiver);
|
|
1901
1901
|
var tmp_0;
|
|
1902
1902
|
if (tmp1_safe_receiver == null) {
|
|
@@ -1918,12 +1918,12 @@
|
|
|
1918
1918
|
}
|
|
1919
1919
|
return tmp;
|
|
1920
1920
|
};
|
|
1921
|
-
protoOf(NumericIndex).
|
|
1922
|
-
if (this.
|
|
1921
|
+
protoOf(NumericIndex).x1m = function (clause) {
|
|
1922
|
+
if (this.f1p_1) {
|
|
1923
1923
|
// Inline function 'kotlin.let' call
|
|
1924
1924
|
var it = asInnerNumeric_1(this, clause);
|
|
1925
1925
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1926
|
-
var this_0 = this.
|
|
1926
|
+
var this_0 = this.h1p_1;
|
|
1927
1927
|
var value = this_0.h2(it);
|
|
1928
1928
|
var tmp;
|
|
1929
1929
|
if (value == null) {
|
|
@@ -1934,16 +1934,16 @@
|
|
|
1934
1934
|
tmp = value;
|
|
1935
1935
|
}
|
|
1936
1936
|
var tmp$ret$2 = tmp;
|
|
1937
|
-
addFirst(tmp$ret$2, Companion_instance_8.
|
|
1937
|
+
addFirst(tmp$ret$2, Companion_instance_8.m1o(clause.e1o(this), this));
|
|
1938
1938
|
} else {
|
|
1939
|
-
this.
|
|
1939
|
+
this.y1m(clause);
|
|
1940
1940
|
}
|
|
1941
1941
|
};
|
|
1942
|
-
protoOf(NumericIndex).
|
|
1942
|
+
protoOf(NumericIndex).y1m = function (clause) {
|
|
1943
1943
|
// Inline function 'kotlin.let' call
|
|
1944
1944
|
var it = asInnerNumeric_1(this, clause);
|
|
1945
1945
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1946
|
-
var this_0 = this.
|
|
1946
|
+
var this_0 = this.h1p_1;
|
|
1947
1947
|
var value = this_0.h2(it);
|
|
1948
1948
|
var tmp;
|
|
1949
1949
|
if (value == null) {
|
|
@@ -1953,12 +1953,12 @@
|
|
|
1953
1953
|
} else {
|
|
1954
1954
|
tmp = value;
|
|
1955
1955
|
}
|
|
1956
|
-
tmp.l(Companion_instance_8.
|
|
1956
|
+
tmp.l(Companion_instance_8.m1o(clause.e1o(this), this));
|
|
1957
1957
|
};
|
|
1958
|
-
protoOf(NumericIndex).
|
|
1958
|
+
protoOf(NumericIndex).o1o = function (clause) {
|
|
1959
1959
|
if (nestedFirstArgument_0(this, clause).xu()) {
|
|
1960
1960
|
// Inline function 'kotlin.let' call
|
|
1961
|
-
var it = this.
|
|
1961
|
+
var it = this.h1p_1.h2(asInnerNumeric(this, clause));
|
|
1962
1962
|
var tmp;
|
|
1963
1963
|
if (it == null) {
|
|
1964
1964
|
tmp = null;
|
|
@@ -1970,10 +1970,10 @@
|
|
|
1970
1970
|
return extractFirst_1(this, clause);
|
|
1971
1971
|
}
|
|
1972
1972
|
};
|
|
1973
|
-
protoOf(NumericIndex).
|
|
1973
|
+
protoOf(NumericIndex).p1o = function (clause) {
|
|
1974
1974
|
var tmp;
|
|
1975
1975
|
if (nestedFirstArgument_0(this, clause).xu()) {
|
|
1976
|
-
var tmp0_safe_receiver = this.
|
|
1976
|
+
var tmp0_safe_receiver = this.h1p_1.h2(asInnerNumeric(this, clause));
|
|
1977
1977
|
var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : asSequence(tmp0_safe_receiver);
|
|
1978
1978
|
var tmp_0;
|
|
1979
1979
|
if (tmp1_safe_receiver == null) {
|
|
@@ -1984,36 +1984,36 @@
|
|
|
1984
1984
|
var tmp2_elvis_lhs = tmp_0;
|
|
1985
1985
|
tmp = tmp2_elvis_lhs == null ? emptySequence() : tmp2_elvis_lhs;
|
|
1986
1986
|
} else {
|
|
1987
|
-
tmp = this.
|
|
1987
|
+
tmp = this.r1o(clause);
|
|
1988
1988
|
}
|
|
1989
1989
|
return tmp;
|
|
1990
1990
|
};
|
|
1991
|
-
protoOf(NumericIndex).
|
|
1992
|
-
ensureNotNull(this.
|
|
1991
|
+
protoOf(NumericIndex).l1o = function (indexed) {
|
|
1992
|
+
ensureNotNull(this.h1p_1.h2(asInnerNumeric_0(this, indexed))).z2(indexed);
|
|
1993
1993
|
};
|
|
1994
|
-
protoOf(NumericIndex).
|
|
1994
|
+
protoOf(NumericIndex).q1o = function (clause) {
|
|
1995
1995
|
var tmp;
|
|
1996
1996
|
if (nestedFirstArgument_0(this, clause).xu()) {
|
|
1997
|
-
var partialIndex = this.
|
|
1998
|
-
tmp = partialIndex == null ? emptySequence() : buffered(this.
|
|
1997
|
+
var partialIndex = this.h1p_1.h2(asInnerNumeric(this, clause));
|
|
1998
|
+
tmp = partialIndex == null ? emptySequence() : buffered(this.w1m(partialIndex, clause));
|
|
1999
1999
|
} else {
|
|
2000
2000
|
var tmp_0 = Utils_instance;
|
|
2001
|
-
var tmp_1 = asSequence(this.
|
|
2002
|
-
tmp = buffered(tmp_0.
|
|
2001
|
+
var tmp_1 = asSequence(this.h1p_1.j2());
|
|
2002
|
+
tmp = buffered(tmp_0.t1n(map(tmp_1, NumericIndex$retractAllIndexed$lambda(this, clause))));
|
|
2003
2003
|
}
|
|
2004
2004
|
return tmp;
|
|
2005
2005
|
};
|
|
2006
|
-
protoOf(NumericIndex).
|
|
2007
|
-
var tmp = this.
|
|
2006
|
+
protoOf(NumericIndex).j1l = function (clause) {
|
|
2007
|
+
var tmp = this.q1o(clause);
|
|
2008
2008
|
return map(tmp, NumericIndex$retractAll$lambda);
|
|
2009
2009
|
};
|
|
2010
|
-
protoOf(NumericIndex).
|
|
2010
|
+
protoOf(NumericIndex).z1m = function () {
|
|
2011
2011
|
var tmp = Utils_instance;
|
|
2012
|
-
var tmp_0 = asSequence(this.
|
|
2013
|
-
return tmp.
|
|
2012
|
+
var tmp_0 = asSequence(this.h1p_1.j2());
|
|
2013
|
+
return tmp.t1n(map(tmp_0, NumericIndex$getCache$lambda));
|
|
2014
2014
|
};
|
|
2015
|
-
protoOf(NumericIndex).
|
|
2016
|
-
var tmp = this.
|
|
2015
|
+
protoOf(NumericIndex).r1o = function (clause) {
|
|
2016
|
+
var tmp = this.z1m();
|
|
2017
2017
|
return filter(tmp, NumericIndex$extractGlobalIndexedSequence$lambda(this, clause));
|
|
2018
2018
|
};
|
|
2019
2019
|
function extractFirst_3($this, clause, index) {
|
|
@@ -2024,7 +2024,7 @@
|
|
|
2024
2024
|
var _iterator__ex2g4s = index.n();
|
|
2025
2025
|
while (_iterator__ex2g4s.q()) {
|
|
2026
2026
|
var item = _iterator__ex2g4s.r();
|
|
2027
|
-
if ($this.
|
|
2027
|
+
if ($this.r1k().match(clause, item.v1m())) {
|
|
2028
2028
|
tmp$ret$0 = index_0;
|
|
2029
2029
|
break $l$block;
|
|
2030
2030
|
}
|
|
@@ -2042,69 +2042,69 @@
|
|
|
2042
2042
|
return tmp;
|
|
2043
2043
|
}
|
|
2044
2044
|
function extractGlobalSequence_1($this, clause) {
|
|
2045
|
-
var tmp = $this.
|
|
2045
|
+
var tmp = $this.r1o(clause);
|
|
2046
2046
|
return map(tmp, VariableIndex$extractGlobalSequence$lambda);
|
|
2047
2047
|
}
|
|
2048
2048
|
function VariableIndex$retractAll$lambda(it) {
|
|
2049
|
-
return it.
|
|
2049
|
+
return it.v1m();
|
|
2050
2050
|
}
|
|
2051
2051
|
function VariableIndex$extractGlobalIndexedSequence$lambda(this$0, $clause) {
|
|
2052
2052
|
return function (it) {
|
|
2053
|
-
return this$0.
|
|
2053
|
+
return this$0.r1k().match($clause, it.v1m());
|
|
2054
2054
|
};
|
|
2055
2055
|
}
|
|
2056
2056
|
function VariableIndex$extractGlobalSequence$lambda(it) {
|
|
2057
|
-
return it.
|
|
2057
|
+
return it.v1m();
|
|
2058
2058
|
}
|
|
2059
2059
|
function VariableIndex(unificator, ordered) {
|
|
2060
2060
|
AbstractIndexingLeaf.call(this, unificator);
|
|
2061
|
-
this.
|
|
2062
|
-
this.
|
|
2061
|
+
this.j1p_1 = ordered;
|
|
2062
|
+
this.k1p_1 = dequeOf([]);
|
|
2063
2063
|
}
|
|
2064
2064
|
protoOf(VariableIndex).s = function () {
|
|
2065
|
-
return this.
|
|
2065
|
+
return this.k1p_1.s();
|
|
2066
2066
|
};
|
|
2067
|
-
protoOf(VariableIndex).
|
|
2068
|
-
return this.
|
|
2067
|
+
protoOf(VariableIndex).w1k = function () {
|
|
2068
|
+
return this.k1p_1.h();
|
|
2069
2069
|
};
|
|
2070
|
-
protoOf(VariableIndex).
|
|
2070
|
+
protoOf(VariableIndex).z1k = function (clause) {
|
|
2071
2071
|
return extractGlobalSequence_1(this, clause);
|
|
2072
2072
|
};
|
|
2073
|
-
protoOf(VariableIndex).
|
|
2073
|
+
protoOf(VariableIndex).x1m = function (clause) {
|
|
2074
2074
|
var tmp;
|
|
2075
|
-
if (this.
|
|
2076
|
-
addFirst(this.
|
|
2075
|
+
if (this.j1p_1) {
|
|
2076
|
+
addFirst(this.k1p_1, Companion_instance_8.m1o(clause.e1o(this), this));
|
|
2077
2077
|
tmp = Unit_instance;
|
|
2078
2078
|
} else {
|
|
2079
|
-
this.
|
|
2079
|
+
this.y1m(clause);
|
|
2080
2080
|
tmp = Unit_instance;
|
|
2081
2081
|
}
|
|
2082
2082
|
return tmp;
|
|
2083
2083
|
};
|
|
2084
|
-
protoOf(VariableIndex).
|
|
2085
|
-
this.
|
|
2084
|
+
protoOf(VariableIndex).y1m = function (clause) {
|
|
2085
|
+
this.k1p_1.l(Companion_instance_8.m1o(clause.e1o(this), this));
|
|
2086
2086
|
};
|
|
2087
|
-
protoOf(VariableIndex).
|
|
2088
|
-
var tmp = this.
|
|
2087
|
+
protoOf(VariableIndex).j1l = function (clause) {
|
|
2088
|
+
var tmp = this.q1o(clause);
|
|
2089
2089
|
return map(tmp, VariableIndex$retractAll$lambda);
|
|
2090
2090
|
};
|
|
2091
|
-
protoOf(VariableIndex).
|
|
2092
|
-
return asSequence(this.
|
|
2091
|
+
protoOf(VariableIndex).z1m = function () {
|
|
2092
|
+
return asSequence(this.k1p_1);
|
|
2093
2093
|
};
|
|
2094
|
-
protoOf(VariableIndex).
|
|
2095
|
-
return extractFirst_3(this, clause, this.
|
|
2094
|
+
protoOf(VariableIndex).o1o = function (clause) {
|
|
2095
|
+
return extractFirst_3(this, clause, this.k1p_1);
|
|
2096
2096
|
};
|
|
2097
|
-
protoOf(VariableIndex).
|
|
2098
|
-
return this.
|
|
2097
|
+
protoOf(VariableIndex).p1o = function (clause) {
|
|
2098
|
+
return this.r1o(clause);
|
|
2099
2099
|
};
|
|
2100
|
-
protoOf(VariableIndex).
|
|
2101
|
-
this.
|
|
2100
|
+
protoOf(VariableIndex).l1o = function (indexed) {
|
|
2101
|
+
this.k1p_1.z2(indexed);
|
|
2102
2102
|
};
|
|
2103
|
-
protoOf(VariableIndex).
|
|
2104
|
-
return buffered(this.
|
|
2103
|
+
protoOf(VariableIndex).q1o = function (clause) {
|
|
2104
|
+
return buffered(this.w1m(this.k1p_1, clause));
|
|
2105
2105
|
};
|
|
2106
|
-
protoOf(VariableIndex).
|
|
2107
|
-
var tmp = asSequence(this.
|
|
2106
|
+
protoOf(VariableIndex).r1o = function (clause) {
|
|
2107
|
+
var tmp = asSequence(this.k1p_1);
|
|
2108
2108
|
return filter(tmp, VariableIndex$extractGlobalIndexedSequence$lambda(this, clause));
|
|
2109
2109
|
};
|
|
2110
2110
|
function ArityNode(unificator) {
|
|
@@ -2112,78 +2112,78 @@
|
|
|
2112
2112
|
}
|
|
2113
2113
|
function FamilyArityIndexingNode(unificator, ordered, nestingLevel) {
|
|
2114
2114
|
FamilyArityReteNode.call(this, unificator, ordered, nestingLevel);
|
|
2115
|
-
this.
|
|
2115
|
+
this.t1p_1 = ordered;
|
|
2116
2116
|
}
|
|
2117
|
-
protoOf(FamilyArityIndexingNode).
|
|
2117
|
+
protoOf(FamilyArityIndexingNode).o1o = function (clause) {
|
|
2118
2118
|
var tmp;
|
|
2119
|
-
if (this.
|
|
2120
|
-
tmp = this.
|
|
2119
|
+
if (this.t1p_1) {
|
|
2120
|
+
tmp = this.d1q(clause);
|
|
2121
2121
|
} else {
|
|
2122
|
-
tmp = this.
|
|
2122
|
+
tmp = this.c1q(clause);
|
|
2123
2123
|
}
|
|
2124
2124
|
return tmp;
|
|
2125
2125
|
};
|
|
2126
|
-
protoOf(FamilyArityIndexingNode).
|
|
2126
|
+
protoOf(FamilyArityIndexingNode).p1o = function (clause) {
|
|
2127
2127
|
var tmp;
|
|
2128
|
-
if (this.
|
|
2129
|
-
tmp = this.
|
|
2128
|
+
if (this.t1p_1) {
|
|
2129
|
+
tmp = this.f1q(clause);
|
|
2130
2130
|
} else {
|
|
2131
|
-
tmp = this.
|
|
2131
|
+
tmp = this.e1q(clause);
|
|
2132
2132
|
}
|
|
2133
2133
|
return tmp;
|
|
2134
2134
|
};
|
|
2135
|
-
protoOf(FamilyArityIndexingNode).
|
|
2135
|
+
protoOf(FamilyArityIndexingNode).q1o = function (clause) {
|
|
2136
2136
|
var tmp;
|
|
2137
|
-
if (this.
|
|
2138
|
-
tmp = this.
|
|
2137
|
+
if (this.t1p_1) {
|
|
2138
|
+
tmp = this.h1q(clause);
|
|
2139
2139
|
} else {
|
|
2140
|
-
tmp = this.
|
|
2140
|
+
tmp = this.g1q(clause);
|
|
2141
2141
|
}
|
|
2142
2142
|
return tmp;
|
|
2143
2143
|
};
|
|
2144
|
-
protoOf(FamilyArityIndexingNode).
|
|
2144
|
+
protoOf(FamilyArityIndexingNode).r1o = function (clause) {
|
|
2145
2145
|
var tmp;
|
|
2146
|
-
if (this.
|
|
2147
|
-
tmp = Utils_instance.
|
|
2146
|
+
if (this.t1p_1) {
|
|
2147
|
+
tmp = Utils_instance.r1n([this.y1p_1.r1o(clause), this.x1p_1.r1o(clause), this.z1p_1.r1o(clause), this.a1q_1.r1o(clause)]);
|
|
2148
2148
|
} else {
|
|
2149
|
-
tmp = Utils_instance.
|
|
2149
|
+
tmp = Utils_instance.u1n([this.y1p_1.r1o(clause), this.x1p_1.r1o(clause), this.z1p_1.r1o(clause), this.a1q_1.r1o(clause)]);
|
|
2150
2150
|
}
|
|
2151
2151
|
return tmp;
|
|
2152
2152
|
};
|
|
2153
2153
|
function retractAllOrdered_0($this, clause) {
|
|
2154
|
-
var tmp = $this.
|
|
2154
|
+
var tmp = $this.h1q(clause);
|
|
2155
2155
|
return map(tmp, FamilyArityReteNode$retractAllOrdered$lambda);
|
|
2156
2156
|
}
|
|
2157
2157
|
function getOrdered($this, clause) {
|
|
2158
|
-
var tmp = $this.
|
|
2158
|
+
var tmp = $this.f1q(clause);
|
|
2159
2159
|
return map(tmp, FamilyArityReteNode$getOrdered$lambda);
|
|
2160
2160
|
}
|
|
2161
2161
|
function retractAllUnordered_0($this, clause) {
|
|
2162
|
-
var tmp = $this.
|
|
2162
|
+
var tmp = $this.g1q(clause);
|
|
2163
2163
|
return map(tmp, FamilyArityReteNode$retractAllUnordered$lambda);
|
|
2164
2164
|
}
|
|
2165
2165
|
function getUnordered($this, clause) {
|
|
2166
|
-
var tmp = $this.
|
|
2166
|
+
var tmp = $this.e1q(clause);
|
|
2167
2167
|
return map(tmp, FamilyArityReteNode$getUnordered$lambda);
|
|
2168
2168
|
}
|
|
2169
2169
|
function regenerateCache_0($this) {
|
|
2170
2170
|
var tmp;
|
|
2171
|
-
if ($this.
|
|
2172
|
-
tmp = Utils_instance.
|
|
2171
|
+
if ($this.v1p_1) {
|
|
2172
|
+
tmp = Utils_instance.r1n([$this.y1p_1.z1m(), $this.x1p_1.z1m(), $this.z1p_1.z1m(), $this.a1q_1.z1m()]);
|
|
2173
2173
|
} else {
|
|
2174
|
-
tmp = Utils_instance.
|
|
2174
|
+
tmp = Utils_instance.u1n([$this.y1p_1.z1m(), $this.x1p_1.z1m(), $this.z1p_1.z1m(), $this.a1q_1.z1m()]);
|
|
2175
2175
|
}
|
|
2176
2176
|
return dequeOf_0(tmp);
|
|
2177
2177
|
}
|
|
2178
2178
|
function nestedFirstArgument_1($this, $receiver) {
|
|
2179
|
-
return Utils_instance.
|
|
2179
|
+
return Utils_instance.q1n(ensureNotNull($receiver.dw()), $this.w1p_1 + 1 | 0);
|
|
2180
2180
|
}
|
|
2181
2181
|
function assertByFirstParameter($this, clause) {
|
|
2182
|
-
var innerFirst = nestedFirstArgument_1($this, clause.
|
|
2183
|
-
return innerFirst.xu() ? $this.
|
|
2182
|
+
var innerFirst = nestedFirstArgument_1($this, clause.v1m());
|
|
2183
|
+
return innerFirst.xu() ? $this.x1p_1 : innerFirst.st() ? $this.y1p_1 : innerFirst.tu() ? $this.z1p_1 : $this.a1q_1;
|
|
2184
2184
|
}
|
|
2185
2185
|
function isGlobal_0($this, $receiver) {
|
|
2186
|
-
return Utils_instance.
|
|
2186
|
+
return Utils_instance.q1n(ensureNotNull($receiver.dw()), $this.w1p_1 + 1 | 0).tu();
|
|
2187
2187
|
}
|
|
2188
2188
|
function FamilyArityReteNode$regenerateCache$ref(p0) {
|
|
2189
2189
|
return constructCallableReference(function () {
|
|
@@ -2195,66 +2195,66 @@
|
|
|
2195
2195
|
return it.s();
|
|
2196
2196
|
}
|
|
2197
2197
|
function FamilyArityReteNode$get$lambda(it) {
|
|
2198
|
-
return it.
|
|
2198
|
+
return it.v1m();
|
|
2199
2199
|
}
|
|
2200
2200
|
function FamilyArityReteNode$get$lambda_0(it) {
|
|
2201
|
-
return it.
|
|
2201
|
+
return it.v1m();
|
|
2202
2202
|
}
|
|
2203
2203
|
function FamilyArityReteNode$retractAllOrdered$lambda(it) {
|
|
2204
|
-
return it.
|
|
2204
|
+
return it.v1m();
|
|
2205
2205
|
}
|
|
2206
2206
|
function FamilyArityReteNode$getOrdered$lambda(it) {
|
|
2207
|
-
return it.
|
|
2207
|
+
return it.v1m();
|
|
2208
2208
|
}
|
|
2209
2209
|
function FamilyArityReteNode$retractAllUnordered$lambda(it) {
|
|
2210
|
-
return it.
|
|
2210
|
+
return it.v1m();
|
|
2211
2211
|
}
|
|
2212
2212
|
function FamilyArityReteNode$getUnordered$lambda(it) {
|
|
2213
|
-
return it.
|
|
2213
|
+
return it.v1m();
|
|
2214
2214
|
}
|
|
2215
2215
|
function FamilyArityReteNode(unificator, ordered, nestingLevel) {
|
|
2216
2216
|
ArityNode.call(this, unificator);
|
|
2217
|
-
this.
|
|
2218
|
-
this.
|
|
2219
|
-
this.
|
|
2220
|
-
this.
|
|
2221
|
-
this.
|
|
2222
|
-
this.
|
|
2217
|
+
this.v1p_1 = ordered;
|
|
2218
|
+
this.w1p_1 = nestingLevel;
|
|
2219
|
+
this.x1p_1 = new NumericIndex(unificator, this.v1p_1, this.w1p_1);
|
|
2220
|
+
this.y1p_1 = new AtomIndex(unificator, this.v1p_1, this.w1p_1);
|
|
2221
|
+
this.z1p_1 = new VariableIndex(unificator, this.v1p_1);
|
|
2222
|
+
this.a1q_1 = new CompoundIndex(unificator, this.v1p_1, this.w1p_1 + 1 | 0);
|
|
2223
2223
|
var tmp = this;
|
|
2224
2224
|
var tmp_0 = Companion_instance_1;
|
|
2225
|
-
tmp.
|
|
2225
|
+
tmp.b1q_1 = tmp_0.yo(FamilyArityReteNode$regenerateCache$ref(this));
|
|
2226
2226
|
}
|
|
2227
|
-
protoOf(FamilyArityReteNode).
|
|
2227
|
+
protoOf(FamilyArityReteNode).h1l = function (clause) {
|
|
2228
2228
|
var tmp;
|
|
2229
|
-
if (this.
|
|
2230
|
-
tmp = this.
|
|
2229
|
+
if (this.v1p_1) {
|
|
2230
|
+
tmp = this.d1q(clause);
|
|
2231
2231
|
} else {
|
|
2232
|
-
tmp = this.
|
|
2232
|
+
tmp = this.c1q(clause);
|
|
2233
2233
|
}
|
|
2234
2234
|
var result = tmp;
|
|
2235
2235
|
var tmp_0;
|
|
2236
2236
|
if (result == null) {
|
|
2237
2237
|
tmp_0 = emptySequence();
|
|
2238
2238
|
} else {
|
|
2239
|
-
result.
|
|
2240
|
-
this.
|
|
2241
|
-
tmp_0 = sequenceOf_0(result.
|
|
2239
|
+
result.k1o();
|
|
2240
|
+
this.a1n();
|
|
2241
|
+
tmp_0 = sequenceOf_0(result.v1m());
|
|
2242
2242
|
}
|
|
2243
2243
|
return tmp_0;
|
|
2244
2244
|
};
|
|
2245
2245
|
protoOf(FamilyArityReteNode).s = function () {
|
|
2246
|
-
var tmp = sequenceOf([this.
|
|
2246
|
+
var tmp = sequenceOf([this.x1p_1, this.y1p_1, this.z1p_1, this.a1q_1]);
|
|
2247
2247
|
return sum(map(tmp, FamilyArityReteNode$_get_size_$lambda_sxz8zo));
|
|
2248
2248
|
};
|
|
2249
|
-
protoOf(FamilyArityReteNode).
|
|
2250
|
-
var tmp0 = sequenceOf([this.
|
|
2249
|
+
protoOf(FamilyArityReteNode).w1k = function () {
|
|
2250
|
+
var tmp0 = sequenceOf([this.x1p_1, this.y1p_1, this.z1p_1, this.a1q_1]);
|
|
2251
2251
|
var tmp$ret$0;
|
|
2252
2252
|
$l$block: {
|
|
2253
2253
|
// Inline function 'kotlin.sequences.all' call
|
|
2254
2254
|
var _iterator__ex2g4s = tmp0.n();
|
|
2255
2255
|
while (_iterator__ex2g4s.q()) {
|
|
2256
2256
|
var element = _iterator__ex2g4s.r();
|
|
2257
|
-
if (!element.
|
|
2257
|
+
if (!element.w1k()) {
|
|
2258
2258
|
tmp$ret$0 = false;
|
|
2259
2259
|
break $l$block;
|
|
2260
2260
|
}
|
|
@@ -2263,21 +2263,21 @@
|
|
|
2263
2263
|
}
|
|
2264
2264
|
return tmp$ret$0;
|
|
2265
2265
|
};
|
|
2266
|
-
protoOf(FamilyArityReteNode).
|
|
2266
|
+
protoOf(FamilyArityReteNode).z1k = function (clause) {
|
|
2267
2267
|
var tmp;
|
|
2268
2268
|
if (isGlobal_0(this, clause)) {
|
|
2269
2269
|
var tmp_0;
|
|
2270
|
-
if (this.
|
|
2271
|
-
var tmp_1 = Utils_instance.
|
|
2270
|
+
if (this.v1p_1) {
|
|
2271
|
+
var tmp_1 = Utils_instance.r1n([this.y1p_1.r1o(clause), this.z1p_1.r1o(clause), this.x1p_1.r1o(clause), this.a1q_1.r1o(clause)]);
|
|
2272
2272
|
tmp_0 = map(tmp_1, FamilyArityReteNode$get$lambda);
|
|
2273
2273
|
} else {
|
|
2274
|
-
var tmp_2 = Utils_instance.
|
|
2274
|
+
var tmp_2 = Utils_instance.u1n([this.y1p_1.r1o(clause), this.z1p_1.r1o(clause), this.x1p_1.r1o(clause), this.a1q_1.r1o(clause)]);
|
|
2275
2275
|
tmp_0 = map(tmp_2, FamilyArityReteNode$get$lambda_0);
|
|
2276
2276
|
}
|
|
2277
2277
|
tmp = tmp_0;
|
|
2278
2278
|
} else {
|
|
2279
2279
|
var tmp_3;
|
|
2280
|
-
if (this.
|
|
2280
|
+
if (this.v1p_1) {
|
|
2281
2281
|
tmp_3 = getOrdered(this, clause);
|
|
2282
2282
|
} else {
|
|
2283
2283
|
tmp_3 = getUnordered(this, clause);
|
|
@@ -2286,94 +2286,94 @@
|
|
|
2286
2286
|
}
|
|
2287
2287
|
return tmp;
|
|
2288
2288
|
};
|
|
2289
|
-
protoOf(FamilyArityReteNode).
|
|
2290
|
-
return assertByFirstParameter(this, clause).
|
|
2289
|
+
protoOf(FamilyArityReteNode).x1m = function (clause) {
|
|
2290
|
+
return assertByFirstParameter(this, clause).x1m(clause.e1o(this));
|
|
2291
2291
|
};
|
|
2292
|
-
protoOf(FamilyArityReteNode).
|
|
2293
|
-
return assertByFirstParameter(this, clause).
|
|
2292
|
+
protoOf(FamilyArityReteNode).y1m = function (clause) {
|
|
2293
|
+
return assertByFirstParameter(this, clause).y1m(clause.e1o(this));
|
|
2294
2294
|
};
|
|
2295
|
-
protoOf(FamilyArityReteNode).
|
|
2295
|
+
protoOf(FamilyArityReteNode).j1l = function (clause) {
|
|
2296
2296
|
var tmp;
|
|
2297
|
-
if (this.
|
|
2297
|
+
if (this.v1p_1) {
|
|
2298
2298
|
tmp = retractAllOrdered_0(this, clause);
|
|
2299
2299
|
} else {
|
|
2300
2300
|
tmp = retractAllUnordered_0(this, clause);
|
|
2301
2301
|
}
|
|
2302
2302
|
return tmp;
|
|
2303
2303
|
};
|
|
2304
|
-
protoOf(FamilyArityReteNode).
|
|
2305
|
-
return asSequence(this.
|
|
2304
|
+
protoOf(FamilyArityReteNode).z1m = function () {
|
|
2305
|
+
return asSequence(this.b1q_1.e2());
|
|
2306
2306
|
};
|
|
2307
|
-
protoOf(FamilyArityReteNode).
|
|
2307
|
+
protoOf(FamilyArityReteNode).h1q = function (clause) {
|
|
2308
2308
|
var innerFirst = nestedFirstArgument_1(this, clause);
|
|
2309
2309
|
var tmp;
|
|
2310
2310
|
if (innerFirst.xu()) {
|
|
2311
|
-
tmp = Utils_instance.
|
|
2311
|
+
tmp = Utils_instance.r1n([this.z1p_1.q1o(clause), this.x1p_1.q1o(clause)]);
|
|
2312
2312
|
} else if (innerFirst.st()) {
|
|
2313
|
-
tmp = Utils_instance.
|
|
2313
|
+
tmp = Utils_instance.r1n([this.z1p_1.q1o(clause), this.y1p_1.q1o(clause)]);
|
|
2314
2314
|
} else if (innerFirst.tu()) {
|
|
2315
|
-
tmp = Utils_instance.
|
|
2315
|
+
tmp = Utils_instance.r1n([this.z1p_1.q1o(clause), this.x1p_1.q1o(clause), this.y1p_1.q1o(clause), this.a1q_1.q1o(clause)]);
|
|
2316
2316
|
} else {
|
|
2317
|
-
tmp = Utils_instance.
|
|
2317
|
+
tmp = Utils_instance.r1n([this.z1p_1.q1o(clause), this.a1q_1.q1o(clause)]);
|
|
2318
2318
|
}
|
|
2319
2319
|
return tmp;
|
|
2320
2320
|
};
|
|
2321
|
-
protoOf(FamilyArityReteNode).
|
|
2321
|
+
protoOf(FamilyArityReteNode).g1q = function (clause) {
|
|
2322
2322
|
var innerFirst = nestedFirstArgument_1(this, clause);
|
|
2323
|
-
return innerFirst.xu() ? Utils_instance.
|
|
2323
|
+
return innerFirst.xu() ? Utils_instance.u1n([this.z1p_1.q1o(clause), this.x1p_1.q1o(clause)]) : innerFirst.st() ? Utils_instance.u1n([this.z1p_1.q1o(clause), this.y1p_1.q1o(clause)]) : innerFirst.tu() ? Utils_instance.u1n([this.z1p_1.q1o(clause), this.x1p_1.q1o(clause), this.y1p_1.q1o(clause), this.a1q_1.q1o(clause)]) : Utils_instance.u1n([this.z1p_1.q1o(clause), this.a1q_1.q1o(clause)]);
|
|
2324
2324
|
};
|
|
2325
|
-
protoOf(FamilyArityReteNode).
|
|
2325
|
+
protoOf(FamilyArityReteNode).f1q = function (clause) {
|
|
2326
2326
|
var innerFirst = nestedFirstArgument_1(this, clause);
|
|
2327
|
-
return innerFirst.xu() ? Utils_instance.
|
|
2327
|
+
return innerFirst.xu() ? Utils_instance.r1n([this.z1p_1.p1o(clause), this.x1p_1.p1o(clause)]) : innerFirst.st() ? Utils_instance.r1n([this.z1p_1.p1o(clause), this.y1p_1.p1o(clause)]) : innerFirst.tu() ? Utils_instance.r1n([this.z1p_1.p1o(clause), this.x1p_1.p1o(clause), this.y1p_1.p1o(clause), this.a1q_1.p1o(clause)]) : Utils_instance.r1n([this.z1p_1.p1o(clause), this.a1q_1.p1o(clause)]);
|
|
2328
2328
|
};
|
|
2329
|
-
protoOf(FamilyArityReteNode).
|
|
2329
|
+
protoOf(FamilyArityReteNode).e1q = function (clause) {
|
|
2330
2330
|
var innerFirst = nestedFirstArgument_1(this, clause);
|
|
2331
|
-
return innerFirst.xu() ? Utils_instance.
|
|
2331
|
+
return innerFirst.xu() ? Utils_instance.u1n([this.z1p_1.p1o(clause), this.x1p_1.p1o(clause)]) : innerFirst.st() ? Utils_instance.u1n([this.z1p_1.p1o(clause), this.y1p_1.p1o(clause)]) : innerFirst.tu() ? Utils_instance.u1n([this.z1p_1.p1o(clause), this.x1p_1.p1o(clause), this.y1p_1.p1o(clause), this.a1q_1.p1o(clause)]) : Utils_instance.u1n([this.z1p_1.p1o(clause), this.a1q_1.p1o(clause)]);
|
|
2332
2332
|
};
|
|
2333
|
-
protoOf(FamilyArityReteNode).
|
|
2333
|
+
protoOf(FamilyArityReteNode).c1q = function (clause) {
|
|
2334
2334
|
var innerFirst = nestedFirstArgument_1(this, clause);
|
|
2335
2335
|
var tmp;
|
|
2336
2336
|
if (innerFirst.xu()) {
|
|
2337
|
-
var tmp0_elvis_lhs = this.
|
|
2338
|
-
tmp = tmp0_elvis_lhs == null ? this.
|
|
2337
|
+
var tmp0_elvis_lhs = this.z1p_1.o1o(clause);
|
|
2338
|
+
tmp = tmp0_elvis_lhs == null ? this.x1p_1.o1o(clause) : tmp0_elvis_lhs;
|
|
2339
2339
|
} else if (innerFirst.st()) {
|
|
2340
|
-
var tmp1_elvis_lhs = this.
|
|
2341
|
-
tmp = tmp1_elvis_lhs == null ? this.
|
|
2340
|
+
var tmp1_elvis_lhs = this.z1p_1.o1o(clause);
|
|
2341
|
+
tmp = tmp1_elvis_lhs == null ? this.y1p_1.o1o(clause) : tmp1_elvis_lhs;
|
|
2342
2342
|
} else if (innerFirst.tu()) {
|
|
2343
|
-
var tmp2_elvis_lhs = this.
|
|
2344
|
-
var tmp3_elvis_lhs = tmp2_elvis_lhs == null ? this.
|
|
2345
|
-
var tmp4_elvis_lhs = tmp3_elvis_lhs == null ? this.
|
|
2346
|
-
tmp = tmp4_elvis_lhs == null ? this.
|
|
2343
|
+
var tmp2_elvis_lhs = this.z1p_1.o1o(clause);
|
|
2344
|
+
var tmp3_elvis_lhs = tmp2_elvis_lhs == null ? this.x1p_1.o1o(clause) : tmp2_elvis_lhs;
|
|
2345
|
+
var tmp4_elvis_lhs = tmp3_elvis_lhs == null ? this.y1p_1.o1o(clause) : tmp3_elvis_lhs;
|
|
2346
|
+
tmp = tmp4_elvis_lhs == null ? this.a1q_1.o1o(clause) : tmp4_elvis_lhs;
|
|
2347
2347
|
} else {
|
|
2348
|
-
var tmp5_elvis_lhs = this.
|
|
2349
|
-
tmp = tmp5_elvis_lhs == null ? this.
|
|
2348
|
+
var tmp5_elvis_lhs = this.z1p_1.o1o(clause);
|
|
2349
|
+
tmp = tmp5_elvis_lhs == null ? this.a1q_1.o1o(clause) : tmp5_elvis_lhs;
|
|
2350
2350
|
}
|
|
2351
2351
|
return tmp;
|
|
2352
2352
|
};
|
|
2353
|
-
protoOf(FamilyArityReteNode).
|
|
2353
|
+
protoOf(FamilyArityReteNode).d1q = function (clause) {
|
|
2354
2354
|
var innerFirst = nestedFirstArgument_1(this, clause);
|
|
2355
2355
|
var tmp;
|
|
2356
2356
|
if (innerFirst.xu()) {
|
|
2357
|
-
tmp = Utils_instance.
|
|
2357
|
+
tmp = Utils_instance.a1o(this.x1p_1.o1o(clause), this.z1p_1.o1o(clause));
|
|
2358
2358
|
} else if (innerFirst.st()) {
|
|
2359
|
-
tmp = Utils_instance.
|
|
2359
|
+
tmp = Utils_instance.a1o(this.y1p_1.o1o(clause), this.z1p_1.o1o(clause));
|
|
2360
2360
|
} else if (innerFirst.tu()) {
|
|
2361
|
-
tmp = Utils_instance.
|
|
2361
|
+
tmp = Utils_instance.a1o(Utils_instance.a1o(this.x1p_1.o1o(clause), this.y1p_1.o1o(clause)), Utils_instance.a1o(this.z1p_1.o1o(clause), this.a1q_1.o1o(clause)));
|
|
2362
2362
|
} else {
|
|
2363
|
-
tmp = Utils_instance.
|
|
2363
|
+
tmp = Utils_instance.a1o(this.z1p_1.o1o(clause), this.a1q_1.o1o(clause));
|
|
2364
2364
|
}
|
|
2365
2365
|
return tmp;
|
|
2366
2366
|
};
|
|
2367
|
-
protoOf(FamilyArityReteNode).
|
|
2368
|
-
this.
|
|
2367
|
+
protoOf(FamilyArityReteNode).a1n = function () {
|
|
2368
|
+
this.b1q_1.ap();
|
|
2369
2369
|
};
|
|
2370
2370
|
function isGlobal_1($this, $receiver) {
|
|
2371
|
-
return $receiver.fu() && Utils_instance.
|
|
2371
|
+
return $receiver.fu() && Utils_instance.q1n($receiver.castToRule().dw(), $this.k1q_1).tu();
|
|
2372
2372
|
}
|
|
2373
2373
|
function nestedArity($this, $receiver) {
|
|
2374
2374
|
var tmp0_safe_receiver = $receiver.asRule();
|
|
2375
2375
|
var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.dw();
|
|
2376
|
-
var tmp2_elvis_lhs = tmp1_safe_receiver == null ? null : Utils_instance.
|
|
2376
|
+
var tmp2_elvis_lhs = tmp1_safe_receiver == null ? null : Utils_instance.o1n(tmp1_safe_receiver, $this.k1q_1);
|
|
2377
2377
|
var tmp;
|
|
2378
2378
|
if (tmp2_elvis_lhs == null) {
|
|
2379
2379
|
// Inline function 'kotlin.error' call
|
|
@@ -2385,36 +2385,36 @@
|
|
|
2385
2385
|
return tmp;
|
|
2386
2386
|
}
|
|
2387
2387
|
function nestedArity_0($this, $receiver) {
|
|
2388
|
-
return Utils_instance.
|
|
2388
|
+
return Utils_instance.o1n(ensureNotNull($receiver.v1m().dw()), $this.k1q_1);
|
|
2389
2389
|
}
|
|
2390
2390
|
function regenerateCache_1($this) {
|
|
2391
2391
|
var tmp;
|
|
2392
|
-
if ($this.
|
|
2392
|
+
if ($this.j1q_1) {
|
|
2393
2393
|
var tmp_0 = Utils_instance;
|
|
2394
2394
|
// Inline function 'kotlin.collections.map' call
|
|
2395
|
-
var this_0 = $this.
|
|
2395
|
+
var this_0 = $this.l1q_1.j2();
|
|
2396
2396
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2397
2397
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2398
2398
|
var _iterator__ex2g4s = this_0.n();
|
|
2399
2399
|
while (_iterator__ex2g4s.q()) {
|
|
2400
2400
|
var item = _iterator__ex2g4s.r();
|
|
2401
|
-
var tmp$ret$2 = item.
|
|
2401
|
+
var tmp$ret$2 = item.z1m();
|
|
2402
2402
|
destination.l(tmp$ret$2);
|
|
2403
2403
|
}
|
|
2404
|
-
tmp = tmp_0.
|
|
2404
|
+
tmp = tmp_0.s1n(destination);
|
|
2405
2405
|
} else {
|
|
2406
2406
|
var tmp_1 = Utils_instance;
|
|
2407
2407
|
// Inline function 'kotlin.collections.map' call
|
|
2408
|
-
var this_1 = $this.
|
|
2408
|
+
var this_1 = $this.l1q_1.j2();
|
|
2409
2409
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2410
2410
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
2411
2411
|
var _iterator__ex2g4s_0 = this_1.n();
|
|
2412
2412
|
while (_iterator__ex2g4s_0.q()) {
|
|
2413
2413
|
var item_0 = _iterator__ex2g4s_0.r();
|
|
2414
|
-
var tmp$ret$5 = item_0.
|
|
2414
|
+
var tmp$ret$5 = item_0.z1m();
|
|
2415
2415
|
destination_0.l(tmp$ret$5);
|
|
2416
2416
|
}
|
|
2417
|
-
tmp = tmp_1.
|
|
2417
|
+
tmp = tmp_1.w1n(destination_0);
|
|
2418
2418
|
}
|
|
2419
2419
|
return dequeOf_0(tmp);
|
|
2420
2420
|
}
|
|
@@ -2429,30 +2429,30 @@
|
|
|
2429
2429
|
}
|
|
2430
2430
|
function FunctorIndexingNode$retractAllIndexed$lambda(this$0, $clause) {
|
|
2431
2431
|
return function (it) {
|
|
2432
|
-
return this$0.
|
|
2432
|
+
return this$0.r1k().match($clause, it.v1m());
|
|
2433
2433
|
};
|
|
2434
2434
|
}
|
|
2435
2435
|
function FunctorIndexingNode(unificator, ordered, nestingLevel) {
|
|
2436
2436
|
FunctorNode.call(this, unificator);
|
|
2437
|
-
this.
|
|
2438
|
-
this.
|
|
2437
|
+
this.j1q_1 = ordered;
|
|
2438
|
+
this.k1q_1 = nestingLevel;
|
|
2439
2439
|
var tmp = this;
|
|
2440
2440
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
2441
|
-
tmp.
|
|
2441
|
+
tmp.l1q_1 = LinkedHashMap_init_$Create$();
|
|
2442
2442
|
var tmp_0 = this;
|
|
2443
2443
|
var tmp_1 = Companion_instance_1;
|
|
2444
|
-
tmp_0.
|
|
2444
|
+
tmp_0.m1q_1 = tmp_1.yo(FunctorIndexingNode$regenerateCache$ref(this));
|
|
2445
2445
|
}
|
|
2446
2446
|
protoOf(FunctorIndexingNode).s = function () {
|
|
2447
|
-
var tmp = asSequence(this.
|
|
2447
|
+
var tmp = asSequence(this.l1q_1.j2());
|
|
2448
2448
|
return sum(map(tmp, FunctorIndexingNode$_get_size_$lambda_vcufvm));
|
|
2449
2449
|
};
|
|
2450
|
-
protoOf(FunctorIndexingNode).
|
|
2450
|
+
protoOf(FunctorIndexingNode).w1k = function () {
|
|
2451
2451
|
var tmp;
|
|
2452
|
-
if (this.
|
|
2452
|
+
if (this.l1q_1.h()) {
|
|
2453
2453
|
tmp = true;
|
|
2454
2454
|
} else {
|
|
2455
|
-
var tmp0 = this.
|
|
2455
|
+
var tmp0 = this.l1q_1.j2();
|
|
2456
2456
|
var tmp$ret$0;
|
|
2457
2457
|
$l$block_0: {
|
|
2458
2458
|
// Inline function 'kotlin.collections.all' call
|
|
@@ -2469,7 +2469,7 @@
|
|
|
2469
2469
|
var _iterator__ex2g4s = tmp0.n();
|
|
2470
2470
|
while (_iterator__ex2g4s.q()) {
|
|
2471
2471
|
var element = _iterator__ex2g4s.r();
|
|
2472
|
-
if (!element.
|
|
2472
|
+
if (!element.w1k()) {
|
|
2473
2473
|
tmp$ret$0 = false;
|
|
2474
2474
|
break $l$block_0;
|
|
2475
2475
|
}
|
|
@@ -2480,71 +2480,71 @@
|
|
|
2480
2480
|
}
|
|
2481
2481
|
return tmp;
|
|
2482
2482
|
};
|
|
2483
|
-
protoOf(FunctorIndexingNode).
|
|
2484
|
-
var tmp0_safe_receiver = this.
|
|
2485
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2483
|
+
protoOf(FunctorIndexingNode).z1k = function (clause) {
|
|
2484
|
+
var tmp0_safe_receiver = this.l1q_1.h2(nestedArity(this, clause));
|
|
2485
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.z1k(clause);
|
|
2486
2486
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2487
2487
|
};
|
|
2488
|
-
protoOf(FunctorIndexingNode).
|
|
2489
|
-
var tmp0 = this.
|
|
2488
|
+
protoOf(FunctorIndexingNode).x1m = function (clause) {
|
|
2489
|
+
var tmp0 = this.l1q_1;
|
|
2490
2490
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2491
2491
|
var key = nestedArity_0(this, clause);
|
|
2492
2492
|
var value = tmp0.h2(key);
|
|
2493
2493
|
var tmp;
|
|
2494
2494
|
if (value == null) {
|
|
2495
|
-
var answer = new FamilyArityIndexingNode(this.
|
|
2495
|
+
var answer = new FamilyArityIndexingNode(this.r1k(), this.j1q_1, this.k1q_1);
|
|
2496
2496
|
tmp0.k4(key, answer);
|
|
2497
2497
|
tmp = answer;
|
|
2498
2498
|
} else {
|
|
2499
2499
|
tmp = value;
|
|
2500
2500
|
}
|
|
2501
|
-
tmp.
|
|
2501
|
+
tmp.x1m(clause.e1o(this));
|
|
2502
2502
|
};
|
|
2503
|
-
protoOf(FunctorIndexingNode).
|
|
2504
|
-
var tmp0 = this.
|
|
2503
|
+
protoOf(FunctorIndexingNode).y1m = function (clause) {
|
|
2504
|
+
var tmp0 = this.l1q_1;
|
|
2505
2505
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2506
2506
|
var key = nestedArity_0(this, clause);
|
|
2507
2507
|
var value = tmp0.h2(key);
|
|
2508
2508
|
var tmp;
|
|
2509
2509
|
if (value == null) {
|
|
2510
|
-
var answer = new FamilyArityIndexingNode(this.
|
|
2510
|
+
var answer = new FamilyArityIndexingNode(this.r1k(), this.j1q_1, this.k1q_1);
|
|
2511
2511
|
tmp0.k4(key, answer);
|
|
2512
2512
|
tmp = answer;
|
|
2513
2513
|
} else {
|
|
2514
2514
|
tmp = value;
|
|
2515
2515
|
}
|
|
2516
|
-
tmp.
|
|
2516
|
+
tmp.y1m(clause.e1o(this));
|
|
2517
2517
|
};
|
|
2518
|
-
protoOf(FunctorIndexingNode).
|
|
2519
|
-
var tmp0_safe_receiver = this.
|
|
2520
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2518
|
+
protoOf(FunctorIndexingNode).j1l = function (clause) {
|
|
2519
|
+
var tmp0_safe_receiver = this.l1q_1.h2(nestedArity(this, clause));
|
|
2520
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.j1l(clause);
|
|
2521
2521
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2522
2522
|
};
|
|
2523
|
-
protoOf(FunctorIndexingNode).
|
|
2524
|
-
return asSequence(this.
|
|
2523
|
+
protoOf(FunctorIndexingNode).z1m = function () {
|
|
2524
|
+
return asSequence(this.m1q_1.e2());
|
|
2525
2525
|
};
|
|
2526
|
-
protoOf(FunctorIndexingNode).
|
|
2526
|
+
protoOf(FunctorIndexingNode).o1o = function (clause) {
|
|
2527
2527
|
var tmp;
|
|
2528
2528
|
if (isGlobal_1(this, clause)) {
|
|
2529
2529
|
var tmp_0 = Utils_instance;
|
|
2530
2530
|
// Inline function 'kotlin.collections.map' call
|
|
2531
|
-
var this_0 = this.
|
|
2531
|
+
var this_0 = this.l1q_1.j2();
|
|
2532
2532
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2533
2533
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2534
2534
|
var _iterator__ex2g4s = this_0.n();
|
|
2535
2535
|
while (_iterator__ex2g4s.q()) {
|
|
2536
2536
|
var item = _iterator__ex2g4s.r();
|
|
2537
|
-
var tmp$ret$2 = item.
|
|
2537
|
+
var tmp$ret$2 = item.r1o(clause);
|
|
2538
2538
|
destination.l(tmp$ret$2);
|
|
2539
2539
|
}
|
|
2540
|
-
var tmp0 = tmp_0.
|
|
2540
|
+
var tmp0 = tmp_0.s1n(destination);
|
|
2541
2541
|
var tmp$ret$3;
|
|
2542
2542
|
$l$block: {
|
|
2543
2543
|
// Inline function 'kotlin.sequences.firstOrNull' call
|
|
2544
2544
|
var _iterator__ex2g4s_0 = tmp0.n();
|
|
2545
2545
|
while (_iterator__ex2g4s_0.q()) {
|
|
2546
2546
|
var element = _iterator__ex2g4s_0.r();
|
|
2547
|
-
if (this.
|
|
2547
|
+
if (this.r1k().match(clause, element.v1m())) {
|
|
2548
2548
|
tmp$ret$3 = element;
|
|
2549
2549
|
break $l$block;
|
|
2550
2550
|
}
|
|
@@ -2553,125 +2553,125 @@
|
|
|
2553
2553
|
}
|
|
2554
2554
|
tmp = tmp$ret$3;
|
|
2555
2555
|
} else {
|
|
2556
|
-
var tmp0_safe_receiver = this.
|
|
2557
|
-
tmp = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2556
|
+
var tmp0_safe_receiver = this.l1q_1.h2(nestedArity(this, clause));
|
|
2557
|
+
tmp = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.o1o(clause);
|
|
2558
2558
|
}
|
|
2559
2559
|
return tmp;
|
|
2560
2560
|
};
|
|
2561
|
-
protoOf(FunctorIndexingNode).
|
|
2561
|
+
protoOf(FunctorIndexingNode).p1o = function (clause) {
|
|
2562
2562
|
var tmp;
|
|
2563
2563
|
if (isGlobal_1(this, clause)) {
|
|
2564
2564
|
var tmp_0 = Utils_instance;
|
|
2565
2565
|
// Inline function 'kotlin.collections.map' call
|
|
2566
|
-
var this_0 = this.
|
|
2566
|
+
var this_0 = this.l1q_1.j2();
|
|
2567
2567
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2568
2568
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2569
2569
|
var _iterator__ex2g4s = this_0.n();
|
|
2570
2570
|
while (_iterator__ex2g4s.q()) {
|
|
2571
2571
|
var item = _iterator__ex2g4s.r();
|
|
2572
|
-
var tmp$ret$2 = item.
|
|
2572
|
+
var tmp$ret$2 = item.r1o(clause);
|
|
2573
2573
|
destination.l(tmp$ret$2);
|
|
2574
2574
|
}
|
|
2575
|
-
tmp = tmp_0.
|
|
2575
|
+
tmp = tmp_0.s1n(destination);
|
|
2576
2576
|
} else {
|
|
2577
|
-
var tmp0_safe_receiver = this.
|
|
2578
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2577
|
+
var tmp0_safe_receiver = this.l1q_1.h2(nestedArity(this, clause));
|
|
2578
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.p1o(clause);
|
|
2579
2579
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2580
2580
|
}
|
|
2581
2581
|
return tmp;
|
|
2582
2582
|
};
|
|
2583
|
-
protoOf(FunctorIndexingNode).
|
|
2583
|
+
protoOf(FunctorIndexingNode).q1o = function (clause) {
|
|
2584
2584
|
var tmp;
|
|
2585
2585
|
if (isGlobal_1(this, clause)) {
|
|
2586
2586
|
var tmp_0 = Utils_instance;
|
|
2587
2587
|
// Inline function 'kotlin.collections.map' call
|
|
2588
|
-
var this_0 = this.
|
|
2588
|
+
var this_0 = this.l1q_1.j2();
|
|
2589
2589
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2590
2590
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2591
2591
|
var _iterator__ex2g4s = this_0.n();
|
|
2592
2592
|
while (_iterator__ex2g4s.q()) {
|
|
2593
2593
|
var item = _iterator__ex2g4s.r();
|
|
2594
|
-
var tmp$ret$2 = item.
|
|
2594
|
+
var tmp$ret$2 = item.r1o(clause);
|
|
2595
2595
|
destination.l(tmp$ret$2);
|
|
2596
2596
|
}
|
|
2597
|
-
var tmp_1 = tmp_0.
|
|
2597
|
+
var tmp_1 = tmp_0.s1n(destination);
|
|
2598
2598
|
var partialResult = toList(filter(tmp_1, FunctorIndexingNode$retractAllIndexed$lambda(this, clause)));
|
|
2599
2599
|
// Inline function 'kotlin.collections.isNotEmpty' call
|
|
2600
2600
|
if (!partialResult.h()) {
|
|
2601
|
-
this.
|
|
2601
|
+
this.a1n();
|
|
2602
2602
|
// Inline function 'kotlin.collections.forEach' call
|
|
2603
2603
|
var _iterator__ex2g4s_0 = partialResult.n();
|
|
2604
2604
|
while (_iterator__ex2g4s_0.q()) {
|
|
2605
2605
|
var element = _iterator__ex2g4s_0.r();
|
|
2606
|
-
element.
|
|
2606
|
+
element.k1o();
|
|
2607
2607
|
}
|
|
2608
2608
|
}
|
|
2609
2609
|
tmp = asSequence(partialResult);
|
|
2610
2610
|
} else {
|
|
2611
|
-
var tmp0_safe_receiver = this.
|
|
2612
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2611
|
+
var tmp0_safe_receiver = this.l1q_1.h2(nestedArity(this, clause));
|
|
2612
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.q1o(clause);
|
|
2613
2613
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2614
2614
|
}
|
|
2615
2615
|
return tmp;
|
|
2616
2616
|
};
|
|
2617
|
-
protoOf(FunctorIndexingNode).
|
|
2617
|
+
protoOf(FunctorIndexingNode).r1o = function (clause) {
|
|
2618
2618
|
var tmp;
|
|
2619
|
-
if (this.
|
|
2619
|
+
if (this.j1q_1) {
|
|
2620
2620
|
var tmp_0 = Utils_instance;
|
|
2621
2621
|
// Inline function 'kotlin.collections.map' call
|
|
2622
|
-
var this_0 = this.
|
|
2622
|
+
var this_0 = this.l1q_1.j2();
|
|
2623
2623
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2624
2624
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2625
2625
|
var _iterator__ex2g4s = this_0.n();
|
|
2626
2626
|
while (_iterator__ex2g4s.q()) {
|
|
2627
2627
|
var item = _iterator__ex2g4s.r();
|
|
2628
|
-
var tmp$ret$2 = item.
|
|
2628
|
+
var tmp$ret$2 = item.r1o(clause);
|
|
2629
2629
|
destination.l(tmp$ret$2);
|
|
2630
2630
|
}
|
|
2631
|
-
tmp = tmp_0.
|
|
2631
|
+
tmp = tmp_0.s1n(destination);
|
|
2632
2632
|
} else {
|
|
2633
2633
|
var tmp_1 = Utils_instance;
|
|
2634
2634
|
// Inline function 'kotlin.collections.map' call
|
|
2635
|
-
var this_1 = this.
|
|
2635
|
+
var this_1 = this.l1q_1.j2();
|
|
2636
2636
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2637
2637
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
2638
2638
|
var _iterator__ex2g4s_0 = this_1.n();
|
|
2639
2639
|
while (_iterator__ex2g4s_0.q()) {
|
|
2640
2640
|
var item_0 = _iterator__ex2g4s_0.r();
|
|
2641
|
-
var tmp$ret$5 = item_0.
|
|
2641
|
+
var tmp$ret$5 = item_0.r1o(clause);
|
|
2642
2642
|
destination_0.l(tmp$ret$5);
|
|
2643
2643
|
}
|
|
2644
|
-
tmp = tmp_1.
|
|
2644
|
+
tmp = tmp_1.w1n(destination_0);
|
|
2645
2645
|
}
|
|
2646
2646
|
return tmp;
|
|
2647
2647
|
};
|
|
2648
|
-
protoOf(FunctorIndexingNode).
|
|
2649
|
-
this.
|
|
2648
|
+
protoOf(FunctorIndexingNode).a1n = function () {
|
|
2649
|
+
this.m1q_1.ap();
|
|
2650
2650
|
};
|
|
2651
2651
|
function FunctorNode(unificator) {
|
|
2652
2652
|
AbstractReteNode.call(this, unificator);
|
|
2653
2653
|
}
|
|
2654
2654
|
function assignHigherIndex($this, clause) {
|
|
2655
2655
|
var tmp = Companion_instance_7;
|
|
2656
|
-
$this.
|
|
2657
|
-
return tmp.
|
|
2656
|
+
$this.t1q_1 = add($this.t1q_1, get_ONE());
|
|
2657
|
+
return tmp.g1o($this.t1q_1, clause, [$this]);
|
|
2658
2658
|
}
|
|
2659
2659
|
function assignLowerIndex($this, clause) {
|
|
2660
2660
|
var tmp = Companion_instance_7;
|
|
2661
|
-
$this.
|
|
2662
|
-
return tmp.
|
|
2661
|
+
$this.s1q_1 = subtract($this.s1q_1, get_ONE());
|
|
2662
|
+
return tmp.g1o($this.s1q_1, clause, [$this]);
|
|
2663
2663
|
}
|
|
2664
2664
|
function regenerateCache_2($this) {
|
|
2665
2665
|
var tmp;
|
|
2666
|
-
if ($this.
|
|
2667
|
-
var tmp_0 = Utils_instance.
|
|
2666
|
+
if ($this.o1q_1) {
|
|
2667
|
+
var tmp_0 = Utils_instance.r1n([$this.r1q_1.z1m(), $this.q1q_1.z1m()]);
|
|
2668
2668
|
tmp = map(tmp_0, RootNode$regenerateCache$lambda);
|
|
2669
2669
|
} else {
|
|
2670
2670
|
var tmp_1 = Utils_instance;
|
|
2671
|
-
var tmp_2 = $this.
|
|
2671
|
+
var tmp_2 = $this.r1q_1.z1m();
|
|
2672
2672
|
var tmp_3 = map(tmp_2, RootNode$regenerateCache$lambda_0);
|
|
2673
|
-
var tmp_4 = $this.
|
|
2674
|
-
tmp = tmp_1.
|
|
2673
|
+
var tmp_4 = $this.q1q_1.z1m();
|
|
2674
|
+
tmp = tmp_1.x1n([tmp_3, map(tmp_4, RootNode$regenerateCache$lambda_1)]);
|
|
2675
2675
|
}
|
|
2676
2676
|
return dequeOf_0(tmp);
|
|
2677
2677
|
}
|
|
@@ -2699,146 +2699,146 @@
|
|
|
2699
2699
|
};
|
|
2700
2700
|
}
|
|
2701
2701
|
function RootNode$regenerateCache$lambda(it) {
|
|
2702
|
-
return it.
|
|
2702
|
+
return it.v1m();
|
|
2703
2703
|
}
|
|
2704
2704
|
function RootNode$regenerateCache$lambda_0(it) {
|
|
2705
|
-
return it.
|
|
2705
|
+
return it.v1m();
|
|
2706
2706
|
}
|
|
2707
2707
|
function RootNode$regenerateCache$lambda_1(it) {
|
|
2708
|
-
return it.
|
|
2708
|
+
return it.v1m();
|
|
2709
2709
|
}
|
|
2710
2710
|
function RootNode(unificator, clauses, isOrdered) {
|
|
2711
|
-
this.
|
|
2712
|
-
this.
|
|
2711
|
+
this.n1q_1 = unificator;
|
|
2712
|
+
this.o1q_1 = isOrdered;
|
|
2713
2713
|
var tmp = this;
|
|
2714
2714
|
var tmp_0 = Companion_instance_1;
|
|
2715
|
-
tmp.
|
|
2716
|
-
this.
|
|
2717
|
-
this.
|
|
2718
|
-
this.
|
|
2719
|
-
this.
|
|
2715
|
+
tmp.p1q_1 = tmp_0.yo(RootNode$regenerateCache$ref(this));
|
|
2716
|
+
this.q1q_1 = new RuleNode(this.n1q_1, this.o1q_1);
|
|
2717
|
+
this.r1q_1 = new DirectiveIndex(this.n1q_1, this.o1q_1);
|
|
2718
|
+
this.s1q_1 = 0n;
|
|
2719
|
+
this.t1q_1 = 0n;
|
|
2720
2720
|
// Inline function 'kotlin.collections.forEach' call
|
|
2721
2721
|
var _iterator__ex2g4s = clauses.n();
|
|
2722
2722
|
while (_iterator__ex2g4s.q()) {
|
|
2723
2723
|
var element = _iterator__ex2g4s.r();
|
|
2724
|
-
this.
|
|
2724
|
+
this.e1l(element);
|
|
2725
2725
|
}
|
|
2726
2726
|
}
|
|
2727
|
-
protoOf(RootNode).
|
|
2728
|
-
return this.
|
|
2727
|
+
protoOf(RootNode).r1k = function () {
|
|
2728
|
+
return this.n1q_1;
|
|
2729
2729
|
};
|
|
2730
|
-
protoOf(RootNode).
|
|
2731
|
-
return this.
|
|
2730
|
+
protoOf(RootNode).z1l = function () {
|
|
2731
|
+
return this.o1q_1;
|
|
2732
2732
|
};
|
|
2733
2733
|
protoOf(RootNode).s = function () {
|
|
2734
|
-
return this.
|
|
2734
|
+
return this.r1q_1.s() + this.q1q_1.s() | 0;
|
|
2735
2735
|
};
|
|
2736
|
-
protoOf(RootNode).
|
|
2737
|
-
return this.
|
|
2736
|
+
protoOf(RootNode).w1k = function () {
|
|
2737
|
+
return this.r1q_1.w1k() && this.q1q_1.w1k();
|
|
2738
2738
|
};
|
|
2739
|
-
protoOf(RootNode).
|
|
2740
|
-
return asSequence(this.
|
|
2739
|
+
protoOf(RootNode).b1l = function () {
|
|
2740
|
+
return asSequence(this.p1q_1.e2());
|
|
2741
2741
|
};
|
|
2742
|
-
protoOf(RootNode).
|
|
2743
|
-
var tmp = this.
|
|
2742
|
+
protoOf(RootNode).u1k = function () {
|
|
2743
|
+
var tmp = this.r1q_1.z1m();
|
|
2744
2744
|
return map(tmp, RootNode$_get_directives_$lambda_9lfp1g);
|
|
2745
2745
|
};
|
|
2746
|
-
protoOf(RootNode).
|
|
2747
|
-
var tmp = this.
|
|
2746
|
+
protoOf(RootNode).v1k = function () {
|
|
2747
|
+
var tmp = this.q1q_1.z1m();
|
|
2748
2748
|
return map(tmp, RootNode$_get_rules_$lambda_py6utr);
|
|
2749
2749
|
};
|
|
2750
|
-
protoOf(RootNode).
|
|
2750
|
+
protoOf(RootNode).z1k = function (clause) {
|
|
2751
2751
|
var tmp;
|
|
2752
2752
|
if (clause.gu()) {
|
|
2753
|
-
tmp = this.
|
|
2753
|
+
tmp = this.r1q_1.z1k(clause);
|
|
2754
2754
|
} else {
|
|
2755
|
-
tmp = this.
|
|
2755
|
+
tmp = this.q1q_1.z1k(clause);
|
|
2756
2756
|
}
|
|
2757
2757
|
return tmp;
|
|
2758
2758
|
};
|
|
2759
|
-
protoOf(RootNode).
|
|
2759
|
+
protoOf(RootNode).h1l = function (clause) {
|
|
2760
2760
|
var tmp;
|
|
2761
2761
|
if (clause.gu()) {
|
|
2762
|
-
tmp = this.
|
|
2762
|
+
tmp = this.r1q_1.h1l(clause);
|
|
2763
2763
|
} else {
|
|
2764
|
-
tmp = this.
|
|
2764
|
+
tmp = this.q1q_1.h1l(clause);
|
|
2765
2765
|
}
|
|
2766
2766
|
return tmp;
|
|
2767
2767
|
};
|
|
2768
|
-
protoOf(RootNode).
|
|
2768
|
+
protoOf(RootNode).j1l = function (clause) {
|
|
2769
2769
|
var tmp;
|
|
2770
2770
|
if (clause.gu()) {
|
|
2771
|
-
tmp = this.
|
|
2771
|
+
tmp = this.r1q_1.j1l(clause);
|
|
2772
2772
|
} else {
|
|
2773
|
-
tmp = this.
|
|
2773
|
+
tmp = this.q1q_1.j1l(clause);
|
|
2774
2774
|
}
|
|
2775
2775
|
return tmp;
|
|
2776
2776
|
};
|
|
2777
|
-
protoOf(RootNode).
|
|
2778
|
-
return new RootNode(this.
|
|
2777
|
+
protoOf(RootNode).m1l = function () {
|
|
2778
|
+
return new RootNode(this.n1q_1, asIterable(this.b1l()), this.o1q_1);
|
|
2779
2779
|
};
|
|
2780
|
-
protoOf(RootNode).
|
|
2780
|
+
protoOf(RootNode).d1m = function (clause) {
|
|
2781
2781
|
var indexed = assignLowerIndex(this, clause);
|
|
2782
|
-
if (this.
|
|
2783
|
-
this.
|
|
2782
|
+
if (this.o1q_1) {
|
|
2783
|
+
this.p1q_1.bp(RootNode$assertA$lambda(clause));
|
|
2784
2784
|
if (clause.gu()) {
|
|
2785
|
-
this.
|
|
2785
|
+
this.r1q_1.x1m(indexed);
|
|
2786
2786
|
} else {
|
|
2787
|
-
this.
|
|
2787
|
+
this.q1q_1.x1m(indexed);
|
|
2788
2788
|
}
|
|
2789
2789
|
} else {
|
|
2790
2790
|
throw UnsupportedOperationException_init_$Create$('An unordered ReteTree cannot perform the assertA operation.');
|
|
2791
2791
|
}
|
|
2792
2792
|
};
|
|
2793
|
-
protoOf(RootNode).
|
|
2793
|
+
protoOf(RootNode).e1l = function (clause) {
|
|
2794
2794
|
var indexed = assignHigherIndex(this, clause);
|
|
2795
|
-
this.
|
|
2795
|
+
this.p1q_1.bp(RootNode$assertZ$lambda(clause));
|
|
2796
2796
|
if (clause.gu()) {
|
|
2797
|
-
this.
|
|
2797
|
+
this.r1q_1.y1m(indexed);
|
|
2798
2798
|
} else {
|
|
2799
|
-
this.
|
|
2799
|
+
this.q1q_1.y1m(indexed);
|
|
2800
2800
|
}
|
|
2801
2801
|
};
|
|
2802
|
-
protoOf(RootNode).
|
|
2803
|
-
return asSequence(this.
|
|
2802
|
+
protoOf(RootNode).z1m = function () {
|
|
2803
|
+
return asSequence(this.p1q_1.e2());
|
|
2804
2804
|
};
|
|
2805
|
-
protoOf(RootNode).
|
|
2806
|
-
this.
|
|
2805
|
+
protoOf(RootNode).a1n = function () {
|
|
2806
|
+
this.p1q_1.ap();
|
|
2807
2807
|
};
|
|
2808
2808
|
function nestedFunctor_1($this, $receiver) {
|
|
2809
|
-
return Utils_instance.
|
|
2809
|
+
return Utils_instance.p1n(ensureNotNull($receiver.dw()), 0);
|
|
2810
2810
|
}
|
|
2811
2811
|
function nestedFunctor_2($this, $receiver) {
|
|
2812
|
-
return nestedFunctor_1($this, $receiver.
|
|
2812
|
+
return nestedFunctor_1($this, $receiver.v1m());
|
|
2813
2813
|
}
|
|
2814
2814
|
function regenerateCache_3($this) {
|
|
2815
2815
|
var tmp;
|
|
2816
|
-
if ($this.
|
|
2816
|
+
if ($this.v1q_1) {
|
|
2817
2817
|
var tmp_0 = Utils_instance;
|
|
2818
2818
|
// Inline function 'kotlin.collections.map' call
|
|
2819
|
-
var this_0 = $this.
|
|
2819
|
+
var this_0 = $this.w1q_1.j2();
|
|
2820
2820
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2821
2821
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2822
2822
|
var _iterator__ex2g4s = this_0.n();
|
|
2823
2823
|
while (_iterator__ex2g4s.q()) {
|
|
2824
2824
|
var item = _iterator__ex2g4s.r();
|
|
2825
|
-
var tmp$ret$2 = item.
|
|
2825
|
+
var tmp$ret$2 = item.z1m();
|
|
2826
2826
|
destination.l(tmp$ret$2);
|
|
2827
2827
|
}
|
|
2828
|
-
tmp = tmp_0.
|
|
2828
|
+
tmp = tmp_0.s1n(destination);
|
|
2829
2829
|
} else {
|
|
2830
2830
|
var tmp_1 = Utils_instance;
|
|
2831
2831
|
// Inline function 'kotlin.collections.map' call
|
|
2832
|
-
var this_1 = $this.
|
|
2832
|
+
var this_1 = $this.w1q_1.j2();
|
|
2833
2833
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2834
2834
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
2835
2835
|
var _iterator__ex2g4s_0 = this_1.n();
|
|
2836
2836
|
while (_iterator__ex2g4s_0.q()) {
|
|
2837
2837
|
var item_0 = _iterator__ex2g4s_0.r();
|
|
2838
|
-
var tmp$ret$5 = item_0.
|
|
2838
|
+
var tmp$ret$5 = item_0.z1m();
|
|
2839
2839
|
destination_0.l(tmp$ret$5);
|
|
2840
2840
|
}
|
|
2841
|
-
tmp = tmp_1.
|
|
2841
|
+
tmp = tmp_1.w1n(destination_0);
|
|
2842
2842
|
}
|
|
2843
2843
|
return dequeOf_0(tmp);
|
|
2844
2844
|
}
|
|
@@ -2852,71 +2852,71 @@
|
|
|
2852
2852
|
return it.s();
|
|
2853
2853
|
}
|
|
2854
2854
|
function RuleNode(unificator, ordered) {
|
|
2855
|
-
this.
|
|
2856
|
-
this.
|
|
2855
|
+
this.u1q_1 = unificator;
|
|
2856
|
+
this.v1q_1 = ordered;
|
|
2857
2857
|
var tmp = this;
|
|
2858
2858
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
2859
|
-
tmp.
|
|
2859
|
+
tmp.w1q_1 = LinkedHashMap_init_$Create$();
|
|
2860
2860
|
var tmp_0 = this;
|
|
2861
2861
|
var tmp_1 = Companion_instance_1;
|
|
2862
|
-
tmp_0.
|
|
2862
|
+
tmp_0.x1q_1 = tmp_1.yo(RuleNode$regenerateCache$ref(this));
|
|
2863
2863
|
}
|
|
2864
|
-
protoOf(RuleNode).
|
|
2865
|
-
var tmp0_safe_receiver = this.
|
|
2866
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2864
|
+
protoOf(RuleNode).z1k = function (clause) {
|
|
2865
|
+
var tmp0_safe_receiver = this.w1q_1.h2(nestedFunctor_1(this, clause));
|
|
2866
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.z1k(clause);
|
|
2867
2867
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2868
2868
|
};
|
|
2869
|
-
protoOf(RuleNode).
|
|
2869
|
+
protoOf(RuleNode).x1m = function (clause) {
|
|
2870
2870
|
// Inline function 'kotlin.let' call
|
|
2871
2871
|
var it = nestedFunctor_2(this, clause);
|
|
2872
|
-
if (this.
|
|
2872
|
+
if (this.v1q_1) {
|
|
2873
2873
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2874
|
-
var this_0 = this.
|
|
2874
|
+
var this_0 = this.w1q_1;
|
|
2875
2875
|
var value = this_0.h2(it);
|
|
2876
2876
|
var tmp;
|
|
2877
2877
|
if (value == null) {
|
|
2878
|
-
var answer = new TopLevelFunctorReteNode(this.
|
|
2878
|
+
var answer = new TopLevelFunctorReteNode(this.u1q_1, this.v1q_1, 0);
|
|
2879
2879
|
this_0.k4(it, answer);
|
|
2880
2880
|
tmp = answer;
|
|
2881
2881
|
} else {
|
|
2882
2882
|
tmp = value;
|
|
2883
2883
|
}
|
|
2884
|
-
tmp.
|
|
2884
|
+
tmp.x1m(clause.e1o(this));
|
|
2885
2885
|
} else {
|
|
2886
|
-
this.
|
|
2886
|
+
this.y1m(clause);
|
|
2887
2887
|
}
|
|
2888
2888
|
};
|
|
2889
|
-
protoOf(RuleNode).
|
|
2889
|
+
protoOf(RuleNode).y1m = function (clause) {
|
|
2890
2890
|
// Inline function 'kotlin.let' call
|
|
2891
2891
|
var it = nestedFunctor_2(this, clause);
|
|
2892
2892
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2893
|
-
var this_0 = this.
|
|
2893
|
+
var this_0 = this.w1q_1;
|
|
2894
2894
|
var value = this_0.h2(it);
|
|
2895
2895
|
var tmp;
|
|
2896
2896
|
if (value == null) {
|
|
2897
|
-
var answer = new TopLevelFunctorReteNode(this.
|
|
2897
|
+
var answer = new TopLevelFunctorReteNode(this.u1q_1, this.v1q_1, 0);
|
|
2898
2898
|
this_0.k4(it, answer);
|
|
2899
2899
|
tmp = answer;
|
|
2900
2900
|
} else {
|
|
2901
2901
|
tmp = value;
|
|
2902
2902
|
}
|
|
2903
|
-
tmp.
|
|
2903
|
+
tmp.y1m(clause.e1o(this));
|
|
2904
2904
|
};
|
|
2905
|
-
protoOf(RuleNode).
|
|
2906
|
-
var tmp0_safe_receiver = this.
|
|
2907
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2905
|
+
protoOf(RuleNode).h1l = function (clause) {
|
|
2906
|
+
var tmp0_safe_receiver = this.w1q_1.h2(nestedFunctor_1(this, clause));
|
|
2907
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.h1l(clause);
|
|
2908
2908
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2909
2909
|
};
|
|
2910
2910
|
protoOf(RuleNode).s = function () {
|
|
2911
|
-
var tmp = asSequence(this.
|
|
2911
|
+
var tmp = asSequence(this.w1q_1.j2());
|
|
2912
2912
|
return sum(map(tmp, RuleNode$_get_size_$lambda_xjenvf));
|
|
2913
2913
|
};
|
|
2914
|
-
protoOf(RuleNode).
|
|
2914
|
+
protoOf(RuleNode).w1k = function () {
|
|
2915
2915
|
var tmp;
|
|
2916
|
-
if (this.
|
|
2916
|
+
if (this.w1q_1.h()) {
|
|
2917
2917
|
tmp = true;
|
|
2918
2918
|
} else {
|
|
2919
|
-
var tmp0 = this.
|
|
2919
|
+
var tmp0 = this.w1q_1.j2();
|
|
2920
2920
|
var tmp$ret$0;
|
|
2921
2921
|
$l$block_0: {
|
|
2922
2922
|
// Inline function 'kotlin.collections.all' call
|
|
@@ -2933,7 +2933,7 @@
|
|
|
2933
2933
|
var _iterator__ex2g4s = tmp0.n();
|
|
2934
2934
|
while (_iterator__ex2g4s.q()) {
|
|
2935
2935
|
var element = _iterator__ex2g4s.r();
|
|
2936
|
-
if (!element.
|
|
2936
|
+
if (!element.w1k()) {
|
|
2937
2937
|
tmp$ret$0 = false;
|
|
2938
2938
|
break $l$block_0;
|
|
2939
2939
|
}
|
|
@@ -2944,31 +2944,31 @@
|
|
|
2944
2944
|
}
|
|
2945
2945
|
return tmp;
|
|
2946
2946
|
};
|
|
2947
|
-
protoOf(RuleNode).
|
|
2948
|
-
var tmp0_safe_receiver = this.
|
|
2949
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2947
|
+
protoOf(RuleNode).j1l = function (clause) {
|
|
2948
|
+
var tmp0_safe_receiver = this.w1q_1.h2(nestedFunctor_1(this, clause));
|
|
2949
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.j1l(clause);
|
|
2950
2950
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2951
2951
|
};
|
|
2952
|
-
protoOf(RuleNode).
|
|
2953
|
-
return asSequence(this.
|
|
2952
|
+
protoOf(RuleNode).z1m = function () {
|
|
2953
|
+
return asSequence(this.x1q_1.e2());
|
|
2954
2954
|
};
|
|
2955
|
-
protoOf(RuleNode).
|
|
2956
|
-
this.
|
|
2955
|
+
protoOf(RuleNode).a1n = function () {
|
|
2956
|
+
this.x1q_1.ap();
|
|
2957
2957
|
};
|
|
2958
2958
|
function selectArity($this, clause) {
|
|
2959
|
-
return $this.
|
|
2959
|
+
return $this.b1r_1.h2(Utils_instance.o1n(ensureNotNull(clause.dw()), $this.a1r_1));
|
|
2960
2960
|
}
|
|
2961
2961
|
function chooseAssertionBranch($this, clause, op) {
|
|
2962
2962
|
// Inline function 'kotlin.let' call
|
|
2963
|
-
var it = Utils_instance.
|
|
2963
|
+
var it = Utils_instance.o1n(ensureNotNull(clause.v1m().dw()), $this.a1r_1);
|
|
2964
2964
|
var tmp;
|
|
2965
2965
|
if (it === 0) {
|
|
2966
2966
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2967
|
-
var this_0 = $this.
|
|
2967
|
+
var this_0 = $this.b1r_1;
|
|
2968
2968
|
var value = this_0.h2(it);
|
|
2969
2969
|
var tmp_0;
|
|
2970
2970
|
if (value == null) {
|
|
2971
|
-
var answer = new ZeroArityReteNode($this.
|
|
2971
|
+
var answer = new ZeroArityReteNode($this.r1k(), $this.z1q_1);
|
|
2972
2972
|
this_0.k4(it, answer);
|
|
2973
2973
|
tmp_0 = answer;
|
|
2974
2974
|
} else {
|
|
@@ -2977,11 +2977,11 @@
|
|
|
2977
2977
|
tmp = tmp_0;
|
|
2978
2978
|
} else {
|
|
2979
2979
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2980
|
-
var this_1 = $this.
|
|
2980
|
+
var this_1 = $this.b1r_1;
|
|
2981
2981
|
var value_0 = this_1.h2(it);
|
|
2982
2982
|
var tmp_1;
|
|
2983
2983
|
if (value_0 == null) {
|
|
2984
|
-
var answer_0 = new FamilyArityReteNode($this.
|
|
2984
|
+
var answer_0 = new FamilyArityReteNode($this.r1k(), $this.z1q_1, $this.a1r_1);
|
|
2985
2985
|
this_1.k4(it, answer_0);
|
|
2986
2986
|
tmp_1 = answer_0;
|
|
2987
2987
|
} else {
|
|
@@ -2993,32 +2993,32 @@
|
|
|
2993
2993
|
}
|
|
2994
2994
|
function regenerateCache_4($this) {
|
|
2995
2995
|
var tmp;
|
|
2996
|
-
if ($this.
|
|
2996
|
+
if ($this.z1q_1) {
|
|
2997
2997
|
var tmp_0 = Utils_instance;
|
|
2998
2998
|
// Inline function 'kotlin.collections.map' call
|
|
2999
|
-
var this_0 = $this.
|
|
2999
|
+
var this_0 = $this.b1r_1.j2();
|
|
3000
3000
|
// Inline function 'kotlin.collections.mapTo' call
|
|
3001
3001
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
3002
3002
|
var _iterator__ex2g4s = this_0.n();
|
|
3003
3003
|
while (_iterator__ex2g4s.q()) {
|
|
3004
3004
|
var item = _iterator__ex2g4s.r();
|
|
3005
|
-
var tmp$ret$2 = item.
|
|
3005
|
+
var tmp$ret$2 = item.z1m();
|
|
3006
3006
|
destination.l(tmp$ret$2);
|
|
3007
3007
|
}
|
|
3008
|
-
tmp = tmp_0.
|
|
3008
|
+
tmp = tmp_0.s1n(destination);
|
|
3009
3009
|
} else {
|
|
3010
3010
|
var tmp_1 = Utils_instance;
|
|
3011
3011
|
// Inline function 'kotlin.collections.map' call
|
|
3012
|
-
var this_1 = $this.
|
|
3012
|
+
var this_1 = $this.b1r_1.j2();
|
|
3013
3013
|
// Inline function 'kotlin.collections.mapTo' call
|
|
3014
3014
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
3015
3015
|
var _iterator__ex2g4s_0 = this_1.n();
|
|
3016
3016
|
while (_iterator__ex2g4s_0.q()) {
|
|
3017
3017
|
var item_0 = _iterator__ex2g4s_0.r();
|
|
3018
|
-
var tmp$ret$5 = item_0.
|
|
3018
|
+
var tmp$ret$5 = item_0.z1m();
|
|
3019
3019
|
destination_0.l(tmp$ret$5);
|
|
3020
3020
|
}
|
|
3021
|
-
tmp = tmp_1.
|
|
3021
|
+
tmp = tmp_1.w1n(destination_0);
|
|
3022
3022
|
}
|
|
3023
3023
|
return dequeOf_0(tmp);
|
|
3024
3024
|
}
|
|
@@ -3033,25 +3033,25 @@
|
|
|
3033
3033
|
}
|
|
3034
3034
|
function TopLevelFunctorReteNode(unificator, ordered, nestingLevel) {
|
|
3035
3035
|
FunctorNode.call(this, unificator);
|
|
3036
|
-
this.
|
|
3037
|
-
this.
|
|
3036
|
+
this.z1q_1 = ordered;
|
|
3037
|
+
this.a1r_1 = nestingLevel;
|
|
3038
3038
|
var tmp = this;
|
|
3039
3039
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
3040
|
-
tmp.
|
|
3040
|
+
tmp.b1r_1 = LinkedHashMap_init_$Create$();
|
|
3041
3041
|
var tmp_0 = this;
|
|
3042
3042
|
var tmp_1 = Companion_instance_1;
|
|
3043
|
-
tmp_0.
|
|
3043
|
+
tmp_0.c1r_1 = tmp_1.yo(TopLevelFunctorReteNode$regenerateCache$ref(this));
|
|
3044
3044
|
}
|
|
3045
3045
|
protoOf(TopLevelFunctorReteNode).s = function () {
|
|
3046
|
-
var tmp = asSequence(this.
|
|
3046
|
+
var tmp = asSequence(this.b1r_1.j2());
|
|
3047
3047
|
return sum(map(tmp, TopLevelFunctorReteNode$_get_size_$lambda_6i36rr));
|
|
3048
3048
|
};
|
|
3049
|
-
protoOf(TopLevelFunctorReteNode).
|
|
3049
|
+
protoOf(TopLevelFunctorReteNode).w1k = function () {
|
|
3050
3050
|
var tmp;
|
|
3051
|
-
if (this.
|
|
3051
|
+
if (this.b1r_1.h()) {
|
|
3052
3052
|
tmp = true;
|
|
3053
3053
|
} else {
|
|
3054
|
-
var tmp0 = this.
|
|
3054
|
+
var tmp0 = this.b1r_1.j2();
|
|
3055
3055
|
var tmp$ret$0;
|
|
3056
3056
|
$l$block_0: {
|
|
3057
3057
|
// Inline function 'kotlin.collections.all' call
|
|
@@ -3068,7 +3068,7 @@
|
|
|
3068
3068
|
var _iterator__ex2g4s = tmp0.n();
|
|
3069
3069
|
while (_iterator__ex2g4s.q()) {
|
|
3070
3070
|
var element = _iterator__ex2g4s.r();
|
|
3071
|
-
if (!element.
|
|
3071
|
+
if (!element.w1k()) {
|
|
3072
3072
|
tmp$ret$0 = false;
|
|
3073
3073
|
break $l$block_0;
|
|
3074
3074
|
}
|
|
@@ -3079,90 +3079,90 @@
|
|
|
3079
3079
|
}
|
|
3080
3080
|
return tmp;
|
|
3081
3081
|
};
|
|
3082
|
-
protoOf(TopLevelFunctorReteNode).
|
|
3082
|
+
protoOf(TopLevelFunctorReteNode).z1k = function (clause) {
|
|
3083
3083
|
var tmp0_safe_receiver = selectArity(this, clause);
|
|
3084
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
3084
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.z1k(clause);
|
|
3085
3085
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
3086
3086
|
};
|
|
3087
|
-
protoOf(TopLevelFunctorReteNode).
|
|
3088
|
-
var tmp = clause.
|
|
3087
|
+
protoOf(TopLevelFunctorReteNode).x1m = function (clause) {
|
|
3088
|
+
var tmp = clause.e1o(this);
|
|
3089
3089
|
chooseAssertionBranch(this, tmp, ReteNode$assertA$ref());
|
|
3090
3090
|
};
|
|
3091
|
-
protoOf(TopLevelFunctorReteNode).
|
|
3092
|
-
var tmp = clause.
|
|
3091
|
+
protoOf(TopLevelFunctorReteNode).y1m = function (clause) {
|
|
3092
|
+
var tmp = clause.e1o(this);
|
|
3093
3093
|
chooseAssertionBranch(this, tmp, ReteNode$assertZ$ref());
|
|
3094
3094
|
};
|
|
3095
|
-
protoOf(TopLevelFunctorReteNode).
|
|
3095
|
+
protoOf(TopLevelFunctorReteNode).h1l = function (clause) {
|
|
3096
3096
|
var tmp0_safe_receiver = selectArity(this, clause);
|
|
3097
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
3097
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.h1l(clause);
|
|
3098
3098
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
3099
3099
|
};
|
|
3100
|
-
protoOf(TopLevelFunctorReteNode).
|
|
3100
|
+
protoOf(TopLevelFunctorReteNode).j1l = function (clause) {
|
|
3101
3101
|
var tmp0_safe_receiver = selectArity(this, clause);
|
|
3102
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
3102
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.j1l(clause);
|
|
3103
3103
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
3104
3104
|
};
|
|
3105
|
-
protoOf(TopLevelFunctorReteNode).
|
|
3106
|
-
return asSequence(this.
|
|
3105
|
+
protoOf(TopLevelFunctorReteNode).z1m = function () {
|
|
3106
|
+
return asSequence(this.c1r_1.e2());
|
|
3107
3107
|
};
|
|
3108
|
-
protoOf(TopLevelFunctorReteNode).
|
|
3109
|
-
this.
|
|
3108
|
+
protoOf(TopLevelFunctorReteNode).a1n = function () {
|
|
3109
|
+
this.c1r_1.ap();
|
|
3110
3110
|
};
|
|
3111
3111
|
function ZeroArityReteNode$retractFirst$lambda(it) {
|
|
3112
|
-
return it.
|
|
3112
|
+
return it.v1m();
|
|
3113
3113
|
}
|
|
3114
3114
|
function ZeroArityReteNode$get$lambda(this$0, $clause) {
|
|
3115
3115
|
return function (it) {
|
|
3116
|
-
return this$0.
|
|
3116
|
+
return this$0.r1k().match($clause, it.v1m());
|
|
3117
3117
|
};
|
|
3118
3118
|
}
|
|
3119
3119
|
function ZeroArityReteNode$get$lambda_0(it) {
|
|
3120
|
-
return it.
|
|
3120
|
+
return it.v1m();
|
|
3121
3121
|
}
|
|
3122
3122
|
function ZeroArityReteNode$retractAll$lambda(it) {
|
|
3123
|
-
return it.
|
|
3123
|
+
return it.v1m();
|
|
3124
3124
|
}
|
|
3125
3125
|
function ZeroArityReteNode(unificator, ordered) {
|
|
3126
3126
|
ArityNode.call(this, unificator);
|
|
3127
|
-
this.
|
|
3128
|
-
this.
|
|
3127
|
+
this.e1r_1 = ordered;
|
|
3128
|
+
this.f1r_1 = dequeOf([]);
|
|
3129
3129
|
}
|
|
3130
|
-
protoOf(ZeroArityReteNode).
|
|
3131
|
-
var tmp = this.
|
|
3130
|
+
protoOf(ZeroArityReteNode).h1l = function (clause) {
|
|
3131
|
+
var tmp = this.w1m(this.f1r_1, clause);
|
|
3132
3132
|
return buffered(take(map(tmp, ZeroArityReteNode$retractFirst$lambda), 1));
|
|
3133
3133
|
};
|
|
3134
3134
|
protoOf(ZeroArityReteNode).s = function () {
|
|
3135
|
-
return this.
|
|
3135
|
+
return this.f1r_1.s();
|
|
3136
3136
|
};
|
|
3137
|
-
protoOf(ZeroArityReteNode).
|
|
3138
|
-
return this.
|
|
3137
|
+
protoOf(ZeroArityReteNode).w1k = function () {
|
|
3138
|
+
return this.f1r_1.h();
|
|
3139
3139
|
};
|
|
3140
|
-
protoOf(ZeroArityReteNode).
|
|
3141
|
-
var tmp = asSequence(this.
|
|
3140
|
+
protoOf(ZeroArityReteNode).z1k = function (clause) {
|
|
3141
|
+
var tmp = asSequence(this.f1r_1);
|
|
3142
3142
|
var tmp_0 = filter(tmp, ZeroArityReteNode$get$lambda(this, clause));
|
|
3143
3143
|
return map(tmp_0, ZeroArityReteNode$get$lambda_0);
|
|
3144
3144
|
};
|
|
3145
|
-
protoOf(ZeroArityReteNode).
|
|
3146
|
-
if (this.
|
|
3147
|
-
addFirst(this.
|
|
3145
|
+
protoOf(ZeroArityReteNode).x1m = function (clause) {
|
|
3146
|
+
if (this.e1r_1) {
|
|
3147
|
+
addFirst(this.f1r_1, Companion_instance_8.m1o(clause.e1o(this), this));
|
|
3148
3148
|
} else {
|
|
3149
|
-
this.
|
|
3149
|
+
this.y1m(clause);
|
|
3150
3150
|
}
|
|
3151
3151
|
};
|
|
3152
|
-
protoOf(ZeroArityReteNode).
|
|
3153
|
-
this.
|
|
3152
|
+
protoOf(ZeroArityReteNode).y1m = function (clause) {
|
|
3153
|
+
this.f1r_1.l(Companion_instance_8.m1o(clause.e1o(this), this));
|
|
3154
3154
|
};
|
|
3155
|
-
protoOf(ZeroArityReteNode).
|
|
3156
|
-
var tmp = this.
|
|
3155
|
+
protoOf(ZeroArityReteNode).j1l = function (clause) {
|
|
3156
|
+
var tmp = this.w1m(this.f1r_1, clause);
|
|
3157
3157
|
return buffered(map(tmp, ZeroArityReteNode$retractAll$lambda));
|
|
3158
3158
|
};
|
|
3159
|
-
protoOf(ZeroArityReteNode).
|
|
3160
|
-
return asSequence(this.
|
|
3159
|
+
protoOf(ZeroArityReteNode).z1m = function () {
|
|
3160
|
+
return asSequence(this.f1r_1);
|
|
3161
3161
|
};
|
|
3162
|
-
protoOf(ZeroArityReteNode).
|
|
3162
|
+
protoOf(ZeroArityReteNode).a1n = function () {
|
|
3163
3163
|
};
|
|
3164
|
-
protoOf(ZeroArityReteNode).
|
|
3165
|
-
this.
|
|
3164
|
+
protoOf(ZeroArityReteNode).l1o = function (indexed) {
|
|
3165
|
+
this.f1r_1.z2(indexed);
|
|
3166
3166
|
};
|
|
3167
3167
|
function AbstractTheory$get$lambda(it) {
|
|
3168
3168
|
return it.castToRule();
|
|
@@ -3171,49 +3171,49 @@
|
|
|
3171
3171
|
return it.castToRule();
|
|
3172
3172
|
}
|
|
3173
3173
|
function AbstractTheory(tags) {
|
|
3174
|
-
this.
|
|
3174
|
+
this.g1r_1 = tags;
|
|
3175
3175
|
}
|
|
3176
3176
|
protoOf(AbstractTheory).lr = function () {
|
|
3177
|
-
return this.
|
|
3177
|
+
return this.g1r_1;
|
|
3178
3178
|
};
|
|
3179
|
-
protoOf(AbstractTheory).
|
|
3179
|
+
protoOf(AbstractTheory).h1r = function () {
|
|
3180
3180
|
return this;
|
|
3181
3181
|
};
|
|
3182
3182
|
protoOf(AbstractTheory).toImmutableTheory = function () {
|
|
3183
|
-
return this.
|
|
3183
|
+
return this.h1r();
|
|
3184
3184
|
};
|
|
3185
|
-
protoOf(AbstractTheory).
|
|
3186
|
-
return plus_2.call(this, TheoryUtils_instance.
|
|
3185
|
+
protoOf(AbstractTheory).i1r = function (clause) {
|
|
3186
|
+
return plus_2.call(this, TheoryUtils_instance.n1l(clause));
|
|
3187
3187
|
};
|
|
3188
3188
|
protoOf(AbstractTheory).plus = function (clause) {
|
|
3189
|
-
return this.
|
|
3189
|
+
return this.i1r(clause);
|
|
3190
3190
|
};
|
|
3191
|
-
protoOf(AbstractTheory).
|
|
3191
|
+
protoOf(AbstractTheory).y1k = function (clause) {
|
|
3192
3192
|
return any(this.get(clause));
|
|
3193
3193
|
};
|
|
3194
3194
|
protoOf(AbstractTheory).contains = function (clause) {
|
|
3195
|
-
return this.
|
|
3195
|
+
return this.y1k(clause);
|
|
3196
3196
|
};
|
|
3197
|
-
protoOf(AbstractTheory).
|
|
3198
|
-
return this.
|
|
3197
|
+
protoOf(AbstractTheory).j1r = function (head) {
|
|
3198
|
+
return this.y1k(Companion_instance_2.of(head, [Companion_getInstance().anonymous()]));
|
|
3199
3199
|
};
|
|
3200
3200
|
protoOf(AbstractTheory).containsHead = function (head) {
|
|
3201
|
-
return this.
|
|
3201
|
+
return this.j1r(head);
|
|
3202
3202
|
};
|
|
3203
|
-
protoOf(AbstractTheory).
|
|
3204
|
-
return any(this.
|
|
3203
|
+
protoOf(AbstractTheory).k1r = function (indicator) {
|
|
3204
|
+
return any(this.l1r(indicator));
|
|
3205
3205
|
};
|
|
3206
3206
|
protoOf(AbstractTheory).containsIndicator = function (indicator) {
|
|
3207
|
-
return this.
|
|
3207
|
+
return this.k1r(indicator);
|
|
3208
3208
|
};
|
|
3209
|
-
protoOf(AbstractTheory).
|
|
3209
|
+
protoOf(AbstractTheory).m1r = function (head) {
|
|
3210
3210
|
var tmp = this.get(Companion_instance_2.of(head, [Companion_getInstance().anonymous()]));
|
|
3211
3211
|
return map(tmp, AbstractTheory$get$lambda);
|
|
3212
3212
|
};
|
|
3213
3213
|
protoOf(AbstractTheory).getByHead = function (head) {
|
|
3214
|
-
return this.
|
|
3214
|
+
return this.m1r(head);
|
|
3215
3215
|
};
|
|
3216
|
-
protoOf(AbstractTheory).
|
|
3216
|
+
protoOf(AbstractTheory).l1r = function (indicator) {
|
|
3217
3217
|
// Inline function 'kotlin.require' call
|
|
3218
3218
|
if (!indicator.nw()) {
|
|
3219
3219
|
var message = 'The provided indicator is not well formed: ' + indicator.toString();
|
|
@@ -3240,49 +3240,49 @@
|
|
|
3240
3240
|
return map(tmp_2, AbstractTheory$get$lambda_0);
|
|
3241
3241
|
};
|
|
3242
3242
|
protoOf(AbstractTheory).getByIndicator = function (indicator) {
|
|
3243
|
-
return this.
|
|
3243
|
+
return this.l1r(indicator);
|
|
3244
3244
|
};
|
|
3245
|
-
protoOf(AbstractTheory).
|
|
3245
|
+
protoOf(AbstractTheory).n1r = function (indicator) {
|
|
3246
3246
|
// Inline function 'kotlin.require' call
|
|
3247
3247
|
if (!indicator.nw()) {
|
|
3248
3248
|
var message = 'The provided indicator is not well formed: ' + indicator.toString();
|
|
3249
3249
|
throw IllegalArgumentException_init_$Create$(toString(message));
|
|
3250
3250
|
}
|
|
3251
|
-
return this.retractAllByHead(Companion_getInstance_0().template(ensureNotNull(indicator.gy()), ensureNotNull(indicator.hy()))).
|
|
3251
|
+
return this.retractAllByHead(Companion_getInstance_0().template(ensureNotNull(indicator.gy()), ensureNotNull(indicator.hy()))).o1r();
|
|
3252
3252
|
};
|
|
3253
3253
|
protoOf(AbstractTheory).abolish = function (indicator) {
|
|
3254
|
-
return this.
|
|
3254
|
+
return this.n1r(indicator);
|
|
3255
3255
|
};
|
|
3256
3256
|
protoOf(AbstractTheory).toString = function () {
|
|
3257
|
-
return '' + getKClassFromExpression(this).b9() + '{ ' + joinToString(this.
|
|
3257
|
+
return '' + getKClassFromExpression(this).b9() + '{ ' + joinToString(this.b1l(), '. ') + ' }';
|
|
3258
3258
|
};
|
|
3259
|
-
protoOf(AbstractTheory).
|
|
3259
|
+
protoOf(AbstractTheory).p1r = function (asPrologText) {
|
|
3260
3260
|
var tmp;
|
|
3261
3261
|
if (asPrologText) {
|
|
3262
|
-
tmp = joinToString(this.
|
|
3262
|
+
tmp = joinToString(this.b1l(), '.\n', '', '.\n');
|
|
3263
3263
|
} else {
|
|
3264
3264
|
tmp = this.toString();
|
|
3265
3265
|
}
|
|
3266
3266
|
return tmp;
|
|
3267
3267
|
};
|
|
3268
3268
|
protoOf(AbstractTheory).toStringAsProlog = function (asPrologText) {
|
|
3269
|
-
return this.
|
|
3269
|
+
return this.p1r(asPrologText);
|
|
3270
3270
|
};
|
|
3271
3271
|
protoOf(AbstractTheory).n = function () {
|
|
3272
|
-
return this.
|
|
3272
|
+
return this.b1l().n();
|
|
3273
3273
|
};
|
|
3274
3274
|
protoOf(AbstractTheory).equals = function (other) {
|
|
3275
3275
|
if (other == null)
|
|
3276
3276
|
return false;
|
|
3277
3277
|
if (!isInterface(other, Theory))
|
|
3278
3278
|
return false;
|
|
3279
|
-
return this.
|
|
3279
|
+
return this.q1r(other, true);
|
|
3280
3280
|
};
|
|
3281
|
-
protoOf(AbstractTheory).
|
|
3281
|
+
protoOf(AbstractTheory).q1r = function (other, useVarCompleteName) {
|
|
3282
3282
|
if (this === other)
|
|
3283
3283
|
return true;
|
|
3284
|
-
var i = this.
|
|
3285
|
-
var j = other.
|
|
3284
|
+
var i = this.b1l().n();
|
|
3285
|
+
var j = other.b1l().n();
|
|
3286
3286
|
while (i.q() && j.q()) {
|
|
3287
3287
|
if (!i.r().equalsUsingVarCompleteNames(j.r(), useVarCompleteName)) {
|
|
3288
3288
|
return false;
|
|
@@ -3291,7 +3291,7 @@
|
|
|
3291
3291
|
return i.q() === j.q();
|
|
3292
3292
|
};
|
|
3293
3293
|
protoOf(AbstractTheory).equalsUsingVarCompleteNames = function (other, useVarCompleteName) {
|
|
3294
|
-
return this.
|
|
3294
|
+
return this.q1r(other, useVarCompleteName);
|
|
3295
3295
|
};
|
|
3296
3296
|
protoOf(AbstractTheory).hashCode = function () {
|
|
3297
3297
|
// Inline function 'kotlin.hashCode' call
|
|
@@ -3299,7 +3299,7 @@
|
|
|
3299
3299
|
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : hashCode(tmp0_safe_receiver);
|
|
3300
3300
|
var base = tmp1_elvis_lhs == null ? 0 : tmp1_elvis_lhs;
|
|
3301
3301
|
var result = base ^ (base >>> 32 | 0);
|
|
3302
|
-
var _iterator__ex2g4s = this.
|
|
3302
|
+
var _iterator__ex2g4s = this.b1l().n();
|
|
3303
3303
|
while (_iterator__ex2g4s.q()) {
|
|
3304
3304
|
var clause = _iterator__ex2g4s.r();
|
|
3305
3305
|
result = imul(31, result) + clause.hashCode() | 0;
|
|
@@ -3316,143 +3316,143 @@
|
|
|
3316
3316
|
}
|
|
3317
3317
|
return i;
|
|
3318
3318
|
};
|
|
3319
|
-
protoOf(AbstractTheory).
|
|
3320
|
-
return !this.
|
|
3319
|
+
protoOf(AbstractTheory).w1k = function () {
|
|
3320
|
+
return !this.r1r();
|
|
3321
3321
|
};
|
|
3322
|
-
protoOf(AbstractTheory).
|
|
3322
|
+
protoOf(AbstractTheory).r1r = function () {
|
|
3323
3323
|
return this.n().q();
|
|
3324
3324
|
};
|
|
3325
|
-
protoOf(AbstractTheory).
|
|
3325
|
+
protoOf(AbstractTheory).s1r = function (unificator) {
|
|
3326
3326
|
var tmp;
|
|
3327
|
-
if (!equals(unificator, this.
|
|
3328
|
-
tmp = this.
|
|
3327
|
+
if (!equals(unificator, this.r1k())) {
|
|
3328
|
+
tmp = this.t1r(asSequence(this.b1l()), VOID, unificator);
|
|
3329
3329
|
} else {
|
|
3330
3330
|
tmp = this;
|
|
3331
3331
|
}
|
|
3332
3332
|
return tmp;
|
|
3333
3333
|
};
|
|
3334
3334
|
protoOf(AbstractTheory).setUnificator = function (unificator) {
|
|
3335
|
-
return this.
|
|
3335
|
+
return this.s1r(unificator);
|
|
3336
3336
|
};
|
|
3337
|
-
protoOf(AbstractTheory).
|
|
3337
|
+
protoOf(AbstractTheory).u1r = function (theory) {
|
|
3338
3338
|
var tmp;
|
|
3339
|
-
if (theory.
|
|
3340
|
-
tmp = this.
|
|
3339
|
+
if (theory.r1r()) {
|
|
3340
|
+
tmp = this.t1r(plus_0(asSequence(this.b1l()), TheoryUtils_instance.v1r(asSequence(theory.b1l()))));
|
|
3341
3341
|
} else {
|
|
3342
3342
|
tmp = this;
|
|
3343
3343
|
}
|
|
3344
3344
|
return tmp;
|
|
3345
3345
|
};
|
|
3346
3346
|
protoOf(AbstractTheory).plusTheory = function (theory) {
|
|
3347
|
-
return this.
|
|
3347
|
+
return this.u1r(theory);
|
|
3348
3348
|
};
|
|
3349
|
-
protoOf(AbstractTheory).
|
|
3350
|
-
return this.
|
|
3349
|
+
protoOf(AbstractTheory).w1r = function (clause) {
|
|
3350
|
+
return this.t1r(plus_0(TheoryUtils_instance.x1r([clause]), asSequence(this.b1l())));
|
|
3351
3351
|
};
|
|
3352
3352
|
protoOf(AbstractTheory).assertA = function (clause) {
|
|
3353
|
-
return this.
|
|
3353
|
+
return this.w1r(clause);
|
|
3354
3354
|
};
|
|
3355
|
-
protoOf(AbstractTheory).
|
|
3356
|
-
return this.
|
|
3355
|
+
protoOf(AbstractTheory).y1r = function (clauses) {
|
|
3356
|
+
return this.t1r(plus_0(TheoryUtils_instance.v1r(asSequence(clauses)), asSequence(this.b1l())));
|
|
3357
3357
|
};
|
|
3358
3358
|
protoOf(AbstractTheory).assertAIterable = function (clauses) {
|
|
3359
|
-
return this.
|
|
3359
|
+
return this.y1r(clauses);
|
|
3360
3360
|
};
|
|
3361
|
-
protoOf(AbstractTheory).
|
|
3362
|
-
return this.
|
|
3361
|
+
protoOf(AbstractTheory).z1r = function (clauses) {
|
|
3362
|
+
return this.t1r(plus_0(TheoryUtils_instance.v1r(clauses), asSequence(this.b1l())));
|
|
3363
3363
|
};
|
|
3364
3364
|
protoOf(AbstractTheory).assertASequence = function (clauses) {
|
|
3365
|
-
return this.
|
|
3365
|
+
return this.z1r(clauses);
|
|
3366
3366
|
};
|
|
3367
|
-
protoOf(AbstractTheory).
|
|
3368
|
-
return this.
|
|
3367
|
+
protoOf(AbstractTheory).a1s = function (clause) {
|
|
3368
|
+
return this.t1r(plus_0(asSequence(this.b1l()), TheoryUtils_instance.v1r(sequenceOf_0(clause))));
|
|
3369
3369
|
};
|
|
3370
3370
|
protoOf(AbstractTheory).assertZ = function (clause) {
|
|
3371
|
-
return this.
|
|
3371
|
+
return this.a1s(clause);
|
|
3372
3372
|
};
|
|
3373
|
-
protoOf(AbstractTheory).
|
|
3374
|
-
return this.
|
|
3373
|
+
protoOf(AbstractTheory).b1s = function (clauses) {
|
|
3374
|
+
return this.t1r(plus_0(asSequence(this.b1l()), asSequence(TheoryUtils_instance.y1l(clauses))));
|
|
3375
3375
|
};
|
|
3376
3376
|
protoOf(AbstractTheory).assertZIterable = function (clauses) {
|
|
3377
|
-
return this.
|
|
3377
|
+
return this.b1s(clauses);
|
|
3378
3378
|
};
|
|
3379
|
-
protoOf(AbstractTheory).
|
|
3380
|
-
return this.
|
|
3379
|
+
protoOf(AbstractTheory).c1s = function (clauses) {
|
|
3380
|
+
return this.t1r(plus_0(asSequence(this.b1l()), TheoryUtils_instance.v1r(clauses)));
|
|
3381
3381
|
};
|
|
3382
3382
|
protoOf(AbstractTheory).assertZSequence = function (clauses) {
|
|
3383
|
-
return this.
|
|
3383
|
+
return this.c1s(clauses);
|
|
3384
3384
|
};
|
|
3385
|
-
protoOf(AbstractTheory).
|
|
3385
|
+
protoOf(AbstractTheory).t1r = function (clauses, tags, unificator, $super) {
|
|
3386
3386
|
tags = tags === VOID ? this.lr() : tags;
|
|
3387
|
-
unificator = unificator === VOID ? this.
|
|
3388
|
-
return $super === VOID ? this.
|
|
3387
|
+
unificator = unificator === VOID ? this.r1k() : unificator;
|
|
3388
|
+
return $super === VOID ? this.d1s(clauses, tags, unificator) : $super.d1s.call(this, clauses, tags, unificator);
|
|
3389
3389
|
};
|
|
3390
|
-
protoOf(AbstractTheory).
|
|
3391
|
-
return this.
|
|
3390
|
+
protoOf(AbstractTheory).e1s = function (clauses) {
|
|
3391
|
+
return this.f1s(asIterable(clauses));
|
|
3392
3392
|
};
|
|
3393
3393
|
protoOf(AbstractTheory).retractSequence = function (clauses) {
|
|
3394
|
-
return this.
|
|
3394
|
+
return this.e1s(clauses);
|
|
3395
3395
|
};
|
|
3396
|
-
protoOf(AbstractTheory).
|
|
3396
|
+
protoOf(AbstractTheory).g1s = function () {
|
|
3397
3397
|
return this;
|
|
3398
3398
|
};
|
|
3399
3399
|
protoOf(AbstractTheory).clone = function () {
|
|
3400
|
-
return this.
|
|
3400
|
+
return this.g1s();
|
|
3401
3401
|
};
|
|
3402
3402
|
function Default() {
|
|
3403
3403
|
Default_instance = this;
|
|
3404
|
-
this.
|
|
3404
|
+
this.i1s_1 = new IndexedTheoryFactory(Companion_getInstance_1().k1k());
|
|
3405
3405
|
}
|
|
3406
3406
|
protoOf(Default).emptyTheoryWithUnificator = function (unificator) {
|
|
3407
|
-
return this.
|
|
3407
|
+
return this.i1s_1.k1s(unificator);
|
|
3408
3408
|
};
|
|
3409
3409
|
protoOf(Default).emptyTheory = function () {
|
|
3410
|
-
return this.
|
|
3410
|
+
return this.i1s_1.emptyTheory();
|
|
3411
3411
|
};
|
|
3412
3412
|
protoOf(Default).theoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3413
|
-
return this.
|
|
3413
|
+
return this.i1s_1.l1s(clauses, unificator);
|
|
3414
3414
|
};
|
|
3415
3415
|
protoOf(Default).theoryOfIterable = function (clauses) {
|
|
3416
|
-
return this.
|
|
3416
|
+
return this.i1s_1.theoryOfIterable(clauses);
|
|
3417
3417
|
};
|
|
3418
3418
|
protoOf(Default).theoryOfWithUnificator = function (unificator, clauses) {
|
|
3419
|
-
return this.
|
|
3419
|
+
return this.i1s_1.m1s(unificator, clauses);
|
|
3420
3420
|
};
|
|
3421
3421
|
protoOf(Default).theoryOf = function (clauses) {
|
|
3422
|
-
return this.
|
|
3422
|
+
return this.i1s_1.theoryOf(clauses);
|
|
3423
3423
|
};
|
|
3424
3424
|
protoOf(Default).theoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3425
|
-
return this.
|
|
3425
|
+
return this.i1s_1.n1s(clauses, unificator);
|
|
3426
3426
|
};
|
|
3427
3427
|
protoOf(Default).theoryOfSequence = function (clauses) {
|
|
3428
|
-
return this.
|
|
3428
|
+
return this.i1s_1.theoryOfSequence(clauses);
|
|
3429
3429
|
};
|
|
3430
3430
|
protoOf(Default).emptyMutableTheoryWithUnificator = function (unificator) {
|
|
3431
|
-
return this.
|
|
3431
|
+
return this.i1s_1.o1s(unificator);
|
|
3432
3432
|
};
|
|
3433
3433
|
protoOf(Default).emptyMutableTheory = function () {
|
|
3434
|
-
return this.
|
|
3434
|
+
return this.i1s_1.emptyMutableTheory();
|
|
3435
3435
|
};
|
|
3436
3436
|
protoOf(Default).mutableTheoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3437
|
-
return this.
|
|
3437
|
+
return this.i1s_1.p1s(clauses, unificator);
|
|
3438
3438
|
};
|
|
3439
3439
|
protoOf(Default).mutableTheoryOfIterable = function (clauses) {
|
|
3440
|
-
return this.
|
|
3440
|
+
return this.i1s_1.mutableTheoryOfIterable(clauses);
|
|
3441
3441
|
};
|
|
3442
3442
|
protoOf(Default).mutableTheoryOfWithUnificator = function (unificator, clauses) {
|
|
3443
|
-
return this.
|
|
3443
|
+
return this.i1s_1.q1s(unificator, clauses);
|
|
3444
3444
|
};
|
|
3445
3445
|
protoOf(Default).mutableTheoryOf = function (clauses) {
|
|
3446
|
-
return this.
|
|
3446
|
+
return this.i1s_1.mutableTheoryOf(clauses);
|
|
3447
3447
|
};
|
|
3448
3448
|
protoOf(Default).mutableTheoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3449
|
-
return this.
|
|
3449
|
+
return this.i1s_1.r1s(clauses, unificator);
|
|
3450
3450
|
};
|
|
3451
3451
|
protoOf(Default).mutableTheoryOfSequence = function (clauses) {
|
|
3452
|
-
return this.
|
|
3452
|
+
return this.i1s_1.mutableTheoryOfSequence(clauses);
|
|
3453
3453
|
};
|
|
3454
|
-
protoOf(Default).
|
|
3455
|
-
return this.
|
|
3454
|
+
protoOf(Default).r1k = function () {
|
|
3455
|
+
return this.i1s_1.j1s_1;
|
|
3456
3456
|
};
|
|
3457
3457
|
var Default_instance;
|
|
3458
3458
|
function Default_getInstance() {
|
|
@@ -3461,113 +3461,113 @@
|
|
|
3461
3461
|
return Default_instance;
|
|
3462
3462
|
}
|
|
3463
3463
|
function IndexedTheoryFactory(unificator) {
|
|
3464
|
-
this.
|
|
3464
|
+
this.j1s_1 = unificator;
|
|
3465
3465
|
}
|
|
3466
|
-
protoOf(IndexedTheoryFactory).
|
|
3467
|
-
return this.
|
|
3466
|
+
protoOf(IndexedTheoryFactory).r1k = function () {
|
|
3467
|
+
return this.j1s_1;
|
|
3468
3468
|
};
|
|
3469
|
-
protoOf(IndexedTheoryFactory).
|
|
3469
|
+
protoOf(IndexedTheoryFactory).k1s = function (unificator) {
|
|
3470
3470
|
return IndexedTheory_init_$Create$(unificator, emptyList());
|
|
3471
3471
|
};
|
|
3472
3472
|
protoOf(IndexedTheoryFactory).emptyTheoryWithUnificator = function (unificator) {
|
|
3473
|
-
return this.
|
|
3473
|
+
return this.k1s(unificator);
|
|
3474
3474
|
};
|
|
3475
|
-
protoOf(IndexedTheoryFactory).
|
|
3475
|
+
protoOf(IndexedTheoryFactory).l1s = function (clauses, unificator) {
|
|
3476
3476
|
return IndexedTheory_init_$Create$(unificator, clauses);
|
|
3477
3477
|
};
|
|
3478
3478
|
protoOf(IndexedTheoryFactory).theoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3479
|
-
return this.
|
|
3479
|
+
return this.l1s(clauses, unificator);
|
|
3480
3480
|
};
|
|
3481
|
-
protoOf(IndexedTheoryFactory).
|
|
3481
|
+
protoOf(IndexedTheoryFactory).m1s = function (unificator, clauses) {
|
|
3482
3482
|
return IndexedTheory_init_$Create$(unificator, asIterable_0(clauses));
|
|
3483
3483
|
};
|
|
3484
3484
|
protoOf(IndexedTheoryFactory).theoryOfWithUnificator = function (unificator, clauses) {
|
|
3485
|
-
return this.
|
|
3485
|
+
return this.m1s(unificator, clauses);
|
|
3486
3486
|
};
|
|
3487
|
-
protoOf(IndexedTheoryFactory).
|
|
3487
|
+
protoOf(IndexedTheoryFactory).n1s = function (clauses, unificator) {
|
|
3488
3488
|
return IndexedTheory_init_$Create$_0(unificator, clauses);
|
|
3489
3489
|
};
|
|
3490
3490
|
protoOf(IndexedTheoryFactory).theoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3491
|
-
return this.
|
|
3491
|
+
return this.n1s(clauses, unificator);
|
|
3492
3492
|
};
|
|
3493
|
-
protoOf(IndexedTheoryFactory).
|
|
3493
|
+
protoOf(IndexedTheoryFactory).o1s = function (unificator) {
|
|
3494
3494
|
return MutableIndexedTheory_init_$Create$(unificator, emptyList());
|
|
3495
3495
|
};
|
|
3496
3496
|
protoOf(IndexedTheoryFactory).emptyMutableTheoryWithUnificator = function (unificator) {
|
|
3497
|
-
return this.
|
|
3497
|
+
return this.o1s(unificator);
|
|
3498
3498
|
};
|
|
3499
|
-
protoOf(IndexedTheoryFactory).
|
|
3499
|
+
protoOf(IndexedTheoryFactory).p1s = function (clauses, unificator) {
|
|
3500
3500
|
return MutableIndexedTheory_init_$Create$(unificator, clauses);
|
|
3501
3501
|
};
|
|
3502
3502
|
protoOf(IndexedTheoryFactory).mutableTheoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3503
|
-
return this.
|
|
3503
|
+
return this.p1s(clauses, unificator);
|
|
3504
3504
|
};
|
|
3505
|
-
protoOf(IndexedTheoryFactory).
|
|
3505
|
+
protoOf(IndexedTheoryFactory).q1s = function (unificator, clauses) {
|
|
3506
3506
|
return MutableIndexedTheory_init_$Create$(unificator, asIterable_0(clauses));
|
|
3507
3507
|
};
|
|
3508
3508
|
protoOf(IndexedTheoryFactory).mutableTheoryOfWithUnificator = function (unificator, clauses) {
|
|
3509
|
-
return this.
|
|
3509
|
+
return this.q1s(unificator, clauses);
|
|
3510
3510
|
};
|
|
3511
|
-
protoOf(IndexedTheoryFactory).
|
|
3511
|
+
protoOf(IndexedTheoryFactory).r1s = function (clauses, unificator) {
|
|
3512
3512
|
return MutableIndexedTheory_init_$Create$_0(unificator, clauses);
|
|
3513
3513
|
};
|
|
3514
3514
|
protoOf(IndexedTheoryFactory).mutableTheoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3515
|
-
return this.
|
|
3515
|
+
return this.r1s(clauses, unificator);
|
|
3516
3516
|
};
|
|
3517
3517
|
function Default_0() {
|
|
3518
3518
|
Default_instance_0 = this;
|
|
3519
|
-
this.
|
|
3519
|
+
this.s1s_1 = new ListedTheoryFactory(Companion_getInstance_1().k1k());
|
|
3520
3520
|
}
|
|
3521
3521
|
protoOf(Default_0).emptyTheoryWithUnificator = function (unificator) {
|
|
3522
|
-
return this.
|
|
3522
|
+
return this.s1s_1.k1s(unificator);
|
|
3523
3523
|
};
|
|
3524
3524
|
protoOf(Default_0).emptyTheory = function () {
|
|
3525
|
-
return this.
|
|
3525
|
+
return this.s1s_1.emptyTheory();
|
|
3526
3526
|
};
|
|
3527
3527
|
protoOf(Default_0).theoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3528
|
-
return this.
|
|
3528
|
+
return this.s1s_1.l1s(clauses, unificator);
|
|
3529
3529
|
};
|
|
3530
3530
|
protoOf(Default_0).theoryOfIterable = function (clauses) {
|
|
3531
|
-
return this.
|
|
3531
|
+
return this.s1s_1.theoryOfIterable(clauses);
|
|
3532
3532
|
};
|
|
3533
3533
|
protoOf(Default_0).theoryOfWithUnificator = function (unificator, clauses) {
|
|
3534
|
-
return this.
|
|
3534
|
+
return this.s1s_1.m1s(unificator, clauses);
|
|
3535
3535
|
};
|
|
3536
3536
|
protoOf(Default_0).theoryOf = function (clauses) {
|
|
3537
|
-
return this.
|
|
3537
|
+
return this.s1s_1.theoryOf(clauses);
|
|
3538
3538
|
};
|
|
3539
3539
|
protoOf(Default_0).theoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3540
|
-
return this.
|
|
3540
|
+
return this.s1s_1.n1s(clauses, unificator);
|
|
3541
3541
|
};
|
|
3542
3542
|
protoOf(Default_0).theoryOfSequence = function (clauses) {
|
|
3543
|
-
return this.
|
|
3543
|
+
return this.s1s_1.theoryOfSequence(clauses);
|
|
3544
3544
|
};
|
|
3545
3545
|
protoOf(Default_0).emptyMutableTheoryWithUnificator = function (unificator) {
|
|
3546
|
-
return this.
|
|
3546
|
+
return this.s1s_1.o1s(unificator);
|
|
3547
3547
|
};
|
|
3548
3548
|
protoOf(Default_0).emptyMutableTheory = function () {
|
|
3549
|
-
return this.
|
|
3549
|
+
return this.s1s_1.emptyMutableTheory();
|
|
3550
3550
|
};
|
|
3551
3551
|
protoOf(Default_0).mutableTheoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3552
|
-
return this.
|
|
3552
|
+
return this.s1s_1.p1s(clauses, unificator);
|
|
3553
3553
|
};
|
|
3554
3554
|
protoOf(Default_0).mutableTheoryOfIterable = function (clauses) {
|
|
3555
|
-
return this.
|
|
3555
|
+
return this.s1s_1.mutableTheoryOfIterable(clauses);
|
|
3556
3556
|
};
|
|
3557
3557
|
protoOf(Default_0).mutableTheoryOfWithUnificator = function (unificator, clauses) {
|
|
3558
|
-
return this.
|
|
3558
|
+
return this.s1s_1.q1s(unificator, clauses);
|
|
3559
3559
|
};
|
|
3560
3560
|
protoOf(Default_0).mutableTheoryOf = function (clauses) {
|
|
3561
|
-
return this.
|
|
3561
|
+
return this.s1s_1.mutableTheoryOf(clauses);
|
|
3562
3562
|
};
|
|
3563
3563
|
protoOf(Default_0).mutableTheoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3564
|
-
return this.
|
|
3564
|
+
return this.s1s_1.r1s(clauses, unificator);
|
|
3565
3565
|
};
|
|
3566
3566
|
protoOf(Default_0).mutableTheoryOfSequence = function (clauses) {
|
|
3567
|
-
return this.
|
|
3567
|
+
return this.s1s_1.mutableTheoryOfSequence(clauses);
|
|
3568
3568
|
};
|
|
3569
|
-
protoOf(Default_0).
|
|
3570
|
-
return this.
|
|
3569
|
+
protoOf(Default_0).r1k = function () {
|
|
3570
|
+
return this.s1s_1.t1s_1;
|
|
3571
3571
|
};
|
|
3572
3572
|
var Default_instance_0;
|
|
3573
3573
|
function Default_getInstance_0() {
|
|
@@ -3576,58 +3576,58 @@
|
|
|
3576
3576
|
return Default_instance_0;
|
|
3577
3577
|
}
|
|
3578
3578
|
function ListedTheoryFactory(unificator) {
|
|
3579
|
-
this.
|
|
3579
|
+
this.t1s_1 = unificator;
|
|
3580
3580
|
}
|
|
3581
|
-
protoOf(ListedTheoryFactory).
|
|
3582
|
-
return this.
|
|
3581
|
+
protoOf(ListedTheoryFactory).r1k = function () {
|
|
3582
|
+
return this.t1s_1;
|
|
3583
3583
|
};
|
|
3584
|
-
protoOf(ListedTheoryFactory).
|
|
3584
|
+
protoOf(ListedTheoryFactory).k1s = function (unificator) {
|
|
3585
3585
|
return ListedTheory_init_$Create$(unificator, emptyList());
|
|
3586
3586
|
};
|
|
3587
3587
|
protoOf(ListedTheoryFactory).emptyTheoryWithUnificator = function (unificator) {
|
|
3588
|
-
return this.
|
|
3588
|
+
return this.k1s(unificator);
|
|
3589
3589
|
};
|
|
3590
|
-
protoOf(ListedTheoryFactory).
|
|
3590
|
+
protoOf(ListedTheoryFactory).l1s = function (clauses, unificator) {
|
|
3591
3591
|
return ListedTheory_init_$Create$(unificator, clauses);
|
|
3592
3592
|
};
|
|
3593
3593
|
protoOf(ListedTheoryFactory).theoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3594
|
-
return this.
|
|
3594
|
+
return this.l1s(clauses, unificator);
|
|
3595
3595
|
};
|
|
3596
|
-
protoOf(ListedTheoryFactory).
|
|
3596
|
+
protoOf(ListedTheoryFactory).m1s = function (unificator, clauses) {
|
|
3597
3597
|
return ListedTheory_init_$Create$(unificator, asIterable_0(clauses));
|
|
3598
3598
|
};
|
|
3599
3599
|
protoOf(ListedTheoryFactory).theoryOfWithUnificator = function (unificator, clauses) {
|
|
3600
|
-
return this.
|
|
3600
|
+
return this.m1s(unificator, clauses);
|
|
3601
3601
|
};
|
|
3602
|
-
protoOf(ListedTheoryFactory).
|
|
3602
|
+
protoOf(ListedTheoryFactory).n1s = function (clauses, unificator) {
|
|
3603
3603
|
return ListedTheory_init_$Create$_0(unificator, clauses);
|
|
3604
3604
|
};
|
|
3605
3605
|
protoOf(ListedTheoryFactory).theoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3606
|
-
return this.
|
|
3606
|
+
return this.n1s(clauses, unificator);
|
|
3607
3607
|
};
|
|
3608
|
-
protoOf(ListedTheoryFactory).
|
|
3608
|
+
protoOf(ListedTheoryFactory).o1s = function (unificator) {
|
|
3609
3609
|
return MutableListedTheory_init_$Create$(unificator, emptyList());
|
|
3610
3610
|
};
|
|
3611
3611
|
protoOf(ListedTheoryFactory).emptyMutableTheoryWithUnificator = function (unificator) {
|
|
3612
|
-
return this.
|
|
3612
|
+
return this.o1s(unificator);
|
|
3613
3613
|
};
|
|
3614
|
-
protoOf(ListedTheoryFactory).
|
|
3614
|
+
protoOf(ListedTheoryFactory).p1s = function (clauses, unificator) {
|
|
3615
3615
|
return MutableListedTheory_init_$Create$(unificator, clauses);
|
|
3616
3616
|
};
|
|
3617
3617
|
protoOf(ListedTheoryFactory).mutableTheoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3618
|
-
return this.
|
|
3618
|
+
return this.p1s(clauses, unificator);
|
|
3619
3619
|
};
|
|
3620
|
-
protoOf(ListedTheoryFactory).
|
|
3620
|
+
protoOf(ListedTheoryFactory).q1s = function (unificator, clauses) {
|
|
3621
3621
|
return MutableListedTheory_init_$Create$(unificator, asIterable_0(clauses));
|
|
3622
3622
|
};
|
|
3623
3623
|
protoOf(ListedTheoryFactory).mutableTheoryOfWithUnificator = function (unificator, clauses) {
|
|
3624
|
-
return this.
|
|
3624
|
+
return this.q1s(unificator, clauses);
|
|
3625
3625
|
};
|
|
3626
|
-
protoOf(ListedTheoryFactory).
|
|
3626
|
+
protoOf(ListedTheoryFactory).r1s = function (clauses, unificator) {
|
|
3627
3627
|
return MutableListedTheory_init_$Create$_0(unificator, clauses);
|
|
3628
3628
|
};
|
|
3629
3629
|
protoOf(ListedTheoryFactory).mutableTheoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3630
|
-
return this.
|
|
3630
|
+
return this.r1s(clauses, unificator);
|
|
3631
3631
|
};
|
|
3632
3632
|
function Companion_4() {
|
|
3633
3633
|
}
|
|
@@ -3706,24 +3706,24 @@
|
|
|
3706
3706
|
}
|
|
3707
3707
|
function Success_0(theory, clauses) {
|
|
3708
3708
|
RetractResult.call(this);
|
|
3709
|
-
this.
|
|
3710
|
-
this.
|
|
3709
|
+
this.a1t_1 = theory;
|
|
3710
|
+
this.b1t_1 = clauses;
|
|
3711
3711
|
}
|
|
3712
|
-
protoOf(Success_0).
|
|
3713
|
-
return this.
|
|
3712
|
+
protoOf(Success_0).o1r = function () {
|
|
3713
|
+
return this.a1t_1;
|
|
3714
3714
|
};
|
|
3715
|
-
protoOf(Success_0).
|
|
3716
|
-
return this.
|
|
3715
|
+
protoOf(Success_0).b1l = function () {
|
|
3716
|
+
return this.b1t_1;
|
|
3717
3717
|
};
|
|
3718
|
-
protoOf(Success_0).
|
|
3719
|
-
return first_0(this.
|
|
3718
|
+
protoOf(Success_0).u1l = function () {
|
|
3719
|
+
return first_0(this.b1t_1);
|
|
3720
3720
|
};
|
|
3721
3721
|
protoOf(Success_0).toString = function () {
|
|
3722
|
-
return 'Success(theory=' + toString(this.
|
|
3722
|
+
return 'Success(theory=' + toString(this.a1t_1) + ', clauses=' + toString(this.b1t_1) + ')';
|
|
3723
3723
|
};
|
|
3724
3724
|
protoOf(Success_0).hashCode = function () {
|
|
3725
|
-
var result = hashCode(this.
|
|
3726
|
-
result = imul(result, 31) + hashCode(this.
|
|
3725
|
+
var result = hashCode(this.a1t_1);
|
|
3726
|
+
result = imul(result, 31) + hashCode(this.b1t_1) | 0;
|
|
3727
3727
|
return result;
|
|
3728
3728
|
};
|
|
3729
3729
|
protoOf(Success_0).equals = function (other) {
|
|
@@ -3731,37 +3731,37 @@
|
|
|
3731
3731
|
return true;
|
|
3732
3732
|
if (!(other instanceof Success_0))
|
|
3733
3733
|
return false;
|
|
3734
|
-
if (!equals(this.
|
|
3734
|
+
if (!equals(this.a1t_1, other.a1t_1))
|
|
3735
3735
|
return false;
|
|
3736
|
-
if (!equals(this.
|
|
3736
|
+
if (!equals(this.b1t_1, other.b1t_1))
|
|
3737
3737
|
return false;
|
|
3738
3738
|
return true;
|
|
3739
3739
|
};
|
|
3740
3740
|
function Failure_0(theory) {
|
|
3741
3741
|
RetractResult.call(this);
|
|
3742
|
-
this.
|
|
3742
|
+
this.c1t_1 = theory;
|
|
3743
3743
|
}
|
|
3744
|
-
protoOf(Failure_0).
|
|
3745
|
-
return this.
|
|
3744
|
+
protoOf(Failure_0).o1r = function () {
|
|
3745
|
+
return this.c1t_1;
|
|
3746
3746
|
};
|
|
3747
|
-
protoOf(Failure_0).
|
|
3747
|
+
protoOf(Failure_0).b1l = function () {
|
|
3748
3748
|
return null;
|
|
3749
3749
|
};
|
|
3750
|
-
protoOf(Failure_0).
|
|
3750
|
+
protoOf(Failure_0).u1l = function () {
|
|
3751
3751
|
return null;
|
|
3752
3752
|
};
|
|
3753
3753
|
protoOf(Failure_0).toString = function () {
|
|
3754
|
-
return 'Failure(theory=' + toString(this.
|
|
3754
|
+
return 'Failure(theory=' + toString(this.c1t_1) + ')';
|
|
3755
3755
|
};
|
|
3756
3756
|
protoOf(Failure_0).hashCode = function () {
|
|
3757
|
-
return hashCode(this.
|
|
3757
|
+
return hashCode(this.c1t_1);
|
|
3758
3758
|
};
|
|
3759
3759
|
protoOf(Failure_0).equals = function (other) {
|
|
3760
3760
|
if (this === other)
|
|
3761
3761
|
return true;
|
|
3762
3762
|
if (!(other instanceof Failure_0))
|
|
3763
3763
|
return false;
|
|
3764
|
-
if (!equals(this.
|
|
3764
|
+
if (!equals(this.c1t_1, other.c1t_1))
|
|
3765
3765
|
return false;
|
|
3766
3766
|
return true;
|
|
3767
3767
|
};
|
|
@@ -3773,31 +3773,31 @@
|
|
|
3773
3773
|
return this.indexedOfSequence(unificator, emptySequence());
|
|
3774
3774
|
};
|
|
3775
3775
|
protoOf(Companion_5).emptyWithDefaultUnificator = function () {
|
|
3776
|
-
return this.empty(Companion_getInstance_1().
|
|
3776
|
+
return this.empty(Companion_getInstance_1().k1k());
|
|
3777
3777
|
};
|
|
3778
3778
|
protoOf(Companion_5).of = function (unificator, clause) {
|
|
3779
3779
|
return this.indexedOf(unificator, clause.slice());
|
|
3780
3780
|
};
|
|
3781
3781
|
protoOf(Companion_5).ofWithDefaultUnificator = function (clause) {
|
|
3782
|
-
return this.indexedOf(Companion_getInstance_1().
|
|
3782
|
+
return this.indexedOf(Companion_getInstance_1().k1k(), clause.slice());
|
|
3783
3783
|
};
|
|
3784
3784
|
protoOf(Companion_5).ofIterable = function (unificator, clauses) {
|
|
3785
3785
|
return this.indexedOfIterable(unificator, clauses);
|
|
3786
3786
|
};
|
|
3787
3787
|
protoOf(Companion_5).ofIterableWithDefaultUnificator = function (clauses) {
|
|
3788
|
-
return this.indexedOfIterable(Companion_getInstance_1().
|
|
3788
|
+
return this.indexedOfIterable(Companion_getInstance_1().k1k(), clauses);
|
|
3789
3789
|
};
|
|
3790
3790
|
protoOf(Companion_5).ofSequence = function (unificator, clauses) {
|
|
3791
3791
|
return this.indexedOfSequence(unificator, clauses);
|
|
3792
3792
|
};
|
|
3793
3793
|
protoOf(Companion_5).ofSequenceWithDefaultUnificator = function (clauses) {
|
|
3794
|
-
return this.indexedOfSequence(Companion_getInstance_1().
|
|
3794
|
+
return this.indexedOfSequence(Companion_getInstance_1().k1k(), clauses);
|
|
3795
3795
|
};
|
|
3796
3796
|
protoOf(Companion_5).ofScopes = function (unificator, clauses) {
|
|
3797
3797
|
return this.indexedOfScopes(unificator, clauses.slice());
|
|
3798
3798
|
};
|
|
3799
3799
|
protoOf(Companion_5).ofScopesWithDefaultUnificator = function (clauses) {
|
|
3800
|
-
return this.indexedOfScopes(Companion_getInstance_1().
|
|
3800
|
+
return this.indexedOfScopes(Companion_getInstance_1().k1k(), clauses.slice());
|
|
3801
3801
|
};
|
|
3802
3802
|
protoOf(Companion_5).emptyIndexed = function (unificator) {
|
|
3803
3803
|
return this.indexedOfIterable(unificator, emptyList());
|
|
@@ -3890,7 +3890,7 @@
|
|
|
3890
3890
|
}
|
|
3891
3891
|
function TheoryUtils() {
|
|
3892
3892
|
}
|
|
3893
|
-
protoOf(TheoryUtils).
|
|
3893
|
+
protoOf(TheoryUtils).n1l = function (clause) {
|
|
3894
3894
|
// Inline function 'kotlin.also' call
|
|
3895
3895
|
// Inline function 'kotlin.require' call
|
|
3896
3896
|
if (!clause.nw()) {
|
|
@@ -3899,18 +3899,18 @@
|
|
|
3899
3899
|
}
|
|
3900
3900
|
return clause;
|
|
3901
3901
|
};
|
|
3902
|
-
protoOf(TheoryUtils).
|
|
3902
|
+
protoOf(TheoryUtils).x1r = function (clauses) {
|
|
3903
3903
|
// Inline function 'kotlin.also' call
|
|
3904
3904
|
var this_0 = asSequence_0(clauses);
|
|
3905
3905
|
actualCheck(TheoryUtils_instance, this_0);
|
|
3906
3906
|
return this_0;
|
|
3907
3907
|
};
|
|
3908
|
-
protoOf(TheoryUtils).
|
|
3908
|
+
protoOf(TheoryUtils).y1l = function (clauses) {
|
|
3909
3909
|
// Inline function 'kotlin.also' call
|
|
3910
3910
|
actualCheck(TheoryUtils_instance, asSequence(clauses));
|
|
3911
3911
|
return clauses;
|
|
3912
3912
|
};
|
|
3913
|
-
protoOf(TheoryUtils).
|
|
3913
|
+
protoOf(TheoryUtils).v1r = function (clauses) {
|
|
3914
3914
|
// Inline function 'kotlin.also' call
|
|
3915
3915
|
actualCheck(TheoryUtils_instance, clauses);
|
|
3916
3916
|
return clauses;
|
|
@@ -3920,81 +3920,81 @@
|
|
|
3920
3920
|
return TheoryUtils_instance;
|
|
3921
3921
|
}
|
|
3922
3922
|
function AbstractIndexedTheory$clauses$$inlined$Iterable$1(this$0) {
|
|
3923
|
-
this.
|
|
3923
|
+
this.d1t_1 = this$0;
|
|
3924
3924
|
}
|
|
3925
3925
|
protoOf(AbstractIndexedTheory$clauses$$inlined$Iterable$1).n = function () {
|
|
3926
|
-
return this.
|
|
3926
|
+
return this.d1t_1.g1t().n();
|
|
3927
3927
|
};
|
|
3928
3928
|
function AbstractIndexedTheory(queue, tags) {
|
|
3929
3929
|
AbstractTheory.call(this, tags);
|
|
3930
|
-
this.
|
|
3930
|
+
this.f1t_1 = queue;
|
|
3931
3931
|
}
|
|
3932
|
-
protoOf(AbstractIndexedTheory).
|
|
3933
|
-
return this.
|
|
3932
|
+
protoOf(AbstractIndexedTheory).r1k = function () {
|
|
3933
|
+
return this.g1t().r1k();
|
|
3934
3934
|
};
|
|
3935
|
-
protoOf(AbstractIndexedTheory).
|
|
3936
|
-
return this.
|
|
3935
|
+
protoOf(AbstractIndexedTheory).g1t = function () {
|
|
3936
|
+
return this.f1t_1;
|
|
3937
3937
|
};
|
|
3938
|
-
protoOf(AbstractIndexedTheory).
|
|
3939
|
-
return this.
|
|
3938
|
+
protoOf(AbstractIndexedTheory).u1k = function () {
|
|
3939
|
+
return this.g1t().t1k();
|
|
3940
3940
|
};
|
|
3941
|
-
protoOf(AbstractIndexedTheory).
|
|
3942
|
-
return this.
|
|
3941
|
+
protoOf(AbstractIndexedTheory).v1k = function () {
|
|
3942
|
+
return this.g1t().v1k();
|
|
3943
3943
|
};
|
|
3944
|
-
protoOf(AbstractIndexedTheory).
|
|
3944
|
+
protoOf(AbstractIndexedTheory).b1l = function () {
|
|
3945
3945
|
// Inline function 'kotlin.collections.Iterable' call
|
|
3946
3946
|
return new AbstractIndexedTheory$clauses$$inlined$Iterable$1(this);
|
|
3947
3947
|
};
|
|
3948
|
-
protoOf(AbstractIndexedTheory).
|
|
3949
|
-
return this.
|
|
3948
|
+
protoOf(AbstractIndexedTheory).z1k = function (clause) {
|
|
3949
|
+
return this.g1t().z1k(clause);
|
|
3950
3950
|
};
|
|
3951
3951
|
protoOf(AbstractIndexedTheory).get = function (clause) {
|
|
3952
|
-
return this.
|
|
3952
|
+
return this.z1k(clause);
|
|
3953
3953
|
};
|
|
3954
3954
|
protoOf(AbstractIndexedTheory).s = function () {
|
|
3955
|
-
return fromInt(this.
|
|
3955
|
+
return fromInt(this.g1t().s());
|
|
3956
3956
|
};
|
|
3957
|
-
protoOf(AbstractIndexedTheory).
|
|
3958
|
-
return this.
|
|
3957
|
+
protoOf(AbstractIndexedTheory).w1k = function () {
|
|
3958
|
+
return this.g1t().isEmpty();
|
|
3959
3959
|
};
|
|
3960
|
-
protoOf(AbstractIndexedTheory).
|
|
3961
|
-
return !this.
|
|
3960
|
+
protoOf(AbstractIndexedTheory).r1r = function () {
|
|
3961
|
+
return !this.w1k();
|
|
3962
3962
|
};
|
|
3963
3963
|
function AbstractListedTheory(unificator, clauses, tags) {
|
|
3964
3964
|
AbstractTheory.call(this, tags);
|
|
3965
|
-
this.
|
|
3966
|
-
this.
|
|
3965
|
+
this.i1t_1 = clauses;
|
|
3966
|
+
this.j1t_1 = unificator;
|
|
3967
3967
|
}
|
|
3968
|
-
protoOf(AbstractListedTheory).
|
|
3969
|
-
return this.
|
|
3968
|
+
protoOf(AbstractListedTheory).b1l = function () {
|
|
3969
|
+
return this.i1t_1;
|
|
3970
3970
|
};
|
|
3971
|
-
protoOf(AbstractListedTheory).
|
|
3972
|
-
this.
|
|
3971
|
+
protoOf(AbstractListedTheory).k1t = function (_set____db54di) {
|
|
3972
|
+
this.j1t_1 = _set____db54di;
|
|
3973
3973
|
};
|
|
3974
|
-
protoOf(AbstractListedTheory).
|
|
3975
|
-
return this.
|
|
3974
|
+
protoOf(AbstractListedTheory).r1k = function () {
|
|
3975
|
+
return this.j1t_1;
|
|
3976
3976
|
};
|
|
3977
|
-
protoOf(AbstractListedTheory).
|
|
3977
|
+
protoOf(AbstractListedTheory).z1k = function (clause) {
|
|
3978
3978
|
// Inline function 'kotlin.collections.filter' call
|
|
3979
|
-
var tmp0 = this.
|
|
3979
|
+
var tmp0 = this.b1l();
|
|
3980
3980
|
// Inline function 'kotlin.collections.filterTo' call
|
|
3981
3981
|
var destination = ArrayList_init_$Create$_0();
|
|
3982
3982
|
var _iterator__ex2g4s = tmp0.n();
|
|
3983
3983
|
while (_iterator__ex2g4s.q()) {
|
|
3984
3984
|
var element = _iterator__ex2g4s.r();
|
|
3985
|
-
if (this.
|
|
3985
|
+
if (this.r1k().match(clause, element)) {
|
|
3986
3986
|
destination.l(element);
|
|
3987
3987
|
}
|
|
3988
3988
|
}
|
|
3989
3989
|
return asSequence(destination);
|
|
3990
3990
|
};
|
|
3991
3991
|
protoOf(AbstractListedTheory).get = function (clause) {
|
|
3992
|
-
return this.
|
|
3992
|
+
return this.z1k(clause);
|
|
3993
3993
|
};
|
|
3994
3994
|
function IndexedTheory_init_$Init$(unificator, clauses, tags, $this) {
|
|
3995
3995
|
tags = tags === VOID ? emptyMap() : tags;
|
|
3996
3996
|
IndexedTheory.call($this, Companion_instance_4.ofIterable(unificator, clauses), tags);
|
|
3997
|
-
TheoryUtils_instance.
|
|
3997
|
+
TheoryUtils_instance.y1l(clauses);
|
|
3998
3998
|
return $this;
|
|
3999
3999
|
}
|
|
4000
4000
|
function IndexedTheory_init_$Create$(unificator, clauses, tags) {
|
|
@@ -4009,14 +4009,14 @@
|
|
|
4009
4009
|
return IndexedTheory_init_$Init$_0(unificator, clauses, tags, objectCreate(protoOf(IndexedTheory)));
|
|
4010
4010
|
}
|
|
4011
4011
|
function _get_hashCodeCache__ny3r0q_0($this) {
|
|
4012
|
-
var tmp0 = $this.
|
|
4012
|
+
var tmp0 = $this.n1t_1;
|
|
4013
4013
|
var tmp = KProperty1;
|
|
4014
4014
|
// Inline function 'kotlin.getValue' call
|
|
4015
4015
|
getPropertyCallableRef('hashCodeCache', 1, tmp, IndexedTheory$_get_hashCodeCache_$ref_4wtmhh(), null);
|
|
4016
4016
|
return tmp0.e2();
|
|
4017
4017
|
}
|
|
4018
4018
|
function _get_sizeCache__6eswog($this) {
|
|
4019
|
-
var tmp0 = $this.
|
|
4019
|
+
var tmp0 = $this.o1t_1;
|
|
4020
4020
|
var tmp = KProperty1;
|
|
4021
4021
|
// Inline function 'kotlin.getValue' call
|
|
4022
4022
|
getPropertyCallableRef('sizeCache', 1, tmp, IndexedTheory$_get_sizeCache_$ref_fqi1u9(), null);
|
|
@@ -4045,42 +4045,42 @@
|
|
|
4045
4045
|
function IndexedTheory(queue, tags) {
|
|
4046
4046
|
AbstractIndexedTheory.call(this, queue, tags);
|
|
4047
4047
|
var tmp = this;
|
|
4048
|
-
tmp.
|
|
4048
|
+
tmp.n1t_1 = lazy(IndexedTheory$hashCodeCache$delegate$lambda(this));
|
|
4049
4049
|
var tmp_0 = this;
|
|
4050
|
-
tmp_0.
|
|
4050
|
+
tmp_0.o1t_1 = lazy(IndexedTheory$sizeCache$delegate$lambda(this));
|
|
4051
4051
|
}
|
|
4052
|
-
protoOf(IndexedTheory).
|
|
4052
|
+
protoOf(IndexedTheory).d1s = function (clauses, tags, unificator) {
|
|
4053
4053
|
return IndexedTheory_init_$Create$_0(unificator, clauses, tags);
|
|
4054
4054
|
};
|
|
4055
|
-
protoOf(IndexedTheory).
|
|
4056
|
-
var newTheory = Companion_instance_4.ofIterable(this.
|
|
4055
|
+
protoOf(IndexedTheory).x1s = function (clause) {
|
|
4056
|
+
var newTheory = Companion_instance_4.ofIterable(this.r1k(), this.b1l());
|
|
4057
4057
|
var retracted = newTheory.retrieveFirst(clause);
|
|
4058
|
-
return retracted.
|
|
4058
|
+
return retracted.v1l() ? new Failure_0(this) : new Success_0(new IndexedTheory(retracted.t1l(), this.lr()), ensureNotNull(retracted.b1l()));
|
|
4059
4059
|
};
|
|
4060
4060
|
protoOf(IndexedTheory).retract = function (clause) {
|
|
4061
|
-
return this.
|
|
4061
|
+
return this.x1s(clause);
|
|
4062
4062
|
};
|
|
4063
|
-
protoOf(IndexedTheory).
|
|
4064
|
-
return this.
|
|
4063
|
+
protoOf(IndexedTheory).u1r = function (theory) {
|
|
4064
|
+
return this.w1k() ? theory.toImmutableTheory() : theory.w1k() ? this : protoOf(AbstractIndexedTheory).u1r.call(this, theory);
|
|
4065
4065
|
};
|
|
4066
4066
|
protoOf(IndexedTheory).plusTheory = function (theory) {
|
|
4067
|
-
return this.
|
|
4067
|
+
return this.u1r(theory);
|
|
4068
4068
|
};
|
|
4069
|
-
protoOf(IndexedTheory).
|
|
4070
|
-
return Companion_instance_9.indexedOfIterable(this.
|
|
4069
|
+
protoOf(IndexedTheory).u1s = function () {
|
|
4070
|
+
return Companion_instance_9.indexedOfIterable(this.r1k(), this);
|
|
4071
4071
|
};
|
|
4072
4072
|
protoOf(IndexedTheory).toMutableTheory = function () {
|
|
4073
|
-
return this.
|
|
4073
|
+
return this.u1s();
|
|
4074
4074
|
};
|
|
4075
|
-
protoOf(IndexedTheory).
|
|
4076
|
-
var newTheory = Companion_instance_5.ofIterable(this.
|
|
4075
|
+
protoOf(IndexedTheory).f1s = function (clauses) {
|
|
4076
|
+
var newTheory = Companion_instance_5.ofIterable(this.r1k(), this.b1l());
|
|
4077
4077
|
var removed = dequeOf([]);
|
|
4078
4078
|
var _iterator__ex2g4s = clauses.n();
|
|
4079
4079
|
while (_iterator__ex2g4s.q()) {
|
|
4080
4080
|
var clause = _iterator__ex2g4s.r();
|
|
4081
|
-
var result = newTheory.
|
|
4081
|
+
var result = newTheory.q1l(clause);
|
|
4082
4082
|
if (result.d10()) {
|
|
4083
|
-
removed.w(ensureNotNull(result.
|
|
4083
|
+
removed.w(ensureNotNull(result.b1l()));
|
|
4084
4084
|
}
|
|
4085
4085
|
}
|
|
4086
4086
|
var tmp;
|
|
@@ -4092,15 +4092,15 @@
|
|
|
4092
4092
|
return tmp;
|
|
4093
4093
|
};
|
|
4094
4094
|
protoOf(IndexedTheory).retractIterable = function (clauses) {
|
|
4095
|
-
return this.
|
|
4095
|
+
return this.f1s(clauses);
|
|
4096
4096
|
};
|
|
4097
|
-
protoOf(IndexedTheory).
|
|
4098
|
-
var newTheory = Companion_instance_4.ofIterable(this.
|
|
4099
|
-
var retracted = newTheory.
|
|
4100
|
-
return retracted.
|
|
4097
|
+
protoOf(IndexedTheory).j1l = function (clause) {
|
|
4098
|
+
var newTheory = Companion_instance_4.ofIterable(this.r1k(), this.b1l());
|
|
4099
|
+
var retracted = newTheory.i1l(clause);
|
|
4100
|
+
return retracted.v1l() ? new Failure_0(this) : new Success_0(new IndexedTheory(retracted.t1l(), this.lr()), ensureNotNull(retracted.b1l()));
|
|
4101
4101
|
};
|
|
4102
4102
|
protoOf(IndexedTheory).retractAll = function (clause) {
|
|
4103
|
-
return this.
|
|
4103
|
+
return this.j1l(clause);
|
|
4104
4104
|
};
|
|
4105
4105
|
protoOf(IndexedTheory).hashCode = function () {
|
|
4106
4106
|
return _get_hashCodeCache__ny3r0q_0(this);
|
|
@@ -4113,7 +4113,7 @@
|
|
|
4113
4113
|
if (tags === this.lr()) {
|
|
4114
4114
|
tmp = this;
|
|
4115
4115
|
} else {
|
|
4116
|
-
tmp = new IndexedTheory(this.
|
|
4116
|
+
tmp = new IndexedTheory(this.g1t(), tags);
|
|
4117
4117
|
}
|
|
4118
4118
|
return tmp;
|
|
4119
4119
|
};
|
|
@@ -4123,7 +4123,7 @@
|
|
|
4123
4123
|
function ListedTheory_init_$Init$(unificator, clauses, tags, $this) {
|
|
4124
4124
|
tags = tags === VOID ? emptyMap() : tags;
|
|
4125
4125
|
ListedTheory.call($this, unificator, toList_0(clauses), tags);
|
|
4126
|
-
TheoryUtils_instance.
|
|
4126
|
+
TheoryUtils_instance.y1l(clauses);
|
|
4127
4127
|
return $this;
|
|
4128
4128
|
}
|
|
4129
4129
|
function ListedTheory_init_$Create$(unificator, clauses, tags) {
|
|
@@ -4132,21 +4132,21 @@
|
|
|
4132
4132
|
function ListedTheory_init_$Init$_0(unificator, clauses, tags, $this) {
|
|
4133
4133
|
tags = tags === VOID ? emptyMap() : tags;
|
|
4134
4134
|
ListedTheory.call($this, unificator, toList(clauses), tags);
|
|
4135
|
-
TheoryUtils_instance.
|
|
4135
|
+
TheoryUtils_instance.v1r(clauses);
|
|
4136
4136
|
return $this;
|
|
4137
4137
|
}
|
|
4138
4138
|
function ListedTheory_init_$Create$_0(unificator, clauses, tags) {
|
|
4139
4139
|
return ListedTheory_init_$Init$_0(unificator, clauses, tags, objectCreate(protoOf(ListedTheory)));
|
|
4140
4140
|
}
|
|
4141
4141
|
function _get_hashCodeCache__ny3r0q_1($this) {
|
|
4142
|
-
var tmp0 = $this.
|
|
4142
|
+
var tmp0 = $this.s1t_1;
|
|
4143
4143
|
var tmp = KProperty1;
|
|
4144
4144
|
// Inline function 'kotlin.getValue' call
|
|
4145
4145
|
getPropertyCallableRef('hashCodeCache', 1, tmp, ListedTheory$_get_hashCodeCache_$ref_jbnoxj(), null);
|
|
4146
4146
|
return tmp0.e2();
|
|
4147
4147
|
}
|
|
4148
4148
|
function _get_sizeCache__6eswog_0($this) {
|
|
4149
|
-
var tmp0 = $this.
|
|
4149
|
+
var tmp0 = $this.t1t_1;
|
|
4150
4150
|
var tmp = KProperty1;
|
|
4151
4151
|
// Inline function 'kotlin.getValue' call
|
|
4152
4152
|
getPropertyCallableRef('sizeCache', 1, tmp, ListedTheory$_get_sizeCache_$ref_3h5dr1(), null);
|
|
@@ -4175,22 +4175,22 @@
|
|
|
4175
4175
|
function ListedTheory(unificator, clauses, tags) {
|
|
4176
4176
|
AbstractListedTheory.call(this, unificator, clauses, tags);
|
|
4177
4177
|
var tmp = this;
|
|
4178
|
-
tmp.
|
|
4178
|
+
tmp.s1t_1 = lazy(ListedTheory$hashCodeCache$delegate$lambda(this));
|
|
4179
4179
|
var tmp_0 = this;
|
|
4180
|
-
tmp_0.
|
|
4180
|
+
tmp_0.t1t_1 = lazy(ListedTheory$sizeCache$delegate$lambda(this));
|
|
4181
4181
|
}
|
|
4182
|
-
protoOf(ListedTheory).
|
|
4182
|
+
protoOf(ListedTheory).d1s = function (clauses, tags, unificator) {
|
|
4183
4183
|
return ListedTheory_init_$Create$_0(unificator, clauses, tags);
|
|
4184
4184
|
};
|
|
4185
|
-
protoOf(ListedTheory).
|
|
4185
|
+
protoOf(ListedTheory).x1s = function (clause) {
|
|
4186
4186
|
// Inline function 'kotlin.collections.filter' call
|
|
4187
|
-
var tmp0 = this.
|
|
4187
|
+
var tmp0 = this.b1l();
|
|
4188
4188
|
// Inline function 'kotlin.collections.filterTo' call
|
|
4189
4189
|
var destination = ArrayList_init_$Create$_0();
|
|
4190
4190
|
var _iterator__ex2g4s = tmp0.n();
|
|
4191
4191
|
while (_iterator__ex2g4s.q()) {
|
|
4192
4192
|
var element = _iterator__ex2g4s.r();
|
|
4193
|
-
if (this.
|
|
4193
|
+
if (this.r1k().match(clause, element)) {
|
|
4194
4194
|
destination.l(element);
|
|
4195
4195
|
}
|
|
4196
4196
|
}
|
|
@@ -4201,7 +4201,7 @@
|
|
|
4201
4201
|
} else {
|
|
4202
4202
|
var toBeActuallyRetracted = first(retractability);
|
|
4203
4203
|
// Inline function 'kotlin.collections.filter' call
|
|
4204
|
-
var tmp0_0 = this.
|
|
4204
|
+
var tmp0_0 = this.b1l();
|
|
4205
4205
|
// Inline function 'kotlin.collections.filterTo' call
|
|
4206
4206
|
var destination_0 = ArrayList_init_$Create$_0();
|
|
4207
4207
|
var _iterator__ex2g4s_0 = tmp0_0.n();
|
|
@@ -4212,21 +4212,21 @@
|
|
|
4212
4212
|
}
|
|
4213
4213
|
}
|
|
4214
4214
|
var newTheory = destination_0;
|
|
4215
|
-
tmp = new Success_0(new ListedTheory(this.
|
|
4215
|
+
tmp = new Success_0(new ListedTheory(this.r1k(), newTheory, this.lr()), listOf_0(toBeActuallyRetracted));
|
|
4216
4216
|
}
|
|
4217
4217
|
return tmp;
|
|
4218
4218
|
};
|
|
4219
4219
|
protoOf(ListedTheory).retract = function (clause) {
|
|
4220
|
-
return this.
|
|
4220
|
+
return this.x1s(clause);
|
|
4221
4221
|
};
|
|
4222
|
-
protoOf(ListedTheory).
|
|
4223
|
-
return Companion_instance_9.listedOfIterable(this.
|
|
4222
|
+
protoOf(ListedTheory).u1s = function () {
|
|
4223
|
+
return Companion_instance_9.listedOfIterable(this.r1k(), this);
|
|
4224
4224
|
};
|
|
4225
4225
|
protoOf(ListedTheory).toMutableTheory = function () {
|
|
4226
|
-
return this.
|
|
4226
|
+
return this.u1s();
|
|
4227
4227
|
};
|
|
4228
|
-
protoOf(ListedTheory).
|
|
4229
|
-
var residual = dequeOf_1(this.
|
|
4228
|
+
protoOf(ListedTheory).f1s = function (clauses) {
|
|
4229
|
+
var residual = dequeOf_1(this.b1l());
|
|
4230
4230
|
var removed = dequeOf([]);
|
|
4231
4231
|
var i = residual.n();
|
|
4232
4232
|
while (i.q()) {
|
|
@@ -4247,7 +4247,7 @@
|
|
|
4247
4247
|
var _iterator__ex2g4s = clauses.n();
|
|
4248
4248
|
while (_iterator__ex2g4s.q()) {
|
|
4249
4249
|
var element = _iterator__ex2g4s.r();
|
|
4250
|
-
if (this.
|
|
4250
|
+
if (this.r1k().match(current, element)) {
|
|
4251
4251
|
tmp$ret$0 = true;
|
|
4252
4252
|
break $l$block_0;
|
|
4253
4253
|
}
|
|
@@ -4263,22 +4263,22 @@
|
|
|
4263
4263
|
if (removed.h()) {
|
|
4264
4264
|
tmp_0 = new Failure_0(this);
|
|
4265
4265
|
} else {
|
|
4266
|
-
tmp_0 = new Success_0(new ListedTheory(this.
|
|
4266
|
+
tmp_0 = new Success_0(new ListedTheory(this.r1k(), residual, this.lr()), removed);
|
|
4267
4267
|
}
|
|
4268
4268
|
return tmp_0;
|
|
4269
4269
|
};
|
|
4270
4270
|
protoOf(ListedTheory).retractIterable = function (clauses) {
|
|
4271
|
-
return this.
|
|
4271
|
+
return this.f1s(clauses);
|
|
4272
4272
|
};
|
|
4273
|
-
protoOf(ListedTheory).
|
|
4273
|
+
protoOf(ListedTheory).j1l = function (clause) {
|
|
4274
4274
|
// Inline function 'kotlin.collections.filter' call
|
|
4275
|
-
var tmp0 = this.
|
|
4275
|
+
var tmp0 = this.b1l();
|
|
4276
4276
|
// Inline function 'kotlin.collections.filterTo' call
|
|
4277
4277
|
var destination = ArrayList_init_$Create$_0();
|
|
4278
4278
|
var _iterator__ex2g4s = tmp0.n();
|
|
4279
4279
|
while (_iterator__ex2g4s.q()) {
|
|
4280
4280
|
var element = _iterator__ex2g4s.r();
|
|
4281
|
-
if (this.
|
|
4281
|
+
if (this.r1k().match(clause, element)) {
|
|
4282
4282
|
destination.l(element);
|
|
4283
4283
|
}
|
|
4284
4284
|
}
|
|
@@ -4288,13 +4288,13 @@
|
|
|
4288
4288
|
tmp = new Failure_0(this);
|
|
4289
4289
|
} else {
|
|
4290
4290
|
// Inline function 'kotlin.collections.partition' call
|
|
4291
|
-
var this_0 = toList_0(this.
|
|
4291
|
+
var this_0 = toList_0(this.b1l());
|
|
4292
4292
|
var first = ArrayList_init_$Create$_0();
|
|
4293
4293
|
var second = ArrayList_init_$Create$_0();
|
|
4294
4294
|
var _iterator__ex2g4s_0 = this_0.n();
|
|
4295
4295
|
while (_iterator__ex2g4s_0.q()) {
|
|
4296
4296
|
var element_0 = _iterator__ex2g4s_0.r();
|
|
4297
|
-
if (this.
|
|
4297
|
+
if (this.r1k().match(clause, element_0)) {
|
|
4298
4298
|
first.l(element_0);
|
|
4299
4299
|
} else {
|
|
4300
4300
|
second.l(element_0);
|
|
@@ -4303,12 +4303,12 @@
|
|
|
4303
4303
|
var partitionedClauses = new Pair(first, second);
|
|
4304
4304
|
var newTheory = partitionedClauses.second;
|
|
4305
4305
|
var toBeActuallyRetracted = partitionedClauses.first;
|
|
4306
|
-
tmp = new Success_0(new ListedTheory(this.
|
|
4306
|
+
tmp = new Success_0(new ListedTheory(this.r1k(), newTheory, this.lr()), toBeActuallyRetracted);
|
|
4307
4307
|
}
|
|
4308
4308
|
return tmp;
|
|
4309
4309
|
};
|
|
4310
4310
|
protoOf(ListedTheory).retractAll = function (clause) {
|
|
4311
|
-
return this.
|
|
4311
|
+
return this.j1l(clause);
|
|
4312
4312
|
};
|
|
4313
4313
|
protoOf(ListedTheory).hashCode = function () {
|
|
4314
4314
|
return _get_hashCodeCache__ny3r0q_1(this);
|
|
@@ -4317,21 +4317,21 @@
|
|
|
4317
4317
|
return _get_sizeCache__6eswog_0(this);
|
|
4318
4318
|
};
|
|
4319
4319
|
protoOf(ListedTheory).b10 = function (tags) {
|
|
4320
|
-
return tags === this.lr() ? this : new ListedTheory(this.
|
|
4320
|
+
return tags === this.lr() ? this : new ListedTheory(this.r1k(), this.b1l(), tags);
|
|
4321
4321
|
};
|
|
4322
4322
|
protoOf(ListedTheory).resetTags = function (tags) {
|
|
4323
4323
|
return this.b10(tags);
|
|
4324
4324
|
};
|
|
4325
|
-
protoOf(ListedTheory).
|
|
4326
|
-
return this.
|
|
4325
|
+
protoOf(ListedTheory).u1r = function (theory) {
|
|
4326
|
+
return this.w1k() ? theory.toImmutableTheory() : theory.w1k() ? this : protoOf(AbstractListedTheory).u1r.call(this, theory);
|
|
4327
4327
|
};
|
|
4328
4328
|
protoOf(ListedTheory).plusTheory = function (theory) {
|
|
4329
|
-
return this.
|
|
4329
|
+
return this.u1r(theory);
|
|
4330
4330
|
};
|
|
4331
4331
|
function MutableIndexedTheory_init_$Init$(unificator, clauses, tags, $this) {
|
|
4332
4332
|
tags = tags === VOID ? emptyMap() : tags;
|
|
4333
4333
|
MutableIndexedTheory.call($this, Companion_instance_5.ofIterable(unificator, clauses), tags);
|
|
4334
|
-
TheoryUtils_instance.
|
|
4334
|
+
TheoryUtils_instance.y1l(clauses);
|
|
4335
4335
|
return $this;
|
|
4336
4336
|
}
|
|
4337
4337
|
function MutableIndexedTheory_init_$Create$(unificator, clauses, tags) {
|
|
@@ -4346,54 +4346,54 @@
|
|
|
4346
4346
|
return MutableIndexedTheory_init_$Init$_0(unificator, clauses, tags, objectCreate(protoOf(MutableIndexedTheory)));
|
|
4347
4347
|
}
|
|
4348
4348
|
function toRetractResult($this, $receiver) {
|
|
4349
|
-
return $receiver.d10() ? new Success_0($this, ensureNotNull($receiver.
|
|
4349
|
+
return $receiver.d10() ? new Success_0($this, ensureNotNull($receiver.b1l())) : new Failure_0($this);
|
|
4350
4350
|
}
|
|
4351
4351
|
function MutableIndexedTheory$retract$lambda(this$0) {
|
|
4352
4352
|
return function (it) {
|
|
4353
|
-
return this$0.
|
|
4353
|
+
return this$0.w1t_1.g1l(it);
|
|
4354
4354
|
};
|
|
4355
4355
|
}
|
|
4356
4356
|
function MutableIndexedTheory$retract$lambda_0(it) {
|
|
4357
4357
|
return it.d10();
|
|
4358
4358
|
}
|
|
4359
4359
|
function MutableIndexedTheory$retract$lambda_1(it) {
|
|
4360
|
-
return asSequence(ensureNotNull(it.
|
|
4360
|
+
return asSequence(ensureNotNull(it.b1l()));
|
|
4361
4361
|
}
|
|
4362
4362
|
function MutableIndexedTheory(queue, tags) {
|
|
4363
4363
|
AbstractIndexedTheory.call(this, queue, tags);
|
|
4364
|
-
this.
|
|
4364
|
+
this.w1t_1 = queue;
|
|
4365
4365
|
}
|
|
4366
|
-
protoOf(MutableIndexedTheory).
|
|
4367
|
-
return this.
|
|
4366
|
+
protoOf(MutableIndexedTheory).g1t = function () {
|
|
4367
|
+
return this.w1t_1;
|
|
4368
4368
|
};
|
|
4369
|
-
protoOf(MutableIndexedTheory).
|
|
4370
|
-
return protoOf(AbstractIndexedTheory).
|
|
4369
|
+
protoOf(MutableIndexedTheory).s1r = function (unificator) {
|
|
4370
|
+
return protoOf(AbstractIndexedTheory).s1r.call(this, unificator).toMutableTheory();
|
|
4371
4371
|
};
|
|
4372
4372
|
protoOf(MutableIndexedTheory).setUnificator = function (unificator) {
|
|
4373
|
-
return this.
|
|
4373
|
+
return this.s1r(unificator);
|
|
4374
4374
|
};
|
|
4375
|
-
protoOf(MutableIndexedTheory).
|
|
4375
|
+
protoOf(MutableIndexedTheory).u1s = function () {
|
|
4376
4376
|
return toMutableTheory.call(this);
|
|
4377
4377
|
};
|
|
4378
4378
|
protoOf(MutableIndexedTheory).toMutableTheory = function () {
|
|
4379
|
-
return this.
|
|
4379
|
+
return this.u1s();
|
|
4380
4380
|
};
|
|
4381
|
-
protoOf(MutableIndexedTheory).
|
|
4382
|
-
return toList_0(this.
|
|
4381
|
+
protoOf(MutableIndexedTheory).b1l = function () {
|
|
4382
|
+
return toList_0(this.w1t_1);
|
|
4383
4383
|
};
|
|
4384
4384
|
protoOf(MutableIndexedTheory).n = function () {
|
|
4385
|
-
return this.
|
|
4385
|
+
return this.w1t_1.n();
|
|
4386
4386
|
};
|
|
4387
|
-
protoOf(MutableIndexedTheory).
|
|
4387
|
+
protoOf(MutableIndexedTheory).d1s = function (clauses, tags, unificator) {
|
|
4388
4388
|
return MutableIndexedTheory_init_$Create$_0(unificator, clauses, tags);
|
|
4389
4389
|
};
|
|
4390
|
-
protoOf(MutableIndexedTheory).
|
|
4391
|
-
return toRetractResult(this, this.
|
|
4390
|
+
protoOf(MutableIndexedTheory).x1s = function (clause) {
|
|
4391
|
+
return toRetractResult(this, this.w1t_1.g1l(clause));
|
|
4392
4392
|
};
|
|
4393
4393
|
protoOf(MutableIndexedTheory).retract = function (clause) {
|
|
4394
|
-
return this.
|
|
4394
|
+
return this.x1s(clause);
|
|
4395
4395
|
};
|
|
4396
|
-
protoOf(MutableIndexedTheory).
|
|
4396
|
+
protoOf(MutableIndexedTheory).f1s = function (clauses) {
|
|
4397
4397
|
var tmp = asSequence(clauses);
|
|
4398
4398
|
var tmp_0 = map(tmp, MutableIndexedTheory$retract$lambda(this));
|
|
4399
4399
|
var tmp_1 = filter(tmp_0, MutableIndexedTheory$retract$lambda_0);
|
|
@@ -4407,126 +4407,126 @@
|
|
|
4407
4407
|
return tmp_2;
|
|
4408
4408
|
};
|
|
4409
4409
|
protoOf(MutableIndexedTheory).retractIterable = function (clauses) {
|
|
4410
|
-
return this.
|
|
4410
|
+
return this.f1s(clauses);
|
|
4411
4411
|
};
|
|
4412
|
-
protoOf(MutableIndexedTheory).
|
|
4413
|
-
return toRetractResult(this, this.
|
|
4412
|
+
protoOf(MutableIndexedTheory).j1l = function (clause) {
|
|
4413
|
+
return toRetractResult(this, this.w1t_1.i1l(clause));
|
|
4414
4414
|
};
|
|
4415
4415
|
protoOf(MutableIndexedTheory).retractAll = function (clause) {
|
|
4416
|
-
return this.
|
|
4416
|
+
return this.j1l(clause);
|
|
4417
4417
|
};
|
|
4418
|
-
protoOf(MutableIndexedTheory).
|
|
4419
|
-
return this.
|
|
4418
|
+
protoOf(MutableIndexedTheory).i1r = function (clause) {
|
|
4419
|
+
return this.a1s(TheoryUtils_instance.n1l(clause));
|
|
4420
4420
|
};
|
|
4421
4421
|
protoOf(MutableIndexedTheory).plus = function (clause) {
|
|
4422
|
-
return this.
|
|
4422
|
+
return this.i1r(clause);
|
|
4423
4423
|
};
|
|
4424
|
-
protoOf(MutableIndexedTheory).
|
|
4424
|
+
protoOf(MutableIndexedTheory).u1r = function (theory) {
|
|
4425
4425
|
var tmp;
|
|
4426
4426
|
if (theory === this) {
|
|
4427
|
-
tmp = this.
|
|
4427
|
+
tmp = this.b1s(toList_0(theory));
|
|
4428
4428
|
} else {
|
|
4429
|
-
tmp = this.
|
|
4429
|
+
tmp = this.b1s(theory);
|
|
4430
4430
|
}
|
|
4431
4431
|
return tmp;
|
|
4432
4432
|
};
|
|
4433
4433
|
protoOf(MutableIndexedTheory).plusTheory = function (theory) {
|
|
4434
|
-
return this.
|
|
4434
|
+
return this.u1r(theory);
|
|
4435
4435
|
};
|
|
4436
|
-
protoOf(MutableIndexedTheory).
|
|
4436
|
+
protoOf(MutableIndexedTheory).w1r = function (clause) {
|
|
4437
4437
|
// Inline function 'kotlin.also' call
|
|
4438
|
-
this.
|
|
4438
|
+
this.w1t_1.o1l(TheoryUtils_instance.n1l(clause));
|
|
4439
4439
|
return this;
|
|
4440
4440
|
};
|
|
4441
4441
|
protoOf(MutableIndexedTheory).assertA = function (clause) {
|
|
4442
|
-
return this.
|
|
4442
|
+
return this.w1r(clause);
|
|
4443
4443
|
};
|
|
4444
|
-
protoOf(MutableIndexedTheory).
|
|
4444
|
+
protoOf(MutableIndexedTheory).y1r = function (clauses) {
|
|
4445
4445
|
// Inline function 'kotlin.also' call
|
|
4446
|
-
var _iterator__ex2g4s = asReversed(toList_0(TheoryUtils_instance.
|
|
4446
|
+
var _iterator__ex2g4s = asReversed(toList_0(TheoryUtils_instance.y1l(clauses))).n();
|
|
4447
4447
|
while (_iterator__ex2g4s.q()) {
|
|
4448
4448
|
var clause = _iterator__ex2g4s.r();
|
|
4449
|
-
this.
|
|
4449
|
+
this.w1t_1.o1l(clause);
|
|
4450
4450
|
}
|
|
4451
4451
|
return this;
|
|
4452
4452
|
};
|
|
4453
4453
|
protoOf(MutableIndexedTheory).assertAIterable = function (clauses) {
|
|
4454
|
-
return this.
|
|
4454
|
+
return this.y1r(clauses);
|
|
4455
4455
|
};
|
|
4456
|
-
protoOf(MutableIndexedTheory).
|
|
4457
|
-
return this.
|
|
4456
|
+
protoOf(MutableIndexedTheory).z1r = function (clauses) {
|
|
4457
|
+
return this.y1r(asIterable(clauses));
|
|
4458
4458
|
};
|
|
4459
4459
|
protoOf(MutableIndexedTheory).assertASequence = function (clauses) {
|
|
4460
|
-
return this.
|
|
4460
|
+
return this.z1r(clauses);
|
|
4461
4461
|
};
|
|
4462
|
-
protoOf(MutableIndexedTheory).
|
|
4462
|
+
protoOf(MutableIndexedTheory).a1s = function (clause) {
|
|
4463
4463
|
// Inline function 'kotlin.also' call
|
|
4464
|
-
this.
|
|
4464
|
+
this.w1t_1.p1l(TheoryUtils_instance.n1l(clause));
|
|
4465
4465
|
return this;
|
|
4466
4466
|
};
|
|
4467
4467
|
protoOf(MutableIndexedTheory).assertZ = function (clause) {
|
|
4468
|
-
return this.
|
|
4468
|
+
return this.a1s(clause);
|
|
4469
4469
|
};
|
|
4470
|
-
protoOf(MutableIndexedTheory).
|
|
4470
|
+
protoOf(MutableIndexedTheory).b1s = function (clauses) {
|
|
4471
4471
|
// Inline function 'kotlin.also' call
|
|
4472
|
-
this.
|
|
4472
|
+
this.w1t_1.f1l(TheoryUtils_instance.y1l(clauses));
|
|
4473
4473
|
return this;
|
|
4474
4474
|
};
|
|
4475
4475
|
protoOf(MutableIndexedTheory).assertZIterable = function (clauses) {
|
|
4476
|
-
return this.
|
|
4476
|
+
return this.b1s(clauses);
|
|
4477
4477
|
};
|
|
4478
|
-
protoOf(MutableIndexedTheory).
|
|
4479
|
-
return this.
|
|
4478
|
+
protoOf(MutableIndexedTheory).c1s = function (clauses) {
|
|
4479
|
+
return this.b1s(TheoryUtils_instance.y1l(asIterable(clauses)));
|
|
4480
4480
|
};
|
|
4481
4481
|
protoOf(MutableIndexedTheory).assertZSequence = function (clauses) {
|
|
4482
|
-
return this.
|
|
4482
|
+
return this.c1s(clauses);
|
|
4483
4483
|
};
|
|
4484
|
-
protoOf(MutableIndexedTheory).
|
|
4485
|
-
return this.
|
|
4484
|
+
protoOf(MutableIndexedTheory).e1s = function (clauses) {
|
|
4485
|
+
return this.f1s(asIterable(clauses));
|
|
4486
4486
|
};
|
|
4487
4487
|
protoOf(MutableIndexedTheory).retractSequence = function (clauses) {
|
|
4488
|
-
return this.
|
|
4488
|
+
return this.e1s(clauses);
|
|
4489
4489
|
};
|
|
4490
|
-
protoOf(MutableIndexedTheory).
|
|
4491
|
-
return protoOf(AbstractIndexedTheory).
|
|
4490
|
+
protoOf(MutableIndexedTheory).n1r = function (indicator) {
|
|
4491
|
+
return protoOf(AbstractIndexedTheory).n1r.call(this, indicator).toMutableTheory();
|
|
4492
4492
|
};
|
|
4493
4493
|
protoOf(MutableIndexedTheory).abolish = function (indicator) {
|
|
4494
|
-
return this.
|
|
4494
|
+
return this.n1r(indicator);
|
|
4495
4495
|
};
|
|
4496
|
-
protoOf(MutableIndexedTheory).
|
|
4497
|
-
return Companion_instance_10.indexedOfIterable(this.
|
|
4496
|
+
protoOf(MutableIndexedTheory).h1r = function () {
|
|
4497
|
+
return Companion_instance_10.indexedOfIterable(this.r1k(), this);
|
|
4498
4498
|
};
|
|
4499
4499
|
protoOf(MutableIndexedTheory).toImmutableTheory = function () {
|
|
4500
|
-
return this.
|
|
4500
|
+
return this.h1r();
|
|
4501
4501
|
};
|
|
4502
4502
|
protoOf(MutableIndexedTheory).b10 = function (tags) {
|
|
4503
|
-
return tags === this.lr() ? this : new MutableIndexedTheory(this.
|
|
4503
|
+
return tags === this.lr() ? this : new MutableIndexedTheory(this.w1t_1, tags);
|
|
4504
4504
|
};
|
|
4505
4505
|
protoOf(MutableIndexedTheory).resetTags = function (tags) {
|
|
4506
4506
|
return this.b10(tags);
|
|
4507
4507
|
};
|
|
4508
|
-
protoOf(MutableIndexedTheory).
|
|
4509
|
-
return this.
|
|
4508
|
+
protoOf(MutableIndexedTheory).g1s = function () {
|
|
4509
|
+
return this.t1r(asSequence(this.b1l()));
|
|
4510
4510
|
};
|
|
4511
4511
|
protoOf(MutableIndexedTheory).clone = function () {
|
|
4512
|
-
return this.
|
|
4512
|
+
return this.g1s();
|
|
4513
4513
|
};
|
|
4514
4514
|
protoOf(MutableIndexedTheory).assertAFact = function (struct) {
|
|
4515
|
-
return this.
|
|
4515
|
+
return this.v1s(struct);
|
|
4516
4516
|
};
|
|
4517
4517
|
protoOf(MutableIndexedTheory).assertZFact = function (struct) {
|
|
4518
|
-
return this.
|
|
4518
|
+
return this.w1s(struct);
|
|
4519
4519
|
};
|
|
4520
4520
|
protoOf(MutableIndexedTheory).retractByHead = function (head) {
|
|
4521
|
-
return this.
|
|
4521
|
+
return this.y1s(head);
|
|
4522
4522
|
};
|
|
4523
4523
|
protoOf(MutableIndexedTheory).retractAllByHead = function (head) {
|
|
4524
|
-
return this.
|
|
4524
|
+
return this.z1s(head);
|
|
4525
4525
|
};
|
|
4526
4526
|
function MutableListedTheory_init_$Init$(unificator, clauses, tags, $this) {
|
|
4527
4527
|
tags = tags === VOID ? emptyMap() : tags;
|
|
4528
4528
|
MutableListedTheory.call($this, unificator, toMutableList(clauses), tags);
|
|
4529
|
-
TheoryUtils_instance.
|
|
4529
|
+
TheoryUtils_instance.y1l(clauses);
|
|
4530
4530
|
return $this;
|
|
4531
4531
|
}
|
|
4532
4532
|
function MutableListedTheory_init_$Create$(unificator, clauses, tags) {
|
|
@@ -4535,7 +4535,7 @@
|
|
|
4535
4535
|
function MutableListedTheory_init_$Init$_0(unificator, clauses, tags, $this) {
|
|
4536
4536
|
tags = tags === VOID ? emptyMap() : tags;
|
|
4537
4537
|
MutableListedTheory.call($this, unificator, toMutableList_0(clauses), tags);
|
|
4538
|
-
TheoryUtils_instance.
|
|
4538
|
+
TheoryUtils_instance.v1r(clauses);
|
|
4539
4539
|
return $this;
|
|
4540
4540
|
}
|
|
4541
4541
|
function MutableListedTheory_init_$Create$_0(unificator, clauses, tags) {
|
|
@@ -4543,32 +4543,32 @@
|
|
|
4543
4543
|
}
|
|
4544
4544
|
function MutableListedTheory(unificator, clauses, tags) {
|
|
4545
4545
|
AbstractListedTheory.call(this, unificator, clauses, tags);
|
|
4546
|
-
this.
|
|
4546
|
+
this.a1u_1 = clauses;
|
|
4547
4547
|
}
|
|
4548
|
-
protoOf(MutableListedTheory).
|
|
4549
|
-
return this.
|
|
4548
|
+
protoOf(MutableListedTheory).b1l = function () {
|
|
4549
|
+
return this.a1u_1;
|
|
4550
4550
|
};
|
|
4551
|
-
protoOf(MutableListedTheory).
|
|
4552
|
-
this.
|
|
4551
|
+
protoOf(MutableListedTheory).s1r = function (unificator) {
|
|
4552
|
+
this.k1t(unificator);
|
|
4553
4553
|
return this;
|
|
4554
4554
|
};
|
|
4555
4555
|
protoOf(MutableListedTheory).setUnificator = function (unificator) {
|
|
4556
|
-
return this.
|
|
4556
|
+
return this.s1r(unificator);
|
|
4557
4557
|
};
|
|
4558
|
-
protoOf(MutableListedTheory).
|
|
4558
|
+
protoOf(MutableListedTheory).u1s = function () {
|
|
4559
4559
|
return toMutableTheory.call(this);
|
|
4560
4560
|
};
|
|
4561
4561
|
protoOf(MutableListedTheory).toMutableTheory = function () {
|
|
4562
|
-
return this.
|
|
4562
|
+
return this.u1s();
|
|
4563
4563
|
};
|
|
4564
|
-
protoOf(MutableListedTheory).
|
|
4564
|
+
protoOf(MutableListedTheory).d1s = function (clauses, tags, unificator) {
|
|
4565
4565
|
return MutableListedTheory_init_$Create$_0(unificator, clauses, tags);
|
|
4566
4566
|
};
|
|
4567
|
-
protoOf(MutableListedTheory).
|
|
4568
|
-
var i = this.
|
|
4567
|
+
protoOf(MutableListedTheory).x1s = function (clause) {
|
|
4568
|
+
var i = this.a1u_1.b4();
|
|
4569
4569
|
while (i.q()) {
|
|
4570
4570
|
var c = i.r();
|
|
4571
|
-
if (this.
|
|
4571
|
+
if (this.r1k().match(clause, c)) {
|
|
4572
4572
|
i.b3();
|
|
4573
4573
|
return new Success_0(this, listOf_0(c));
|
|
4574
4574
|
}
|
|
@@ -4576,10 +4576,10 @@
|
|
|
4576
4576
|
return new Failure_0(this);
|
|
4577
4577
|
};
|
|
4578
4578
|
protoOf(MutableListedTheory).retract = function (clause) {
|
|
4579
|
-
return this.
|
|
4579
|
+
return this.x1s(clause);
|
|
4580
4580
|
};
|
|
4581
|
-
protoOf(MutableListedTheory).
|
|
4582
|
-
var i = this.
|
|
4581
|
+
protoOf(MutableListedTheory).f1s = function (clauses) {
|
|
4582
|
+
var i = this.a1u_1.b4();
|
|
4583
4583
|
// Inline function 'kotlin.collections.mutableListOf' call
|
|
4584
4584
|
var retracted = ArrayList_init_$Create$_0();
|
|
4585
4585
|
while (i.q()) {
|
|
@@ -4587,7 +4587,7 @@
|
|
|
4587
4587
|
var _iterator__ex2g4s = clauses.n();
|
|
4588
4588
|
while (_iterator__ex2g4s.q()) {
|
|
4589
4589
|
var clause = _iterator__ex2g4s.r();
|
|
4590
|
-
if (this.
|
|
4590
|
+
if (this.r1k().match(clause, c)) {
|
|
4591
4591
|
retracted.l(c);
|
|
4592
4592
|
i.b3();
|
|
4593
4593
|
}
|
|
@@ -4602,15 +4602,15 @@
|
|
|
4602
4602
|
return tmp;
|
|
4603
4603
|
};
|
|
4604
4604
|
protoOf(MutableListedTheory).retractIterable = function (clauses) {
|
|
4605
|
-
return this.
|
|
4605
|
+
return this.f1s(clauses);
|
|
4606
4606
|
};
|
|
4607
|
-
protoOf(MutableListedTheory).
|
|
4608
|
-
var i = this.
|
|
4607
|
+
protoOf(MutableListedTheory).j1l = function (clause) {
|
|
4608
|
+
var i = this.a1u_1.b4();
|
|
4609
4609
|
// Inline function 'kotlin.collections.mutableListOf' call
|
|
4610
4610
|
var retracted = ArrayList_init_$Create$_0();
|
|
4611
4611
|
while (i.q()) {
|
|
4612
4612
|
var c = i.r();
|
|
4613
|
-
if (this.
|
|
4613
|
+
if (this.r1k().match(clause, c)) {
|
|
4614
4614
|
retracted.l(c);
|
|
4615
4615
|
i.b3();
|
|
4616
4616
|
}
|
|
@@ -4624,111 +4624,111 @@
|
|
|
4624
4624
|
return tmp;
|
|
4625
4625
|
};
|
|
4626
4626
|
protoOf(MutableListedTheory).retractAll = function (clause) {
|
|
4627
|
-
return this.
|
|
4627
|
+
return this.j1l(clause);
|
|
4628
4628
|
};
|
|
4629
|
-
protoOf(MutableListedTheory).
|
|
4630
|
-
return this.
|
|
4629
|
+
protoOf(MutableListedTheory).i1r = function (clause) {
|
|
4630
|
+
return this.a1s(clause);
|
|
4631
4631
|
};
|
|
4632
4632
|
protoOf(MutableListedTheory).plus = function (clause) {
|
|
4633
|
-
return this.
|
|
4633
|
+
return this.i1r(clause);
|
|
4634
4634
|
};
|
|
4635
|
-
protoOf(MutableListedTheory).
|
|
4635
|
+
protoOf(MutableListedTheory).u1r = function (theory) {
|
|
4636
4636
|
var tmp;
|
|
4637
4637
|
if (theory === this) {
|
|
4638
|
-
tmp = this.
|
|
4638
|
+
tmp = this.b1s(toList_0(theory));
|
|
4639
4639
|
} else {
|
|
4640
|
-
tmp = this.
|
|
4640
|
+
tmp = this.b1s(theory);
|
|
4641
4641
|
}
|
|
4642
4642
|
return tmp;
|
|
4643
4643
|
};
|
|
4644
4644
|
protoOf(MutableListedTheory).plusTheory = function (theory) {
|
|
4645
|
-
return this.
|
|
4645
|
+
return this.u1r(theory);
|
|
4646
4646
|
};
|
|
4647
|
-
protoOf(MutableListedTheory).
|
|
4647
|
+
protoOf(MutableListedTheory).w1r = function (clause) {
|
|
4648
4648
|
// Inline function 'kotlin.also' call
|
|
4649
|
-
addFirst(this.
|
|
4649
|
+
addFirst(this.a1u_1, TheoryUtils_instance.n1l(clause));
|
|
4650
4650
|
return this;
|
|
4651
4651
|
};
|
|
4652
4652
|
protoOf(MutableListedTheory).assertA = function (clause) {
|
|
4653
|
-
return this.
|
|
4653
|
+
return this.w1r(clause);
|
|
4654
4654
|
};
|
|
4655
|
-
protoOf(MutableListedTheory).
|
|
4655
|
+
protoOf(MutableListedTheory).y1r = function (clauses) {
|
|
4656
4656
|
// Inline function 'kotlin.also' call
|
|
4657
|
-
addFirst_0(this.
|
|
4657
|
+
addFirst_0(this.a1u_1, TheoryUtils_instance.y1l(clauses));
|
|
4658
4658
|
return this;
|
|
4659
4659
|
};
|
|
4660
4660
|
protoOf(MutableListedTheory).assertAIterable = function (clauses) {
|
|
4661
|
-
return this.
|
|
4661
|
+
return this.y1r(clauses);
|
|
4662
4662
|
};
|
|
4663
|
-
protoOf(MutableListedTheory).
|
|
4664
|
-
return this.
|
|
4663
|
+
protoOf(MutableListedTheory).z1r = function (clauses) {
|
|
4664
|
+
return this.y1r(asIterable(clauses));
|
|
4665
4665
|
};
|
|
4666
4666
|
protoOf(MutableListedTheory).assertASequence = function (clauses) {
|
|
4667
|
-
return this.
|
|
4667
|
+
return this.z1r(clauses);
|
|
4668
4668
|
};
|
|
4669
|
-
protoOf(MutableListedTheory).
|
|
4669
|
+
protoOf(MutableListedTheory).a1s = function (clause) {
|
|
4670
4670
|
// Inline function 'kotlin.also' call
|
|
4671
|
-
this.
|
|
4671
|
+
this.a1u_1.l(TheoryUtils_instance.n1l(clause));
|
|
4672
4672
|
return this;
|
|
4673
4673
|
};
|
|
4674
4674
|
protoOf(MutableListedTheory).assertZ = function (clause) {
|
|
4675
|
-
return this.
|
|
4675
|
+
return this.a1s(clause);
|
|
4676
4676
|
};
|
|
4677
|
-
protoOf(MutableListedTheory).
|
|
4677
|
+
protoOf(MutableListedTheory).b1s = function (clauses) {
|
|
4678
4678
|
// Inline function 'kotlin.also' call
|
|
4679
|
-
addAll(this.
|
|
4679
|
+
addAll(this.a1u_1, TheoryUtils_instance.y1l(clauses));
|
|
4680
4680
|
return this;
|
|
4681
4681
|
};
|
|
4682
4682
|
protoOf(MutableListedTheory).assertZIterable = function (clauses) {
|
|
4683
|
-
return this.
|
|
4683
|
+
return this.b1s(clauses);
|
|
4684
4684
|
};
|
|
4685
|
-
protoOf(MutableListedTheory).
|
|
4686
|
-
return this.
|
|
4685
|
+
protoOf(MutableListedTheory).c1s = function (clauses) {
|
|
4686
|
+
return this.b1s(asIterable(clauses));
|
|
4687
4687
|
};
|
|
4688
4688
|
protoOf(MutableListedTheory).assertZSequence = function (clauses) {
|
|
4689
|
-
return this.
|
|
4689
|
+
return this.c1s(clauses);
|
|
4690
4690
|
};
|
|
4691
|
-
protoOf(MutableListedTheory).
|
|
4692
|
-
return this.
|
|
4691
|
+
protoOf(MutableListedTheory).e1s = function (clauses) {
|
|
4692
|
+
return this.f1s(asIterable(clauses));
|
|
4693
4693
|
};
|
|
4694
4694
|
protoOf(MutableListedTheory).retractSequence = function (clauses) {
|
|
4695
|
-
return this.
|
|
4695
|
+
return this.e1s(clauses);
|
|
4696
4696
|
};
|
|
4697
|
-
protoOf(MutableListedTheory).
|
|
4698
|
-
return protoOf(AbstractListedTheory).
|
|
4697
|
+
protoOf(MutableListedTheory).n1r = function (indicator) {
|
|
4698
|
+
return protoOf(AbstractListedTheory).n1r.call(this, indicator).toMutableTheory();
|
|
4699
4699
|
};
|
|
4700
4700
|
protoOf(MutableListedTheory).abolish = function (indicator) {
|
|
4701
|
-
return this.
|
|
4701
|
+
return this.n1r(indicator);
|
|
4702
4702
|
};
|
|
4703
|
-
protoOf(MutableListedTheory).
|
|
4704
|
-
return Companion_instance_10.listedOfIterable(this.
|
|
4703
|
+
protoOf(MutableListedTheory).h1r = function () {
|
|
4704
|
+
return Companion_instance_10.listedOfIterable(this.r1k(), this);
|
|
4705
4705
|
};
|
|
4706
4706
|
protoOf(MutableListedTheory).toImmutableTheory = function () {
|
|
4707
|
-
return this.
|
|
4707
|
+
return this.h1r();
|
|
4708
4708
|
};
|
|
4709
4709
|
protoOf(MutableListedTheory).b10 = function (tags) {
|
|
4710
|
-
return tags === this.lr() ? this : new MutableListedTheory(this.
|
|
4710
|
+
return tags === this.lr() ? this : new MutableListedTheory(this.r1k(), this.a1u_1, tags);
|
|
4711
4711
|
};
|
|
4712
4712
|
protoOf(MutableListedTheory).resetTags = function (tags) {
|
|
4713
4713
|
return this.b10(tags);
|
|
4714
4714
|
};
|
|
4715
|
-
protoOf(MutableListedTheory).
|
|
4716
|
-
return this.
|
|
4715
|
+
protoOf(MutableListedTheory).g1s = function () {
|
|
4716
|
+
return this.t1r(asSequence(this.a1u_1));
|
|
4717
4717
|
};
|
|
4718
4718
|
protoOf(MutableListedTheory).clone = function () {
|
|
4719
|
-
return this.
|
|
4719
|
+
return this.g1s();
|
|
4720
4720
|
};
|
|
4721
4721
|
protoOf(MutableListedTheory).assertAFact = function (struct) {
|
|
4722
|
-
return this.
|
|
4722
|
+
return this.v1s(struct);
|
|
4723
4723
|
};
|
|
4724
4724
|
protoOf(MutableListedTheory).assertZFact = function (struct) {
|
|
4725
|
-
return this.
|
|
4725
|
+
return this.w1s(struct);
|
|
4726
4726
|
};
|
|
4727
4727
|
protoOf(MutableListedTheory).retractByHead = function (head) {
|
|
4728
|
-
return this.
|
|
4728
|
+
return this.y1s(head);
|
|
4729
4729
|
};
|
|
4730
4730
|
protoOf(MutableListedTheory).retractAllByHead = function (head) {
|
|
4731
|
-
return this.
|
|
4731
|
+
return this.z1s(head);
|
|
4732
4732
|
};
|
|
4733
4733
|
function takeFirstAfterSkipping(_this__u8e3s4, n) {
|
|
4734
4734
|
var iter = _this__u8e3s4.n();
|
|
@@ -4745,29 +4745,29 @@
|
|
|
4745
4745
|
}
|
|
4746
4746
|
//region block: post-declaration
|
|
4747
4747
|
defineProp(protoOf(RetrieveResult), 'collection', function () {
|
|
4748
|
-
return this.
|
|
4748
|
+
return this.t1l();
|
|
4749
4749
|
});
|
|
4750
4750
|
defineProp(protoOf(RetrieveResult), 'clauses', function () {
|
|
4751
|
-
return this.
|
|
4751
|
+
return this.b1l();
|
|
4752
4752
|
});
|
|
4753
4753
|
defineProp(protoOf(RetrieveResult), 'firstClause', function () {
|
|
4754
|
-
return this.
|
|
4754
|
+
return this.u1l();
|
|
4755
4755
|
});
|
|
4756
|
-
protoOf(MutableReteClauseQueue).
|
|
4757
|
-
protoOf(ReteClauseQueue).
|
|
4758
|
-
protoOf(IndexedClause$Companion$wrap$1).
|
|
4759
|
-
protoOf(IndexedClause$Companion$wrap$1).
|
|
4756
|
+
protoOf(MutableReteClauseQueue).z1k = get;
|
|
4757
|
+
protoOf(ReteClauseQueue).z1k = get;
|
|
4758
|
+
protoOf(IndexedClause$Companion$wrap$1).v1m = get_innerClause;
|
|
4759
|
+
protoOf(IndexedClause$Companion$wrap$1).e1o = plus_1;
|
|
4760
4760
|
protoOf(IndexedClause$Companion$wrap$1).hr = compareTo;
|
|
4761
4761
|
protoOf(IndexedClause$Companion$wrap$1).oc = component1;
|
|
4762
4762
|
protoOf(IndexedClause$Companion$wrap$1).pc = component2;
|
|
4763
|
-
protoOf(SituatedIndexedClause$Companion$of$1).
|
|
4764
|
-
protoOf(SituatedIndexedClause$Companion$of$1).
|
|
4763
|
+
protoOf(SituatedIndexedClause$Companion$of$1).v1m = get_innerClause;
|
|
4764
|
+
protoOf(SituatedIndexedClause$Companion$of$1).e1o = plus_1;
|
|
4765
4765
|
protoOf(SituatedIndexedClause$Companion$of$1).hr = compareTo;
|
|
4766
4766
|
protoOf(SituatedIndexedClause$Companion$of$1).oc = component1;
|
|
4767
4767
|
protoOf(SituatedIndexedClause$Companion$of$1).pc = component2;
|
|
4768
|
-
protoOf(AbstractTheory).
|
|
4769
|
-
protoOf(AbstractTheory).
|
|
4770
|
-
protoOf(AbstractTheory).
|
|
4768
|
+
protoOf(AbstractTheory).h1s = get_isMutable;
|
|
4769
|
+
protoOf(AbstractTheory).v1k = get_rules;
|
|
4770
|
+
protoOf(AbstractTheory).u1k = get_directives;
|
|
4771
4771
|
protoOf(AbstractTheory).assertAFact = assertAFact;
|
|
4772
4772
|
protoOf(AbstractTheory).assertZFact = assertZFact;
|
|
4773
4773
|
protoOf(AbstractTheory).retractByHead = retractByHead;
|
|
@@ -4791,24 +4791,24 @@
|
|
|
4791
4791
|
protoOf(ListedTheoryFactory).mutableTheoryOf = mutableTheoryOf;
|
|
4792
4792
|
protoOf(ListedTheoryFactory).mutableTheoryOfSequence = mutableTheoryOfSequence;
|
|
4793
4793
|
defineProp(protoOf(RetractResult), 'theory', function () {
|
|
4794
|
-
return this.
|
|
4794
|
+
return this.o1r();
|
|
4795
4795
|
});
|
|
4796
4796
|
defineProp(protoOf(RetractResult), 'clauses', function () {
|
|
4797
|
-
return this.
|
|
4797
|
+
return this.b1l();
|
|
4798
4798
|
});
|
|
4799
4799
|
defineProp(protoOf(RetractResult), 'firstClause', function () {
|
|
4800
|
-
return this.
|
|
4800
|
+
return this.u1l();
|
|
4801
4801
|
});
|
|
4802
|
-
protoOf(MutableIndexedTheory).
|
|
4803
|
-
protoOf(MutableIndexedTheory).
|
|
4804
|
-
protoOf(MutableIndexedTheory).
|
|
4805
|
-
protoOf(MutableIndexedTheory).
|
|
4806
|
-
protoOf(MutableIndexedTheory).
|
|
4807
|
-
protoOf(MutableListedTheory).
|
|
4808
|
-
protoOf(MutableListedTheory).
|
|
4809
|
-
protoOf(MutableListedTheory).
|
|
4810
|
-
protoOf(MutableListedTheory).
|
|
4811
|
-
protoOf(MutableListedTheory).
|
|
4802
|
+
protoOf(MutableIndexedTheory).v1s = assertAFact_0;
|
|
4803
|
+
protoOf(MutableIndexedTheory).w1s = assertZFact_0;
|
|
4804
|
+
protoOf(MutableIndexedTheory).y1s = retractByHead_0;
|
|
4805
|
+
protoOf(MutableIndexedTheory).h1s = get_isMutable_0;
|
|
4806
|
+
protoOf(MutableIndexedTheory).z1s = retractAllByHead_0;
|
|
4807
|
+
protoOf(MutableListedTheory).v1s = assertAFact_0;
|
|
4808
|
+
protoOf(MutableListedTheory).w1s = assertZFact_0;
|
|
4809
|
+
protoOf(MutableListedTheory).y1s = retractByHead_0;
|
|
4810
|
+
protoOf(MutableListedTheory).h1s = get_isMutable_0;
|
|
4811
|
+
protoOf(MutableListedTheory).z1s = retractAllByHead_0;
|
|
4812
4812
|
//endregion
|
|
4813
4813
|
//region block: init
|
|
4814
4814
|
Companion_instance_4 = new Companion();
|