@tuprolog/2p-full 0.32.4 → 1.0.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/2p-bdd.js +136 -136
- package/2p-core.js +379 -412
- package/2p-core.js.map +1 -1
- package/2p-io-lib.js +463 -463
- package/2p-oop-lib.js +594 -594
- package/2p-oop-lib.js.map +1 -1
- package/2p-parser-core.js +114 -114
- package/2p-parser-core.js.map +1 -1
- package/2p-parser-theory.js +11 -11
- package/2p-repl.js +63 -63
- package/2p-repl.js.map +1 -1
- package/2p-solve-classic.js +794 -794
- package/2p-solve-classic.js.map +1 -1
- package/2p-solve-plp.js +1 -1
- package/2p-solve-problog.js +922 -922
- package/2p-solve-problog.js.map +1 -1
- package/2p-solve-streams.js +641 -641
- package/2p-solve.js +2877 -2867
- package/2p-solve.js.map +1 -1
- package/2p-test-dsl.js +15 -0
- package/2p-test-dsl.js.map +1 -0
- package/2p-theory.js +1342 -1065
- package/2p-theory.js.map +1 -1
- package/2p-unify.js +160 -160
- package/2p-utils.js +3 -3
- package/2p-utils.js.map +1 -1
- package/clikt-clikt-js-ir.js +1010 -1010
- package/kotlin-kotlin-stdlib.js +31 -31
- package/kotlin-kotlin-stdlib.js.map +1 -1
- package/kotlin-kotlin-test-kotlin-test-js-ir.js +15 -0
- package/kotlin-kotlin-test-kotlin-test-js-ir.js.map +1 -0
- package/package.json +1 -1
package/2p-theory.js
CHANGED
|
@@ -98,9 +98,9 @@
|
|
|
98
98
|
var plus_0 = kotlin_kotlin.$_$.u8;
|
|
99
99
|
var getTag = kotlin_it_unibo_tuprolog_utils.$_$.m;
|
|
100
100
|
var containsTag = kotlin_it_unibo_tuprolog_utils.$_$.l;
|
|
101
|
+
var Companion_getInstance_1 = kotlin_it_unibo_tuprolog_unify.$_$.a;
|
|
101
102
|
var Companion_instance_3 = kotlin_it_unibo_tuprolog_core.$_$.v;
|
|
102
103
|
var first_0 = kotlin_kotlin.$_$.f3;
|
|
103
|
-
var Companion_getInstance_1 = kotlin_it_unibo_tuprolog_unify.$_$.a;
|
|
104
104
|
var filterNotNull = kotlin_kotlin.$_$.c8;
|
|
105
105
|
var Taggable = kotlin_it_unibo_tuprolog_utils.$_$.n;
|
|
106
106
|
var filterNot = kotlin_kotlin.$_$.d8;
|
|
@@ -130,13 +130,13 @@
|
|
|
130
130
|
return this.addLast(clause);
|
|
131
131
|
}
|
|
132
132
|
function add_0(clause) {
|
|
133
|
-
return this.
|
|
133
|
+
return this.r1l(clause);
|
|
134
134
|
}
|
|
135
135
|
function retrieve(clause) {
|
|
136
136
|
return this.retrieveFirst(clause);
|
|
137
137
|
}
|
|
138
138
|
function retrieve_0(clause) {
|
|
139
|
-
return this.
|
|
139
|
+
return this.u1l(clause);
|
|
140
140
|
}
|
|
141
141
|
setMetadataFor(ClauseQueue, 'ClauseQueue', interfaceMeta);
|
|
142
142
|
setMetadataFor(Companion_0, 'Companion', objectMeta);
|
|
@@ -155,7 +155,7 @@
|
|
|
155
155
|
return this.r2();
|
|
156
156
|
}
|
|
157
157
|
function plus_1(traversed) {
|
|
158
|
-
return Companion_instance_7.
|
|
158
|
+
return Companion_instance_7.v1o(this.jr(), this.k1n(), plus(this.r1o(), traversed));
|
|
159
159
|
}
|
|
160
160
|
setMetadataFor(IndexedClause, 'IndexedClause', interfaceMeta, VOID, [LongIndexed]);
|
|
161
161
|
setMetadataFor(IndexedClause$Companion$wrap$1, VOID, classMeta, VOID, [IndexedClause]);
|
|
@@ -183,11 +183,11 @@
|
|
|
183
183
|
return false;
|
|
184
184
|
}
|
|
185
185
|
function get_rules() {
|
|
186
|
-
var tmp = asSequence(this.
|
|
186
|
+
var tmp = asSequence(this.p1l());
|
|
187
187
|
return asIterable(filterNotNull(map(tmp, Theory$_get_rules_$lambda_c39n1s)));
|
|
188
188
|
}
|
|
189
189
|
function get_directives() {
|
|
190
|
-
var tmp = asSequence(this.
|
|
190
|
+
var tmp = asSequence(this.p1l());
|
|
191
191
|
return asIterable(filterNotNull(map(tmp, Theory$_get_directives_$lambda_zbsn17)));
|
|
192
192
|
}
|
|
193
193
|
function plus_2(clause) {
|
|
@@ -207,6 +207,35 @@
|
|
|
207
207
|
}
|
|
208
208
|
setMetadataFor(Theory, 'Theory', interfaceMeta, VOID, [Taggable]);
|
|
209
209
|
setMetadataFor(AbstractTheory, 'AbstractTheory', classMeta, VOID, [Theory]);
|
|
210
|
+
function emptyTheory() {
|
|
211
|
+
return this.emptyTheoryWithUnificator(this.f1l());
|
|
212
|
+
}
|
|
213
|
+
function theoryOfIterable(clauses) {
|
|
214
|
+
return this.theoryOfIterableWithUnificator(clauses, this.f1l());
|
|
215
|
+
}
|
|
216
|
+
function theoryOf(clauses) {
|
|
217
|
+
return this.theoryOfWithUnificator(this.f1l(), clauses.slice());
|
|
218
|
+
}
|
|
219
|
+
function theoryOfSequence(clauses) {
|
|
220
|
+
return this.theoryOfSequenceWithUnificator(clauses, this.f1l());
|
|
221
|
+
}
|
|
222
|
+
function emptyMutableTheory() {
|
|
223
|
+
return this.emptyMutableTheoryWithUnificator(this.f1l());
|
|
224
|
+
}
|
|
225
|
+
function mutableTheoryOfIterable(clauses) {
|
|
226
|
+
return this.mutableTheoryOfIterableWithUnificator(clauses, this.f1l());
|
|
227
|
+
}
|
|
228
|
+
function mutableTheoryOf(clauses) {
|
|
229
|
+
return this.mutableTheoryOfWithUnificator(this.f1l(), clauses.slice());
|
|
230
|
+
}
|
|
231
|
+
function mutableTheoryOfSequence(clauses) {
|
|
232
|
+
return this.mutableTheoryOfSequenceWithUnificator(clauses, this.f1l());
|
|
233
|
+
}
|
|
234
|
+
setMetadataFor(TheoryFactory, 'TheoryFactory', interfaceMeta);
|
|
235
|
+
setMetadataFor(Default, 'Default', objectMeta, VOID, [TheoryFactory]);
|
|
236
|
+
setMetadataFor(IndexedTheoryFactory, 'IndexedTheoryFactory', classMeta, VOID, [TheoryFactory]);
|
|
237
|
+
setMetadataFor(Default_0, 'Default', objectMeta, VOID, [TheoryFactory]);
|
|
238
|
+
setMetadataFor(ListedTheoryFactory, 'ListedTheoryFactory', classMeta, VOID, [TheoryFactory]);
|
|
210
239
|
setMetadataFor(Companion_4, 'Companion', objectMeta);
|
|
211
240
|
function get_isMutable_0() {
|
|
212
241
|
return true;
|
|
@@ -215,16 +244,16 @@
|
|
|
215
244
|
return this;
|
|
216
245
|
}
|
|
217
246
|
function assertAFact_0(struct) {
|
|
218
|
-
return this.
|
|
247
|
+
return this.k1s(Companion_instance_3.of(struct));
|
|
219
248
|
}
|
|
220
249
|
function assertZFact_0(struct) {
|
|
221
|
-
return this.
|
|
250
|
+
return this.o1s(Companion_instance_3.of(struct));
|
|
222
251
|
}
|
|
223
252
|
function retractByHead_0(head) {
|
|
224
|
-
return this.
|
|
253
|
+
return this.l1t(Companion_instance_2.of(head, [Companion_getInstance().anonymous()]));
|
|
225
254
|
}
|
|
226
255
|
function retractAllByHead_0(head) {
|
|
227
|
-
return this.
|
|
256
|
+
return this.x1l(Companion_instance_2.of(head, [Companion_getInstance().anonymous()]));
|
|
228
257
|
}
|
|
229
258
|
setMetadataFor(MutableTheory, 'MutableTheory', interfaceMeta, VOID, [Theory]);
|
|
230
259
|
setMetadataFor(RetractResult, 'RetractResult', classMeta);
|
|
@@ -241,39 +270,39 @@
|
|
|
241
270
|
setMetadataFor(MutableListedTheory, 'MutableListedTheory', classMeta, AbstractListedTheory, [AbstractListedTheory, MutableTheory]);
|
|
242
271
|
//endregion
|
|
243
272
|
function AbstractClauseCollection(rete) {
|
|
244
|
-
this.
|
|
273
|
+
this.e1l_1 = rete;
|
|
245
274
|
}
|
|
246
|
-
protoOf(AbstractClauseCollection).
|
|
247
|
-
return this.
|
|
275
|
+
protoOf(AbstractClauseCollection).f1l = function () {
|
|
276
|
+
return this.e1l_1.f1l();
|
|
248
277
|
};
|
|
249
278
|
protoOf(AbstractClauseCollection).l = function () {
|
|
250
|
-
return this.
|
|
279
|
+
return this.e1l_1.l();
|
|
251
280
|
};
|
|
252
|
-
protoOf(AbstractClauseCollection).
|
|
253
|
-
return asIterable(this.
|
|
281
|
+
protoOf(AbstractClauseCollection).h1l = function () {
|
|
282
|
+
return asIterable(this.e1l_1.i1l());
|
|
254
283
|
};
|
|
255
|
-
protoOf(AbstractClauseCollection).
|
|
256
|
-
return asIterable(this.
|
|
284
|
+
protoOf(AbstractClauseCollection).j1l = function () {
|
|
285
|
+
return asIterable(this.e1l_1.j1l());
|
|
257
286
|
};
|
|
258
287
|
protoOf(AbstractClauseCollection).y = function () {
|
|
259
|
-
return this.
|
|
288
|
+
return this.e1l_1.k1l();
|
|
260
289
|
};
|
|
261
290
|
protoOf(AbstractClauseCollection).isEmpty = function () {
|
|
262
291
|
return this.y();
|
|
263
292
|
};
|
|
264
|
-
protoOf(AbstractClauseCollection).
|
|
293
|
+
protoOf(AbstractClauseCollection).l1l = function () {
|
|
265
294
|
return !this.y();
|
|
266
295
|
};
|
|
267
296
|
protoOf(AbstractClauseCollection).isNonEmpty = function () {
|
|
268
|
-
return this.
|
|
297
|
+
return this.l1l();
|
|
269
298
|
};
|
|
270
|
-
protoOf(AbstractClauseCollection).
|
|
271
|
-
return any(this.
|
|
299
|
+
protoOf(AbstractClauseCollection).m1l = function (element) {
|
|
300
|
+
return any(this.e1l_1.n1l(element));
|
|
272
301
|
};
|
|
273
302
|
protoOf(AbstractClauseCollection).contains = function (element) {
|
|
274
|
-
return this.
|
|
303
|
+
return this.m1l(element);
|
|
275
304
|
};
|
|
276
|
-
protoOf(AbstractClauseCollection).
|
|
305
|
+
protoOf(AbstractClauseCollection).o1l = function (elements) {
|
|
277
306
|
var tmp$ret$1;
|
|
278
307
|
$l$block: {
|
|
279
308
|
// Inline function 'kotlin.sequences.all' call
|
|
@@ -281,7 +310,7 @@
|
|
|
281
310
|
while (tmp0_iterator.s()) {
|
|
282
311
|
var element = tmp0_iterator.u();
|
|
283
312
|
// Inline function 'it.unibo.tuprolog.collections.AbstractClauseCollection.containsAll.<anonymous>' call
|
|
284
|
-
if (!this.
|
|
313
|
+
if (!this.m1l(element)) {
|
|
285
314
|
tmp$ret$1 = false;
|
|
286
315
|
break $l$block;
|
|
287
316
|
}
|
|
@@ -291,10 +320,10 @@
|
|
|
291
320
|
return tmp$ret$1;
|
|
292
321
|
};
|
|
293
322
|
protoOf(AbstractClauseCollection).containsAll = function (elements) {
|
|
294
|
-
return this.
|
|
323
|
+
return this.o1l(elements);
|
|
295
324
|
};
|
|
296
325
|
protoOf(AbstractClauseCollection).r = function () {
|
|
297
|
-
return this.
|
|
326
|
+
return this.e1l_1.p1l().r();
|
|
298
327
|
};
|
|
299
328
|
protoOf(AbstractClauseCollection).toString = function () {
|
|
300
329
|
return '' + getKClassFromExpression(this).s6() + '(' + joinToString(this, ', ') + ')';
|
|
@@ -304,59 +333,59 @@
|
|
|
304
333
|
AbstractMutableReteClauseCollection.call($this);
|
|
305
334
|
return $this;
|
|
306
335
|
}
|
|
307
|
-
protoOf(AbstractMutableReteClauseCollection).
|
|
308
|
-
this.
|
|
309
|
-
return this.
|
|
336
|
+
protoOf(AbstractMutableReteClauseCollection).r1l = function (clause) {
|
|
337
|
+
this.e1l_1.s1l(clause);
|
|
338
|
+
return this.g1l();
|
|
310
339
|
};
|
|
311
340
|
protoOf(AbstractMutableReteClauseCollection).add = function (clause) {
|
|
312
|
-
return this.
|
|
341
|
+
return this.r1l(clause);
|
|
313
342
|
};
|
|
314
|
-
protoOf(AbstractMutableReteClauseCollection).
|
|
343
|
+
protoOf(AbstractMutableReteClauseCollection).t1l = function (clauses) {
|
|
315
344
|
// Inline function 'kotlin.collections.forEach' call
|
|
316
345
|
var tmp0_iterator = clauses.r();
|
|
317
346
|
while (tmp0_iterator.s()) {
|
|
318
347
|
var element = tmp0_iterator.u();
|
|
319
348
|
// Inline function 'it.unibo.tuprolog.collections.AbstractMutableReteClauseCollection.addAll.<anonymous>' call
|
|
320
|
-
this.
|
|
349
|
+
this.e1l_1.s1l(element);
|
|
321
350
|
}
|
|
322
|
-
return this.
|
|
351
|
+
return this.g1l();
|
|
323
352
|
};
|
|
324
353
|
protoOf(AbstractMutableReteClauseCollection).addAll = function (clauses) {
|
|
325
|
-
return this.
|
|
354
|
+
return this.t1l(clauses);
|
|
326
355
|
};
|
|
327
|
-
protoOf(AbstractMutableReteClauseCollection).
|
|
328
|
-
var retracted = this.
|
|
329
|
-
return none(retracted) ? new Failure(this.
|
|
356
|
+
protoOf(AbstractMutableReteClauseCollection).u1l = function (clause) {
|
|
357
|
+
var retracted = this.e1l_1.v1l(clause);
|
|
358
|
+
return none(retracted) ? new Failure(this.g1l()) : new Success(this.g1l(), toList(retracted));
|
|
330
359
|
};
|
|
331
360
|
protoOf(AbstractMutableReteClauseCollection).retrieve = function (clause) {
|
|
332
|
-
return this.
|
|
361
|
+
return this.u1l(clause);
|
|
333
362
|
};
|
|
334
|
-
protoOf(AbstractMutableReteClauseCollection).
|
|
335
|
-
var retracted = this.
|
|
336
|
-
return none(retracted) ? new Failure(this.
|
|
363
|
+
protoOf(AbstractMutableReteClauseCollection).w1l = function (clause) {
|
|
364
|
+
var retracted = this.e1l_1.x1l(clause);
|
|
365
|
+
return none(retracted) ? new Failure(this.g1l()) : new Success(this.g1l(), toList(retracted));
|
|
337
366
|
};
|
|
338
367
|
protoOf(AbstractMutableReteClauseCollection).retrieveAll = function (clause) {
|
|
339
|
-
return this.
|
|
368
|
+
return this.w1l(clause);
|
|
340
369
|
};
|
|
341
370
|
function AbstractMutableReteClauseCollection() {
|
|
342
371
|
}
|
|
343
372
|
function AbstractReteClauseCollection(rete) {
|
|
344
373
|
AbstractClauseCollection.call(this, rete);
|
|
345
374
|
}
|
|
346
|
-
protoOf(AbstractReteClauseCollection).
|
|
375
|
+
protoOf(AbstractReteClauseCollection).r1l = function (clause) {
|
|
347
376
|
// Inline function 'kotlin.apply' call
|
|
348
|
-
var this_0 = this.
|
|
377
|
+
var this_0 = this.e1l_1.a1m();
|
|
349
378
|
// Inline function 'kotlin.contracts.contract' call
|
|
350
379
|
// Inline function 'it.unibo.tuprolog.collections.AbstractReteClauseCollection.add.<anonymous>' call
|
|
351
|
-
this_0.
|
|
352
|
-
return this.
|
|
380
|
+
this_0.s1l(TheoryUtils_instance.b1m(clause));
|
|
381
|
+
return this.z1l(this_0);
|
|
353
382
|
};
|
|
354
383
|
protoOf(AbstractReteClauseCollection).add = function (clause) {
|
|
355
|
-
return this.
|
|
384
|
+
return this.r1l(clause);
|
|
356
385
|
};
|
|
357
|
-
protoOf(AbstractReteClauseCollection).
|
|
386
|
+
protoOf(AbstractReteClauseCollection).t1l = function (clauses) {
|
|
358
387
|
// Inline function 'kotlin.apply' call
|
|
359
|
-
var this_0 = this.
|
|
388
|
+
var this_0 = this.e1l_1.a1m();
|
|
360
389
|
// Inline function 'kotlin.contracts.contract' call
|
|
361
390
|
// Inline function 'it.unibo.tuprolog.collections.AbstractReteClauseCollection.addAll.<anonymous>' call
|
|
362
391
|
// Inline function 'kotlin.collections.forEach' call
|
|
@@ -364,28 +393,28 @@
|
|
|
364
393
|
while (tmp0_iterator.s()) {
|
|
365
394
|
var element = tmp0_iterator.u();
|
|
366
395
|
// Inline function 'it.unibo.tuprolog.collections.AbstractReteClauseCollection.addAll.<anonymous>.<anonymous>' call
|
|
367
|
-
this_0.
|
|
396
|
+
this_0.s1l(TheoryUtils_instance.b1m(element));
|
|
368
397
|
}
|
|
369
|
-
return this.
|
|
398
|
+
return this.z1l(this_0);
|
|
370
399
|
};
|
|
371
400
|
protoOf(AbstractReteClauseCollection).addAll = function (clauses) {
|
|
372
|
-
return this.
|
|
401
|
+
return this.t1l(clauses);
|
|
373
402
|
};
|
|
374
|
-
protoOf(AbstractReteClauseCollection).
|
|
375
|
-
var newTheory = this.
|
|
376
|
-
var retracted = newTheory.
|
|
377
|
-
return none(retracted) ? new Failure(this.
|
|
403
|
+
protoOf(AbstractReteClauseCollection).u1l = function (clause) {
|
|
404
|
+
var newTheory = this.e1l_1.a1m();
|
|
405
|
+
var retracted = newTheory.v1l(clause);
|
|
406
|
+
return none(retracted) ? new Failure(this.g1l()) : new Success(this.z1l(newTheory), toList(retracted));
|
|
378
407
|
};
|
|
379
408
|
protoOf(AbstractReteClauseCollection).retrieve = function (clause) {
|
|
380
|
-
return this.
|
|
409
|
+
return this.u1l(clause);
|
|
381
410
|
};
|
|
382
|
-
protoOf(AbstractReteClauseCollection).
|
|
383
|
-
var newTheory = this.
|
|
384
|
-
var retracted = newTheory.
|
|
385
|
-
return none(retracted) ? new Failure(this.
|
|
411
|
+
protoOf(AbstractReteClauseCollection).w1l = function (clause) {
|
|
412
|
+
var newTheory = this.e1l_1.a1m();
|
|
413
|
+
var retracted = newTheory.x1l(clause);
|
|
414
|
+
return none(retracted) ? new Failure(this.g1l()) : new Success(this.z1l(newTheory), toList(retracted));
|
|
386
415
|
};
|
|
387
416
|
protoOf(AbstractReteClauseCollection).retrieveAll = function (clause) {
|
|
388
|
-
return this.
|
|
417
|
+
return this.w1l(clause);
|
|
389
418
|
};
|
|
390
419
|
function Companion() {
|
|
391
420
|
}
|
|
@@ -471,27 +500,27 @@
|
|
|
471
500
|
}
|
|
472
501
|
function Success(collection, clauses) {
|
|
473
502
|
RetrieveResult.call(this);
|
|
474
|
-
this.
|
|
475
|
-
this.
|
|
503
|
+
this.f1m_1 = collection;
|
|
504
|
+
this.g1m_1 = clauses;
|
|
476
505
|
}
|
|
477
|
-
protoOf(Success).
|
|
478
|
-
return this.
|
|
506
|
+
protoOf(Success).h1m = function () {
|
|
507
|
+
return this.f1m_1;
|
|
479
508
|
};
|
|
480
|
-
protoOf(Success).
|
|
481
|
-
return this.
|
|
509
|
+
protoOf(Success).p1l = function () {
|
|
510
|
+
return this.g1m_1;
|
|
482
511
|
};
|
|
483
512
|
protoOf(Success).w12 = function () {
|
|
484
513
|
return true;
|
|
485
514
|
};
|
|
486
|
-
protoOf(Success).
|
|
487
|
-
return first(this.
|
|
515
|
+
protoOf(Success).i1m = function () {
|
|
516
|
+
return first(this.g1m_1);
|
|
488
517
|
};
|
|
489
518
|
protoOf(Success).toString = function () {
|
|
490
|
-
return 'Success(collection=' + this.
|
|
519
|
+
return 'Success(collection=' + this.f1m_1 + ', clauses=' + this.g1m_1 + ')';
|
|
491
520
|
};
|
|
492
521
|
protoOf(Success).hashCode = function () {
|
|
493
|
-
var result = hashCode(this.
|
|
494
|
-
result = imul(result, 31) + hashCode(this.
|
|
522
|
+
var result = hashCode(this.f1m_1);
|
|
523
|
+
result = imul(result, 31) + hashCode(this.g1m_1) | 0;
|
|
495
524
|
return result;
|
|
496
525
|
};
|
|
497
526
|
protoOf(Success).equals = function (other) {
|
|
@@ -500,33 +529,33 @@
|
|
|
500
529
|
if (!(other instanceof Success))
|
|
501
530
|
return false;
|
|
502
531
|
var tmp0_other_with_cast = other instanceof Success ? other : THROW_CCE();
|
|
503
|
-
if (!equals(this.
|
|
532
|
+
if (!equals(this.f1m_1, tmp0_other_with_cast.f1m_1))
|
|
504
533
|
return false;
|
|
505
|
-
if (!equals(this.
|
|
534
|
+
if (!equals(this.g1m_1, tmp0_other_with_cast.g1m_1))
|
|
506
535
|
return false;
|
|
507
536
|
return true;
|
|
508
537
|
};
|
|
509
538
|
function Failure(collection) {
|
|
510
539
|
RetrieveResult.call(this);
|
|
511
|
-
this.
|
|
540
|
+
this.k1m_1 = collection;
|
|
512
541
|
}
|
|
513
|
-
protoOf(Failure).
|
|
514
|
-
return this.
|
|
542
|
+
protoOf(Failure).h1m = function () {
|
|
543
|
+
return this.k1m_1;
|
|
515
544
|
};
|
|
516
|
-
protoOf(Failure).
|
|
545
|
+
protoOf(Failure).j1m = function () {
|
|
517
546
|
return true;
|
|
518
547
|
};
|
|
519
|
-
protoOf(Failure).
|
|
548
|
+
protoOf(Failure).p1l = function () {
|
|
520
549
|
return null;
|
|
521
550
|
};
|
|
522
|
-
protoOf(Failure).
|
|
551
|
+
protoOf(Failure).i1m = function () {
|
|
523
552
|
return null;
|
|
524
553
|
};
|
|
525
554
|
protoOf(Failure).toString = function () {
|
|
526
|
-
return 'Failure(collection=' + this.
|
|
555
|
+
return 'Failure(collection=' + this.k1m_1 + ')';
|
|
527
556
|
};
|
|
528
557
|
protoOf(Failure).hashCode = function () {
|
|
529
|
-
return hashCode(this.
|
|
558
|
+
return hashCode(this.k1m_1);
|
|
530
559
|
};
|
|
531
560
|
protoOf(Failure).equals = function (other) {
|
|
532
561
|
if (this === other)
|
|
@@ -534,7 +563,7 @@
|
|
|
534
563
|
if (!(other instanceof Failure))
|
|
535
564
|
return false;
|
|
536
565
|
var tmp0_other_with_cast = other instanceof Failure ? other : THROW_CCE();
|
|
537
|
-
if (!equals(this.
|
|
566
|
+
if (!equals(this.k1m_1, tmp0_other_with_cast.k1m_1))
|
|
538
567
|
return false;
|
|
539
568
|
return true;
|
|
540
569
|
};
|
|
@@ -543,12 +572,12 @@
|
|
|
543
572
|
protoOf(RetrieveResult).w12 = function () {
|
|
544
573
|
return false;
|
|
545
574
|
};
|
|
546
|
-
protoOf(RetrieveResult).
|
|
575
|
+
protoOf(RetrieveResult).j1m = function () {
|
|
547
576
|
return false;
|
|
548
577
|
};
|
|
549
578
|
function MutableReteClauseQueue_init_$Init$(unificator, clauses, $this) {
|
|
550
|
-
MutableReteClauseQueue.call($this, Companion_instance_6.
|
|
551
|
-
TheoryUtils_instance.
|
|
579
|
+
MutableReteClauseQueue.call($this, Companion_instance_6.l1m(unificator, clauses));
|
|
580
|
+
TheoryUtils_instance.m1m(clauses);
|
|
552
581
|
return $this;
|
|
553
582
|
}
|
|
554
583
|
function MutableReteClauseQueue_init_$Create$(unificator, clauses) {
|
|
@@ -560,44 +589,44 @@
|
|
|
560
589
|
// Inline function 'kotlin.contracts.contract' call
|
|
561
590
|
// Inline function 'kotlin.require' call
|
|
562
591
|
// Inline function 'kotlin.contracts.contract' call
|
|
563
|
-
if (!rete.
|
|
592
|
+
if (!rete.n1m()) {
|
|
564
593
|
// Inline function 'kotlin.require.<anonymous>' call
|
|
565
594
|
var message = 'Failed requirement.';
|
|
566
595
|
throw IllegalArgumentException_init_$Create$(toString(message));
|
|
567
596
|
}
|
|
568
597
|
}
|
|
569
|
-
protoOf(MutableReteClauseQueue).
|
|
570
|
-
return this.
|
|
598
|
+
protoOf(MutableReteClauseQueue).p1m = function (clause) {
|
|
599
|
+
return this.e1l_1.n1l(clause);
|
|
571
600
|
};
|
|
572
601
|
protoOf(MutableReteClauseQueue).getFifoOrdered = function (clause) {
|
|
573
|
-
return this.
|
|
602
|
+
return this.p1m(clause);
|
|
574
603
|
};
|
|
575
|
-
protoOf(MutableReteClauseQueue).
|
|
576
|
-
return asSequence(asReversed(toList(this.
|
|
604
|
+
protoOf(MutableReteClauseQueue).q1m = function (clause) {
|
|
605
|
+
return asSequence(asReversed(toList(this.p1m(clause))));
|
|
577
606
|
};
|
|
578
607
|
protoOf(MutableReteClauseQueue).getLifoOrdered = function (clause) {
|
|
579
|
-
return this.
|
|
608
|
+
return this.q1m(clause);
|
|
580
609
|
};
|
|
581
|
-
protoOf(MutableReteClauseQueue).
|
|
582
|
-
this.
|
|
610
|
+
protoOf(MutableReteClauseQueue).c1m = function (clause) {
|
|
611
|
+
this.e1l_1.r1m(clause);
|
|
583
612
|
return this;
|
|
584
613
|
};
|
|
585
614
|
protoOf(MutableReteClauseQueue).addFirst = function (clause) {
|
|
586
|
-
return this.
|
|
615
|
+
return this.c1m(clause);
|
|
587
616
|
};
|
|
588
|
-
protoOf(MutableReteClauseQueue).
|
|
589
|
-
this.
|
|
617
|
+
protoOf(MutableReteClauseQueue).d1m = function (clause) {
|
|
618
|
+
this.e1l_1.s1l(clause);
|
|
590
619
|
return this;
|
|
591
620
|
};
|
|
592
621
|
protoOf(MutableReteClauseQueue).addLast = function (clause) {
|
|
593
|
-
return this.
|
|
622
|
+
return this.d1m(clause);
|
|
594
623
|
};
|
|
595
|
-
protoOf(MutableReteClauseQueue).
|
|
596
|
-
var retracted = this.
|
|
624
|
+
protoOf(MutableReteClauseQueue).e1m = function (clause) {
|
|
625
|
+
var retracted = this.e1l_1.v1l(clause);
|
|
597
626
|
return none(retracted) ? new Failure(this) : new Success(this, toList(retracted));
|
|
598
627
|
};
|
|
599
628
|
protoOf(MutableReteClauseQueue).retrieveFirst = function (clause) {
|
|
600
|
-
return this.
|
|
629
|
+
return this.e1m(clause);
|
|
601
630
|
};
|
|
602
631
|
protoOf(MutableReteClauseQueue).equals = function (other) {
|
|
603
632
|
var tmp;
|
|
@@ -611,18 +640,18 @@
|
|
|
611
640
|
protoOf(MutableReteClauseQueue).hashCode = function () {
|
|
612
641
|
return Companion_instance_5.computeHashCode(this);
|
|
613
642
|
};
|
|
614
|
-
protoOf(MutableReteClauseQueue).
|
|
643
|
+
protoOf(MutableReteClauseQueue).g1l = function () {
|
|
615
644
|
return this;
|
|
616
645
|
};
|
|
617
646
|
function _get_hashCodeCache__ny3r0q($this) {
|
|
618
647
|
// Inline function 'kotlin.getValue' call
|
|
619
|
-
var this_0 = $this.
|
|
648
|
+
var this_0 = $this.t1m_1;
|
|
620
649
|
hashCodeCache$factory();
|
|
621
650
|
return this_0.r2();
|
|
622
651
|
}
|
|
623
652
|
function ReteClauseQueue_init_$Init$(unificator, clauses, $this) {
|
|
624
|
-
ReteClauseQueue.call($this, Companion_instance_6.
|
|
625
|
-
TheoryUtils_instance.
|
|
653
|
+
ReteClauseQueue.call($this, Companion_instance_6.l1m(unificator, clauses));
|
|
654
|
+
TheoryUtils_instance.m1m(clauses);
|
|
626
655
|
return $this;
|
|
627
656
|
}
|
|
628
657
|
function ReteClauseQueue_init_$Create$(unificator, clauses) {
|
|
@@ -636,70 +665,70 @@
|
|
|
636
665
|
function ReteClauseQueue(rete) {
|
|
637
666
|
AbstractReteClauseCollection.call(this, rete);
|
|
638
667
|
var tmp = this;
|
|
639
|
-
tmp.
|
|
668
|
+
tmp.t1m_1 = lazy(ReteClauseQueue$hashCodeCache$delegate$lambda(this));
|
|
640
669
|
// Inline function 'kotlin.require' call
|
|
641
670
|
// Inline function 'kotlin.contracts.contract' call
|
|
642
671
|
// Inline function 'kotlin.require' call
|
|
643
672
|
// Inline function 'kotlin.contracts.contract' call
|
|
644
|
-
if (!rete.
|
|
673
|
+
if (!rete.n1m()) {
|
|
645
674
|
// Inline function 'kotlin.require.<anonymous>' call
|
|
646
675
|
var message = 'Failed requirement.';
|
|
647
676
|
throw IllegalArgumentException_init_$Create$(toString(message));
|
|
648
677
|
}
|
|
649
678
|
}
|
|
650
|
-
protoOf(ReteClauseQueue).
|
|
679
|
+
protoOf(ReteClauseQueue).c1m = function (clause) {
|
|
651
680
|
// Inline function 'kotlin.apply' call
|
|
652
|
-
var this_0 = this.
|
|
681
|
+
var this_0 = this.e1l_1.a1m();
|
|
653
682
|
// Inline function 'kotlin.contracts.contract' call
|
|
654
683
|
// Inline function 'it.unibo.tuprolog.collections.impl.ReteClauseQueue.addFirst.<anonymous>' call
|
|
655
|
-
this_0.
|
|
684
|
+
this_0.r1m(TheoryUtils_instance.b1m(clause));
|
|
656
685
|
return new ReteClauseQueue(this_0);
|
|
657
686
|
};
|
|
658
687
|
protoOf(ReteClauseQueue).addFirst = function (clause) {
|
|
659
|
-
return this.
|
|
688
|
+
return this.c1m(clause);
|
|
660
689
|
};
|
|
661
|
-
protoOf(ReteClauseQueue).
|
|
690
|
+
protoOf(ReteClauseQueue).d1m = function (clause) {
|
|
662
691
|
// Inline function 'kotlin.apply' call
|
|
663
|
-
var this_0 = this.
|
|
692
|
+
var this_0 = this.e1l_1.a1m();
|
|
664
693
|
// Inline function 'kotlin.contracts.contract' call
|
|
665
694
|
// Inline function 'it.unibo.tuprolog.collections.impl.ReteClauseQueue.addLast.<anonymous>' call
|
|
666
|
-
this_0.
|
|
695
|
+
this_0.s1l(TheoryUtils_instance.b1m(clause));
|
|
667
696
|
return new ReteClauseQueue(this_0);
|
|
668
697
|
};
|
|
669
698
|
protoOf(ReteClauseQueue).addLast = function (clause) {
|
|
670
|
-
return this.
|
|
699
|
+
return this.d1m(clause);
|
|
671
700
|
};
|
|
672
|
-
protoOf(ReteClauseQueue).
|
|
673
|
-
return this.
|
|
701
|
+
protoOf(ReteClauseQueue).p1m = function (clause) {
|
|
702
|
+
return this.e1l_1.n1l(clause);
|
|
674
703
|
};
|
|
675
704
|
protoOf(ReteClauseQueue).getFifoOrdered = function (clause) {
|
|
676
|
-
return this.
|
|
705
|
+
return this.p1m(clause);
|
|
677
706
|
};
|
|
678
|
-
protoOf(ReteClauseQueue).
|
|
679
|
-
return asSequence(asReversed(toList(this.
|
|
707
|
+
protoOf(ReteClauseQueue).q1m = function (clause) {
|
|
708
|
+
return asSequence(asReversed(toList(this.p1m(clause))));
|
|
680
709
|
};
|
|
681
710
|
protoOf(ReteClauseQueue).getLifoOrdered = function (clause) {
|
|
682
|
-
return this.
|
|
711
|
+
return this.q1m(clause);
|
|
683
712
|
};
|
|
684
|
-
protoOf(ReteClauseQueue).
|
|
685
|
-
return this.
|
|
713
|
+
protoOf(ReteClauseQueue).r1l = function (clause) {
|
|
714
|
+
return this.d1m(clause);
|
|
686
715
|
};
|
|
687
716
|
protoOf(ReteClauseQueue).add = function (clause) {
|
|
688
|
-
return this.
|
|
717
|
+
return this.r1l(clause);
|
|
689
718
|
};
|
|
690
|
-
protoOf(ReteClauseQueue).
|
|
691
|
-
return protoOf(AbstractReteClauseCollection).
|
|
719
|
+
protoOf(ReteClauseQueue).u1l = function (clause) {
|
|
720
|
+
return protoOf(AbstractReteClauseCollection).u1l.call(this, clause);
|
|
692
721
|
};
|
|
693
722
|
protoOf(ReteClauseQueue).retrieve = function (clause) {
|
|
694
|
-
return this.
|
|
723
|
+
return this.u1l(clause);
|
|
695
724
|
};
|
|
696
|
-
protoOf(ReteClauseQueue).
|
|
697
|
-
return protoOf(AbstractReteClauseCollection).
|
|
725
|
+
protoOf(ReteClauseQueue).e1m = function (clause) {
|
|
726
|
+
return protoOf(AbstractReteClauseCollection).u1l.call(this, clause);
|
|
698
727
|
};
|
|
699
728
|
protoOf(ReteClauseQueue).retrieveFirst = function (clause) {
|
|
700
|
-
return this.
|
|
729
|
+
return this.e1m(clause);
|
|
701
730
|
};
|
|
702
|
-
protoOf(ReteClauseQueue).
|
|
731
|
+
protoOf(ReteClauseQueue).z1l = function (rete) {
|
|
703
732
|
return new ReteClauseQueue(rete);
|
|
704
733
|
};
|
|
705
734
|
protoOf(ReteClauseQueue).equals = function (other) {
|
|
@@ -720,7 +749,7 @@
|
|
|
720
749
|
protoOf(ReteClauseQueue).hashCode = function () {
|
|
721
750
|
return _get_hashCodeCache__ny3r0q(this);
|
|
722
751
|
};
|
|
723
|
-
protoOf(ReteClauseQueue).
|
|
752
|
+
protoOf(ReteClauseQueue).g1l = function () {
|
|
724
753
|
return this;
|
|
725
754
|
};
|
|
726
755
|
function hashCodeCache$factory() {
|
|
@@ -729,9 +758,9 @@
|
|
|
729
758
|
}, null);
|
|
730
759
|
}
|
|
731
760
|
function AbstractReteNode$removeAllLazily$slambda($source, this$0, $clause, resultContinuation) {
|
|
732
|
-
this.
|
|
733
|
-
this.
|
|
734
|
-
this.
|
|
761
|
+
this.c1n_1 = $source;
|
|
762
|
+
this.d1n_1 = this$0;
|
|
763
|
+
this.e1n_1 = $clause;
|
|
735
764
|
CoroutineImpl.call(this, resultContinuation);
|
|
736
765
|
}
|
|
737
766
|
protoOf(AbstractReteNode$removeAllLazily$slambda).as = function ($this$sequence, $completion) {
|
|
@@ -751,21 +780,21 @@
|
|
|
751
780
|
switch (tmp) {
|
|
752
781
|
case 0:
|
|
753
782
|
this.oc_1 = 5;
|
|
754
|
-
this.
|
|
783
|
+
this.g1n_1 = this.c1n_1.r();
|
|
755
784
|
this.nc_1 = 1;
|
|
756
785
|
continue $sm;
|
|
757
786
|
case 1:
|
|
758
|
-
if (!this.
|
|
787
|
+
if (!this.g1n_1.s()) {
|
|
759
788
|
this.nc_1 = 4;
|
|
760
789
|
continue $sm;
|
|
761
790
|
}
|
|
762
791
|
|
|
763
|
-
this.
|
|
764
|
-
if (this.
|
|
765
|
-
this.
|
|
766
|
-
this.
|
|
792
|
+
this.h1n_1 = this.g1n_1.u();
|
|
793
|
+
if (this.d1n_1.f1l().match(this.h1n_1.k1n(), this.e1n_1)) {
|
|
794
|
+
this.h1n_1.i1n();
|
|
795
|
+
this.g1n_1.t();
|
|
767
796
|
this.nc_1 = 2;
|
|
768
|
-
suspendResult = this.
|
|
797
|
+
suspendResult = this.f1n_1.ef(this.h1n_1, this);
|
|
769
798
|
if (suspendResult === get_COROUTINE_SUSPENDED()) {
|
|
770
799
|
return suspendResult;
|
|
771
800
|
}
|
|
@@ -798,8 +827,8 @@
|
|
|
798
827
|
while (true);
|
|
799
828
|
};
|
|
800
829
|
protoOf(AbstractReteNode$removeAllLazily$slambda).bs = function ($this$sequence, completion) {
|
|
801
|
-
var i = new AbstractReteNode$removeAllLazily$slambda(this.
|
|
802
|
-
i.
|
|
830
|
+
var i = new AbstractReteNode$removeAllLazily$slambda(this.c1n_1, this.d1n_1, this.e1n_1, completion);
|
|
831
|
+
i.f1n_1 = $this$sequence;
|
|
803
832
|
return i;
|
|
804
833
|
};
|
|
805
834
|
function AbstractReteNode$removeAllLazily$slambda_0($source, this$0, $clause, resultContinuation) {
|
|
@@ -811,17 +840,17 @@
|
|
|
811
840
|
return l;
|
|
812
841
|
}
|
|
813
842
|
function AbstractReteNode(unificator) {
|
|
814
|
-
this.
|
|
843
|
+
this.j1n_1 = unificator;
|
|
815
844
|
}
|
|
816
|
-
protoOf(AbstractReteNode).
|
|
817
|
-
return this.
|
|
845
|
+
protoOf(AbstractReteNode).f1l = function () {
|
|
846
|
+
return this.j1n_1;
|
|
818
847
|
};
|
|
819
|
-
protoOf(AbstractReteNode).
|
|
848
|
+
protoOf(AbstractReteNode).l1n = function (source, clause) {
|
|
820
849
|
return sequence(AbstractReteNode$removeAllLazily$slambda_0(source, this, clause, null));
|
|
821
850
|
};
|
|
822
851
|
function Companion_1() {
|
|
823
852
|
}
|
|
824
|
-
protoOf(Companion_1).
|
|
853
|
+
protoOf(Companion_1).l1m = function (unificator, clauses) {
|
|
825
854
|
return new RootNode(unificator, clauses, true);
|
|
826
855
|
};
|
|
827
856
|
var Companion_instance_6;
|
|
@@ -832,17 +861,17 @@
|
|
|
832
861
|
return sequence(Utils$firstArguments$slambda_0(_this__u8e3s4, null));
|
|
833
862
|
}
|
|
834
863
|
function Utils$firstArguments$slambda($this_firstArguments, resultContinuation) {
|
|
835
|
-
this.
|
|
864
|
+
this.y1n_1 = $this_firstArguments;
|
|
836
865
|
CoroutineImpl.call(this, resultContinuation);
|
|
837
866
|
}
|
|
838
|
-
protoOf(Utils$firstArguments$slambda).
|
|
839
|
-
var tmp = this.
|
|
867
|
+
protoOf(Utils$firstArguments$slambda).b1o = function ($this$sequence, $completion) {
|
|
868
|
+
var tmp = this.c1o($this$sequence, $completion);
|
|
840
869
|
tmp.pc_1 = Unit_instance;
|
|
841
870
|
tmp.qc_1 = null;
|
|
842
871
|
return tmp.yc();
|
|
843
872
|
};
|
|
844
873
|
protoOf(Utils$firstArguments$slambda).ld = function (p1, $completion) {
|
|
845
|
-
return this.
|
|
874
|
+
return this.b1o(p1 instanceof SequenceScope ? p1 : THROW_CCE(), $completion);
|
|
846
875
|
};
|
|
847
876
|
protoOf(Utils$firstArguments$slambda).yc = function () {
|
|
848
877
|
var suspendResult = this.pc_1;
|
|
@@ -852,29 +881,29 @@
|
|
|
852
881
|
switch (tmp) {
|
|
853
882
|
case 0:
|
|
854
883
|
this.oc_1 = 5;
|
|
855
|
-
this.
|
|
884
|
+
this.a1o_1 = this.y1n_1;
|
|
856
885
|
this.nc_1 = 1;
|
|
857
886
|
continue $sm;
|
|
858
887
|
case 1:
|
|
859
|
-
if (!this.
|
|
888
|
+
if (!this.a1o_1.ww()) {
|
|
860
889
|
this.nc_1 = 3;
|
|
861
890
|
continue $sm;
|
|
862
891
|
}
|
|
863
892
|
|
|
864
893
|
this.nc_1 = 2;
|
|
865
|
-
suspendResult = this.
|
|
894
|
+
suspendResult = this.z1n_1.ef(this.a1o_1, this);
|
|
866
895
|
if (suspendResult === get_COROUTINE_SUSPENDED()) {
|
|
867
896
|
return suspendResult;
|
|
868
897
|
}
|
|
869
898
|
|
|
870
899
|
continue $sm;
|
|
871
900
|
case 2:
|
|
872
|
-
this.
|
|
901
|
+
this.a1o_1 = this.a1o_1.castToStruct().getArgAt(0);
|
|
873
902
|
this.nc_1 = 1;
|
|
874
903
|
continue $sm;
|
|
875
904
|
case 3:
|
|
876
905
|
this.nc_1 = 4;
|
|
877
|
-
suspendResult = this.
|
|
906
|
+
suspendResult = this.z1n_1.ef(this.a1o_1, this);
|
|
878
907
|
if (suspendResult === get_COROUTINE_SUSPENDED()) {
|
|
879
908
|
return suspendResult;
|
|
880
909
|
}
|
|
@@ -896,15 +925,15 @@
|
|
|
896
925
|
}
|
|
897
926
|
while (true);
|
|
898
927
|
};
|
|
899
|
-
protoOf(Utils$firstArguments$slambda).
|
|
900
|
-
var i = new Utils$firstArguments$slambda(this.
|
|
901
|
-
i.
|
|
928
|
+
protoOf(Utils$firstArguments$slambda).c1o = function ($this$sequence, completion) {
|
|
929
|
+
var i = new Utils$firstArguments$slambda(this.y1n_1, completion);
|
|
930
|
+
i.z1n_1 = $this$sequence;
|
|
902
931
|
return i;
|
|
903
932
|
};
|
|
904
933
|
function Utils$firstArguments$slambda_0($this_firstArguments, resultContinuation) {
|
|
905
934
|
var i = new Utils$firstArguments$slambda($this_firstArguments, resultContinuation);
|
|
906
935
|
var l = function ($this$sequence, $completion) {
|
|
907
|
-
return i.
|
|
936
|
+
return i.b1o($this$sequence, $completion);
|
|
908
937
|
};
|
|
909
938
|
l.$arity = 1;
|
|
910
939
|
return l;
|
|
@@ -918,46 +947,46 @@
|
|
|
918
947
|
}
|
|
919
948
|
function Utils() {
|
|
920
949
|
}
|
|
921
|
-
protoOf(Utils).
|
|
950
|
+
protoOf(Utils).d1o = function (_this__u8e3s4, nestingLevel) {
|
|
922
951
|
// Inline function 'kotlin.let' call
|
|
923
952
|
// Inline function 'kotlin.contracts.contract' call
|
|
924
953
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.Utils.arityOfNestedFirstArgument.<anonymous>' call
|
|
925
954
|
return takeFirstAfterSkipping(firstArguments(_this__u8e3s4, this), nestingLevel).castToStruct().kw();
|
|
926
955
|
};
|
|
927
|
-
protoOf(Utils).
|
|
956
|
+
protoOf(Utils).e1o = function (_this__u8e3s4, nestingLevel) {
|
|
928
957
|
// Inline function 'kotlin.let' call
|
|
929
958
|
// Inline function 'kotlin.contracts.contract' call
|
|
930
959
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.Utils.functorOfNestedFirstArgument.<anonymous>' call
|
|
931
960
|
return takeFirstAfterSkipping(firstArguments(_this__u8e3s4, this), nestingLevel).castToStruct().qw();
|
|
932
961
|
};
|
|
933
|
-
protoOf(Utils).
|
|
962
|
+
protoOf(Utils).f1o = function (_this__u8e3s4, nestingLevel) {
|
|
934
963
|
return takeFirstAfterSkipping(firstArguments(_this__u8e3s4, this), nestingLevel);
|
|
935
964
|
};
|
|
936
|
-
protoOf(Utils).
|
|
937
|
-
return this.
|
|
965
|
+
protoOf(Utils).g1o = function (args) {
|
|
966
|
+
return this.h1o(listOf(args.slice()));
|
|
938
967
|
};
|
|
939
|
-
protoOf(Utils).
|
|
940
|
-
return this.
|
|
968
|
+
protoOf(Utils).i1o = function (sequence) {
|
|
969
|
+
return this.h1o(asIterable(sequence));
|
|
941
970
|
};
|
|
942
|
-
protoOf(Utils).
|
|
971
|
+
protoOf(Utils).h1o = function (iterable) {
|
|
943
972
|
return mergeSequences(iterable, SituatedIndexedClause$compareTo$ref());
|
|
944
973
|
};
|
|
945
|
-
protoOf(Utils).
|
|
946
|
-
return this.
|
|
974
|
+
protoOf(Utils).j1o = function (args) {
|
|
975
|
+
return this.k1o(sequenceOf(args.slice()));
|
|
947
976
|
};
|
|
948
|
-
protoOf(Utils).
|
|
977
|
+
protoOf(Utils).k1o = function (sequence) {
|
|
949
978
|
return flatten(sequence);
|
|
950
979
|
};
|
|
951
|
-
protoOf(Utils).
|
|
952
|
-
return this.
|
|
980
|
+
protoOf(Utils).l1o = function (iterable) {
|
|
981
|
+
return this.k1o(asSequence(iterable));
|
|
953
982
|
};
|
|
954
|
-
protoOf(Utils).
|
|
955
|
-
return this.
|
|
983
|
+
protoOf(Utils).m1o = function (args) {
|
|
984
|
+
return this.n1o(sequenceOf(args.slice()));
|
|
956
985
|
};
|
|
957
|
-
protoOf(Utils).
|
|
986
|
+
protoOf(Utils).n1o = function (sequence) {
|
|
958
987
|
return flatten(sequence);
|
|
959
988
|
};
|
|
960
|
-
protoOf(Utils).
|
|
989
|
+
protoOf(Utils).o1o = function (a, b) {
|
|
961
990
|
return (a == null ? b == null : false) ? null : a == null ? b : b == null ? a : a.kt(b) < 0 ? a : b;
|
|
962
991
|
};
|
|
963
992
|
var Utils_instance;
|
|
@@ -965,25 +994,25 @@
|
|
|
965
994
|
return Utils_instance;
|
|
966
995
|
}
|
|
967
996
|
function IndexedClause$Companion$wrap$1($traversed, $indexedClause) {
|
|
968
|
-
this.
|
|
969
|
-
this.
|
|
997
|
+
this.q1o_1 = $indexedClause;
|
|
998
|
+
this.p1o_1 = listOf($traversed.slice());
|
|
970
999
|
}
|
|
971
1000
|
protoOf(IndexedClause$Companion$wrap$1).jr = function () {
|
|
972
|
-
return this.
|
|
1001
|
+
return this.q1o_1.jr();
|
|
973
1002
|
};
|
|
974
1003
|
protoOf(IndexedClause$Companion$wrap$1).r2 = function () {
|
|
975
|
-
return this.
|
|
1004
|
+
return this.q1o_1.r2();
|
|
976
1005
|
};
|
|
977
|
-
protoOf(IndexedClause$Companion$wrap$1).
|
|
978
|
-
return this.
|
|
1006
|
+
protoOf(IndexedClause$Companion$wrap$1).r1o = function () {
|
|
1007
|
+
return this.p1o_1;
|
|
979
1008
|
};
|
|
980
|
-
protoOf(IndexedClause$Companion$wrap$1).
|
|
1009
|
+
protoOf(IndexedClause$Companion$wrap$1).i1n = function () {
|
|
981
1010
|
// Inline function 'kotlin.collections.forEach' call
|
|
982
|
-
var tmp0_iterator = this.
|
|
1011
|
+
var tmp0_iterator = this.p1o_1.r();
|
|
983
1012
|
while (tmp0_iterator.s()) {
|
|
984
1013
|
var element = tmp0_iterator.u();
|
|
985
1014
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.clause.<no name provided>.invalidateAllCaches.<anonymous>' call
|
|
986
|
-
element.
|
|
1015
|
+
element.p1n();
|
|
987
1016
|
}
|
|
988
1017
|
};
|
|
989
1018
|
protoOf(IndexedClause$Companion$wrap$1).d = function (other) {
|
|
@@ -991,17 +1020,17 @@
|
|
|
991
1020
|
};
|
|
992
1021
|
function Companion_2() {
|
|
993
1022
|
}
|
|
994
|
-
protoOf(Companion_2).
|
|
1023
|
+
protoOf(Companion_2).t1o = function (indexedClause, traversed) {
|
|
995
1024
|
return new IndexedClause$Companion$wrap$1(traversed, indexedClause);
|
|
996
1025
|
};
|
|
997
|
-
protoOf(Companion_2).
|
|
998
|
-
return this.
|
|
1026
|
+
protoOf(Companion_2).u1o = function (index, clause, traversed) {
|
|
1027
|
+
return this.t1o(Companion_instance_0.jt(index, clause), traversed.slice());
|
|
999
1028
|
};
|
|
1000
|
-
protoOf(Companion_2).
|
|
1029
|
+
protoOf(Companion_2).v1o = function (index, clause, traversed) {
|
|
1001
1030
|
var tmp = Companion_instance_0.jt(index, clause);
|
|
1002
1031
|
// Inline function 'kotlin.collections.toTypedArray' call
|
|
1003
1032
|
var tmp$ret$0 = copyToArray(traversed);
|
|
1004
|
-
return this.
|
|
1033
|
+
return this.t1o(tmp, tmp$ret$0.slice());
|
|
1005
1034
|
};
|
|
1006
1035
|
var Companion_instance_7;
|
|
1007
1036
|
function Companion_getInstance_5() {
|
|
@@ -1010,24 +1039,24 @@
|
|
|
1010
1039
|
function IndexedClause() {
|
|
1011
1040
|
}
|
|
1012
1041
|
function SituatedIndexedClause$Companion$of$1($indexed, $index) {
|
|
1013
|
-
this.
|
|
1014
|
-
this.
|
|
1042
|
+
this.w1o_1 = $indexed;
|
|
1043
|
+
this.x1o_1 = $index;
|
|
1015
1044
|
}
|
|
1016
1045
|
protoOf(SituatedIndexedClause$Companion$of$1).jr = function () {
|
|
1017
|
-
return this.
|
|
1046
|
+
return this.w1o_1.jr();
|
|
1018
1047
|
};
|
|
1019
1048
|
protoOf(SituatedIndexedClause$Companion$of$1).r2 = function () {
|
|
1020
|
-
return this.
|
|
1049
|
+
return this.w1o_1.r2();
|
|
1021
1050
|
};
|
|
1022
|
-
protoOf(SituatedIndexedClause$Companion$of$1).
|
|
1023
|
-
this.
|
|
1024
|
-
this.
|
|
1051
|
+
protoOf(SituatedIndexedClause$Companion$of$1).y1o = function () {
|
|
1052
|
+
this.x1o_1.z1o(this);
|
|
1053
|
+
this.i1n();
|
|
1025
1054
|
};
|
|
1026
|
-
protoOf(SituatedIndexedClause$Companion$of$1).
|
|
1027
|
-
return this.
|
|
1055
|
+
protoOf(SituatedIndexedClause$Companion$of$1).r1o = function () {
|
|
1056
|
+
return this.w1o_1.r1o();
|
|
1028
1057
|
};
|
|
1029
|
-
protoOf(SituatedIndexedClause$Companion$of$1).
|
|
1030
|
-
this.
|
|
1058
|
+
protoOf(SituatedIndexedClause$Companion$of$1).i1n = function () {
|
|
1059
|
+
this.w1o_1.i1n();
|
|
1031
1060
|
};
|
|
1032
1061
|
protoOf(SituatedIndexedClause$Companion$of$1).equals = function (other) {
|
|
1033
1062
|
if (this === other)
|
|
@@ -1043,7 +1072,7 @@
|
|
|
1043
1072
|
};
|
|
1044
1073
|
function Companion_3() {
|
|
1045
1074
|
}
|
|
1046
|
-
protoOf(Companion_3).
|
|
1075
|
+
protoOf(Companion_3).a1p = function (indexed, index) {
|
|
1047
1076
|
return new SituatedIndexedClause$Companion$of$1(indexed, index);
|
|
1048
1077
|
};
|
|
1049
1078
|
var Companion_instance_8;
|
|
@@ -1055,12 +1084,12 @@
|
|
|
1055
1084
|
function AbstractIndexingLeaf(unificator) {
|
|
1056
1085
|
AbstractReteNode.call(this, unificator);
|
|
1057
1086
|
}
|
|
1058
|
-
protoOf(AbstractIndexingLeaf).
|
|
1087
|
+
protoOf(AbstractIndexingLeaf).p1n = function () {
|
|
1059
1088
|
};
|
|
1060
1089
|
function extractFirst($this, clause) {
|
|
1061
1090
|
// Inline function 'kotlin.collections.mapNotNull' call
|
|
1062
1091
|
// Inline function 'kotlin.collections.mapNotNullTo' call
|
|
1063
|
-
var this_0 = $this.
|
|
1092
|
+
var this_0 = $this.j1p_1.m2();
|
|
1064
1093
|
var destination = ArrayList_init_$Create$_0();
|
|
1065
1094
|
// Inline function 'kotlin.collections.forEach' call
|
|
1066
1095
|
var tmp0_iterator = this_0.r();
|
|
@@ -1088,7 +1117,7 @@
|
|
|
1088
1117
|
while (tmp0_iterator.s()) {
|
|
1089
1118
|
var item = tmp0_iterator.u();
|
|
1090
1119
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.AtomIndex.extractFirst.<anonymous>' call
|
|
1091
|
-
if ($this.
|
|
1120
|
+
if ($this.f1l().match(item.k1n(), clause)) {
|
|
1092
1121
|
tmp$ret$1 = index_0;
|
|
1093
1122
|
break $l$block;
|
|
1094
1123
|
}
|
|
@@ -1106,28 +1135,28 @@
|
|
|
1106
1135
|
return tmp;
|
|
1107
1136
|
}
|
|
1108
1137
|
function nestedFirstArgument(_this__u8e3s4, $this) {
|
|
1109
|
-
return Utils_instance.
|
|
1138
|
+
return Utils_instance.f1o(ensureNotNull(_this__u8e3s4.wy()), $this.i1p_1 + 1 | 0);
|
|
1110
1139
|
}
|
|
1111
1140
|
function asInnerAtom(_this__u8e3s4, $this) {
|
|
1112
1141
|
return nestedFirstArgument(_this__u8e3s4, $this).castToAtom();
|
|
1113
1142
|
}
|
|
1114
1143
|
function asInnerAtom_0(_this__u8e3s4, $this) {
|
|
1115
|
-
return nestedFirstArgument(_this__u8e3s4.
|
|
1144
|
+
return nestedFirstArgument(_this__u8e3s4.k1n(), $this).castToAtom();
|
|
1116
1145
|
}
|
|
1117
1146
|
function asInnerAtom_1(_this__u8e3s4, $this) {
|
|
1118
|
-
return nestedFirstArgument(_this__u8e3s4.
|
|
1147
|
+
return nestedFirstArgument(_this__u8e3s4.k1n(), $this).castToAtom();
|
|
1119
1148
|
}
|
|
1120
1149
|
function AtomIndex$_get_size_$lambda_ygjfwe(it) {
|
|
1121
1150
|
return it.l();
|
|
1122
1151
|
}
|
|
1123
1152
|
function AtomIndex$getIndexed$lambda(this$0, $clause) {
|
|
1124
1153
|
return function (it) {
|
|
1125
|
-
return this$0.
|
|
1154
|
+
return this$0.f1l().match(it.k1n(), $clause);
|
|
1126
1155
|
};
|
|
1127
1156
|
}
|
|
1128
1157
|
function AtomIndex$retractAllIndexed$lambda(this$0, $clause) {
|
|
1129
1158
|
return function (it) {
|
|
1130
|
-
return this$0.
|
|
1159
|
+
return this$0.l1n(it, $clause);
|
|
1131
1160
|
};
|
|
1132
1161
|
}
|
|
1133
1162
|
function AtomIndex$getCache$lambda(it) {
|
|
@@ -1135,30 +1164,30 @@
|
|
|
1135
1164
|
}
|
|
1136
1165
|
function AtomIndex$extractGlobalIndexedSequence$lambda(this$0, $clause) {
|
|
1137
1166
|
return function (it) {
|
|
1138
|
-
return this$0.
|
|
1167
|
+
return this$0.f1l().match(it.k1n(), $clause);
|
|
1139
1168
|
};
|
|
1140
1169
|
}
|
|
1141
1170
|
function AtomIndex(unificator, ordered, nestingLevel) {
|
|
1142
1171
|
AbstractIndexingLeaf.call(this, unificator);
|
|
1143
|
-
this.
|
|
1144
|
-
this.
|
|
1172
|
+
this.h1p_1 = ordered;
|
|
1173
|
+
this.i1p_1 = nestingLevel;
|
|
1145
1174
|
var tmp = this;
|
|
1146
1175
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
1147
|
-
tmp.
|
|
1176
|
+
tmp.j1p_1 = LinkedHashMap_init_$Create$();
|
|
1148
1177
|
}
|
|
1149
1178
|
protoOf(AtomIndex).l = function () {
|
|
1150
|
-
var tmp = asSequence(this.
|
|
1179
|
+
var tmp = asSequence(this.j1p_1.m2());
|
|
1151
1180
|
return sum(map(tmp, AtomIndex$_get_size_$lambda_ygjfwe));
|
|
1152
1181
|
};
|
|
1153
|
-
protoOf(AtomIndex).
|
|
1182
|
+
protoOf(AtomIndex).k1l = function () {
|
|
1154
1183
|
var tmp;
|
|
1155
|
-
if (this.
|
|
1184
|
+
if (this.j1p_1.y()) {
|
|
1156
1185
|
tmp = true;
|
|
1157
1186
|
} else {
|
|
1158
1187
|
var tmp$ret$0;
|
|
1159
1188
|
$l$block_0: {
|
|
1160
1189
|
// Inline function 'kotlin.collections.all' call
|
|
1161
|
-
var this_0 = this.
|
|
1190
|
+
var this_0 = this.j1p_1.m2();
|
|
1162
1191
|
var tmp_0;
|
|
1163
1192
|
if (isInterface(this_0, Collection)) {
|
|
1164
1193
|
tmp_0 = this_0.y();
|
|
@@ -1184,13 +1213,13 @@
|
|
|
1184
1213
|
}
|
|
1185
1214
|
return tmp;
|
|
1186
1215
|
};
|
|
1187
|
-
protoOf(AtomIndex).
|
|
1188
|
-
if (this.
|
|
1216
|
+
protoOf(AtomIndex).m1n = function (clause) {
|
|
1217
|
+
if (this.h1p_1) {
|
|
1189
1218
|
// Inline function 'kotlin.let' call
|
|
1190
1219
|
// Inline function 'kotlin.contracts.contract' call
|
|
1191
1220
|
var it = asInnerAtom_1(clause, this);
|
|
1192
1221
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1193
|
-
var this_0 = this.
|
|
1222
|
+
var this_0 = this.j1p_1;
|
|
1194
1223
|
var value = this_0.x2(it);
|
|
1195
1224
|
var tmp;
|
|
1196
1225
|
if (value == null) {
|
|
@@ -1202,18 +1231,18 @@
|
|
|
1202
1231
|
tmp = value;
|
|
1203
1232
|
}
|
|
1204
1233
|
var tmp$ret$1 = tmp;
|
|
1205
|
-
addFirst(tmp$ret$1, Companion_instance_8.
|
|
1234
|
+
addFirst(tmp$ret$1, Companion_instance_8.a1p(clause.s1o(this), this));
|
|
1206
1235
|
} else {
|
|
1207
|
-
this.
|
|
1236
|
+
this.n1n(clause);
|
|
1208
1237
|
}
|
|
1209
1238
|
};
|
|
1210
|
-
protoOf(AtomIndex).
|
|
1239
|
+
protoOf(AtomIndex).n1n = function (clause) {
|
|
1211
1240
|
// Inline function 'kotlin.let' call
|
|
1212
1241
|
// Inline function 'kotlin.contracts.contract' call
|
|
1213
1242
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.AtomIndex.assertZ.<anonymous>' call
|
|
1214
1243
|
var it = asInnerAtom_1(clause, this);
|
|
1215
1244
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1216
|
-
var this_0 = this.
|
|
1245
|
+
var this_0 = this.j1p_1;
|
|
1217
1246
|
var value = this_0.x2(it);
|
|
1218
1247
|
var tmp;
|
|
1219
1248
|
if (value == null) {
|
|
@@ -1224,15 +1253,15 @@
|
|
|
1224
1253
|
} else {
|
|
1225
1254
|
tmp = value;
|
|
1226
1255
|
}
|
|
1227
|
-
tmp.o(Companion_instance_8.
|
|
1256
|
+
tmp.o(Companion_instance_8.a1p(clause.s1o(this), this));
|
|
1228
1257
|
};
|
|
1229
|
-
protoOf(AtomIndex).
|
|
1258
|
+
protoOf(AtomIndex).c1p = function (clause) {
|
|
1230
1259
|
var tmp;
|
|
1231
1260
|
if (nestedFirstArgument(clause, this).lw()) {
|
|
1232
1261
|
// Inline function 'kotlin.let' call
|
|
1233
1262
|
// Inline function 'kotlin.contracts.contract' call
|
|
1234
1263
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.AtomIndex.getFirstIndexed.<anonymous>' call
|
|
1235
|
-
var it = this.
|
|
1264
|
+
var it = this.j1p_1.x2(asInnerAtom(clause, this));
|
|
1236
1265
|
var tmp_0;
|
|
1237
1266
|
if (it == null) {
|
|
1238
1267
|
tmp_0 = null;
|
|
@@ -1245,10 +1274,10 @@
|
|
|
1245
1274
|
}
|
|
1246
1275
|
return tmp;
|
|
1247
1276
|
};
|
|
1248
|
-
protoOf(AtomIndex).
|
|
1277
|
+
protoOf(AtomIndex).d1p = function (clause) {
|
|
1249
1278
|
var tmp;
|
|
1250
1279
|
if (nestedFirstArgument(clause, this).lw()) {
|
|
1251
|
-
var tmp0_safe_receiver = this.
|
|
1280
|
+
var tmp0_safe_receiver = this.j1p_1.x2(asInnerAtom(clause, this));
|
|
1252
1281
|
var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : asSequence(tmp0_safe_receiver);
|
|
1253
1282
|
var tmp_0;
|
|
1254
1283
|
if (tmp1_safe_receiver == null) {
|
|
@@ -1259,73 +1288,73 @@
|
|
|
1259
1288
|
var tmp2_elvis_lhs = tmp_0;
|
|
1260
1289
|
tmp = tmp2_elvis_lhs == null ? emptySequence() : tmp2_elvis_lhs;
|
|
1261
1290
|
} else {
|
|
1262
|
-
tmp = this.
|
|
1291
|
+
tmp = this.f1p(clause);
|
|
1263
1292
|
}
|
|
1264
1293
|
return tmp;
|
|
1265
1294
|
};
|
|
1266
|
-
protoOf(AtomIndex).
|
|
1267
|
-
ensureNotNull(this.
|
|
1295
|
+
protoOf(AtomIndex).z1o = function (indexed) {
|
|
1296
|
+
ensureNotNull(this.j1p_1.x2(asInnerAtom_0(indexed, this))).p(indexed);
|
|
1268
1297
|
};
|
|
1269
|
-
protoOf(AtomIndex).
|
|
1298
|
+
protoOf(AtomIndex).e1p = function (clause) {
|
|
1270
1299
|
var tmp;
|
|
1271
1300
|
if (nestedFirstArgument(clause, this).lw()) {
|
|
1272
|
-
var partialIndex = this.
|
|
1273
|
-
tmp = partialIndex == null ? emptySequence() : this.
|
|
1301
|
+
var partialIndex = this.j1p_1.x2(asInnerAtom(clause, this));
|
|
1302
|
+
tmp = partialIndex == null ? emptySequence() : this.l1n(partialIndex, clause);
|
|
1274
1303
|
} else {
|
|
1275
1304
|
var tmp_0 = Utils_instance;
|
|
1276
|
-
var tmp_1 = asSequence(this.
|
|
1277
|
-
tmp = tmp_0.
|
|
1305
|
+
var tmp_1 = asSequence(this.j1p_1.m2());
|
|
1306
|
+
tmp = tmp_0.i1o(map(tmp_1, AtomIndex$retractAllIndexed$lambda(this, clause)));
|
|
1278
1307
|
}
|
|
1279
1308
|
return buffered(tmp);
|
|
1280
1309
|
};
|
|
1281
|
-
protoOf(AtomIndex).
|
|
1310
|
+
protoOf(AtomIndex).o1n = function () {
|
|
1282
1311
|
var tmp = Utils_instance;
|
|
1283
|
-
var tmp_0 = asSequence(this.
|
|
1284
|
-
return tmp.
|
|
1312
|
+
var tmp_0 = asSequence(this.j1p_1.m2());
|
|
1313
|
+
return tmp.i1o(map(tmp_0, AtomIndex$getCache$lambda));
|
|
1285
1314
|
};
|
|
1286
|
-
protoOf(AtomIndex).
|
|
1287
|
-
var tmp = this.
|
|
1315
|
+
protoOf(AtomIndex).f1p = function (clause) {
|
|
1316
|
+
var tmp = this.o1n();
|
|
1288
1317
|
return filter(tmp, AtomIndex$extractGlobalIndexedSequence$lambda(this, clause));
|
|
1289
1318
|
};
|
|
1290
1319
|
function nestedFunctor(_this__u8e3s4, $this) {
|
|
1291
|
-
return Utils_instance.
|
|
1320
|
+
return Utils_instance.e1o(ensureNotNull(_this__u8e3s4.wy()), $this.m1p_1);
|
|
1292
1321
|
}
|
|
1293
1322
|
function nestedFunctor_0(_this__u8e3s4, $this) {
|
|
1294
|
-
return Utils_instance.
|
|
1323
|
+
return Utils_instance.e1o(ensureNotNull(_this__u8e3s4.k1n().wy()), $this.m1p_1);
|
|
1295
1324
|
}
|
|
1296
1325
|
function isGlobal(_this__u8e3s4, $this) {
|
|
1297
|
-
return Utils_instance.
|
|
1326
|
+
return Utils_instance.f1o(ensureNotNull(_this__u8e3s4.wy()), $this.m1p_1).mx();
|
|
1298
1327
|
}
|
|
1299
1328
|
function regenerateCache($this) {
|
|
1300
1329
|
var tmp;
|
|
1301
|
-
if ($this.
|
|
1330
|
+
if ($this.l1p_1) {
|
|
1302
1331
|
var tmp_0 = Utils_instance;
|
|
1303
1332
|
// Inline function 'kotlin.collections.map' call
|
|
1304
|
-
var this_0 = $this.
|
|
1333
|
+
var this_0 = $this.n1p_1.m2();
|
|
1305
1334
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1306
1335
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
1307
1336
|
var tmp0_iterator = this_0.r();
|
|
1308
1337
|
while (tmp0_iterator.s()) {
|
|
1309
1338
|
var item = tmp0_iterator.u();
|
|
1310
1339
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.CompoundIndex.regenerateCache.<anonymous>' call
|
|
1311
|
-
var tmp$ret$0 = item.
|
|
1340
|
+
var tmp$ret$0 = item.o1n();
|
|
1312
1341
|
destination.o(tmp$ret$0);
|
|
1313
1342
|
}
|
|
1314
|
-
tmp = tmp_0.
|
|
1343
|
+
tmp = tmp_0.h1o(destination);
|
|
1315
1344
|
} else {
|
|
1316
1345
|
var tmp_1 = Utils_instance;
|
|
1317
1346
|
// Inline function 'kotlin.collections.map' call
|
|
1318
|
-
var this_1 = $this.
|
|
1347
|
+
var this_1 = $this.n1p_1.m2();
|
|
1319
1348
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1320
1349
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
1321
1350
|
var tmp0_iterator_0 = this_1.r();
|
|
1322
1351
|
while (tmp0_iterator_0.s()) {
|
|
1323
1352
|
var item_0 = tmp0_iterator_0.u();
|
|
1324
1353
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.CompoundIndex.regenerateCache.<anonymous>' call
|
|
1325
|
-
var tmp$ret$3 = item_0.
|
|
1354
|
+
var tmp$ret$3 = item_0.o1n();
|
|
1326
1355
|
destination_0.o(tmp$ret$3);
|
|
1327
1356
|
}
|
|
1328
|
-
tmp = tmp_1.
|
|
1357
|
+
tmp = tmp_1.l1o(destination_0);
|
|
1329
1358
|
}
|
|
1330
1359
|
return dequeOf_0(tmp);
|
|
1331
1360
|
}
|
|
@@ -1341,28 +1370,28 @@
|
|
|
1341
1370
|
}
|
|
1342
1371
|
function CompoundIndex(unificator, ordered, nestingLevel) {
|
|
1343
1372
|
AbstractReteNode.call(this, unificator);
|
|
1344
|
-
this.
|
|
1345
|
-
this.
|
|
1373
|
+
this.l1p_1 = ordered;
|
|
1374
|
+
this.m1p_1 = nestingLevel;
|
|
1346
1375
|
var tmp = this;
|
|
1347
1376
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
1348
|
-
tmp.
|
|
1377
|
+
tmp.n1p_1 = LinkedHashMap_init_$Create$();
|
|
1349
1378
|
var tmp_0 = this;
|
|
1350
1379
|
var tmp_1 = Companion_instance_1;
|
|
1351
|
-
tmp_0.
|
|
1380
|
+
tmp_0.o1p_1 = tmp_1.vq(CompoundIndex$regenerateCache$ref(this));
|
|
1352
1381
|
}
|
|
1353
1382
|
protoOf(CompoundIndex).l = function () {
|
|
1354
|
-
var tmp = asSequence(this.
|
|
1383
|
+
var tmp = asSequence(this.n1p_1.m2());
|
|
1355
1384
|
return sum(map(tmp, CompoundIndex$_get_size_$lambda_91vt0k));
|
|
1356
1385
|
};
|
|
1357
|
-
protoOf(CompoundIndex).
|
|
1386
|
+
protoOf(CompoundIndex).k1l = function () {
|
|
1358
1387
|
var tmp;
|
|
1359
|
-
if (this.
|
|
1388
|
+
if (this.n1p_1.y()) {
|
|
1360
1389
|
tmp = true;
|
|
1361
1390
|
} else {
|
|
1362
1391
|
var tmp$ret$0;
|
|
1363
1392
|
$l$block_0: {
|
|
1364
1393
|
// Inline function 'kotlin.collections.all' call
|
|
1365
|
-
var this_0 = this.
|
|
1394
|
+
var this_0 = this.n1p_1.m2();
|
|
1366
1395
|
var tmp_0;
|
|
1367
1396
|
if (isInterface(this_0, Collection)) {
|
|
1368
1397
|
tmp_0 = this_0.y();
|
|
@@ -1377,7 +1406,7 @@
|
|
|
1377
1406
|
while (tmp0_iterator.s()) {
|
|
1378
1407
|
var element = tmp0_iterator.u();
|
|
1379
1408
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.CompoundIndex.<get-isEmpty>.<anonymous>' call
|
|
1380
|
-
if (!element.
|
|
1409
|
+
if (!element.k1l()) {
|
|
1381
1410
|
tmp$ret$0 = false;
|
|
1382
1411
|
break $l$block_0;
|
|
1383
1412
|
}
|
|
@@ -1388,61 +1417,61 @@
|
|
|
1388
1417
|
}
|
|
1389
1418
|
return tmp;
|
|
1390
1419
|
};
|
|
1391
|
-
protoOf(CompoundIndex).
|
|
1420
|
+
protoOf(CompoundIndex).m1n = function (clause) {
|
|
1392
1421
|
// Inline function 'kotlin.let' call
|
|
1393
1422
|
// Inline function 'kotlin.contracts.contract' call
|
|
1394
1423
|
var it = nestedFunctor_0(clause, this);
|
|
1395
1424
|
var tmp;
|
|
1396
|
-
if (this.
|
|
1425
|
+
if (this.l1p_1) {
|
|
1397
1426
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1398
|
-
var this_0 = this.
|
|
1427
|
+
var this_0 = this.n1p_1;
|
|
1399
1428
|
var value = this_0.x2(it);
|
|
1400
1429
|
var tmp_0;
|
|
1401
1430
|
if (value == null) {
|
|
1402
1431
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.CompoundIndex.assertA.<anonymous>.<anonymous>' call
|
|
1403
|
-
var answer = new FunctorIndexingNode(this.
|
|
1432
|
+
var answer = new FunctorIndexingNode(this.f1l(), this.l1p_1, this.m1p_1);
|
|
1404
1433
|
this_0.n2(it, answer);
|
|
1405
1434
|
tmp_0 = answer;
|
|
1406
1435
|
} else {
|
|
1407
1436
|
tmp_0 = value;
|
|
1408
1437
|
}
|
|
1409
|
-
tmp_0.
|
|
1438
|
+
tmp_0.m1n(clause.s1o(this));
|
|
1410
1439
|
tmp = Unit_instance;
|
|
1411
1440
|
} else {
|
|
1412
|
-
this.
|
|
1441
|
+
this.n1n(clause);
|
|
1413
1442
|
tmp = Unit_instance;
|
|
1414
1443
|
}
|
|
1415
1444
|
return tmp;
|
|
1416
1445
|
};
|
|
1417
|
-
protoOf(CompoundIndex).
|
|
1446
|
+
protoOf(CompoundIndex).n1n = function (clause) {
|
|
1418
1447
|
// Inline function 'kotlin.let' call
|
|
1419
1448
|
// Inline function 'kotlin.contracts.contract' call
|
|
1420
1449
|
var it = nestedFunctor_0(clause, this);
|
|
1421
1450
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1422
|
-
var this_0 = this.
|
|
1451
|
+
var this_0 = this.n1p_1;
|
|
1423
1452
|
var value = this_0.x2(it);
|
|
1424
1453
|
var tmp;
|
|
1425
1454
|
if (value == null) {
|
|
1426
1455
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.CompoundIndex.assertZ.<anonymous>.<anonymous>' call
|
|
1427
|
-
var answer = new FunctorIndexingNode(this.
|
|
1456
|
+
var answer = new FunctorIndexingNode(this.f1l(), this.l1p_1, this.m1p_1);
|
|
1428
1457
|
this_0.n2(it, answer);
|
|
1429
1458
|
tmp = answer;
|
|
1430
1459
|
} else {
|
|
1431
1460
|
tmp = value;
|
|
1432
1461
|
}
|
|
1433
|
-
tmp.
|
|
1462
|
+
tmp.n1n(clause.s1o(this));
|
|
1434
1463
|
return Unit_instance;
|
|
1435
1464
|
};
|
|
1436
|
-
protoOf(CompoundIndex).
|
|
1437
|
-
return asSequence(this.
|
|
1465
|
+
protoOf(CompoundIndex).o1n = function () {
|
|
1466
|
+
return asSequence(this.o1p_1.r2());
|
|
1438
1467
|
};
|
|
1439
|
-
protoOf(CompoundIndex).
|
|
1468
|
+
protoOf(CompoundIndex).c1p = function (clause) {
|
|
1440
1469
|
var tmp;
|
|
1441
1470
|
if (isGlobal(clause, this)) {
|
|
1442
1471
|
var tmp_0 = Utils_instance;
|
|
1443
1472
|
// Inline function 'kotlin.collections.mapNotNull' call
|
|
1444
1473
|
// Inline function 'kotlin.collections.mapNotNullTo' call
|
|
1445
|
-
var this_0 = this.
|
|
1474
|
+
var this_0 = this.n1p_1.m2();
|
|
1446
1475
|
var destination = ArrayList_init_$Create$_0();
|
|
1447
1476
|
// Inline function 'kotlin.collections.forEach' call
|
|
1448
1477
|
var tmp0_iterator = this_0.r();
|
|
@@ -1450,7 +1479,7 @@
|
|
|
1450
1479
|
var element = tmp0_iterator.u();
|
|
1451
1480
|
// Inline function 'kotlin.collections.mapNotNullTo.<anonymous>' call
|
|
1452
1481
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.CompoundIndex.getFirstIndexed.<anonymous>' call
|
|
1453
|
-
var tmp0_safe_receiver = element.
|
|
1482
|
+
var tmp0_safe_receiver = element.c1p(clause);
|
|
1454
1483
|
if (tmp0_safe_receiver == null)
|
|
1455
1484
|
null;
|
|
1456
1485
|
else {
|
|
@@ -1459,134 +1488,134 @@
|
|
|
1459
1488
|
destination.o(tmp0_safe_receiver);
|
|
1460
1489
|
}
|
|
1461
1490
|
}
|
|
1462
|
-
tmp = firstOrNull(tmp_0.
|
|
1491
|
+
tmp = firstOrNull(tmp_0.i1o(sequenceOf([asSequence(destination)])));
|
|
1463
1492
|
} else {
|
|
1464
|
-
var tmp0_safe_receiver_0 = this.
|
|
1465
|
-
tmp = tmp0_safe_receiver_0 == null ? null : tmp0_safe_receiver_0.
|
|
1493
|
+
var tmp0_safe_receiver_0 = this.n1p_1.x2(nestedFunctor(clause, this));
|
|
1494
|
+
tmp = tmp0_safe_receiver_0 == null ? null : tmp0_safe_receiver_0.c1p(clause);
|
|
1466
1495
|
}
|
|
1467
1496
|
return tmp;
|
|
1468
1497
|
};
|
|
1469
|
-
protoOf(CompoundIndex).
|
|
1498
|
+
protoOf(CompoundIndex).d1p = function (clause) {
|
|
1470
1499
|
var tmp;
|
|
1471
1500
|
if (isGlobal(clause, this)) {
|
|
1472
1501
|
var tmp_0 = Utils_instance;
|
|
1473
1502
|
// Inline function 'kotlin.collections.map' call
|
|
1474
|
-
var this_0 = this.
|
|
1503
|
+
var this_0 = this.n1p_1.m2();
|
|
1475
1504
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1476
1505
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
1477
1506
|
var tmp0_iterator = this_0.r();
|
|
1478
1507
|
while (tmp0_iterator.s()) {
|
|
1479
1508
|
var item = tmp0_iterator.u();
|
|
1480
1509
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.CompoundIndex.getIndexed.<anonymous>' call
|
|
1481
|
-
var tmp$ret$0 = item.
|
|
1510
|
+
var tmp$ret$0 = item.f1p(clause);
|
|
1482
1511
|
destination.o(tmp$ret$0);
|
|
1483
1512
|
}
|
|
1484
|
-
tmp = tmp_0.
|
|
1513
|
+
tmp = tmp_0.h1o(destination);
|
|
1485
1514
|
} else {
|
|
1486
|
-
var tmp0_safe_receiver = this.
|
|
1487
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
1515
|
+
var tmp0_safe_receiver = this.n1p_1.x2(nestedFunctor(clause, this));
|
|
1516
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.d1p(clause);
|
|
1488
1517
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
1489
1518
|
}
|
|
1490
1519
|
return tmp;
|
|
1491
1520
|
};
|
|
1492
|
-
protoOf(CompoundIndex).
|
|
1521
|
+
protoOf(CompoundIndex).e1p = function (clause) {
|
|
1493
1522
|
var tmp;
|
|
1494
1523
|
if (isGlobal(clause, this)) {
|
|
1495
1524
|
var tmp_0 = Utils_instance;
|
|
1496
1525
|
// Inline function 'kotlin.collections.map' call
|
|
1497
|
-
var this_0 = this.
|
|
1526
|
+
var this_0 = this.n1p_1.m2();
|
|
1498
1527
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1499
1528
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
1500
1529
|
var tmp0_iterator = this_0.r();
|
|
1501
1530
|
while (tmp0_iterator.s()) {
|
|
1502
1531
|
var item = tmp0_iterator.u();
|
|
1503
1532
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.CompoundIndex.retractAllIndexed.<anonymous>' call
|
|
1504
|
-
var tmp$ret$0 = item.
|
|
1533
|
+
var tmp$ret$0 = item.e1p(clause);
|
|
1505
1534
|
destination.o(tmp$ret$0);
|
|
1506
1535
|
}
|
|
1507
|
-
tmp = tmp_0.
|
|
1536
|
+
tmp = tmp_0.h1o(destination);
|
|
1508
1537
|
} else {
|
|
1509
|
-
var tmp0_safe_receiver = this.
|
|
1510
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
1538
|
+
var tmp0_safe_receiver = this.n1p_1.x2(nestedFunctor(clause, this));
|
|
1539
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.e1p(clause);
|
|
1511
1540
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
1512
1541
|
}
|
|
1513
1542
|
return tmp;
|
|
1514
1543
|
};
|
|
1515
|
-
protoOf(CompoundIndex).
|
|
1544
|
+
protoOf(CompoundIndex).f1p = function (clause) {
|
|
1516
1545
|
var tmp;
|
|
1517
|
-
if (this.
|
|
1546
|
+
if (this.l1p_1) {
|
|
1518
1547
|
var tmp_0 = Utils_instance;
|
|
1519
1548
|
// Inline function 'kotlin.collections.map' call
|
|
1520
|
-
var this_0 = this.
|
|
1549
|
+
var this_0 = this.n1p_1.m2();
|
|
1521
1550
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1522
1551
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
1523
1552
|
var tmp0_iterator = this_0.r();
|
|
1524
1553
|
while (tmp0_iterator.s()) {
|
|
1525
1554
|
var item = tmp0_iterator.u();
|
|
1526
1555
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.CompoundIndex.extractGlobalIndexedSequence.<anonymous>' call
|
|
1527
|
-
var tmp$ret$0 = item.
|
|
1556
|
+
var tmp$ret$0 = item.f1p(clause);
|
|
1528
1557
|
destination.o(tmp$ret$0);
|
|
1529
1558
|
}
|
|
1530
|
-
tmp = tmp_0.
|
|
1559
|
+
tmp = tmp_0.h1o(destination);
|
|
1531
1560
|
} else {
|
|
1532
1561
|
var tmp_1 = Utils_instance;
|
|
1533
1562
|
// Inline function 'kotlin.collections.map' call
|
|
1534
|
-
var this_1 = this.
|
|
1563
|
+
var this_1 = this.n1p_1.m2();
|
|
1535
1564
|
// Inline function 'kotlin.collections.mapTo' call
|
|
1536
1565
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
1537
1566
|
var tmp0_iterator_0 = this_1.r();
|
|
1538
1567
|
while (tmp0_iterator_0.s()) {
|
|
1539
1568
|
var item_0 = tmp0_iterator_0.u();
|
|
1540
1569
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.CompoundIndex.extractGlobalIndexedSequence.<anonymous>' call
|
|
1541
|
-
var tmp$ret$3 = item_0.
|
|
1570
|
+
var tmp$ret$3 = item_0.f1p(clause);
|
|
1542
1571
|
destination_0.o(tmp$ret$3);
|
|
1543
1572
|
}
|
|
1544
|
-
tmp = tmp_1.
|
|
1573
|
+
tmp = tmp_1.l1o(destination_0);
|
|
1545
1574
|
}
|
|
1546
1575
|
return tmp;
|
|
1547
1576
|
};
|
|
1548
|
-
protoOf(CompoundIndex).
|
|
1549
|
-
this.
|
|
1577
|
+
protoOf(CompoundIndex).p1n = function () {
|
|
1578
|
+
this.o1p_1.xq();
|
|
1550
1579
|
};
|
|
1551
1580
|
function DirectiveIndex$retractFirst$lambda(it) {
|
|
1552
|
-
return it.
|
|
1581
|
+
return it.k1n();
|
|
1553
1582
|
}
|
|
1554
1583
|
function DirectiveIndex$retractAll$lambda(it) {
|
|
1555
|
-
return it.
|
|
1584
|
+
return it.k1n();
|
|
1556
1585
|
}
|
|
1557
1586
|
function DirectiveIndex$getCache$lambda(it) {
|
|
1558
1587
|
var tmp = Companion_instance_8;
|
|
1559
|
-
return tmp.
|
|
1588
|
+
return tmp.a1p(it, new DirectiveIndex$getCache$1$1());
|
|
1560
1589
|
}
|
|
1561
1590
|
function DirectiveIndex$getCache$1$1() {
|
|
1562
1591
|
}
|
|
1563
|
-
protoOf(DirectiveIndex$getCache$1$1).
|
|
1592
|
+
protoOf(DirectiveIndex$getCache$1$1).z1o = function (indexed) {
|
|
1564
1593
|
// Inline function 'kotlin.TODO' call
|
|
1565
1594
|
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';
|
|
1566
1595
|
throw new NotImplementedError('An operation is not implemented: ' + reason);
|
|
1567
1596
|
};
|
|
1568
1597
|
function DirectiveIndex(unificator, ordered) {
|
|
1569
1598
|
AbstractReteNode.call(this, unificator);
|
|
1570
|
-
this.
|
|
1571
|
-
this.
|
|
1599
|
+
this.q1p_1 = ordered;
|
|
1600
|
+
this.r1p_1 = dequeOf([]);
|
|
1572
1601
|
}
|
|
1573
1602
|
protoOf(DirectiveIndex).l = function () {
|
|
1574
|
-
return this.
|
|
1603
|
+
return this.r1p_1.l();
|
|
1575
1604
|
};
|
|
1576
|
-
protoOf(DirectiveIndex).
|
|
1577
|
-
return this.
|
|
1605
|
+
protoOf(DirectiveIndex).k1l = function () {
|
|
1606
|
+
return this.r1p_1.y();
|
|
1578
1607
|
};
|
|
1579
|
-
protoOf(DirectiveIndex).
|
|
1608
|
+
protoOf(DirectiveIndex).n1l = function (clause) {
|
|
1580
1609
|
// Inline function 'kotlin.collections.map' call
|
|
1581
1610
|
// Inline function 'kotlin.collections.filter' call
|
|
1582
1611
|
// Inline function 'kotlin.collections.filterTo' call
|
|
1583
|
-
var this_0 = this.
|
|
1612
|
+
var this_0 = this.r1p_1;
|
|
1584
1613
|
var destination = ArrayList_init_$Create$_0();
|
|
1585
1614
|
var tmp0_iterator = this_0.r();
|
|
1586
1615
|
while (tmp0_iterator.s()) {
|
|
1587
1616
|
var element = tmp0_iterator.u();
|
|
1588
1617
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.DirectiveIndex.get.<anonymous>' call
|
|
1589
|
-
if (this.
|
|
1618
|
+
if (this.f1l().match(element.k1n(), clause)) {
|
|
1590
1619
|
destination.o(element);
|
|
1591
1620
|
}
|
|
1592
1621
|
}
|
|
@@ -1596,39 +1625,39 @@
|
|
|
1596
1625
|
while (tmp0_iterator_0.s()) {
|
|
1597
1626
|
var item = tmp0_iterator_0.u();
|
|
1598
1627
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.DirectiveIndex.get.<anonymous>' call
|
|
1599
|
-
var tmp$ret$3 = item.
|
|
1628
|
+
var tmp$ret$3 = item.k1n();
|
|
1600
1629
|
destination_0.o(tmp$ret$3);
|
|
1601
1630
|
}
|
|
1602
1631
|
return asSequence(destination_0);
|
|
1603
1632
|
};
|
|
1604
|
-
protoOf(DirectiveIndex).
|
|
1605
|
-
if (this.
|
|
1606
|
-
addFirst(this.
|
|
1633
|
+
protoOf(DirectiveIndex).m1n = function (clause) {
|
|
1634
|
+
if (this.q1p_1) {
|
|
1635
|
+
addFirst(this.r1p_1, clause.s1o(this));
|
|
1607
1636
|
} else {
|
|
1608
|
-
this.
|
|
1637
|
+
this.n1n(clause);
|
|
1609
1638
|
}
|
|
1610
1639
|
};
|
|
1611
|
-
protoOf(DirectiveIndex).
|
|
1612
|
-
this.
|
|
1640
|
+
protoOf(DirectiveIndex).n1n = function (clause) {
|
|
1641
|
+
this.r1p_1.o(clause.s1o(this));
|
|
1613
1642
|
};
|
|
1614
|
-
protoOf(DirectiveIndex).
|
|
1615
|
-
var tmp = this.
|
|
1643
|
+
protoOf(DirectiveIndex).v1l = function (clause) {
|
|
1644
|
+
var tmp = this.l1n(this.r1p_1, clause);
|
|
1616
1645
|
return buffered(take(map(tmp, DirectiveIndex$retractFirst$lambda), 1));
|
|
1617
1646
|
};
|
|
1618
|
-
protoOf(DirectiveIndex).
|
|
1619
|
-
var tmp = this.
|
|
1647
|
+
protoOf(DirectiveIndex).x1l = function (clause) {
|
|
1648
|
+
var tmp = this.l1n(this.r1p_1, clause);
|
|
1620
1649
|
return buffered(map(tmp, DirectiveIndex$retractAll$lambda));
|
|
1621
1650
|
};
|
|
1622
|
-
protoOf(DirectiveIndex).
|
|
1623
|
-
var tmp = asSequence(this.
|
|
1651
|
+
protoOf(DirectiveIndex).o1n = function () {
|
|
1652
|
+
var tmp = asSequence(this.r1p_1);
|
|
1624
1653
|
return map(tmp, DirectiveIndex$getCache$lambda);
|
|
1625
1654
|
};
|
|
1626
|
-
protoOf(DirectiveIndex).
|
|
1655
|
+
protoOf(DirectiveIndex).p1n = function () {
|
|
1627
1656
|
};
|
|
1628
1657
|
function extractFirst_1($this, clause) {
|
|
1629
1658
|
// Inline function 'kotlin.collections.mapNotNull' call
|
|
1630
1659
|
// Inline function 'kotlin.collections.mapNotNullTo' call
|
|
1631
|
-
var this_0 = $this.
|
|
1660
|
+
var this_0 = $this.v1p_1.m2();
|
|
1632
1661
|
var destination = ArrayList_init_$Create$_0();
|
|
1633
1662
|
// Inline function 'kotlin.collections.forEach' call
|
|
1634
1663
|
var tmp0_iterator = this_0.r();
|
|
@@ -1656,7 +1685,7 @@
|
|
|
1656
1685
|
while (tmp0_iterator.s()) {
|
|
1657
1686
|
var item = tmp0_iterator.u();
|
|
1658
1687
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.NumericIndex.extractFirst.<anonymous>' call
|
|
1659
|
-
if ($this.
|
|
1688
|
+
if ($this.f1l().match(item.k1n(), clause)) {
|
|
1660
1689
|
tmp$ret$1 = index_0;
|
|
1661
1690
|
break $l$block;
|
|
1662
1691
|
}
|
|
@@ -1674,28 +1703,28 @@
|
|
|
1674
1703
|
return tmp;
|
|
1675
1704
|
}
|
|
1676
1705
|
function nestedFirstArgument_0(_this__u8e3s4, $this) {
|
|
1677
|
-
return Utils_instance.
|
|
1706
|
+
return Utils_instance.f1o(ensureNotNull(_this__u8e3s4.wy()), $this.u1p_1 + 1 | 0);
|
|
1678
1707
|
}
|
|
1679
1708
|
function asInnerNumeric(_this__u8e3s4, $this) {
|
|
1680
1709
|
return nestedFirstArgument_0(_this__u8e3s4, $this).castToNumeric();
|
|
1681
1710
|
}
|
|
1682
1711
|
function asInnerNumeric_0(_this__u8e3s4, $this) {
|
|
1683
|
-
return nestedFirstArgument_0(_this__u8e3s4.
|
|
1712
|
+
return nestedFirstArgument_0(_this__u8e3s4.k1n(), $this).castToNumeric();
|
|
1684
1713
|
}
|
|
1685
1714
|
function asInnerNumeric_1(_this__u8e3s4, $this) {
|
|
1686
|
-
return nestedFirstArgument_0(_this__u8e3s4.
|
|
1715
|
+
return nestedFirstArgument_0(_this__u8e3s4.k1n(), $this).castToNumeric();
|
|
1687
1716
|
}
|
|
1688
1717
|
function NumericIndex$_get_size_$lambda_exo30i(it) {
|
|
1689
1718
|
return it.l();
|
|
1690
1719
|
}
|
|
1691
1720
|
function NumericIndex$getIndexed$lambda(this$0, $clause) {
|
|
1692
1721
|
return function (it) {
|
|
1693
|
-
return this$0.
|
|
1722
|
+
return this$0.f1l().match(it.k1n(), $clause);
|
|
1694
1723
|
};
|
|
1695
1724
|
}
|
|
1696
1725
|
function NumericIndex$retractAllIndexed$lambda(this$0, $clause) {
|
|
1697
1726
|
return function (it) {
|
|
1698
|
-
return this$0.
|
|
1727
|
+
return this$0.l1n(it, $clause);
|
|
1699
1728
|
};
|
|
1700
1729
|
}
|
|
1701
1730
|
function NumericIndex$getCache$lambda(it) {
|
|
@@ -1703,30 +1732,30 @@
|
|
|
1703
1732
|
}
|
|
1704
1733
|
function NumericIndex$extractGlobalIndexedSequence$lambda(this$0, $clause) {
|
|
1705
1734
|
return function (it) {
|
|
1706
|
-
return this$0.
|
|
1735
|
+
return this$0.f1l().match(it.k1n(), $clause);
|
|
1707
1736
|
};
|
|
1708
1737
|
}
|
|
1709
1738
|
function NumericIndex(unificator, ordered, nestingLevel) {
|
|
1710
1739
|
AbstractIndexingLeaf.call(this, unificator);
|
|
1711
|
-
this.
|
|
1712
|
-
this.
|
|
1740
|
+
this.t1p_1 = ordered;
|
|
1741
|
+
this.u1p_1 = nestingLevel;
|
|
1713
1742
|
var tmp = this;
|
|
1714
1743
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
1715
|
-
tmp.
|
|
1744
|
+
tmp.v1p_1 = LinkedHashMap_init_$Create$();
|
|
1716
1745
|
}
|
|
1717
1746
|
protoOf(NumericIndex).l = function () {
|
|
1718
|
-
var tmp = asSequence(this.
|
|
1747
|
+
var tmp = asSequence(this.v1p_1.m2());
|
|
1719
1748
|
return sum(map(tmp, NumericIndex$_get_size_$lambda_exo30i));
|
|
1720
1749
|
};
|
|
1721
|
-
protoOf(NumericIndex).
|
|
1750
|
+
protoOf(NumericIndex).k1l = function () {
|
|
1722
1751
|
var tmp;
|
|
1723
|
-
if (this.
|
|
1752
|
+
if (this.v1p_1.y()) {
|
|
1724
1753
|
tmp = true;
|
|
1725
1754
|
} else {
|
|
1726
1755
|
var tmp$ret$0;
|
|
1727
1756
|
$l$block_0: {
|
|
1728
1757
|
// Inline function 'kotlin.collections.all' call
|
|
1729
|
-
var this_0 = this.
|
|
1758
|
+
var this_0 = this.v1p_1.m2();
|
|
1730
1759
|
var tmp_0;
|
|
1731
1760
|
if (isInterface(this_0, Collection)) {
|
|
1732
1761
|
tmp_0 = this_0.y();
|
|
@@ -1752,13 +1781,13 @@
|
|
|
1752
1781
|
}
|
|
1753
1782
|
return tmp;
|
|
1754
1783
|
};
|
|
1755
|
-
protoOf(NumericIndex).
|
|
1756
|
-
if (this.
|
|
1784
|
+
protoOf(NumericIndex).m1n = function (clause) {
|
|
1785
|
+
if (this.t1p_1) {
|
|
1757
1786
|
// Inline function 'kotlin.let' call
|
|
1758
1787
|
// Inline function 'kotlin.contracts.contract' call
|
|
1759
1788
|
var it = asInnerNumeric_1(clause, this);
|
|
1760
1789
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1761
|
-
var this_0 = this.
|
|
1790
|
+
var this_0 = this.v1p_1;
|
|
1762
1791
|
var value = this_0.x2(it);
|
|
1763
1792
|
var tmp;
|
|
1764
1793
|
if (value == null) {
|
|
@@ -1770,18 +1799,18 @@
|
|
|
1770
1799
|
tmp = value;
|
|
1771
1800
|
}
|
|
1772
1801
|
var tmp$ret$1 = tmp;
|
|
1773
|
-
addFirst(tmp$ret$1, Companion_instance_8.
|
|
1802
|
+
addFirst(tmp$ret$1, Companion_instance_8.a1p(clause.s1o(this), this));
|
|
1774
1803
|
} else {
|
|
1775
|
-
this.
|
|
1804
|
+
this.n1n(clause);
|
|
1776
1805
|
}
|
|
1777
1806
|
};
|
|
1778
|
-
protoOf(NumericIndex).
|
|
1807
|
+
protoOf(NumericIndex).n1n = function (clause) {
|
|
1779
1808
|
// Inline function 'kotlin.let' call
|
|
1780
1809
|
// Inline function 'kotlin.contracts.contract' call
|
|
1781
1810
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.NumericIndex.assertZ.<anonymous>' call
|
|
1782
1811
|
var it = asInnerNumeric_1(clause, this);
|
|
1783
1812
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
1784
|
-
var this_0 = this.
|
|
1813
|
+
var this_0 = this.v1p_1;
|
|
1785
1814
|
var value = this_0.x2(it);
|
|
1786
1815
|
var tmp;
|
|
1787
1816
|
if (value == null) {
|
|
@@ -1792,13 +1821,13 @@
|
|
|
1792
1821
|
} else {
|
|
1793
1822
|
tmp = value;
|
|
1794
1823
|
}
|
|
1795
|
-
tmp.o(Companion_instance_8.
|
|
1824
|
+
tmp.o(Companion_instance_8.a1p(clause.s1o(this), this));
|
|
1796
1825
|
};
|
|
1797
|
-
protoOf(NumericIndex).
|
|
1826
|
+
protoOf(NumericIndex).c1p = function (clause) {
|
|
1798
1827
|
if (nestedFirstArgument_0(clause, this).qx()) {
|
|
1799
1828
|
// Inline function 'kotlin.let' call
|
|
1800
1829
|
// Inline function 'kotlin.contracts.contract' call
|
|
1801
|
-
var it = this.
|
|
1830
|
+
var it = this.v1p_1.x2(asInnerNumeric(clause, this));
|
|
1802
1831
|
var tmp;
|
|
1803
1832
|
if (it == null) {
|
|
1804
1833
|
tmp = null;
|
|
@@ -1810,10 +1839,10 @@
|
|
|
1810
1839
|
return extractFirst_1(this, clause);
|
|
1811
1840
|
}
|
|
1812
1841
|
};
|
|
1813
|
-
protoOf(NumericIndex).
|
|
1842
|
+
protoOf(NumericIndex).d1p = function (clause) {
|
|
1814
1843
|
var tmp;
|
|
1815
1844
|
if (nestedFirstArgument_0(clause, this).qx()) {
|
|
1816
|
-
var tmp0_safe_receiver = this.
|
|
1845
|
+
var tmp0_safe_receiver = this.v1p_1.x2(asInnerNumeric(clause, this));
|
|
1817
1846
|
var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : asSequence(tmp0_safe_receiver);
|
|
1818
1847
|
var tmp_0;
|
|
1819
1848
|
if (tmp1_safe_receiver == null) {
|
|
@@ -1824,32 +1853,32 @@
|
|
|
1824
1853
|
var tmp2_elvis_lhs = tmp_0;
|
|
1825
1854
|
tmp = tmp2_elvis_lhs == null ? emptySequence() : tmp2_elvis_lhs;
|
|
1826
1855
|
} else {
|
|
1827
|
-
tmp = this.
|
|
1856
|
+
tmp = this.f1p(clause);
|
|
1828
1857
|
}
|
|
1829
1858
|
return tmp;
|
|
1830
1859
|
};
|
|
1831
|
-
protoOf(NumericIndex).
|
|
1832
|
-
ensureNotNull(this.
|
|
1860
|
+
protoOf(NumericIndex).z1o = function (indexed) {
|
|
1861
|
+
ensureNotNull(this.v1p_1.x2(asInnerNumeric_0(indexed, this))).p(indexed);
|
|
1833
1862
|
};
|
|
1834
|
-
protoOf(NumericIndex).
|
|
1863
|
+
protoOf(NumericIndex).e1p = function (clause) {
|
|
1835
1864
|
var tmp;
|
|
1836
1865
|
if (nestedFirstArgument_0(clause, this).qx()) {
|
|
1837
|
-
var partialIndex = this.
|
|
1838
|
-
tmp = partialIndex == null ? emptySequence() : buffered(this.
|
|
1866
|
+
var partialIndex = this.v1p_1.x2(asInnerNumeric(clause, this));
|
|
1867
|
+
tmp = partialIndex == null ? emptySequence() : buffered(this.l1n(partialIndex, clause));
|
|
1839
1868
|
} else {
|
|
1840
1869
|
var tmp_0 = Utils_instance;
|
|
1841
|
-
var tmp_1 = asSequence(this.
|
|
1842
|
-
tmp = buffered(tmp_0.
|
|
1870
|
+
var tmp_1 = asSequence(this.v1p_1.m2());
|
|
1871
|
+
tmp = buffered(tmp_0.i1o(map(tmp_1, NumericIndex$retractAllIndexed$lambda(this, clause))));
|
|
1843
1872
|
}
|
|
1844
1873
|
return tmp;
|
|
1845
1874
|
};
|
|
1846
|
-
protoOf(NumericIndex).
|
|
1875
|
+
protoOf(NumericIndex).o1n = function () {
|
|
1847
1876
|
var tmp = Utils_instance;
|
|
1848
|
-
var tmp_0 = asSequence(this.
|
|
1849
|
-
return tmp.
|
|
1877
|
+
var tmp_0 = asSequence(this.v1p_1.m2());
|
|
1878
|
+
return tmp.i1o(map(tmp_0, NumericIndex$getCache$lambda));
|
|
1850
1879
|
};
|
|
1851
|
-
protoOf(NumericIndex).
|
|
1852
|
-
var tmp = this.
|
|
1880
|
+
protoOf(NumericIndex).f1p = function (clause) {
|
|
1881
|
+
var tmp = this.o1n();
|
|
1853
1882
|
return filter(tmp, NumericIndex$extractGlobalIndexedSequence$lambda(this, clause));
|
|
1854
1883
|
};
|
|
1855
1884
|
function extractFirst_3($this, clause, index) {
|
|
@@ -1861,7 +1890,7 @@
|
|
|
1861
1890
|
while (tmp0_iterator.s()) {
|
|
1862
1891
|
var item = tmp0_iterator.u();
|
|
1863
1892
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.leaf.VariableIndex.extractFirst.<anonymous>' call
|
|
1864
|
-
if ($this.
|
|
1893
|
+
if ($this.f1l().match(item.k1n(), clause)) {
|
|
1865
1894
|
tmp$ret$1 = index_0;
|
|
1866
1895
|
break $l$block;
|
|
1867
1896
|
}
|
|
@@ -1880,51 +1909,51 @@
|
|
|
1880
1909
|
}
|
|
1881
1910
|
function VariableIndex$extractGlobalIndexedSequence$lambda(this$0, $clause) {
|
|
1882
1911
|
return function (it) {
|
|
1883
|
-
return this$0.
|
|
1912
|
+
return this$0.f1l().match(it.k1n(), $clause);
|
|
1884
1913
|
};
|
|
1885
1914
|
}
|
|
1886
1915
|
function VariableIndex(unificator, ordered) {
|
|
1887
1916
|
AbstractIndexingLeaf.call(this, unificator);
|
|
1888
|
-
this.
|
|
1889
|
-
this.
|
|
1917
|
+
this.x1p_1 = ordered;
|
|
1918
|
+
this.y1p_1 = dequeOf([]);
|
|
1890
1919
|
}
|
|
1891
1920
|
protoOf(VariableIndex).l = function () {
|
|
1892
|
-
return this.
|
|
1921
|
+
return this.y1p_1.l();
|
|
1893
1922
|
};
|
|
1894
|
-
protoOf(VariableIndex).
|
|
1895
|
-
return this.
|
|
1923
|
+
protoOf(VariableIndex).k1l = function () {
|
|
1924
|
+
return this.y1p_1.y();
|
|
1896
1925
|
};
|
|
1897
|
-
protoOf(VariableIndex).
|
|
1926
|
+
protoOf(VariableIndex).m1n = function (clause) {
|
|
1898
1927
|
var tmp;
|
|
1899
|
-
if (this.
|
|
1900
|
-
addFirst(this.
|
|
1928
|
+
if (this.x1p_1) {
|
|
1929
|
+
addFirst(this.y1p_1, Companion_instance_8.a1p(clause.s1o(this), this));
|
|
1901
1930
|
tmp = Unit_instance;
|
|
1902
1931
|
} else {
|
|
1903
|
-
this.
|
|
1932
|
+
this.n1n(clause);
|
|
1904
1933
|
tmp = Unit_instance;
|
|
1905
1934
|
}
|
|
1906
1935
|
return tmp;
|
|
1907
1936
|
};
|
|
1908
|
-
protoOf(VariableIndex).
|
|
1909
|
-
this.
|
|
1937
|
+
protoOf(VariableIndex).n1n = function (clause) {
|
|
1938
|
+
this.y1p_1.o(Companion_instance_8.a1p(clause.s1o(this), this));
|
|
1910
1939
|
};
|
|
1911
|
-
protoOf(VariableIndex).
|
|
1912
|
-
return asSequence(this.
|
|
1940
|
+
protoOf(VariableIndex).o1n = function () {
|
|
1941
|
+
return asSequence(this.y1p_1);
|
|
1913
1942
|
};
|
|
1914
|
-
protoOf(VariableIndex).
|
|
1915
|
-
return extractFirst_3(this, clause, this.
|
|
1943
|
+
protoOf(VariableIndex).c1p = function (clause) {
|
|
1944
|
+
return extractFirst_3(this, clause, this.y1p_1);
|
|
1916
1945
|
};
|
|
1917
|
-
protoOf(VariableIndex).
|
|
1918
|
-
return this.
|
|
1946
|
+
protoOf(VariableIndex).d1p = function (clause) {
|
|
1947
|
+
return this.f1p(clause);
|
|
1919
1948
|
};
|
|
1920
|
-
protoOf(VariableIndex).
|
|
1921
|
-
this.
|
|
1949
|
+
protoOf(VariableIndex).z1o = function (indexed) {
|
|
1950
|
+
this.y1p_1.p(indexed);
|
|
1922
1951
|
};
|
|
1923
|
-
protoOf(VariableIndex).
|
|
1924
|
-
return buffered(this.
|
|
1952
|
+
protoOf(VariableIndex).e1p = function (clause) {
|
|
1953
|
+
return buffered(this.l1n(this.y1p_1, clause));
|
|
1925
1954
|
};
|
|
1926
|
-
protoOf(VariableIndex).
|
|
1927
|
-
var tmp = asSequence(this.
|
|
1955
|
+
protoOf(VariableIndex).f1p = function (clause) {
|
|
1956
|
+
var tmp = asSequence(this.y1p_1);
|
|
1928
1957
|
return filter(tmp, VariableIndex$extractGlobalIndexedSequence$lambda(this, clause));
|
|
1929
1958
|
};
|
|
1930
1959
|
function ArityNode(unificator) {
|
|
@@ -1932,78 +1961,78 @@
|
|
|
1932
1961
|
}
|
|
1933
1962
|
function FamilyArityIndexingNode(unificator, ordered, nestingLevel) {
|
|
1934
1963
|
FamilyArityReteNode.call(this, unificator, ordered, nestingLevel);
|
|
1935
|
-
this.
|
|
1964
|
+
this.h1q_1 = ordered;
|
|
1936
1965
|
}
|
|
1937
|
-
protoOf(FamilyArityIndexingNode).
|
|
1966
|
+
protoOf(FamilyArityIndexingNode).c1p = function (clause) {
|
|
1938
1967
|
var tmp;
|
|
1939
|
-
if (this.
|
|
1940
|
-
tmp = this.
|
|
1968
|
+
if (this.h1q_1) {
|
|
1969
|
+
tmp = this.r1q(clause);
|
|
1941
1970
|
} else {
|
|
1942
|
-
tmp = this.
|
|
1971
|
+
tmp = this.q1q(clause);
|
|
1943
1972
|
}
|
|
1944
1973
|
return tmp;
|
|
1945
1974
|
};
|
|
1946
|
-
protoOf(FamilyArityIndexingNode).
|
|
1975
|
+
protoOf(FamilyArityIndexingNode).d1p = function (clause) {
|
|
1947
1976
|
var tmp;
|
|
1948
|
-
if (this.
|
|
1949
|
-
tmp = this.
|
|
1977
|
+
if (this.h1q_1) {
|
|
1978
|
+
tmp = this.t1q(clause);
|
|
1950
1979
|
} else {
|
|
1951
|
-
tmp = this.
|
|
1980
|
+
tmp = this.s1q(clause);
|
|
1952
1981
|
}
|
|
1953
1982
|
return tmp;
|
|
1954
1983
|
};
|
|
1955
|
-
protoOf(FamilyArityIndexingNode).
|
|
1984
|
+
protoOf(FamilyArityIndexingNode).e1p = function (clause) {
|
|
1956
1985
|
var tmp;
|
|
1957
|
-
if (this.
|
|
1958
|
-
tmp = this.
|
|
1986
|
+
if (this.h1q_1) {
|
|
1987
|
+
tmp = this.v1q(clause);
|
|
1959
1988
|
} else {
|
|
1960
|
-
tmp = this.
|
|
1989
|
+
tmp = this.u1q(clause);
|
|
1961
1990
|
}
|
|
1962
1991
|
return tmp;
|
|
1963
1992
|
};
|
|
1964
|
-
protoOf(FamilyArityIndexingNode).
|
|
1993
|
+
protoOf(FamilyArityIndexingNode).f1p = function (clause) {
|
|
1965
1994
|
var tmp;
|
|
1966
|
-
if (this.
|
|
1967
|
-
tmp = Utils_instance.
|
|
1995
|
+
if (this.h1q_1) {
|
|
1996
|
+
tmp = Utils_instance.g1o([this.m1q_1.f1p(clause), this.l1q_1.f1p(clause), this.n1q_1.f1p(clause), this.o1q_1.f1p(clause)]);
|
|
1968
1997
|
} else {
|
|
1969
|
-
tmp = Utils_instance.
|
|
1998
|
+
tmp = Utils_instance.j1o([this.m1q_1.f1p(clause), this.l1q_1.f1p(clause), this.n1q_1.f1p(clause), this.o1q_1.f1p(clause)]);
|
|
1970
1999
|
}
|
|
1971
2000
|
return tmp;
|
|
1972
2001
|
};
|
|
1973
2002
|
function retractAllOrdered($this, clause) {
|
|
1974
|
-
var tmp = $this.
|
|
2003
|
+
var tmp = $this.v1q(clause);
|
|
1975
2004
|
return map(tmp, FamilyArityReteNode$retractAllOrdered$lambda);
|
|
1976
2005
|
}
|
|
1977
2006
|
function getOrdered($this, clause) {
|
|
1978
|
-
var tmp = $this.
|
|
2007
|
+
var tmp = $this.t1q(clause);
|
|
1979
2008
|
return map(tmp, FamilyArityReteNode$getOrdered$lambda);
|
|
1980
2009
|
}
|
|
1981
2010
|
function retractAllUnordered($this, clause) {
|
|
1982
|
-
var tmp = $this.
|
|
2011
|
+
var tmp = $this.u1q(clause);
|
|
1983
2012
|
return map(tmp, FamilyArityReteNode$retractAllUnordered$lambda);
|
|
1984
2013
|
}
|
|
1985
2014
|
function getUnordered($this, clause) {
|
|
1986
|
-
var tmp = $this.
|
|
2015
|
+
var tmp = $this.s1q(clause);
|
|
1987
2016
|
return map(tmp, FamilyArityReteNode$getUnordered$lambda);
|
|
1988
2017
|
}
|
|
1989
2018
|
function regenerateCache_0($this) {
|
|
1990
2019
|
var tmp;
|
|
1991
|
-
if ($this.
|
|
1992
|
-
tmp = Utils_instance.
|
|
2020
|
+
if ($this.j1q_1) {
|
|
2021
|
+
tmp = Utils_instance.g1o([$this.m1q_1.o1n(), $this.l1q_1.o1n(), $this.n1q_1.o1n(), $this.o1q_1.o1n()]);
|
|
1993
2022
|
} else {
|
|
1994
|
-
tmp = Utils_instance.
|
|
2023
|
+
tmp = Utils_instance.j1o([$this.m1q_1.o1n(), $this.l1q_1.o1n(), $this.n1q_1.o1n(), $this.o1q_1.o1n()]);
|
|
1995
2024
|
}
|
|
1996
2025
|
return dequeOf_0(tmp);
|
|
1997
2026
|
}
|
|
1998
2027
|
function nestedFirstArgument_1(_this__u8e3s4, $this) {
|
|
1999
|
-
return Utils_instance.
|
|
2028
|
+
return Utils_instance.f1o(ensureNotNull(_this__u8e3s4.wy()), $this.k1q_1 + 1 | 0);
|
|
2000
2029
|
}
|
|
2001
2030
|
function assertByFirstParameter($this, clause) {
|
|
2002
|
-
var innerFirst = nestedFirstArgument_1(clause.
|
|
2003
|
-
return innerFirst.qx() ? $this.
|
|
2031
|
+
var innerFirst = nestedFirstArgument_1(clause.k1n(), $this);
|
|
2032
|
+
return innerFirst.qx() ? $this.l1q_1 : innerFirst.lw() ? $this.m1q_1 : innerFirst.mx() ? $this.n1q_1 : $this.o1q_1;
|
|
2004
2033
|
}
|
|
2005
2034
|
function isGlobal_0(_this__u8e3s4, $this) {
|
|
2006
|
-
return Utils_instance.
|
|
2035
|
+
return Utils_instance.f1o(ensureNotNull(_this__u8e3s4.wy()), $this.k1q_1 + 1 | 0).mx();
|
|
2007
2036
|
}
|
|
2008
2037
|
function FamilyArityReteNode$regenerateCache$ref($boundThis) {
|
|
2009
2038
|
var l = function () {
|
|
@@ -2016,66 +2045,66 @@
|
|
|
2016
2045
|
return it.l();
|
|
2017
2046
|
}
|
|
2018
2047
|
function FamilyArityReteNode$get$lambda(it) {
|
|
2019
|
-
return it.
|
|
2048
|
+
return it.k1n();
|
|
2020
2049
|
}
|
|
2021
2050
|
function FamilyArityReteNode$get$lambda_0(it) {
|
|
2022
|
-
return it.
|
|
2051
|
+
return it.k1n();
|
|
2023
2052
|
}
|
|
2024
2053
|
function FamilyArityReteNode$retractAllOrdered$lambda(it) {
|
|
2025
|
-
return it.
|
|
2054
|
+
return it.k1n();
|
|
2026
2055
|
}
|
|
2027
2056
|
function FamilyArityReteNode$getOrdered$lambda(it) {
|
|
2028
|
-
return it.
|
|
2057
|
+
return it.k1n();
|
|
2029
2058
|
}
|
|
2030
2059
|
function FamilyArityReteNode$retractAllUnordered$lambda(it) {
|
|
2031
|
-
return it.
|
|
2060
|
+
return it.k1n();
|
|
2032
2061
|
}
|
|
2033
2062
|
function FamilyArityReteNode$getUnordered$lambda(it) {
|
|
2034
|
-
return it.
|
|
2063
|
+
return it.k1n();
|
|
2035
2064
|
}
|
|
2036
2065
|
function FamilyArityReteNode(unificator, ordered, nestingLevel) {
|
|
2037
2066
|
ArityNode.call(this, unificator);
|
|
2038
|
-
this.
|
|
2039
|
-
this.
|
|
2040
|
-
this.
|
|
2041
|
-
this.
|
|
2042
|
-
this.
|
|
2043
|
-
this.
|
|
2067
|
+
this.j1q_1 = ordered;
|
|
2068
|
+
this.k1q_1 = nestingLevel;
|
|
2069
|
+
this.l1q_1 = new NumericIndex(unificator, this.j1q_1, this.k1q_1);
|
|
2070
|
+
this.m1q_1 = new AtomIndex(unificator, this.j1q_1, this.k1q_1);
|
|
2071
|
+
this.n1q_1 = new VariableIndex(unificator, this.j1q_1);
|
|
2072
|
+
this.o1q_1 = new CompoundIndex(unificator, this.j1q_1, this.k1q_1 + 1 | 0);
|
|
2044
2073
|
var tmp = this;
|
|
2045
2074
|
var tmp_0 = Companion_instance_1;
|
|
2046
|
-
tmp.
|
|
2075
|
+
tmp.p1q_1 = tmp_0.vq(FamilyArityReteNode$regenerateCache$ref(this));
|
|
2047
2076
|
}
|
|
2048
|
-
protoOf(FamilyArityReteNode).
|
|
2077
|
+
protoOf(FamilyArityReteNode).v1l = function (clause) {
|
|
2049
2078
|
var tmp;
|
|
2050
|
-
if (this.
|
|
2051
|
-
tmp = this.
|
|
2079
|
+
if (this.j1q_1) {
|
|
2080
|
+
tmp = this.r1q(clause);
|
|
2052
2081
|
} else {
|
|
2053
|
-
tmp = this.
|
|
2082
|
+
tmp = this.q1q(clause);
|
|
2054
2083
|
}
|
|
2055
2084
|
var result = tmp;
|
|
2056
2085
|
var tmp_0;
|
|
2057
2086
|
if (result == null) {
|
|
2058
2087
|
tmp_0 = emptySequence();
|
|
2059
2088
|
} else {
|
|
2060
|
-
result.
|
|
2061
|
-
this.
|
|
2062
|
-
tmp_0 = sequenceOf([result.
|
|
2089
|
+
result.y1o();
|
|
2090
|
+
this.p1n();
|
|
2091
|
+
tmp_0 = sequenceOf([result.k1n()]);
|
|
2063
2092
|
}
|
|
2064
2093
|
return tmp_0;
|
|
2065
2094
|
};
|
|
2066
2095
|
protoOf(FamilyArityReteNode).l = function () {
|
|
2067
|
-
var tmp = sequenceOf([this.
|
|
2096
|
+
var tmp = sequenceOf([this.l1q_1, this.m1q_1, this.n1q_1, this.o1q_1]);
|
|
2068
2097
|
return sum(map(tmp, FamilyArityReteNode$_get_size_$lambda_sxz8zo));
|
|
2069
2098
|
};
|
|
2070
|
-
protoOf(FamilyArityReteNode).
|
|
2099
|
+
protoOf(FamilyArityReteNode).k1l = function () {
|
|
2071
2100
|
var tmp$ret$1;
|
|
2072
2101
|
$l$block: {
|
|
2073
2102
|
// Inline function 'kotlin.sequences.all' call
|
|
2074
|
-
var tmp0_iterator = sequenceOf([this.
|
|
2103
|
+
var tmp0_iterator = sequenceOf([this.l1q_1, this.m1q_1, this.n1q_1, this.o1q_1]).r();
|
|
2075
2104
|
while (tmp0_iterator.s()) {
|
|
2076
2105
|
var element = tmp0_iterator.u();
|
|
2077
2106
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FamilyArityReteNode.<get-isEmpty>.<anonymous>' call
|
|
2078
|
-
if (!element.
|
|
2107
|
+
if (!element.k1l()) {
|
|
2079
2108
|
tmp$ret$1 = false;
|
|
2080
2109
|
break $l$block;
|
|
2081
2110
|
}
|
|
@@ -2084,21 +2113,21 @@
|
|
|
2084
2113
|
}
|
|
2085
2114
|
return tmp$ret$1;
|
|
2086
2115
|
};
|
|
2087
|
-
protoOf(FamilyArityReteNode).
|
|
2116
|
+
protoOf(FamilyArityReteNode).n1l = function (clause) {
|
|
2088
2117
|
var tmp;
|
|
2089
2118
|
if (isGlobal_0(clause, this)) {
|
|
2090
2119
|
var tmp_0;
|
|
2091
|
-
if (this.
|
|
2092
|
-
var tmp_1 = Utils_instance.
|
|
2120
|
+
if (this.j1q_1) {
|
|
2121
|
+
var tmp_1 = Utils_instance.g1o([this.m1q_1.f1p(clause), this.n1q_1.f1p(clause), this.l1q_1.f1p(clause), this.o1q_1.f1p(clause)]);
|
|
2093
2122
|
tmp_0 = map(tmp_1, FamilyArityReteNode$get$lambda);
|
|
2094
2123
|
} else {
|
|
2095
|
-
var tmp_2 = Utils_instance.
|
|
2124
|
+
var tmp_2 = Utils_instance.j1o([this.m1q_1.f1p(clause), this.n1q_1.f1p(clause), this.l1q_1.f1p(clause), this.o1q_1.f1p(clause)]);
|
|
2096
2125
|
tmp_0 = map(tmp_2, FamilyArityReteNode$get$lambda_0);
|
|
2097
2126
|
}
|
|
2098
2127
|
tmp = tmp_0;
|
|
2099
2128
|
} else {
|
|
2100
2129
|
var tmp_3;
|
|
2101
|
-
if (this.
|
|
2130
|
+
if (this.j1q_1) {
|
|
2102
2131
|
tmp_3 = getOrdered(this, clause);
|
|
2103
2132
|
} else {
|
|
2104
2133
|
tmp_3 = getUnordered(this, clause);
|
|
@@ -2107,94 +2136,94 @@
|
|
|
2107
2136
|
}
|
|
2108
2137
|
return tmp;
|
|
2109
2138
|
};
|
|
2110
|
-
protoOf(FamilyArityReteNode).
|
|
2111
|
-
return assertByFirstParameter(this, clause).
|
|
2139
|
+
protoOf(FamilyArityReteNode).m1n = function (clause) {
|
|
2140
|
+
return assertByFirstParameter(this, clause).m1n(clause.s1o(this));
|
|
2112
2141
|
};
|
|
2113
|
-
protoOf(FamilyArityReteNode).
|
|
2114
|
-
return assertByFirstParameter(this, clause).
|
|
2142
|
+
protoOf(FamilyArityReteNode).n1n = function (clause) {
|
|
2143
|
+
return assertByFirstParameter(this, clause).n1n(clause.s1o(this));
|
|
2115
2144
|
};
|
|
2116
|
-
protoOf(FamilyArityReteNode).
|
|
2145
|
+
protoOf(FamilyArityReteNode).x1l = function (clause) {
|
|
2117
2146
|
var tmp;
|
|
2118
|
-
if (this.
|
|
2147
|
+
if (this.j1q_1) {
|
|
2119
2148
|
tmp = retractAllOrdered(this, clause);
|
|
2120
2149
|
} else {
|
|
2121
2150
|
tmp = retractAllUnordered(this, clause);
|
|
2122
2151
|
}
|
|
2123
2152
|
return tmp;
|
|
2124
2153
|
};
|
|
2125
|
-
protoOf(FamilyArityReteNode).
|
|
2126
|
-
return asSequence(this.
|
|
2154
|
+
protoOf(FamilyArityReteNode).o1n = function () {
|
|
2155
|
+
return asSequence(this.p1q_1.r2());
|
|
2127
2156
|
};
|
|
2128
|
-
protoOf(FamilyArityReteNode).
|
|
2157
|
+
protoOf(FamilyArityReteNode).v1q = function (clause) {
|
|
2129
2158
|
var innerFirst = nestedFirstArgument_1(clause, this);
|
|
2130
2159
|
var tmp;
|
|
2131
2160
|
if (innerFirst.qx()) {
|
|
2132
|
-
tmp = Utils_instance.
|
|
2161
|
+
tmp = Utils_instance.g1o([this.n1q_1.e1p(clause), this.l1q_1.e1p(clause)]);
|
|
2133
2162
|
} else if (innerFirst.lw()) {
|
|
2134
|
-
tmp = Utils_instance.
|
|
2163
|
+
tmp = Utils_instance.g1o([this.n1q_1.e1p(clause), this.m1q_1.e1p(clause)]);
|
|
2135
2164
|
} else if (innerFirst.mx()) {
|
|
2136
|
-
tmp = Utils_instance.
|
|
2165
|
+
tmp = Utils_instance.g1o([this.n1q_1.e1p(clause), this.l1q_1.e1p(clause), this.m1q_1.e1p(clause), this.o1q_1.e1p(clause)]);
|
|
2137
2166
|
} else {
|
|
2138
|
-
tmp = Utils_instance.
|
|
2167
|
+
tmp = Utils_instance.g1o([this.n1q_1.e1p(clause), this.o1q_1.e1p(clause)]);
|
|
2139
2168
|
}
|
|
2140
2169
|
return tmp;
|
|
2141
2170
|
};
|
|
2142
|
-
protoOf(FamilyArityReteNode).
|
|
2171
|
+
protoOf(FamilyArityReteNode).u1q = function (clause) {
|
|
2143
2172
|
var innerFirst = nestedFirstArgument_1(clause, this);
|
|
2144
|
-
return innerFirst.qx() ? Utils_instance.
|
|
2173
|
+
return innerFirst.qx() ? Utils_instance.j1o([this.n1q_1.e1p(clause), this.l1q_1.e1p(clause)]) : innerFirst.lw() ? Utils_instance.j1o([this.n1q_1.e1p(clause), this.m1q_1.e1p(clause)]) : innerFirst.mx() ? Utils_instance.j1o([this.n1q_1.e1p(clause), this.l1q_1.e1p(clause), this.m1q_1.e1p(clause), this.o1q_1.e1p(clause)]) : Utils_instance.j1o([this.n1q_1.e1p(clause), this.o1q_1.e1p(clause)]);
|
|
2145
2174
|
};
|
|
2146
|
-
protoOf(FamilyArityReteNode).
|
|
2175
|
+
protoOf(FamilyArityReteNode).t1q = function (clause) {
|
|
2147
2176
|
var innerFirst = nestedFirstArgument_1(clause, this);
|
|
2148
|
-
return innerFirst.qx() ? Utils_instance.
|
|
2177
|
+
return innerFirst.qx() ? Utils_instance.g1o([this.n1q_1.d1p(clause), this.l1q_1.d1p(clause)]) : innerFirst.lw() ? Utils_instance.g1o([this.n1q_1.d1p(clause), this.m1q_1.d1p(clause)]) : innerFirst.mx() ? Utils_instance.g1o([this.n1q_1.d1p(clause), this.l1q_1.d1p(clause), this.m1q_1.d1p(clause), this.o1q_1.d1p(clause)]) : Utils_instance.g1o([this.n1q_1.d1p(clause), this.o1q_1.d1p(clause)]);
|
|
2149
2178
|
};
|
|
2150
|
-
protoOf(FamilyArityReteNode).
|
|
2179
|
+
protoOf(FamilyArityReteNode).s1q = function (clause) {
|
|
2151
2180
|
var innerFirst = nestedFirstArgument_1(clause, this);
|
|
2152
|
-
return innerFirst.qx() ? Utils_instance.
|
|
2181
|
+
return innerFirst.qx() ? Utils_instance.j1o([this.n1q_1.d1p(clause), this.l1q_1.d1p(clause)]) : innerFirst.lw() ? Utils_instance.j1o([this.n1q_1.d1p(clause), this.m1q_1.d1p(clause)]) : innerFirst.mx() ? Utils_instance.j1o([this.n1q_1.d1p(clause), this.l1q_1.d1p(clause), this.m1q_1.d1p(clause), this.o1q_1.d1p(clause)]) : Utils_instance.j1o([this.n1q_1.d1p(clause), this.o1q_1.d1p(clause)]);
|
|
2153
2182
|
};
|
|
2154
|
-
protoOf(FamilyArityReteNode).
|
|
2183
|
+
protoOf(FamilyArityReteNode).q1q = function (clause) {
|
|
2155
2184
|
var innerFirst = nestedFirstArgument_1(clause, this);
|
|
2156
2185
|
var tmp;
|
|
2157
2186
|
if (innerFirst.qx()) {
|
|
2158
|
-
var tmp0_elvis_lhs = this.
|
|
2159
|
-
tmp = tmp0_elvis_lhs == null ? this.
|
|
2187
|
+
var tmp0_elvis_lhs = this.n1q_1.c1p(clause);
|
|
2188
|
+
tmp = tmp0_elvis_lhs == null ? this.l1q_1.c1p(clause) : tmp0_elvis_lhs;
|
|
2160
2189
|
} else if (innerFirst.lw()) {
|
|
2161
|
-
var tmp1_elvis_lhs = this.
|
|
2162
|
-
tmp = tmp1_elvis_lhs == null ? this.
|
|
2190
|
+
var tmp1_elvis_lhs = this.n1q_1.c1p(clause);
|
|
2191
|
+
tmp = tmp1_elvis_lhs == null ? this.m1q_1.c1p(clause) : tmp1_elvis_lhs;
|
|
2163
2192
|
} else if (innerFirst.mx()) {
|
|
2164
|
-
var tmp2_elvis_lhs = this.
|
|
2165
|
-
var tmp3_elvis_lhs = tmp2_elvis_lhs == null ? this.
|
|
2166
|
-
var tmp4_elvis_lhs = tmp3_elvis_lhs == null ? this.
|
|
2167
|
-
tmp = tmp4_elvis_lhs == null ? this.
|
|
2193
|
+
var tmp2_elvis_lhs = this.n1q_1.c1p(clause);
|
|
2194
|
+
var tmp3_elvis_lhs = tmp2_elvis_lhs == null ? this.l1q_1.c1p(clause) : tmp2_elvis_lhs;
|
|
2195
|
+
var tmp4_elvis_lhs = tmp3_elvis_lhs == null ? this.m1q_1.c1p(clause) : tmp3_elvis_lhs;
|
|
2196
|
+
tmp = tmp4_elvis_lhs == null ? this.o1q_1.c1p(clause) : tmp4_elvis_lhs;
|
|
2168
2197
|
} else {
|
|
2169
|
-
var tmp5_elvis_lhs = this.
|
|
2170
|
-
tmp = tmp5_elvis_lhs == null ? this.
|
|
2198
|
+
var tmp5_elvis_lhs = this.n1q_1.c1p(clause);
|
|
2199
|
+
tmp = tmp5_elvis_lhs == null ? this.o1q_1.c1p(clause) : tmp5_elvis_lhs;
|
|
2171
2200
|
}
|
|
2172
2201
|
return tmp;
|
|
2173
2202
|
};
|
|
2174
|
-
protoOf(FamilyArityReteNode).
|
|
2203
|
+
protoOf(FamilyArityReteNode).r1q = function (clause) {
|
|
2175
2204
|
var innerFirst = nestedFirstArgument_1(clause, this);
|
|
2176
2205
|
var tmp;
|
|
2177
2206
|
if (innerFirst.qx()) {
|
|
2178
|
-
tmp = Utils_instance.
|
|
2207
|
+
tmp = Utils_instance.o1o(this.l1q_1.c1p(clause), this.n1q_1.c1p(clause));
|
|
2179
2208
|
} else if (innerFirst.lw()) {
|
|
2180
|
-
tmp = Utils_instance.
|
|
2209
|
+
tmp = Utils_instance.o1o(this.m1q_1.c1p(clause), this.n1q_1.c1p(clause));
|
|
2181
2210
|
} else if (innerFirst.mx()) {
|
|
2182
|
-
tmp = Utils_instance.
|
|
2211
|
+
tmp = Utils_instance.o1o(Utils_instance.o1o(this.l1q_1.c1p(clause), this.m1q_1.c1p(clause)), Utils_instance.o1o(this.n1q_1.c1p(clause), this.o1q_1.c1p(clause)));
|
|
2183
2212
|
} else {
|
|
2184
|
-
tmp = Utils_instance.
|
|
2213
|
+
tmp = Utils_instance.o1o(this.n1q_1.c1p(clause), this.o1q_1.c1p(clause));
|
|
2185
2214
|
}
|
|
2186
2215
|
return tmp;
|
|
2187
2216
|
};
|
|
2188
|
-
protoOf(FamilyArityReteNode).
|
|
2189
|
-
this.
|
|
2217
|
+
protoOf(FamilyArityReteNode).p1n = function () {
|
|
2218
|
+
this.p1q_1.xq();
|
|
2190
2219
|
};
|
|
2191
2220
|
function isGlobal_1(_this__u8e3s4, $this) {
|
|
2192
|
-
return _this__u8e3s4.yw() ? Utils_instance.
|
|
2221
|
+
return _this__u8e3s4.yw() ? Utils_instance.f1o(_this__u8e3s4.castToRule().wy(), $this.y1q_1).mx() : false;
|
|
2193
2222
|
}
|
|
2194
2223
|
function nestedArity(_this__u8e3s4, $this) {
|
|
2195
2224
|
var tmp0_safe_receiver = _this__u8e3s4.asRule();
|
|
2196
2225
|
var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.wy();
|
|
2197
|
-
var tmp2_elvis_lhs = tmp1_safe_receiver == null ? null : Utils_instance.
|
|
2226
|
+
var tmp2_elvis_lhs = tmp1_safe_receiver == null ? null : Utils_instance.d1o(tmp1_safe_receiver, $this.y1q_1);
|
|
2198
2227
|
var tmp;
|
|
2199
2228
|
if (tmp2_elvis_lhs == null) {
|
|
2200
2229
|
var message = 'The nestedArity method cannot be invoked on non-rule clauses';
|
|
@@ -2205,38 +2234,38 @@
|
|
|
2205
2234
|
return tmp;
|
|
2206
2235
|
}
|
|
2207
2236
|
function nestedArity_0(_this__u8e3s4, $this) {
|
|
2208
|
-
return Utils_instance.
|
|
2237
|
+
return Utils_instance.d1o(ensureNotNull(_this__u8e3s4.k1n().wy()), $this.y1q_1);
|
|
2209
2238
|
}
|
|
2210
2239
|
function regenerateCache_1($this) {
|
|
2211
2240
|
var tmp;
|
|
2212
|
-
if ($this.
|
|
2241
|
+
if ($this.x1q_1) {
|
|
2213
2242
|
var tmp_0 = Utils_instance;
|
|
2214
2243
|
// Inline function 'kotlin.collections.map' call
|
|
2215
|
-
var this_0 = $this.
|
|
2244
|
+
var this_0 = $this.z1q_1.m2();
|
|
2216
2245
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2217
2246
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2218
2247
|
var tmp0_iterator = this_0.r();
|
|
2219
2248
|
while (tmp0_iterator.s()) {
|
|
2220
2249
|
var item = tmp0_iterator.u();
|
|
2221
2250
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.regenerateCache.<anonymous>' call
|
|
2222
|
-
var tmp$ret$0 = item.
|
|
2251
|
+
var tmp$ret$0 = item.o1n();
|
|
2223
2252
|
destination.o(tmp$ret$0);
|
|
2224
2253
|
}
|
|
2225
|
-
tmp = tmp_0.
|
|
2254
|
+
tmp = tmp_0.h1o(destination);
|
|
2226
2255
|
} else {
|
|
2227
2256
|
var tmp_1 = Utils_instance;
|
|
2228
2257
|
// Inline function 'kotlin.collections.map' call
|
|
2229
|
-
var this_1 = $this.
|
|
2258
|
+
var this_1 = $this.z1q_1.m2();
|
|
2230
2259
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2231
2260
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
2232
2261
|
var tmp0_iterator_0 = this_1.r();
|
|
2233
2262
|
while (tmp0_iterator_0.s()) {
|
|
2234
2263
|
var item_0 = tmp0_iterator_0.u();
|
|
2235
2264
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.regenerateCache.<anonymous>' call
|
|
2236
|
-
var tmp$ret$3 = item_0.
|
|
2265
|
+
var tmp$ret$3 = item_0.o1n();
|
|
2237
2266
|
destination_0.o(tmp$ret$3);
|
|
2238
2267
|
}
|
|
2239
|
-
tmp = tmp_1.
|
|
2268
|
+
tmp = tmp_1.l1o(destination_0);
|
|
2240
2269
|
}
|
|
2241
2270
|
return dequeOf_0(tmp);
|
|
2242
2271
|
}
|
|
@@ -2252,33 +2281,33 @@
|
|
|
2252
2281
|
}
|
|
2253
2282
|
function FunctorIndexingNode$retractAllIndexed$lambda(this$0, $clause) {
|
|
2254
2283
|
return function (it) {
|
|
2255
|
-
return this$0.
|
|
2284
|
+
return this$0.f1l().match(it.k1n(), $clause);
|
|
2256
2285
|
};
|
|
2257
2286
|
}
|
|
2258
2287
|
function FunctorIndexingNode(unificator, ordered, nestingLevel) {
|
|
2259
2288
|
FunctorNode.call(this, unificator);
|
|
2260
|
-
this.
|
|
2261
|
-
this.
|
|
2289
|
+
this.x1q_1 = ordered;
|
|
2290
|
+
this.y1q_1 = nestingLevel;
|
|
2262
2291
|
var tmp = this;
|
|
2263
2292
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
2264
|
-
tmp.
|
|
2293
|
+
tmp.z1q_1 = LinkedHashMap_init_$Create$();
|
|
2265
2294
|
var tmp_0 = this;
|
|
2266
2295
|
var tmp_1 = Companion_instance_1;
|
|
2267
|
-
tmp_0.
|
|
2296
|
+
tmp_0.a1r_1 = tmp_1.vq(FunctorIndexingNode$regenerateCache$ref(this));
|
|
2268
2297
|
}
|
|
2269
2298
|
protoOf(FunctorIndexingNode).l = function () {
|
|
2270
|
-
var tmp = asSequence(this.
|
|
2299
|
+
var tmp = asSequence(this.z1q_1.m2());
|
|
2271
2300
|
return sum(map(tmp, FunctorIndexingNode$_get_size_$lambda_vcufvm));
|
|
2272
2301
|
};
|
|
2273
|
-
protoOf(FunctorIndexingNode).
|
|
2302
|
+
protoOf(FunctorIndexingNode).k1l = function () {
|
|
2274
2303
|
var tmp;
|
|
2275
|
-
if (this.
|
|
2304
|
+
if (this.z1q_1.y()) {
|
|
2276
2305
|
tmp = true;
|
|
2277
2306
|
} else {
|
|
2278
2307
|
var tmp$ret$0;
|
|
2279
2308
|
$l$block_0: {
|
|
2280
2309
|
// Inline function 'kotlin.collections.all' call
|
|
2281
|
-
var this_0 = this.
|
|
2310
|
+
var this_0 = this.z1q_1.m2();
|
|
2282
2311
|
var tmp_0;
|
|
2283
2312
|
if (isInterface(this_0, Collection)) {
|
|
2284
2313
|
tmp_0 = this_0.y();
|
|
@@ -2293,7 +2322,7 @@
|
|
|
2293
2322
|
while (tmp0_iterator.s()) {
|
|
2294
2323
|
var element = tmp0_iterator.u();
|
|
2295
2324
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.<get-isEmpty>.<anonymous>' call
|
|
2296
|
-
if (!element.
|
|
2325
|
+
if (!element.k1l()) {
|
|
2297
2326
|
tmp$ret$0 = false;
|
|
2298
2327
|
break $l$block_0;
|
|
2299
2328
|
}
|
|
@@ -2304,42 +2333,42 @@
|
|
|
2304
2333
|
}
|
|
2305
2334
|
return tmp;
|
|
2306
2335
|
};
|
|
2307
|
-
protoOf(FunctorIndexingNode).
|
|
2336
|
+
protoOf(FunctorIndexingNode).m1n = function (clause) {
|
|
2308
2337
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2309
|
-
var this_0 = this.
|
|
2338
|
+
var this_0 = this.z1q_1;
|
|
2310
2339
|
var key = nestedArity_0(clause, this);
|
|
2311
2340
|
var value = this_0.x2(key);
|
|
2312
2341
|
var tmp;
|
|
2313
2342
|
if (value == null) {
|
|
2314
2343
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.assertA.<anonymous>' call
|
|
2315
|
-
var answer = new FamilyArityIndexingNode(this.
|
|
2344
|
+
var answer = new FamilyArityIndexingNode(this.f1l(), this.x1q_1, this.y1q_1);
|
|
2316
2345
|
this_0.n2(key, answer);
|
|
2317
2346
|
tmp = answer;
|
|
2318
2347
|
} else {
|
|
2319
2348
|
tmp = value;
|
|
2320
2349
|
}
|
|
2321
|
-
tmp.
|
|
2350
|
+
tmp.m1n(clause.s1o(this));
|
|
2322
2351
|
};
|
|
2323
|
-
protoOf(FunctorIndexingNode).
|
|
2352
|
+
protoOf(FunctorIndexingNode).n1n = function (clause) {
|
|
2324
2353
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2325
|
-
var this_0 = this.
|
|
2354
|
+
var this_0 = this.z1q_1;
|
|
2326
2355
|
var key = nestedArity_0(clause, this);
|
|
2327
2356
|
var value = this_0.x2(key);
|
|
2328
2357
|
var tmp;
|
|
2329
2358
|
if (value == null) {
|
|
2330
2359
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.assertZ.<anonymous>' call
|
|
2331
|
-
var answer = new FamilyArityIndexingNode(this.
|
|
2360
|
+
var answer = new FamilyArityIndexingNode(this.f1l(), this.x1q_1, this.y1q_1);
|
|
2332
2361
|
this_0.n2(key, answer);
|
|
2333
2362
|
tmp = answer;
|
|
2334
2363
|
} else {
|
|
2335
2364
|
tmp = value;
|
|
2336
2365
|
}
|
|
2337
|
-
tmp.
|
|
2366
|
+
tmp.n1n(clause.s1o(this));
|
|
2338
2367
|
};
|
|
2339
|
-
protoOf(FunctorIndexingNode).
|
|
2340
|
-
return asSequence(this.
|
|
2368
|
+
protoOf(FunctorIndexingNode).o1n = function () {
|
|
2369
|
+
return asSequence(this.a1r_1.r2());
|
|
2341
2370
|
};
|
|
2342
|
-
protoOf(FunctorIndexingNode).
|
|
2371
|
+
protoOf(FunctorIndexingNode).c1p = function (clause) {
|
|
2343
2372
|
var tmp;
|
|
2344
2373
|
if (isGlobal_1(clause, this)) {
|
|
2345
2374
|
var tmp$ret$4;
|
|
@@ -2347,21 +2376,21 @@
|
|
|
2347
2376
|
// Inline function 'kotlin.sequences.firstOrNull' call
|
|
2348
2377
|
var tmp_0 = Utils_instance;
|
|
2349
2378
|
// Inline function 'kotlin.collections.map' call
|
|
2350
|
-
var this_0 = this.
|
|
2379
|
+
var this_0 = this.z1q_1.m2();
|
|
2351
2380
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2352
2381
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2353
2382
|
var tmp0_iterator = this_0.r();
|
|
2354
2383
|
while (tmp0_iterator.s()) {
|
|
2355
2384
|
var item = tmp0_iterator.u();
|
|
2356
2385
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.getFirstIndexed.<anonymous>' call
|
|
2357
|
-
var tmp$ret$0 = item.
|
|
2386
|
+
var tmp$ret$0 = item.f1p(clause);
|
|
2358
2387
|
destination.o(tmp$ret$0);
|
|
2359
2388
|
}
|
|
2360
|
-
var tmp0_iterator_0 = tmp_0.
|
|
2389
|
+
var tmp0_iterator_0 = tmp_0.h1o(destination).r();
|
|
2361
2390
|
while (tmp0_iterator_0.s()) {
|
|
2362
2391
|
var element = tmp0_iterator_0.u();
|
|
2363
2392
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.getFirstIndexed.<anonymous>' call
|
|
2364
|
-
if (this.
|
|
2393
|
+
if (this.f1l().match(element.k1n(), clause)) {
|
|
2365
2394
|
tmp$ret$4 = element;
|
|
2366
2395
|
break $l$block;
|
|
2367
2396
|
}
|
|
@@ -2370,130 +2399,130 @@
|
|
|
2370
2399
|
}
|
|
2371
2400
|
tmp = tmp$ret$4;
|
|
2372
2401
|
} else {
|
|
2373
|
-
var tmp0_safe_receiver = this.
|
|
2374
|
-
tmp = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2402
|
+
var tmp0_safe_receiver = this.z1q_1.x2(nestedArity(clause, this));
|
|
2403
|
+
tmp = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.c1p(clause);
|
|
2375
2404
|
}
|
|
2376
2405
|
return tmp;
|
|
2377
2406
|
};
|
|
2378
|
-
protoOf(FunctorIndexingNode).
|
|
2407
|
+
protoOf(FunctorIndexingNode).d1p = function (clause) {
|
|
2379
2408
|
var tmp;
|
|
2380
2409
|
if (isGlobal_1(clause, this)) {
|
|
2381
2410
|
var tmp_0 = Utils_instance;
|
|
2382
2411
|
// Inline function 'kotlin.collections.map' call
|
|
2383
|
-
var this_0 = this.
|
|
2412
|
+
var this_0 = this.z1q_1.m2();
|
|
2384
2413
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2385
2414
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2386
2415
|
var tmp0_iterator = this_0.r();
|
|
2387
2416
|
while (tmp0_iterator.s()) {
|
|
2388
2417
|
var item = tmp0_iterator.u();
|
|
2389
2418
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.getIndexed.<anonymous>' call
|
|
2390
|
-
var tmp$ret$0 = item.
|
|
2419
|
+
var tmp$ret$0 = item.f1p(clause);
|
|
2391
2420
|
destination.o(tmp$ret$0);
|
|
2392
2421
|
}
|
|
2393
|
-
tmp = tmp_0.
|
|
2422
|
+
tmp = tmp_0.h1o(destination);
|
|
2394
2423
|
} else {
|
|
2395
|
-
var tmp0_safe_receiver = this.
|
|
2396
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2424
|
+
var tmp0_safe_receiver = this.z1q_1.x2(nestedArity(clause, this));
|
|
2425
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.d1p(clause);
|
|
2397
2426
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2398
2427
|
}
|
|
2399
2428
|
return tmp;
|
|
2400
2429
|
};
|
|
2401
|
-
protoOf(FunctorIndexingNode).
|
|
2430
|
+
protoOf(FunctorIndexingNode).e1p = function (clause) {
|
|
2402
2431
|
var tmp;
|
|
2403
2432
|
if (isGlobal_1(clause, this)) {
|
|
2404
2433
|
var tmp_0 = Utils_instance;
|
|
2405
2434
|
// Inline function 'kotlin.collections.map' call
|
|
2406
|
-
var this_0 = this.
|
|
2435
|
+
var this_0 = this.z1q_1.m2();
|
|
2407
2436
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2408
2437
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2409
2438
|
var tmp0_iterator = this_0.r();
|
|
2410
2439
|
while (tmp0_iterator.s()) {
|
|
2411
2440
|
var item = tmp0_iterator.u();
|
|
2412
2441
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.retractAllIndexed.<anonymous>' call
|
|
2413
|
-
var tmp$ret$0 = item.
|
|
2442
|
+
var tmp$ret$0 = item.f1p(clause);
|
|
2414
2443
|
destination.o(tmp$ret$0);
|
|
2415
2444
|
}
|
|
2416
|
-
var tmp_1 = tmp_0.
|
|
2445
|
+
var tmp_1 = tmp_0.h1o(destination);
|
|
2417
2446
|
var partialResult = toList(filter(tmp_1, FunctorIndexingNode$retractAllIndexed$lambda(this, clause)));
|
|
2418
2447
|
// Inline function 'kotlin.collections.isNotEmpty' call
|
|
2419
2448
|
if (!partialResult.y()) {
|
|
2420
|
-
this.
|
|
2449
|
+
this.p1n();
|
|
2421
2450
|
// Inline function 'kotlin.collections.forEach' call
|
|
2422
2451
|
var tmp0_iterator_0 = partialResult.r();
|
|
2423
2452
|
while (tmp0_iterator_0.s()) {
|
|
2424
2453
|
var element = tmp0_iterator_0.u();
|
|
2425
2454
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.retractAllIndexed.<anonymous>' call
|
|
2426
|
-
element.
|
|
2455
|
+
element.y1o();
|
|
2427
2456
|
}
|
|
2428
2457
|
}
|
|
2429
2458
|
tmp = asSequence(partialResult);
|
|
2430
2459
|
} else {
|
|
2431
|
-
var tmp0_safe_receiver = this.
|
|
2432
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2460
|
+
var tmp0_safe_receiver = this.z1q_1.x2(nestedArity(clause, this));
|
|
2461
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.e1p(clause);
|
|
2433
2462
|
tmp = tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2434
2463
|
}
|
|
2435
2464
|
return tmp;
|
|
2436
2465
|
};
|
|
2437
|
-
protoOf(FunctorIndexingNode).
|
|
2466
|
+
protoOf(FunctorIndexingNode).f1p = function (clause) {
|
|
2438
2467
|
var tmp;
|
|
2439
|
-
if (this.
|
|
2468
|
+
if (this.x1q_1) {
|
|
2440
2469
|
var tmp_0 = Utils_instance;
|
|
2441
2470
|
// Inline function 'kotlin.collections.map' call
|
|
2442
|
-
var this_0 = this.
|
|
2471
|
+
var this_0 = this.z1q_1.m2();
|
|
2443
2472
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2444
2473
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2445
2474
|
var tmp0_iterator = this_0.r();
|
|
2446
2475
|
while (tmp0_iterator.s()) {
|
|
2447
2476
|
var item = tmp0_iterator.u();
|
|
2448
2477
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.extractGlobalIndexedSequence.<anonymous>' call
|
|
2449
|
-
var tmp$ret$0 = item.
|
|
2478
|
+
var tmp$ret$0 = item.f1p(clause);
|
|
2450
2479
|
destination.o(tmp$ret$0);
|
|
2451
2480
|
}
|
|
2452
|
-
tmp = tmp_0.
|
|
2481
|
+
tmp = tmp_0.h1o(destination);
|
|
2453
2482
|
} else {
|
|
2454
2483
|
var tmp_1 = Utils_instance;
|
|
2455
2484
|
// Inline function 'kotlin.collections.map' call
|
|
2456
|
-
var this_1 = this.
|
|
2485
|
+
var this_1 = this.z1q_1.m2();
|
|
2457
2486
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2458
2487
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
2459
2488
|
var tmp0_iterator_0 = this_1.r();
|
|
2460
2489
|
while (tmp0_iterator_0.s()) {
|
|
2461
2490
|
var item_0 = tmp0_iterator_0.u();
|
|
2462
2491
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.FunctorIndexingNode.extractGlobalIndexedSequence.<anonymous>' call
|
|
2463
|
-
var tmp$ret$3 = item_0.
|
|
2492
|
+
var tmp$ret$3 = item_0.f1p(clause);
|
|
2464
2493
|
destination_0.o(tmp$ret$3);
|
|
2465
2494
|
}
|
|
2466
|
-
tmp = tmp_1.
|
|
2495
|
+
tmp = tmp_1.l1o(destination_0);
|
|
2467
2496
|
}
|
|
2468
2497
|
return tmp;
|
|
2469
2498
|
};
|
|
2470
|
-
protoOf(FunctorIndexingNode).
|
|
2471
|
-
this.
|
|
2499
|
+
protoOf(FunctorIndexingNode).p1n = function () {
|
|
2500
|
+
this.a1r_1.xq();
|
|
2472
2501
|
};
|
|
2473
2502
|
function FunctorNode(unificator) {
|
|
2474
2503
|
AbstractReteNode.call(this, unificator);
|
|
2475
2504
|
}
|
|
2476
2505
|
function assignHigherIndex($this, clause) {
|
|
2477
2506
|
var tmp = Companion_instance_7;
|
|
2478
|
-
$this.
|
|
2479
|
-
return tmp.
|
|
2507
|
+
$this.h1r_1 = $this.h1r_1.tb();
|
|
2508
|
+
return tmp.u1o($this.h1r_1, clause, [$this]);
|
|
2480
2509
|
}
|
|
2481
2510
|
function assignLowerIndex($this, clause) {
|
|
2482
2511
|
var tmp = Companion_instance_7;
|
|
2483
|
-
$this.
|
|
2484
|
-
return tmp.
|
|
2512
|
+
$this.g1r_1 = $this.g1r_1.ub();
|
|
2513
|
+
return tmp.u1o($this.g1r_1, clause, [$this]);
|
|
2485
2514
|
}
|
|
2486
2515
|
function regenerateCache_2($this) {
|
|
2487
2516
|
var tmp;
|
|
2488
|
-
if ($this.
|
|
2489
|
-
var tmp_0 = Utils_instance.
|
|
2517
|
+
if ($this.c1r_1) {
|
|
2518
|
+
var tmp_0 = Utils_instance.g1o([$this.f1r_1.o1n(), $this.e1r_1.o1n()]);
|
|
2490
2519
|
tmp = map(tmp_0, RootNode$regenerateCache$lambda);
|
|
2491
2520
|
} else {
|
|
2492
2521
|
var tmp_1 = Utils_instance;
|
|
2493
|
-
var tmp_2 = $this.
|
|
2522
|
+
var tmp_2 = $this.f1r_1.o1n();
|
|
2494
2523
|
var tmp_3 = map(tmp_2, RootNode$regenerateCache$lambda_0);
|
|
2495
|
-
var tmp_4 = $this.
|
|
2496
|
-
tmp = tmp_1.
|
|
2524
|
+
var tmp_4 = $this.e1r_1.o1n();
|
|
2525
|
+
tmp = tmp_1.m1o([tmp_3, map(tmp_4, RootNode$regenerateCache$lambda_1)]);
|
|
2497
2526
|
}
|
|
2498
2527
|
return dequeOf_0(tmp);
|
|
2499
2528
|
}
|
|
@@ -2522,146 +2551,146 @@
|
|
|
2522
2551
|
};
|
|
2523
2552
|
}
|
|
2524
2553
|
function RootNode$regenerateCache$lambda(it) {
|
|
2525
|
-
return it.
|
|
2554
|
+
return it.k1n();
|
|
2526
2555
|
}
|
|
2527
2556
|
function RootNode$regenerateCache$lambda_0(it) {
|
|
2528
|
-
return it.
|
|
2557
|
+
return it.k1n();
|
|
2529
2558
|
}
|
|
2530
2559
|
function RootNode$regenerateCache$lambda_1(it) {
|
|
2531
|
-
return it.
|
|
2560
|
+
return it.k1n();
|
|
2532
2561
|
}
|
|
2533
2562
|
function RootNode(unificator, clauses, isOrdered) {
|
|
2534
|
-
this.
|
|
2535
|
-
this.
|
|
2563
|
+
this.b1r_1 = unificator;
|
|
2564
|
+
this.c1r_1 = isOrdered;
|
|
2536
2565
|
var tmp = this;
|
|
2537
2566
|
var tmp_0 = Companion_instance_1;
|
|
2538
|
-
tmp.
|
|
2539
|
-
this.
|
|
2540
|
-
this.
|
|
2541
|
-
this.
|
|
2542
|
-
this.
|
|
2567
|
+
tmp.d1r_1 = tmp_0.vq(RootNode$regenerateCache$ref(this));
|
|
2568
|
+
this.e1r_1 = new RuleNode(this.b1r_1, this.c1r_1);
|
|
2569
|
+
this.f1r_1 = new DirectiveIndex(this.b1r_1, this.c1r_1);
|
|
2570
|
+
this.g1r_1 = new Long(0, 0);
|
|
2571
|
+
this.h1r_1 = new Long(0, 0);
|
|
2543
2572
|
// Inline function 'kotlin.collections.forEach' call
|
|
2544
2573
|
var tmp0_iterator = clauses.r();
|
|
2545
2574
|
while (tmp0_iterator.s()) {
|
|
2546
2575
|
var element = tmp0_iterator.u();
|
|
2547
2576
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.RootNode.<anonymous>' call
|
|
2548
|
-
this.
|
|
2577
|
+
this.s1l(element);
|
|
2549
2578
|
}
|
|
2550
2579
|
}
|
|
2551
|
-
protoOf(RootNode).
|
|
2552
|
-
return this.
|
|
2580
|
+
protoOf(RootNode).f1l = function () {
|
|
2581
|
+
return this.b1r_1;
|
|
2553
2582
|
};
|
|
2554
|
-
protoOf(RootNode).
|
|
2555
|
-
return this.
|
|
2583
|
+
protoOf(RootNode).n1m = function () {
|
|
2584
|
+
return this.c1r_1;
|
|
2556
2585
|
};
|
|
2557
2586
|
protoOf(RootNode).l = function () {
|
|
2558
|
-
return this.
|
|
2587
|
+
return this.f1r_1.l() + this.e1r_1.l() | 0;
|
|
2559
2588
|
};
|
|
2560
|
-
protoOf(RootNode).
|
|
2561
|
-
return this.
|
|
2589
|
+
protoOf(RootNode).k1l = function () {
|
|
2590
|
+
return this.f1r_1.k1l() ? this.e1r_1.k1l() : false;
|
|
2562
2591
|
};
|
|
2563
|
-
protoOf(RootNode).
|
|
2564
|
-
return asSequence(this.
|
|
2592
|
+
protoOf(RootNode).p1l = function () {
|
|
2593
|
+
return asSequence(this.d1r_1.r2());
|
|
2565
2594
|
};
|
|
2566
|
-
protoOf(RootNode).
|
|
2567
|
-
var tmp = this.
|
|
2595
|
+
protoOf(RootNode).i1l = function () {
|
|
2596
|
+
var tmp = this.f1r_1.o1n();
|
|
2568
2597
|
return map(tmp, RootNode$_get_directives_$lambda_9lfp1g);
|
|
2569
2598
|
};
|
|
2570
|
-
protoOf(RootNode).
|
|
2571
|
-
var tmp = this.
|
|
2599
|
+
protoOf(RootNode).j1l = function () {
|
|
2600
|
+
var tmp = this.e1r_1.o1n();
|
|
2572
2601
|
return map(tmp, RootNode$_get_rules_$lambda_py6utr);
|
|
2573
2602
|
};
|
|
2574
|
-
protoOf(RootNode).
|
|
2603
|
+
protoOf(RootNode).n1l = function (clause) {
|
|
2575
2604
|
var tmp;
|
|
2576
2605
|
if (clause.zw()) {
|
|
2577
|
-
tmp = this.
|
|
2606
|
+
tmp = this.f1r_1.n1l(clause);
|
|
2578
2607
|
} else {
|
|
2579
|
-
tmp = this.
|
|
2608
|
+
tmp = this.e1r_1.n1l(clause);
|
|
2580
2609
|
}
|
|
2581
2610
|
return tmp;
|
|
2582
2611
|
};
|
|
2583
|
-
protoOf(RootNode).
|
|
2612
|
+
protoOf(RootNode).v1l = function (clause) {
|
|
2584
2613
|
var tmp;
|
|
2585
2614
|
if (clause.zw()) {
|
|
2586
|
-
tmp = this.
|
|
2615
|
+
tmp = this.f1r_1.v1l(clause);
|
|
2587
2616
|
} else {
|
|
2588
|
-
tmp = this.
|
|
2617
|
+
tmp = this.e1r_1.v1l(clause);
|
|
2589
2618
|
}
|
|
2590
2619
|
return tmp;
|
|
2591
2620
|
};
|
|
2592
|
-
protoOf(RootNode).
|
|
2621
|
+
protoOf(RootNode).x1l = function (clause) {
|
|
2593
2622
|
var tmp;
|
|
2594
2623
|
if (clause.zw()) {
|
|
2595
|
-
tmp = this.
|
|
2624
|
+
tmp = this.f1r_1.x1l(clause);
|
|
2596
2625
|
} else {
|
|
2597
|
-
tmp = this.
|
|
2626
|
+
tmp = this.e1r_1.x1l(clause);
|
|
2598
2627
|
}
|
|
2599
2628
|
return tmp;
|
|
2600
2629
|
};
|
|
2601
|
-
protoOf(RootNode).
|
|
2602
|
-
return new RootNode(this.
|
|
2630
|
+
protoOf(RootNode).a1m = function () {
|
|
2631
|
+
return new RootNode(this.b1r_1, asIterable(this.p1l()), this.c1r_1);
|
|
2603
2632
|
};
|
|
2604
|
-
protoOf(RootNode).
|
|
2633
|
+
protoOf(RootNode).r1m = function (clause) {
|
|
2605
2634
|
var indexed = assignLowerIndex(this, clause);
|
|
2606
|
-
if (this.
|
|
2607
|
-
this.
|
|
2635
|
+
if (this.c1r_1) {
|
|
2636
|
+
this.d1r_1.yq(RootNode$assertA$lambda(clause));
|
|
2608
2637
|
if (clause.zw()) {
|
|
2609
|
-
this.
|
|
2638
|
+
this.f1r_1.m1n(indexed);
|
|
2610
2639
|
} else {
|
|
2611
|
-
this.
|
|
2640
|
+
this.e1r_1.m1n(indexed);
|
|
2612
2641
|
}
|
|
2613
2642
|
} else {
|
|
2614
2643
|
throw UnsupportedOperationException_init_$Create$('An unordered ReteTree cannot perform the assertA operation.');
|
|
2615
2644
|
}
|
|
2616
2645
|
};
|
|
2617
|
-
protoOf(RootNode).
|
|
2646
|
+
protoOf(RootNode).s1l = function (clause) {
|
|
2618
2647
|
var indexed = assignHigherIndex(this, clause);
|
|
2619
|
-
this.
|
|
2648
|
+
this.d1r_1.yq(RootNode$assertZ$lambda(clause));
|
|
2620
2649
|
if (clause.zw()) {
|
|
2621
|
-
this.
|
|
2650
|
+
this.f1r_1.n1n(indexed);
|
|
2622
2651
|
} else {
|
|
2623
|
-
this.
|
|
2652
|
+
this.e1r_1.n1n(indexed);
|
|
2624
2653
|
}
|
|
2625
2654
|
};
|
|
2626
|
-
protoOf(RootNode).
|
|
2627
|
-
this.
|
|
2655
|
+
protoOf(RootNode).p1n = function () {
|
|
2656
|
+
this.d1r_1.xq();
|
|
2628
2657
|
};
|
|
2629
2658
|
function nestedFunctor_1(_this__u8e3s4, $this) {
|
|
2630
|
-
return Utils_instance.
|
|
2659
|
+
return Utils_instance.e1o(ensureNotNull(_this__u8e3s4.wy()), 0);
|
|
2631
2660
|
}
|
|
2632
2661
|
function nestedFunctor_2(_this__u8e3s4, $this) {
|
|
2633
|
-
return nestedFunctor_1(_this__u8e3s4.
|
|
2662
|
+
return nestedFunctor_1(_this__u8e3s4.k1n(), $this);
|
|
2634
2663
|
}
|
|
2635
2664
|
function regenerateCache_3($this) {
|
|
2636
2665
|
var tmp;
|
|
2637
|
-
if ($this.
|
|
2666
|
+
if ($this.j1r_1) {
|
|
2638
2667
|
var tmp_0 = Utils_instance;
|
|
2639
2668
|
// Inline function 'kotlin.collections.map' call
|
|
2640
|
-
var this_0 = $this.
|
|
2669
|
+
var this_0 = $this.k1r_1.m2();
|
|
2641
2670
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2642
2671
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2643
2672
|
var tmp0_iterator = this_0.r();
|
|
2644
2673
|
while (tmp0_iterator.s()) {
|
|
2645
2674
|
var item = tmp0_iterator.u();
|
|
2646
2675
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.RuleNode.regenerateCache.<anonymous>' call
|
|
2647
|
-
var tmp$ret$0 = item.
|
|
2676
|
+
var tmp$ret$0 = item.o1n();
|
|
2648
2677
|
destination.o(tmp$ret$0);
|
|
2649
2678
|
}
|
|
2650
|
-
tmp = tmp_0.
|
|
2679
|
+
tmp = tmp_0.h1o(destination);
|
|
2651
2680
|
} else {
|
|
2652
2681
|
var tmp_1 = Utils_instance;
|
|
2653
2682
|
// Inline function 'kotlin.collections.map' call
|
|
2654
|
-
var this_1 = $this.
|
|
2683
|
+
var this_1 = $this.k1r_1.m2();
|
|
2655
2684
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2656
2685
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
2657
2686
|
var tmp0_iterator_0 = this_1.r();
|
|
2658
2687
|
while (tmp0_iterator_0.s()) {
|
|
2659
2688
|
var item_0 = tmp0_iterator_0.u();
|
|
2660
2689
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.RuleNode.regenerateCache.<anonymous>' call
|
|
2661
|
-
var tmp$ret$3 = item_0.
|
|
2690
|
+
var tmp$ret$3 = item_0.o1n();
|
|
2662
2691
|
destination_0.o(tmp$ret$3);
|
|
2663
2692
|
}
|
|
2664
|
-
tmp = tmp_1.
|
|
2693
|
+
tmp = tmp_1.l1o(destination_0);
|
|
2665
2694
|
}
|
|
2666
2695
|
return dequeOf_0(tmp);
|
|
2667
2696
|
}
|
|
@@ -2676,81 +2705,81 @@
|
|
|
2676
2705
|
return it.l();
|
|
2677
2706
|
}
|
|
2678
2707
|
function RuleNode(unificator, ordered) {
|
|
2679
|
-
this.
|
|
2680
|
-
this.
|
|
2708
|
+
this.i1r_1 = unificator;
|
|
2709
|
+
this.j1r_1 = ordered;
|
|
2681
2710
|
var tmp = this;
|
|
2682
2711
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
2683
|
-
tmp.
|
|
2712
|
+
tmp.k1r_1 = LinkedHashMap_init_$Create$();
|
|
2684
2713
|
var tmp_0 = this;
|
|
2685
2714
|
var tmp_1 = Companion_instance_1;
|
|
2686
|
-
tmp_0.
|
|
2715
|
+
tmp_0.l1r_1 = tmp_1.vq(RuleNode$regenerateCache$ref(this));
|
|
2687
2716
|
}
|
|
2688
|
-
protoOf(RuleNode).
|
|
2689
|
-
var tmp0_safe_receiver = this.
|
|
2690
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2717
|
+
protoOf(RuleNode).n1l = function (clause) {
|
|
2718
|
+
var tmp0_safe_receiver = this.k1r_1.x2(nestedFunctor_1(clause, this));
|
|
2719
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.n1l(clause);
|
|
2691
2720
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2692
2721
|
};
|
|
2693
|
-
protoOf(RuleNode).
|
|
2722
|
+
protoOf(RuleNode).m1n = function (clause) {
|
|
2694
2723
|
// Inline function 'kotlin.let' call
|
|
2695
2724
|
// Inline function 'kotlin.contracts.contract' call
|
|
2696
2725
|
var it = nestedFunctor_2(clause, this);
|
|
2697
2726
|
var tmp;
|
|
2698
|
-
if (this.
|
|
2727
|
+
if (this.j1r_1) {
|
|
2699
2728
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2700
|
-
var this_0 = this.
|
|
2729
|
+
var this_0 = this.k1r_1;
|
|
2701
2730
|
var value = this_0.x2(it);
|
|
2702
2731
|
var tmp_0;
|
|
2703
2732
|
if (value == null) {
|
|
2704
2733
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.RuleNode.assertA.<anonymous>.<anonymous>' call
|
|
2705
|
-
var answer = new TopLevelFunctorReteNode(this.
|
|
2734
|
+
var answer = new TopLevelFunctorReteNode(this.i1r_1, this.j1r_1, 0);
|
|
2706
2735
|
this_0.n2(it, answer);
|
|
2707
2736
|
tmp_0 = answer;
|
|
2708
2737
|
} else {
|
|
2709
2738
|
tmp_0 = value;
|
|
2710
2739
|
}
|
|
2711
|
-
tmp_0.
|
|
2740
|
+
tmp_0.m1n(clause.s1o(this));
|
|
2712
2741
|
tmp = Unit_instance;
|
|
2713
2742
|
} else {
|
|
2714
|
-
this.
|
|
2743
|
+
this.n1n(clause);
|
|
2715
2744
|
tmp = Unit_instance;
|
|
2716
2745
|
}
|
|
2717
2746
|
};
|
|
2718
|
-
protoOf(RuleNode).
|
|
2747
|
+
protoOf(RuleNode).n1n = function (clause) {
|
|
2719
2748
|
// Inline function 'kotlin.let' call
|
|
2720
2749
|
// Inline function 'kotlin.contracts.contract' call
|
|
2721
2750
|
var it = nestedFunctor_2(clause, this);
|
|
2722
2751
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2723
|
-
var this_0 = this.
|
|
2752
|
+
var this_0 = this.k1r_1;
|
|
2724
2753
|
var value = this_0.x2(it);
|
|
2725
2754
|
var tmp;
|
|
2726
2755
|
if (value == null) {
|
|
2727
2756
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.RuleNode.assertZ.<anonymous>.<anonymous>' call
|
|
2728
|
-
var answer = new TopLevelFunctorReteNode(this.
|
|
2757
|
+
var answer = new TopLevelFunctorReteNode(this.i1r_1, this.j1r_1, 0);
|
|
2729
2758
|
this_0.n2(it, answer);
|
|
2730
2759
|
tmp = answer;
|
|
2731
2760
|
} else {
|
|
2732
2761
|
tmp = value;
|
|
2733
2762
|
}
|
|
2734
|
-
tmp.
|
|
2763
|
+
tmp.n1n(clause.s1o(this));
|
|
2735
2764
|
};
|
|
2736
|
-
protoOf(RuleNode).
|
|
2737
|
-
var tmp0_safe_receiver = this.
|
|
2738
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2765
|
+
protoOf(RuleNode).v1l = function (clause) {
|
|
2766
|
+
var tmp0_safe_receiver = this.k1r_1.x2(nestedFunctor_1(clause, this));
|
|
2767
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.v1l(clause);
|
|
2739
2768
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2740
2769
|
};
|
|
2741
2770
|
protoOf(RuleNode).l = function () {
|
|
2742
|
-
var tmp = asSequence(this.
|
|
2771
|
+
var tmp = asSequence(this.k1r_1.m2());
|
|
2743
2772
|
return sum(map(tmp, RuleNode$_get_size_$lambda_xjenvf));
|
|
2744
2773
|
};
|
|
2745
|
-
protoOf(RuleNode).
|
|
2774
|
+
protoOf(RuleNode).k1l = function () {
|
|
2746
2775
|
var tmp;
|
|
2747
|
-
if (this.
|
|
2776
|
+
if (this.k1r_1.y()) {
|
|
2748
2777
|
tmp = true;
|
|
2749
2778
|
} else {
|
|
2750
2779
|
var tmp$ret$0;
|
|
2751
2780
|
$l$block_0: {
|
|
2752
2781
|
// Inline function 'kotlin.collections.all' call
|
|
2753
|
-
var this_0 = this.
|
|
2782
|
+
var this_0 = this.k1r_1.m2();
|
|
2754
2783
|
var tmp_0;
|
|
2755
2784
|
if (isInterface(this_0, Collection)) {
|
|
2756
2785
|
tmp_0 = this_0.y();
|
|
@@ -2765,7 +2794,7 @@
|
|
|
2765
2794
|
while (tmp0_iterator.s()) {
|
|
2766
2795
|
var element = tmp0_iterator.u();
|
|
2767
2796
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.RuleNode.<get-isEmpty>.<anonymous>' call
|
|
2768
|
-
if (!element.
|
|
2797
|
+
if (!element.k1l()) {
|
|
2769
2798
|
tmp$ret$0 = false;
|
|
2770
2799
|
break $l$block_0;
|
|
2771
2800
|
}
|
|
@@ -2776,34 +2805,34 @@
|
|
|
2776
2805
|
}
|
|
2777
2806
|
return tmp;
|
|
2778
2807
|
};
|
|
2779
|
-
protoOf(RuleNode).
|
|
2780
|
-
var tmp0_safe_receiver = this.
|
|
2781
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2808
|
+
protoOf(RuleNode).x1l = function (clause) {
|
|
2809
|
+
var tmp0_safe_receiver = this.k1r_1.x2(nestedFunctor_1(clause, this));
|
|
2810
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.x1l(clause);
|
|
2782
2811
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2783
2812
|
};
|
|
2784
|
-
protoOf(RuleNode).
|
|
2785
|
-
return asSequence(this.
|
|
2813
|
+
protoOf(RuleNode).o1n = function () {
|
|
2814
|
+
return asSequence(this.l1r_1.r2());
|
|
2786
2815
|
};
|
|
2787
|
-
protoOf(RuleNode).
|
|
2788
|
-
this.
|
|
2816
|
+
protoOf(RuleNode).p1n = function () {
|
|
2817
|
+
this.l1r_1.xq();
|
|
2789
2818
|
};
|
|
2790
2819
|
function selectArity($this, clause) {
|
|
2791
|
-
return $this.
|
|
2820
|
+
return $this.p1r_1.x2(Utils_instance.d1o(ensureNotNull(clause.wy()), $this.o1r_1));
|
|
2792
2821
|
}
|
|
2793
2822
|
function chooseAssertionBranch($this, clause, op) {
|
|
2794
2823
|
// Inline function 'kotlin.let' call
|
|
2795
2824
|
// Inline function 'kotlin.contracts.contract' call
|
|
2796
2825
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.TopLevelFunctorReteNode.chooseAssertionBranch.<anonymous>' call
|
|
2797
|
-
var it = Utils_instance.
|
|
2826
|
+
var it = Utils_instance.d1o(ensureNotNull(clause.k1n().wy()), $this.o1r_1);
|
|
2798
2827
|
var tmp;
|
|
2799
2828
|
if (it === 0) {
|
|
2800
2829
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2801
|
-
var this_0 = $this.
|
|
2830
|
+
var this_0 = $this.p1r_1;
|
|
2802
2831
|
var value = this_0.x2(it);
|
|
2803
2832
|
var tmp_0;
|
|
2804
2833
|
if (value == null) {
|
|
2805
2834
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.TopLevelFunctorReteNode.chooseAssertionBranch.<anonymous>.<anonymous>' call
|
|
2806
|
-
var answer = new ZeroArityReteNode($this.
|
|
2835
|
+
var answer = new ZeroArityReteNode($this.f1l(), $this.n1r_1);
|
|
2807
2836
|
this_0.n2(it, answer);
|
|
2808
2837
|
tmp_0 = answer;
|
|
2809
2838
|
} else {
|
|
@@ -2812,12 +2841,12 @@
|
|
|
2812
2841
|
tmp = tmp_0;
|
|
2813
2842
|
} else {
|
|
2814
2843
|
// Inline function 'kotlin.collections.getOrPut' call
|
|
2815
|
-
var this_1 = $this.
|
|
2844
|
+
var this_1 = $this.p1r_1;
|
|
2816
2845
|
var value_0 = this_1.x2(it);
|
|
2817
2846
|
var tmp_1;
|
|
2818
2847
|
if (value_0 == null) {
|
|
2819
2848
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.TopLevelFunctorReteNode.chooseAssertionBranch.<anonymous>.<anonymous>' call
|
|
2820
|
-
var answer_0 = new FamilyArityReteNode($this.
|
|
2849
|
+
var answer_0 = new FamilyArityReteNode($this.f1l(), $this.n1r_1, $this.o1r_1);
|
|
2821
2850
|
this_1.n2(it, answer_0);
|
|
2822
2851
|
tmp_1 = answer_0;
|
|
2823
2852
|
} else {
|
|
@@ -2829,34 +2858,34 @@
|
|
|
2829
2858
|
}
|
|
2830
2859
|
function regenerateCache_4($this) {
|
|
2831
2860
|
var tmp;
|
|
2832
|
-
if ($this.
|
|
2861
|
+
if ($this.n1r_1) {
|
|
2833
2862
|
var tmp_0 = Utils_instance;
|
|
2834
2863
|
// Inline function 'kotlin.collections.map' call
|
|
2835
|
-
var this_0 = $this.
|
|
2864
|
+
var this_0 = $this.p1r_1.m2();
|
|
2836
2865
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2837
2866
|
var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
|
|
2838
2867
|
var tmp0_iterator = this_0.r();
|
|
2839
2868
|
while (tmp0_iterator.s()) {
|
|
2840
2869
|
var item = tmp0_iterator.u();
|
|
2841
2870
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.TopLevelFunctorReteNode.regenerateCache.<anonymous>' call
|
|
2842
|
-
var tmp$ret$0 = item.
|
|
2871
|
+
var tmp$ret$0 = item.o1n();
|
|
2843
2872
|
destination.o(tmp$ret$0);
|
|
2844
2873
|
}
|
|
2845
|
-
tmp = tmp_0.
|
|
2874
|
+
tmp = tmp_0.h1o(destination);
|
|
2846
2875
|
} else {
|
|
2847
2876
|
var tmp_1 = Utils_instance;
|
|
2848
2877
|
// Inline function 'kotlin.collections.map' call
|
|
2849
|
-
var this_1 = $this.
|
|
2878
|
+
var this_1 = $this.p1r_1.m2();
|
|
2850
2879
|
// Inline function 'kotlin.collections.mapTo' call
|
|
2851
2880
|
var destination_0 = ArrayList_init_$Create$(collectionSizeOrDefault(this_1, 10));
|
|
2852
2881
|
var tmp0_iterator_0 = this_1.r();
|
|
2853
2882
|
while (tmp0_iterator_0.s()) {
|
|
2854
2883
|
var item_0 = tmp0_iterator_0.u();
|
|
2855
2884
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.TopLevelFunctorReteNode.regenerateCache.<anonymous>' call
|
|
2856
|
-
var tmp$ret$3 = item_0.
|
|
2885
|
+
var tmp$ret$3 = item_0.o1n();
|
|
2857
2886
|
destination_0.o(tmp$ret$3);
|
|
2858
2887
|
}
|
|
2859
|
-
tmp = tmp_1.
|
|
2888
|
+
tmp = tmp_1.l1o(destination_0);
|
|
2860
2889
|
}
|
|
2861
2890
|
return dequeOf_0(tmp);
|
|
2862
2891
|
}
|
|
@@ -2872,7 +2901,7 @@
|
|
|
2872
2901
|
}
|
|
2873
2902
|
function ReteNode$assertA$ref() {
|
|
2874
2903
|
var l = function (p0, p1) {
|
|
2875
|
-
p0.
|
|
2904
|
+
p0.m1n(p1);
|
|
2876
2905
|
return Unit_instance;
|
|
2877
2906
|
};
|
|
2878
2907
|
l.callableName = 'assertA';
|
|
@@ -2880,7 +2909,7 @@
|
|
|
2880
2909
|
}
|
|
2881
2910
|
function ReteNode$assertZ$ref() {
|
|
2882
2911
|
var l = function (p0, p1) {
|
|
2883
|
-
p0.
|
|
2912
|
+
p0.n1n(p1);
|
|
2884
2913
|
return Unit_instance;
|
|
2885
2914
|
};
|
|
2886
2915
|
l.callableName = 'assertZ';
|
|
@@ -2888,28 +2917,28 @@
|
|
|
2888
2917
|
}
|
|
2889
2918
|
function TopLevelFunctorReteNode(unificator, ordered, nestingLevel) {
|
|
2890
2919
|
FunctorNode.call(this, unificator);
|
|
2891
|
-
this.
|
|
2892
|
-
this.
|
|
2920
|
+
this.n1r_1 = ordered;
|
|
2921
|
+
this.o1r_1 = nestingLevel;
|
|
2893
2922
|
var tmp = this;
|
|
2894
2923
|
// Inline function 'kotlin.collections.mutableMapOf' call
|
|
2895
|
-
tmp.
|
|
2924
|
+
tmp.p1r_1 = LinkedHashMap_init_$Create$();
|
|
2896
2925
|
var tmp_0 = this;
|
|
2897
2926
|
var tmp_1 = Companion_instance_1;
|
|
2898
|
-
tmp_0.
|
|
2927
|
+
tmp_0.q1r_1 = tmp_1.vq(TopLevelFunctorReteNode$regenerateCache$ref(this));
|
|
2899
2928
|
}
|
|
2900
2929
|
protoOf(TopLevelFunctorReteNode).l = function () {
|
|
2901
|
-
var tmp = asSequence(this.
|
|
2930
|
+
var tmp = asSequence(this.p1r_1.m2());
|
|
2902
2931
|
return sum(map(tmp, TopLevelFunctorReteNode$_get_size_$lambda_6i36rr));
|
|
2903
2932
|
};
|
|
2904
|
-
protoOf(TopLevelFunctorReteNode).
|
|
2933
|
+
protoOf(TopLevelFunctorReteNode).k1l = function () {
|
|
2905
2934
|
var tmp;
|
|
2906
|
-
if (this.
|
|
2935
|
+
if (this.p1r_1.y()) {
|
|
2907
2936
|
tmp = true;
|
|
2908
2937
|
} else {
|
|
2909
2938
|
var tmp$ret$0;
|
|
2910
2939
|
$l$block_0: {
|
|
2911
2940
|
// Inline function 'kotlin.collections.all' call
|
|
2912
|
-
var this_0 = this.
|
|
2941
|
+
var this_0 = this.p1r_1.m2();
|
|
2913
2942
|
var tmp_0;
|
|
2914
2943
|
if (isInterface(this_0, Collection)) {
|
|
2915
2944
|
tmp_0 = this_0.y();
|
|
@@ -2924,7 +2953,7 @@
|
|
|
2924
2953
|
while (tmp0_iterator.s()) {
|
|
2925
2954
|
var element = tmp0_iterator.u();
|
|
2926
2955
|
// Inline function 'it.unibo.tuprolog.collections.rete.custom.nodes.TopLevelFunctorReteNode.<get-isEmpty>.<anonymous>' call
|
|
2927
|
-
if (!element.
|
|
2956
|
+
if (!element.k1l()) {
|
|
2928
2957
|
tmp$ret$0 = false;
|
|
2929
2958
|
break $l$block_0;
|
|
2930
2959
|
}
|
|
@@ -2935,90 +2964,90 @@
|
|
|
2935
2964
|
}
|
|
2936
2965
|
return tmp;
|
|
2937
2966
|
};
|
|
2938
|
-
protoOf(TopLevelFunctorReteNode).
|
|
2967
|
+
protoOf(TopLevelFunctorReteNode).n1l = function (clause) {
|
|
2939
2968
|
var tmp0_safe_receiver = selectArity(this, clause);
|
|
2940
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2969
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.n1l(clause);
|
|
2941
2970
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2942
2971
|
};
|
|
2943
|
-
protoOf(TopLevelFunctorReteNode).
|
|
2944
|
-
var tmp = clause.
|
|
2972
|
+
protoOf(TopLevelFunctorReteNode).m1n = function (clause) {
|
|
2973
|
+
var tmp = clause.s1o(this);
|
|
2945
2974
|
chooseAssertionBranch(this, tmp, ReteNode$assertA$ref());
|
|
2946
2975
|
};
|
|
2947
|
-
protoOf(TopLevelFunctorReteNode).
|
|
2948
|
-
var tmp = clause.
|
|
2976
|
+
protoOf(TopLevelFunctorReteNode).n1n = function (clause) {
|
|
2977
|
+
var tmp = clause.s1o(this);
|
|
2949
2978
|
chooseAssertionBranch(this, tmp, ReteNode$assertZ$ref());
|
|
2950
2979
|
};
|
|
2951
|
-
protoOf(TopLevelFunctorReteNode).
|
|
2980
|
+
protoOf(TopLevelFunctorReteNode).v1l = function (clause) {
|
|
2952
2981
|
var tmp0_safe_receiver = selectArity(this, clause);
|
|
2953
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2982
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.v1l(clause);
|
|
2954
2983
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2955
2984
|
};
|
|
2956
|
-
protoOf(TopLevelFunctorReteNode).
|
|
2985
|
+
protoOf(TopLevelFunctorReteNode).x1l = function (clause) {
|
|
2957
2986
|
var tmp0_safe_receiver = selectArity(this, clause);
|
|
2958
|
-
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.
|
|
2987
|
+
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.x1l(clause);
|
|
2959
2988
|
return tmp1_elvis_lhs == null ? emptySequence() : tmp1_elvis_lhs;
|
|
2960
2989
|
};
|
|
2961
|
-
protoOf(TopLevelFunctorReteNode).
|
|
2962
|
-
return asSequence(this.
|
|
2990
|
+
protoOf(TopLevelFunctorReteNode).o1n = function () {
|
|
2991
|
+
return asSequence(this.q1r_1.r2());
|
|
2963
2992
|
};
|
|
2964
|
-
protoOf(TopLevelFunctorReteNode).
|
|
2965
|
-
this.
|
|
2993
|
+
protoOf(TopLevelFunctorReteNode).p1n = function () {
|
|
2994
|
+
this.q1r_1.xq();
|
|
2966
2995
|
};
|
|
2967
2996
|
function ZeroArityReteNode$retractFirst$lambda(it) {
|
|
2968
|
-
return it.
|
|
2997
|
+
return it.k1n();
|
|
2969
2998
|
}
|
|
2970
2999
|
function ZeroArityReteNode$get$lambda(this$0, $clause) {
|
|
2971
3000
|
return function (it) {
|
|
2972
|
-
return this$0.
|
|
3001
|
+
return this$0.f1l().match(it.k1n(), $clause);
|
|
2973
3002
|
};
|
|
2974
3003
|
}
|
|
2975
3004
|
function ZeroArityReteNode$get$lambda_0(it) {
|
|
2976
|
-
return it.
|
|
3005
|
+
return it.k1n();
|
|
2977
3006
|
}
|
|
2978
3007
|
function ZeroArityReteNode$retractAll$lambda(it) {
|
|
2979
|
-
return it.
|
|
3008
|
+
return it.k1n();
|
|
2980
3009
|
}
|
|
2981
3010
|
function ZeroArityReteNode(unificator, ordered) {
|
|
2982
3011
|
ArityNode.call(this, unificator);
|
|
2983
|
-
this.
|
|
2984
|
-
this.
|
|
3012
|
+
this.s1r_1 = ordered;
|
|
3013
|
+
this.t1r_1 = dequeOf([]);
|
|
2985
3014
|
}
|
|
2986
|
-
protoOf(ZeroArityReteNode).
|
|
2987
|
-
var tmp = this.
|
|
3015
|
+
protoOf(ZeroArityReteNode).v1l = function (clause) {
|
|
3016
|
+
var tmp = this.l1n(this.t1r_1, clause);
|
|
2988
3017
|
return buffered(take(map(tmp, ZeroArityReteNode$retractFirst$lambda), 1));
|
|
2989
3018
|
};
|
|
2990
3019
|
protoOf(ZeroArityReteNode).l = function () {
|
|
2991
|
-
return this.
|
|
3020
|
+
return this.t1r_1.l();
|
|
2992
3021
|
};
|
|
2993
|
-
protoOf(ZeroArityReteNode).
|
|
2994
|
-
return this.
|
|
3022
|
+
protoOf(ZeroArityReteNode).k1l = function () {
|
|
3023
|
+
return this.t1r_1.y();
|
|
2995
3024
|
};
|
|
2996
|
-
protoOf(ZeroArityReteNode).
|
|
2997
|
-
var tmp = asSequence(this.
|
|
3025
|
+
protoOf(ZeroArityReteNode).n1l = function (clause) {
|
|
3026
|
+
var tmp = asSequence(this.t1r_1);
|
|
2998
3027
|
var tmp_0 = filter(tmp, ZeroArityReteNode$get$lambda(this, clause));
|
|
2999
3028
|
return map(tmp_0, ZeroArityReteNode$get$lambda_0);
|
|
3000
3029
|
};
|
|
3001
|
-
protoOf(ZeroArityReteNode).
|
|
3002
|
-
if (this.
|
|
3003
|
-
addFirst(this.
|
|
3030
|
+
protoOf(ZeroArityReteNode).m1n = function (clause) {
|
|
3031
|
+
if (this.s1r_1) {
|
|
3032
|
+
addFirst(this.t1r_1, Companion_instance_8.a1p(clause.s1o(this), this));
|
|
3004
3033
|
} else {
|
|
3005
|
-
this.
|
|
3034
|
+
this.n1n(clause);
|
|
3006
3035
|
}
|
|
3007
3036
|
};
|
|
3008
|
-
protoOf(ZeroArityReteNode).
|
|
3009
|
-
this.
|
|
3037
|
+
protoOf(ZeroArityReteNode).n1n = function (clause) {
|
|
3038
|
+
this.t1r_1.o(Companion_instance_8.a1p(clause.s1o(this), this));
|
|
3010
3039
|
};
|
|
3011
|
-
protoOf(ZeroArityReteNode).
|
|
3012
|
-
var tmp = this.
|
|
3040
|
+
protoOf(ZeroArityReteNode).x1l = function (clause) {
|
|
3041
|
+
var tmp = this.l1n(this.t1r_1, clause);
|
|
3013
3042
|
return buffered(map(tmp, ZeroArityReteNode$retractAll$lambda));
|
|
3014
3043
|
};
|
|
3015
|
-
protoOf(ZeroArityReteNode).
|
|
3016
|
-
return asSequence(this.
|
|
3044
|
+
protoOf(ZeroArityReteNode).o1n = function () {
|
|
3045
|
+
return asSequence(this.t1r_1);
|
|
3017
3046
|
};
|
|
3018
|
-
protoOf(ZeroArityReteNode).
|
|
3047
|
+
protoOf(ZeroArityReteNode).p1n = function () {
|
|
3019
3048
|
};
|
|
3020
|
-
protoOf(ZeroArityReteNode).
|
|
3021
|
-
this.
|
|
3049
|
+
protoOf(ZeroArityReteNode).z1o = function (indexed) {
|
|
3050
|
+
this.t1r_1.p(indexed);
|
|
3022
3051
|
};
|
|
3023
3052
|
function AbstractTheory$get$lambda(it) {
|
|
3024
3053
|
return it.castToRule();
|
|
@@ -3027,49 +3056,49 @@
|
|
|
3027
3056
|
return it.castToRule();
|
|
3028
3057
|
}
|
|
3029
3058
|
function AbstractTheory(tags) {
|
|
3030
|
-
this.
|
|
3059
|
+
this.u1r_1 = tags;
|
|
3031
3060
|
}
|
|
3032
3061
|
protoOf(AbstractTheory).vt = function () {
|
|
3033
|
-
return this.
|
|
3062
|
+
return this.u1r_1;
|
|
3034
3063
|
};
|
|
3035
|
-
protoOf(AbstractTheory).
|
|
3064
|
+
protoOf(AbstractTheory).v1r = function () {
|
|
3036
3065
|
return this;
|
|
3037
3066
|
};
|
|
3038
3067
|
protoOf(AbstractTheory).toImmutableTheory = function () {
|
|
3039
|
-
return this.
|
|
3068
|
+
return this.v1r();
|
|
3040
3069
|
};
|
|
3041
|
-
protoOf(AbstractTheory).
|
|
3042
|
-
return plus_2.call(this, TheoryUtils_instance.
|
|
3070
|
+
protoOf(AbstractTheory).w1r = function (clause) {
|
|
3071
|
+
return plus_2.call(this, TheoryUtils_instance.b1m(clause));
|
|
3043
3072
|
};
|
|
3044
3073
|
protoOf(AbstractTheory).plus = function (clause) {
|
|
3045
|
-
return this.
|
|
3074
|
+
return this.w1r(clause);
|
|
3046
3075
|
};
|
|
3047
|
-
protoOf(AbstractTheory).
|
|
3076
|
+
protoOf(AbstractTheory).m1l = function (clause) {
|
|
3048
3077
|
return any(this.get(clause));
|
|
3049
3078
|
};
|
|
3050
3079
|
protoOf(AbstractTheory).contains = function (clause) {
|
|
3051
|
-
return this.
|
|
3080
|
+
return this.m1l(clause);
|
|
3052
3081
|
};
|
|
3053
|
-
protoOf(AbstractTheory).
|
|
3054
|
-
return this.
|
|
3082
|
+
protoOf(AbstractTheory).x1r = function (head) {
|
|
3083
|
+
return this.m1l(Companion_instance_2.of(head, [Companion_getInstance().anonymous()]));
|
|
3055
3084
|
};
|
|
3056
3085
|
protoOf(AbstractTheory).containsHead = function (head) {
|
|
3057
|
-
return this.
|
|
3086
|
+
return this.x1r(head);
|
|
3058
3087
|
};
|
|
3059
|
-
protoOf(AbstractTheory).
|
|
3060
|
-
return any(this.
|
|
3088
|
+
protoOf(AbstractTheory).y1r = function (indicator) {
|
|
3089
|
+
return any(this.z1r(indicator));
|
|
3061
3090
|
};
|
|
3062
3091
|
protoOf(AbstractTheory).containsIndicator = function (indicator) {
|
|
3063
|
-
return this.
|
|
3092
|
+
return this.y1r(indicator);
|
|
3064
3093
|
};
|
|
3065
|
-
protoOf(AbstractTheory).
|
|
3094
|
+
protoOf(AbstractTheory).a1s = function (head) {
|
|
3066
3095
|
var tmp = this.get(Companion_instance_2.of(head, [Companion_getInstance().anonymous()]));
|
|
3067
3096
|
return map(tmp, AbstractTheory$get$lambda);
|
|
3068
3097
|
};
|
|
3069
3098
|
protoOf(AbstractTheory).getByHead = function (head) {
|
|
3070
|
-
return this.
|
|
3099
|
+
return this.a1s(head);
|
|
3071
3100
|
};
|
|
3072
|
-
protoOf(AbstractTheory).
|
|
3101
|
+
protoOf(AbstractTheory).z1r = function (indicator) {
|
|
3073
3102
|
// Inline function 'kotlin.require' call
|
|
3074
3103
|
// Inline function 'kotlin.contracts.contract' call
|
|
3075
3104
|
if (!indicator.gz()) {
|
|
@@ -3095,9 +3124,9 @@
|
|
|
3095
3124
|
return map(tmp_2, AbstractTheory$get$lambda_0);
|
|
3096
3125
|
};
|
|
3097
3126
|
protoOf(AbstractTheory).getByIndicator = function (indicator) {
|
|
3098
|
-
return this.
|
|
3127
|
+
return this.z1r(indicator);
|
|
3099
3128
|
};
|
|
3100
|
-
protoOf(AbstractTheory).
|
|
3129
|
+
protoOf(AbstractTheory).b1s = function (indicator) {
|
|
3101
3130
|
// Inline function 'kotlin.require' call
|
|
3102
3131
|
// Inline function 'kotlin.contracts.contract' call
|
|
3103
3132
|
if (!indicator.gz()) {
|
|
@@ -3105,41 +3134,41 @@
|
|
|
3105
3134
|
var message = 'The provided indicator is not well formed: ' + indicator;
|
|
3106
3135
|
throw IllegalArgumentException_init_$Create$(toString(message));
|
|
3107
3136
|
}
|
|
3108
|
-
return this.retractAllByHead(Companion_getInstance_0().template(ensureNotNull(indicator.z10()), ensureNotNull(indicator.a11()))).
|
|
3137
|
+
return this.retractAllByHead(Companion_getInstance_0().template(ensureNotNull(indicator.z10()), ensureNotNull(indicator.a11()))).c1s();
|
|
3109
3138
|
};
|
|
3110
3139
|
protoOf(AbstractTheory).abolish = function (indicator) {
|
|
3111
|
-
return this.
|
|
3140
|
+
return this.b1s(indicator);
|
|
3112
3141
|
};
|
|
3113
3142
|
protoOf(AbstractTheory).toString = function () {
|
|
3114
|
-
return '' + getKClassFromExpression(this).s6() + '{ ' + joinToString(this.
|
|
3143
|
+
return '' + getKClassFromExpression(this).s6() + '{ ' + joinToString(this.p1l(), '. ') + ' }';
|
|
3115
3144
|
};
|
|
3116
|
-
protoOf(AbstractTheory).
|
|
3145
|
+
protoOf(AbstractTheory).d1s = function (asPrologText) {
|
|
3117
3146
|
var tmp;
|
|
3118
3147
|
if (asPrologText) {
|
|
3119
|
-
tmp = joinToString(this.
|
|
3148
|
+
tmp = joinToString(this.p1l(), '.\n', '', '.\n');
|
|
3120
3149
|
} else {
|
|
3121
3150
|
tmp = this.toString();
|
|
3122
3151
|
}
|
|
3123
3152
|
return tmp;
|
|
3124
3153
|
};
|
|
3125
3154
|
protoOf(AbstractTheory).toStringAsProlog = function (asPrologText) {
|
|
3126
|
-
return this.
|
|
3155
|
+
return this.d1s(asPrologText);
|
|
3127
3156
|
};
|
|
3128
3157
|
protoOf(AbstractTheory).r = function () {
|
|
3129
|
-
return this.
|
|
3158
|
+
return this.p1l().r();
|
|
3130
3159
|
};
|
|
3131
3160
|
protoOf(AbstractTheory).equals = function (other) {
|
|
3132
3161
|
if (other == null)
|
|
3133
3162
|
return false;
|
|
3134
3163
|
if (!(!(other == null) ? isInterface(other, Theory) : false))
|
|
3135
3164
|
return false;
|
|
3136
|
-
return this.
|
|
3165
|
+
return this.e1s(other, true);
|
|
3137
3166
|
};
|
|
3138
|
-
protoOf(AbstractTheory).
|
|
3167
|
+
protoOf(AbstractTheory).e1s = function (other, useVarCompleteName) {
|
|
3139
3168
|
if (this === other)
|
|
3140
3169
|
return true;
|
|
3141
|
-
var i = this.
|
|
3142
|
-
var j = other.
|
|
3170
|
+
var i = this.p1l().r();
|
|
3171
|
+
var j = other.p1l().r();
|
|
3143
3172
|
while (i.s() ? j.s() : false) {
|
|
3144
3173
|
if (!i.u().equalsUsingVarCompleteNames(j.u(), useVarCompleteName)) {
|
|
3145
3174
|
return false;
|
|
@@ -3148,7 +3177,7 @@
|
|
|
3148
3177
|
return i.s() === j.s();
|
|
3149
3178
|
};
|
|
3150
3179
|
protoOf(AbstractTheory).equalsUsingVarCompleteNames = function (other, useVarCompleteName) {
|
|
3151
|
-
return this.
|
|
3180
|
+
return this.e1s(other, useVarCompleteName);
|
|
3152
3181
|
};
|
|
3153
3182
|
protoOf(AbstractTheory).hashCode = function () {
|
|
3154
3183
|
// Inline function 'kotlin.hashCode' call
|
|
@@ -3156,7 +3185,7 @@
|
|
|
3156
3185
|
var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : hashCode(tmp0_safe_receiver);
|
|
3157
3186
|
var base = tmp1_elvis_lhs == null ? 0 : tmp1_elvis_lhs;
|
|
3158
3187
|
var result = base ^ (base >>> 32 | 0);
|
|
3159
|
-
var tmp0_iterator = this.
|
|
3188
|
+
var tmp0_iterator = this.p1l().r();
|
|
3160
3189
|
while (tmp0_iterator.s()) {
|
|
3161
3190
|
var clause = tmp0_iterator.u();
|
|
3162
3191
|
result = imul(31, result) + clause.hashCode() | 0;
|
|
@@ -3172,88 +3201,318 @@
|
|
|
3172
3201
|
}
|
|
3173
3202
|
return i;
|
|
3174
3203
|
};
|
|
3175
|
-
protoOf(AbstractTheory).
|
|
3176
|
-
return !this.
|
|
3204
|
+
protoOf(AbstractTheory).k1l = function () {
|
|
3205
|
+
return !this.f1s();
|
|
3177
3206
|
};
|
|
3178
|
-
protoOf(AbstractTheory).
|
|
3207
|
+
protoOf(AbstractTheory).f1s = function () {
|
|
3179
3208
|
return this.r().s();
|
|
3180
3209
|
};
|
|
3181
|
-
protoOf(AbstractTheory).
|
|
3210
|
+
protoOf(AbstractTheory).g1s = function (unificator) {
|
|
3182
3211
|
var tmp;
|
|
3183
|
-
if (!equals(unificator, this.
|
|
3184
|
-
tmp = this.
|
|
3212
|
+
if (!equals(unificator, this.f1l())) {
|
|
3213
|
+
tmp = this.h1s(asSequence(this.p1l()), VOID, unificator);
|
|
3185
3214
|
} else {
|
|
3186
3215
|
tmp = this;
|
|
3187
3216
|
}
|
|
3188
3217
|
return tmp;
|
|
3189
3218
|
};
|
|
3190
3219
|
protoOf(AbstractTheory).setUnificator = function (unificator) {
|
|
3191
|
-
return this.
|
|
3220
|
+
return this.g1s(unificator);
|
|
3192
3221
|
};
|
|
3193
|
-
protoOf(AbstractTheory).
|
|
3222
|
+
protoOf(AbstractTheory).i1s = function (theory) {
|
|
3194
3223
|
var tmp;
|
|
3195
|
-
if (theory.
|
|
3196
|
-
tmp = this.
|
|
3224
|
+
if (theory.f1s()) {
|
|
3225
|
+
tmp = this.h1s(plus_0(asSequence(this.p1l()), TheoryUtils_instance.j1s(asSequence(theory.p1l()))));
|
|
3197
3226
|
} else {
|
|
3198
3227
|
tmp = this;
|
|
3199
3228
|
}
|
|
3200
3229
|
return tmp;
|
|
3201
3230
|
};
|
|
3202
3231
|
protoOf(AbstractTheory).plusTheory = function (theory) {
|
|
3203
|
-
return this.
|
|
3232
|
+
return this.i1s(theory);
|
|
3204
3233
|
};
|
|
3205
|
-
protoOf(AbstractTheory).
|
|
3206
|
-
return this.
|
|
3234
|
+
protoOf(AbstractTheory).k1s = function (clause) {
|
|
3235
|
+
return this.h1s(plus_0(TheoryUtils_instance.l1s([clause]), asSequence(this.p1l())));
|
|
3207
3236
|
};
|
|
3208
3237
|
protoOf(AbstractTheory).assertA = function (clause) {
|
|
3209
|
-
return this.
|
|
3238
|
+
return this.k1s(clause);
|
|
3210
3239
|
};
|
|
3211
|
-
protoOf(AbstractTheory).
|
|
3212
|
-
return this.
|
|
3240
|
+
protoOf(AbstractTheory).m1s = function (clauses) {
|
|
3241
|
+
return this.h1s(plus_0(TheoryUtils_instance.j1s(asSequence(clauses)), asSequence(this.p1l())));
|
|
3213
3242
|
};
|
|
3214
3243
|
protoOf(AbstractTheory).assertAIterable = function (clauses) {
|
|
3215
|
-
return this.
|
|
3244
|
+
return this.m1s(clauses);
|
|
3216
3245
|
};
|
|
3217
|
-
protoOf(AbstractTheory).
|
|
3218
|
-
return this.
|
|
3246
|
+
protoOf(AbstractTheory).n1s = function (clauses) {
|
|
3247
|
+
return this.h1s(plus_0(TheoryUtils_instance.j1s(clauses), asSequence(this.p1l())));
|
|
3219
3248
|
};
|
|
3220
3249
|
protoOf(AbstractTheory).assertASequence = function (clauses) {
|
|
3221
|
-
return this.
|
|
3250
|
+
return this.n1s(clauses);
|
|
3222
3251
|
};
|
|
3223
|
-
protoOf(AbstractTheory).
|
|
3224
|
-
return this.
|
|
3252
|
+
protoOf(AbstractTheory).o1s = function (clause) {
|
|
3253
|
+
return this.h1s(plus_0(asSequence(this.p1l()), TheoryUtils_instance.j1s(sequenceOf([clause]))));
|
|
3225
3254
|
};
|
|
3226
3255
|
protoOf(AbstractTheory).assertZ = function (clause) {
|
|
3227
|
-
return this.
|
|
3256
|
+
return this.o1s(clause);
|
|
3228
3257
|
};
|
|
3229
|
-
protoOf(AbstractTheory).
|
|
3230
|
-
return this.
|
|
3258
|
+
protoOf(AbstractTheory).p1s = function (clauses) {
|
|
3259
|
+
return this.h1s(plus_0(asSequence(this.p1l()), asSequence(TheoryUtils_instance.m1m(clauses))));
|
|
3231
3260
|
};
|
|
3232
3261
|
protoOf(AbstractTheory).assertZIterable = function (clauses) {
|
|
3233
|
-
return this.
|
|
3262
|
+
return this.p1s(clauses);
|
|
3234
3263
|
};
|
|
3235
|
-
protoOf(AbstractTheory).
|
|
3236
|
-
return this.
|
|
3264
|
+
protoOf(AbstractTheory).q1s = function (clauses) {
|
|
3265
|
+
return this.h1s(plus_0(asSequence(this.p1l()), TheoryUtils_instance.j1s(clauses)));
|
|
3237
3266
|
};
|
|
3238
3267
|
protoOf(AbstractTheory).assertZSequence = function (clauses) {
|
|
3239
|
-
return this.
|
|
3268
|
+
return this.q1s(clauses);
|
|
3240
3269
|
};
|
|
3241
|
-
protoOf(AbstractTheory).
|
|
3270
|
+
protoOf(AbstractTheory).h1s = function (clauses, tags, unificator, $super) {
|
|
3242
3271
|
tags = tags === VOID ? this.vt() : tags;
|
|
3243
|
-
unificator = unificator === VOID ? this.
|
|
3244
|
-
return $super === VOID ? this.
|
|
3272
|
+
unificator = unificator === VOID ? this.f1l() : unificator;
|
|
3273
|
+
return $super === VOID ? this.r1s(clauses, tags, unificator) : $super.r1s.call(this, clauses, tags, unificator);
|
|
3245
3274
|
};
|
|
3246
|
-
protoOf(AbstractTheory).
|
|
3247
|
-
return this.
|
|
3275
|
+
protoOf(AbstractTheory).s1s = function (clauses) {
|
|
3276
|
+
return this.t1s(asIterable(clauses));
|
|
3248
3277
|
};
|
|
3249
3278
|
protoOf(AbstractTheory).retractSequence = function (clauses) {
|
|
3250
|
-
return this.
|
|
3279
|
+
return this.s1s(clauses);
|
|
3251
3280
|
};
|
|
3252
|
-
protoOf(AbstractTheory).
|
|
3281
|
+
protoOf(AbstractTheory).u1s = function () {
|
|
3253
3282
|
return this;
|
|
3254
3283
|
};
|
|
3255
3284
|
protoOf(AbstractTheory).clone = function () {
|
|
3256
|
-
return this.
|
|
3285
|
+
return this.u1s();
|
|
3286
|
+
};
|
|
3287
|
+
function Default() {
|
|
3288
|
+
Default_instance = this;
|
|
3289
|
+
this.w1s_1 = new IndexedTheoryFactory(Companion_getInstance_1().c1l());
|
|
3290
|
+
}
|
|
3291
|
+
protoOf(Default).f1l = function () {
|
|
3292
|
+
return this.w1s_1.x1s_1;
|
|
3293
|
+
};
|
|
3294
|
+
protoOf(Default).emptyMutableTheory = function () {
|
|
3295
|
+
return this.w1s_1.emptyMutableTheory();
|
|
3296
|
+
};
|
|
3297
|
+
protoOf(Default).emptyMutableTheoryWithUnificator = function (unificator) {
|
|
3298
|
+
return this.w1s_1.y1s(unificator);
|
|
3299
|
+
};
|
|
3300
|
+
protoOf(Default).emptyTheory = function () {
|
|
3301
|
+
return this.w1s_1.emptyTheory();
|
|
3302
|
+
};
|
|
3303
|
+
protoOf(Default).emptyTheoryWithUnificator = function (unificator) {
|
|
3304
|
+
return this.w1s_1.z1s(unificator);
|
|
3305
|
+
};
|
|
3306
|
+
protoOf(Default).mutableTheoryOfWithUnificator = function (unificator, clauses) {
|
|
3307
|
+
return this.w1s_1.a1t(unificator, clauses);
|
|
3308
|
+
};
|
|
3309
|
+
protoOf(Default).mutableTheoryOf = function (clauses) {
|
|
3310
|
+
return this.w1s_1.mutableTheoryOf(clauses);
|
|
3311
|
+
};
|
|
3312
|
+
protoOf(Default).mutableTheoryOfIterable = function (clauses) {
|
|
3313
|
+
return this.w1s_1.mutableTheoryOfIterable(clauses);
|
|
3314
|
+
};
|
|
3315
|
+
protoOf(Default).mutableTheoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3316
|
+
return this.w1s_1.b1t(clauses, unificator);
|
|
3317
|
+
};
|
|
3318
|
+
protoOf(Default).mutableTheoryOfSequence = function (clauses) {
|
|
3319
|
+
return this.w1s_1.mutableTheoryOfSequence(clauses);
|
|
3320
|
+
};
|
|
3321
|
+
protoOf(Default).mutableTheoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3322
|
+
return this.w1s_1.c1t(clauses, unificator);
|
|
3323
|
+
};
|
|
3324
|
+
protoOf(Default).theoryOfWithUnificator = function (unificator, clauses) {
|
|
3325
|
+
return this.w1s_1.d1t(unificator, clauses);
|
|
3326
|
+
};
|
|
3327
|
+
protoOf(Default).theoryOf = function (clauses) {
|
|
3328
|
+
return this.w1s_1.theoryOf(clauses);
|
|
3329
|
+
};
|
|
3330
|
+
protoOf(Default).theoryOfIterable = function (clauses) {
|
|
3331
|
+
return this.w1s_1.theoryOfIterable(clauses);
|
|
3332
|
+
};
|
|
3333
|
+
protoOf(Default).theoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3334
|
+
return this.w1s_1.e1t(clauses, unificator);
|
|
3335
|
+
};
|
|
3336
|
+
protoOf(Default).theoryOfSequence = function (clauses) {
|
|
3337
|
+
return this.w1s_1.theoryOfSequence(clauses);
|
|
3338
|
+
};
|
|
3339
|
+
protoOf(Default).theoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3340
|
+
return this.w1s_1.f1t(clauses, unificator);
|
|
3341
|
+
};
|
|
3342
|
+
var Default_instance;
|
|
3343
|
+
function Default_getInstance() {
|
|
3344
|
+
if (Default_instance == null)
|
|
3345
|
+
new Default();
|
|
3346
|
+
return Default_instance;
|
|
3347
|
+
}
|
|
3348
|
+
function IndexedTheoryFactory(unificator) {
|
|
3349
|
+
this.x1s_1 = unificator;
|
|
3350
|
+
}
|
|
3351
|
+
protoOf(IndexedTheoryFactory).f1l = function () {
|
|
3352
|
+
return this.x1s_1;
|
|
3353
|
+
};
|
|
3354
|
+
protoOf(IndexedTheoryFactory).z1s = function (unificator) {
|
|
3355
|
+
return IndexedTheory_init_$Create$(unificator, emptyList());
|
|
3356
|
+
};
|
|
3357
|
+
protoOf(IndexedTheoryFactory).emptyTheoryWithUnificator = function (unificator) {
|
|
3358
|
+
return this.z1s(unificator);
|
|
3359
|
+
};
|
|
3360
|
+
protoOf(IndexedTheoryFactory).e1t = function (clauses, unificator) {
|
|
3361
|
+
return IndexedTheory_init_$Create$(unificator, clauses);
|
|
3362
|
+
};
|
|
3363
|
+
protoOf(IndexedTheoryFactory).theoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3364
|
+
return this.e1t(clauses, unificator);
|
|
3365
|
+
};
|
|
3366
|
+
protoOf(IndexedTheoryFactory).d1t = function (unificator, clauses) {
|
|
3367
|
+
return IndexedTheory_init_$Create$(unificator, asIterable_0(clauses));
|
|
3368
|
+
};
|
|
3369
|
+
protoOf(IndexedTheoryFactory).theoryOfWithUnificator = function (unificator, clauses) {
|
|
3370
|
+
return this.d1t(unificator, clauses);
|
|
3371
|
+
};
|
|
3372
|
+
protoOf(IndexedTheoryFactory).f1t = function (clauses, unificator) {
|
|
3373
|
+
return IndexedTheory_init_$Create$_0(unificator, clauses);
|
|
3374
|
+
};
|
|
3375
|
+
protoOf(IndexedTheoryFactory).theoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3376
|
+
return this.f1t(clauses, unificator);
|
|
3377
|
+
};
|
|
3378
|
+
protoOf(IndexedTheoryFactory).y1s = function (unificator) {
|
|
3379
|
+
return MutableIndexedTheory_init_$Create$(unificator, emptyList());
|
|
3380
|
+
};
|
|
3381
|
+
protoOf(IndexedTheoryFactory).emptyMutableTheoryWithUnificator = function (unificator) {
|
|
3382
|
+
return this.y1s(unificator);
|
|
3383
|
+
};
|
|
3384
|
+
protoOf(IndexedTheoryFactory).b1t = function (clauses, unificator) {
|
|
3385
|
+
return MutableIndexedTheory_init_$Create$(unificator, clauses);
|
|
3386
|
+
};
|
|
3387
|
+
protoOf(IndexedTheoryFactory).mutableTheoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3388
|
+
return this.b1t(clauses, unificator);
|
|
3389
|
+
};
|
|
3390
|
+
protoOf(IndexedTheoryFactory).a1t = function (unificator, clauses) {
|
|
3391
|
+
return MutableIndexedTheory_init_$Create$(unificator, asIterable_0(clauses));
|
|
3392
|
+
};
|
|
3393
|
+
protoOf(IndexedTheoryFactory).mutableTheoryOfWithUnificator = function (unificator, clauses) {
|
|
3394
|
+
return this.a1t(unificator, clauses);
|
|
3395
|
+
};
|
|
3396
|
+
protoOf(IndexedTheoryFactory).c1t = function (clauses, unificator) {
|
|
3397
|
+
return MutableIndexedTheory_init_$Create$_0(unificator, clauses);
|
|
3398
|
+
};
|
|
3399
|
+
protoOf(IndexedTheoryFactory).mutableTheoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3400
|
+
return this.c1t(clauses, unificator);
|
|
3401
|
+
};
|
|
3402
|
+
function Default_0() {
|
|
3403
|
+
Default_instance_0 = this;
|
|
3404
|
+
this.g1t_1 = new ListedTheoryFactory(Companion_getInstance_1().c1l());
|
|
3405
|
+
}
|
|
3406
|
+
protoOf(Default_0).f1l = function () {
|
|
3407
|
+
return this.g1t_1.h1t_1;
|
|
3408
|
+
};
|
|
3409
|
+
protoOf(Default_0).emptyMutableTheory = function () {
|
|
3410
|
+
return this.g1t_1.emptyMutableTheory();
|
|
3411
|
+
};
|
|
3412
|
+
protoOf(Default_0).emptyMutableTheoryWithUnificator = function (unificator) {
|
|
3413
|
+
return this.g1t_1.y1s(unificator);
|
|
3414
|
+
};
|
|
3415
|
+
protoOf(Default_0).emptyTheory = function () {
|
|
3416
|
+
return this.g1t_1.emptyTheory();
|
|
3417
|
+
};
|
|
3418
|
+
protoOf(Default_0).emptyTheoryWithUnificator = function (unificator) {
|
|
3419
|
+
return this.g1t_1.z1s(unificator);
|
|
3420
|
+
};
|
|
3421
|
+
protoOf(Default_0).mutableTheoryOfWithUnificator = function (unificator, clauses) {
|
|
3422
|
+
return this.g1t_1.a1t(unificator, clauses);
|
|
3423
|
+
};
|
|
3424
|
+
protoOf(Default_0).mutableTheoryOf = function (clauses) {
|
|
3425
|
+
return this.g1t_1.mutableTheoryOf(clauses);
|
|
3426
|
+
};
|
|
3427
|
+
protoOf(Default_0).mutableTheoryOfIterable = function (clauses) {
|
|
3428
|
+
return this.g1t_1.mutableTheoryOfIterable(clauses);
|
|
3429
|
+
};
|
|
3430
|
+
protoOf(Default_0).mutableTheoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3431
|
+
return this.g1t_1.b1t(clauses, unificator);
|
|
3432
|
+
};
|
|
3433
|
+
protoOf(Default_0).mutableTheoryOfSequence = function (clauses) {
|
|
3434
|
+
return this.g1t_1.mutableTheoryOfSequence(clauses);
|
|
3435
|
+
};
|
|
3436
|
+
protoOf(Default_0).mutableTheoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3437
|
+
return this.g1t_1.c1t(clauses, unificator);
|
|
3438
|
+
};
|
|
3439
|
+
protoOf(Default_0).theoryOfWithUnificator = function (unificator, clauses) {
|
|
3440
|
+
return this.g1t_1.d1t(unificator, clauses);
|
|
3441
|
+
};
|
|
3442
|
+
protoOf(Default_0).theoryOf = function (clauses) {
|
|
3443
|
+
return this.g1t_1.theoryOf(clauses);
|
|
3444
|
+
};
|
|
3445
|
+
protoOf(Default_0).theoryOfIterable = function (clauses) {
|
|
3446
|
+
return this.g1t_1.theoryOfIterable(clauses);
|
|
3447
|
+
};
|
|
3448
|
+
protoOf(Default_0).theoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3449
|
+
return this.g1t_1.e1t(clauses, unificator);
|
|
3450
|
+
};
|
|
3451
|
+
protoOf(Default_0).theoryOfSequence = function (clauses) {
|
|
3452
|
+
return this.g1t_1.theoryOfSequence(clauses);
|
|
3453
|
+
};
|
|
3454
|
+
protoOf(Default_0).theoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3455
|
+
return this.g1t_1.f1t(clauses, unificator);
|
|
3456
|
+
};
|
|
3457
|
+
var Default_instance_0;
|
|
3458
|
+
function Default_getInstance_0() {
|
|
3459
|
+
if (Default_instance_0 == null)
|
|
3460
|
+
new Default_0();
|
|
3461
|
+
return Default_instance_0;
|
|
3462
|
+
}
|
|
3463
|
+
function ListedTheoryFactory(unificator) {
|
|
3464
|
+
this.h1t_1 = unificator;
|
|
3465
|
+
}
|
|
3466
|
+
protoOf(ListedTheoryFactory).f1l = function () {
|
|
3467
|
+
return this.h1t_1;
|
|
3468
|
+
};
|
|
3469
|
+
protoOf(ListedTheoryFactory).z1s = function (unificator) {
|
|
3470
|
+
return ListedTheory_init_$Create$(unificator, emptyList());
|
|
3471
|
+
};
|
|
3472
|
+
protoOf(ListedTheoryFactory).emptyTheoryWithUnificator = function (unificator) {
|
|
3473
|
+
return this.z1s(unificator);
|
|
3474
|
+
};
|
|
3475
|
+
protoOf(ListedTheoryFactory).e1t = function (clauses, unificator) {
|
|
3476
|
+
return ListedTheory_init_$Create$(unificator, clauses);
|
|
3477
|
+
};
|
|
3478
|
+
protoOf(ListedTheoryFactory).theoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3479
|
+
return this.e1t(clauses, unificator);
|
|
3480
|
+
};
|
|
3481
|
+
protoOf(ListedTheoryFactory).d1t = function (unificator, clauses) {
|
|
3482
|
+
return ListedTheory_init_$Create$(unificator, asIterable_0(clauses));
|
|
3483
|
+
};
|
|
3484
|
+
protoOf(ListedTheoryFactory).theoryOfWithUnificator = function (unificator, clauses) {
|
|
3485
|
+
return this.d1t(unificator, clauses);
|
|
3486
|
+
};
|
|
3487
|
+
protoOf(ListedTheoryFactory).f1t = function (clauses, unificator) {
|
|
3488
|
+
return ListedTheory_init_$Create$_0(unificator, clauses);
|
|
3489
|
+
};
|
|
3490
|
+
protoOf(ListedTheoryFactory).theoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3491
|
+
return this.f1t(clauses, unificator);
|
|
3492
|
+
};
|
|
3493
|
+
protoOf(ListedTheoryFactory).y1s = function (unificator) {
|
|
3494
|
+
return MutableListedTheory_init_$Create$(unificator, emptyList());
|
|
3495
|
+
};
|
|
3496
|
+
protoOf(ListedTheoryFactory).emptyMutableTheoryWithUnificator = function (unificator) {
|
|
3497
|
+
return this.y1s(unificator);
|
|
3498
|
+
};
|
|
3499
|
+
protoOf(ListedTheoryFactory).b1t = function (clauses, unificator) {
|
|
3500
|
+
return MutableListedTheory_init_$Create$(unificator, clauses);
|
|
3501
|
+
};
|
|
3502
|
+
protoOf(ListedTheoryFactory).mutableTheoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
3503
|
+
return this.b1t(clauses, unificator);
|
|
3504
|
+
};
|
|
3505
|
+
protoOf(ListedTheoryFactory).a1t = function (unificator, clauses) {
|
|
3506
|
+
return MutableListedTheory_init_$Create$(unificator, asIterable_0(clauses));
|
|
3507
|
+
};
|
|
3508
|
+
protoOf(ListedTheoryFactory).mutableTheoryOfWithUnificator = function (unificator, clauses) {
|
|
3509
|
+
return this.a1t(unificator, clauses);
|
|
3510
|
+
};
|
|
3511
|
+
protoOf(ListedTheoryFactory).c1t = function (clauses, unificator) {
|
|
3512
|
+
return MutableListedTheory_init_$Create$_0(unificator, clauses);
|
|
3513
|
+
};
|
|
3514
|
+
protoOf(ListedTheoryFactory).mutableTheoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
3515
|
+
return this.c1t(clauses, unificator);
|
|
3257
3516
|
};
|
|
3258
3517
|
function Companion_4() {
|
|
3259
3518
|
}
|
|
@@ -3334,24 +3593,24 @@
|
|
|
3334
3593
|
}
|
|
3335
3594
|
function Success_0(theory, clauses) {
|
|
3336
3595
|
RetractResult.call(this);
|
|
3337
|
-
this.
|
|
3338
|
-
this.
|
|
3596
|
+
this.o1t_1 = theory;
|
|
3597
|
+
this.p1t_1 = clauses;
|
|
3339
3598
|
}
|
|
3340
|
-
protoOf(Success_0).
|
|
3341
|
-
return this.
|
|
3599
|
+
protoOf(Success_0).c1s = function () {
|
|
3600
|
+
return this.o1t_1;
|
|
3342
3601
|
};
|
|
3343
|
-
protoOf(Success_0).
|
|
3344
|
-
return this.
|
|
3602
|
+
protoOf(Success_0).p1l = function () {
|
|
3603
|
+
return this.p1t_1;
|
|
3345
3604
|
};
|
|
3346
|
-
protoOf(Success_0).
|
|
3347
|
-
return first_0(this.
|
|
3605
|
+
protoOf(Success_0).i1m = function () {
|
|
3606
|
+
return first_0(this.p1t_1);
|
|
3348
3607
|
};
|
|
3349
3608
|
protoOf(Success_0).toString = function () {
|
|
3350
|
-
return 'Success(theory=' + this.
|
|
3609
|
+
return 'Success(theory=' + this.o1t_1 + ', clauses=' + this.p1t_1 + ')';
|
|
3351
3610
|
};
|
|
3352
3611
|
protoOf(Success_0).hashCode = function () {
|
|
3353
|
-
var result = hashCode(this.
|
|
3354
|
-
result = imul(result, 31) + hashCode(this.
|
|
3612
|
+
var result = hashCode(this.o1t_1);
|
|
3613
|
+
result = imul(result, 31) + hashCode(this.p1t_1) | 0;
|
|
3355
3614
|
return result;
|
|
3356
3615
|
};
|
|
3357
3616
|
protoOf(Success_0).equals = function (other) {
|
|
@@ -3360,30 +3619,30 @@
|
|
|
3360
3619
|
if (!(other instanceof Success_0))
|
|
3361
3620
|
return false;
|
|
3362
3621
|
var tmp0_other_with_cast = other instanceof Success_0 ? other : THROW_CCE();
|
|
3363
|
-
if (!equals(this.
|
|
3622
|
+
if (!equals(this.o1t_1, tmp0_other_with_cast.o1t_1))
|
|
3364
3623
|
return false;
|
|
3365
|
-
if (!equals(this.
|
|
3624
|
+
if (!equals(this.p1t_1, tmp0_other_with_cast.p1t_1))
|
|
3366
3625
|
return false;
|
|
3367
3626
|
return true;
|
|
3368
3627
|
};
|
|
3369
3628
|
function Failure_0(theory) {
|
|
3370
3629
|
RetractResult.call(this);
|
|
3371
|
-
this.
|
|
3630
|
+
this.q1t_1 = theory;
|
|
3372
3631
|
}
|
|
3373
|
-
protoOf(Failure_0).
|
|
3374
|
-
return this.
|
|
3632
|
+
protoOf(Failure_0).c1s = function () {
|
|
3633
|
+
return this.q1t_1;
|
|
3375
3634
|
};
|
|
3376
|
-
protoOf(Failure_0).
|
|
3635
|
+
protoOf(Failure_0).p1l = function () {
|
|
3377
3636
|
return null;
|
|
3378
3637
|
};
|
|
3379
|
-
protoOf(Failure_0).
|
|
3638
|
+
protoOf(Failure_0).i1m = function () {
|
|
3380
3639
|
return null;
|
|
3381
3640
|
};
|
|
3382
3641
|
protoOf(Failure_0).toString = function () {
|
|
3383
|
-
return 'Failure(theory=' + this.
|
|
3642
|
+
return 'Failure(theory=' + this.q1t_1 + ')';
|
|
3384
3643
|
};
|
|
3385
3644
|
protoOf(Failure_0).hashCode = function () {
|
|
3386
|
-
return hashCode(this.
|
|
3645
|
+
return hashCode(this.q1t_1);
|
|
3387
3646
|
};
|
|
3388
3647
|
protoOf(Failure_0).equals = function (other) {
|
|
3389
3648
|
if (this === other)
|
|
@@ -3391,7 +3650,7 @@
|
|
|
3391
3650
|
if (!(other instanceof Failure_0))
|
|
3392
3651
|
return false;
|
|
3393
3652
|
var tmp0_other_with_cast = other instanceof Failure_0 ? other : THROW_CCE();
|
|
3394
|
-
if (!equals(this.
|
|
3653
|
+
if (!equals(this.q1t_1, tmp0_other_with_cast.q1t_1))
|
|
3395
3654
|
return false;
|
|
3396
3655
|
return true;
|
|
3397
3656
|
};
|
|
@@ -3403,31 +3662,31 @@
|
|
|
3403
3662
|
return this.indexedOfSequence(unificator, emptySequence());
|
|
3404
3663
|
};
|
|
3405
3664
|
protoOf(Companion_5).emptyWithDefaultUnificator = function () {
|
|
3406
|
-
return this.empty(Companion_getInstance_1().
|
|
3665
|
+
return this.empty(Companion_getInstance_1().c1l());
|
|
3407
3666
|
};
|
|
3408
3667
|
protoOf(Companion_5).of = function (unificator, clause) {
|
|
3409
3668
|
return this.indexedOf(unificator, clause.slice());
|
|
3410
3669
|
};
|
|
3411
3670
|
protoOf(Companion_5).ofWithDefaultUnificator = function (clause) {
|
|
3412
|
-
return this.indexedOf(Companion_getInstance_1().
|
|
3671
|
+
return this.indexedOf(Companion_getInstance_1().c1l(), clause.slice());
|
|
3413
3672
|
};
|
|
3414
3673
|
protoOf(Companion_5).ofIterable = function (unificator, clauses) {
|
|
3415
3674
|
return this.indexedOfIterable(unificator, clauses);
|
|
3416
3675
|
};
|
|
3417
3676
|
protoOf(Companion_5).ofIterableWithDefaultUnificator = function (clauses) {
|
|
3418
|
-
return this.indexedOfIterable(Companion_getInstance_1().
|
|
3677
|
+
return this.indexedOfIterable(Companion_getInstance_1().c1l(), clauses);
|
|
3419
3678
|
};
|
|
3420
3679
|
protoOf(Companion_5).ofSequence = function (unificator, clauses) {
|
|
3421
3680
|
return this.indexedOfSequence(unificator, clauses);
|
|
3422
3681
|
};
|
|
3423
3682
|
protoOf(Companion_5).ofSequenceWithDefaultUnificator = function (clauses) {
|
|
3424
|
-
return this.indexedOfSequence(Companion_getInstance_1().
|
|
3683
|
+
return this.indexedOfSequence(Companion_getInstance_1().c1l(), clauses);
|
|
3425
3684
|
};
|
|
3426
3685
|
protoOf(Companion_5).ofScopes = function (unificator, clauses) {
|
|
3427
3686
|
return this.indexedOfScopes(unificator, clauses.slice());
|
|
3428
3687
|
};
|
|
3429
3688
|
protoOf(Companion_5).ofScopesWithDefaultUnificator = function (clauses) {
|
|
3430
|
-
return this.indexedOfScopes(Companion_getInstance_1().
|
|
3689
|
+
return this.indexedOfScopes(Companion_getInstance_1().c1l(), clauses.slice());
|
|
3431
3690
|
};
|
|
3432
3691
|
protoOf(Companion_5).emptyIndexed = function (unificator) {
|
|
3433
3692
|
return this.indexedOfIterable(unificator, emptyList());
|
|
@@ -3454,7 +3713,7 @@
|
|
|
3454
3713
|
return this.indexedOfIterable(unificator, asIterable(clauses));
|
|
3455
3714
|
};
|
|
3456
3715
|
protoOf(Companion_5).indexedOfIterable = function (unificator, clauses) {
|
|
3457
|
-
return
|
|
3716
|
+
return Default_getInstance().theoryOfIterableWithUnificator(clauses, unificator);
|
|
3458
3717
|
};
|
|
3459
3718
|
protoOf(Companion_5).emptyListed = function (unificator) {
|
|
3460
3719
|
return this.listedOfSequence(unificator, emptySequence());
|
|
@@ -3481,7 +3740,7 @@
|
|
|
3481
3740
|
return this.listedOfIterable(unificator, asIterable(clauses));
|
|
3482
3741
|
};
|
|
3483
3742
|
protoOf(Companion_5).listedOfIterable = function (unificator, clauses) {
|
|
3484
|
-
return
|
|
3743
|
+
return Default_getInstance_0().theoryOfIterableWithUnificator(clauses, unificator);
|
|
3485
3744
|
};
|
|
3486
3745
|
var Companion_instance_10;
|
|
3487
3746
|
function Companion_getInstance_8() {
|
|
@@ -3495,6 +3754,8 @@
|
|
|
3495
3754
|
}
|
|
3496
3755
|
function Theory() {
|
|
3497
3756
|
}
|
|
3757
|
+
function TheoryFactory() {
|
|
3758
|
+
}
|
|
3498
3759
|
function actualCheck($this, clauses) {
|
|
3499
3760
|
// Inline function 'kotlin.require' call
|
|
3500
3761
|
var tmp$ret$1;
|
|
@@ -3523,7 +3784,7 @@
|
|
|
3523
3784
|
}
|
|
3524
3785
|
function TheoryUtils() {
|
|
3525
3786
|
}
|
|
3526
|
-
protoOf(TheoryUtils).
|
|
3787
|
+
protoOf(TheoryUtils).b1m = function (clause) {
|
|
3527
3788
|
// Inline function 'kotlin.also' call
|
|
3528
3789
|
// Inline function 'kotlin.contracts.contract' call
|
|
3529
3790
|
// Inline function 'it.unibo.tuprolog.theory.TheoryUtils.checkClauseCorrect.<anonymous>' call
|
|
@@ -3536,7 +3797,7 @@
|
|
|
3536
3797
|
}
|
|
3537
3798
|
return clause;
|
|
3538
3799
|
};
|
|
3539
|
-
protoOf(TheoryUtils).
|
|
3800
|
+
protoOf(TheoryUtils).l1s = function (clauses) {
|
|
3540
3801
|
// Inline function 'kotlin.also' call
|
|
3541
3802
|
var this_0 = asSequence_0(clauses);
|
|
3542
3803
|
// Inline function 'kotlin.contracts.contract' call
|
|
@@ -3544,14 +3805,14 @@
|
|
|
3544
3805
|
actualCheck(TheoryUtils_instance, this_0);
|
|
3545
3806
|
return this_0;
|
|
3546
3807
|
};
|
|
3547
|
-
protoOf(TheoryUtils).
|
|
3808
|
+
protoOf(TheoryUtils).m1m = function (clauses) {
|
|
3548
3809
|
// Inline function 'kotlin.also' call
|
|
3549
3810
|
// Inline function 'kotlin.contracts.contract' call
|
|
3550
3811
|
// Inline function 'it.unibo.tuprolog.theory.TheoryUtils.checkClausesCorrect.<anonymous>' call
|
|
3551
3812
|
actualCheck(TheoryUtils_instance, asSequence(clauses));
|
|
3552
3813
|
return clauses;
|
|
3553
3814
|
};
|
|
3554
|
-
protoOf(TheoryUtils).
|
|
3815
|
+
protoOf(TheoryUtils).j1s = function (clauses) {
|
|
3555
3816
|
// Inline function 'kotlin.also' call
|
|
3556
3817
|
// Inline function 'kotlin.contracts.contract' call
|
|
3557
3818
|
// Inline function 'it.unibo.tuprolog.theory.TheoryUtils.checkClausesCorrect.<anonymous>' call
|
|
@@ -3563,83 +3824,83 @@
|
|
|
3563
3824
|
return TheoryUtils_instance;
|
|
3564
3825
|
}
|
|
3565
3826
|
function _no_name_provided__qut3iv(this$0) {
|
|
3566
|
-
this.
|
|
3827
|
+
this.r1t_1 = this$0;
|
|
3567
3828
|
}
|
|
3568
3829
|
protoOf(_no_name_provided__qut3iv).r = function () {
|
|
3569
3830
|
// Inline function 'it.unibo.tuprolog.theory.impl.AbstractIndexedTheory.<get-clauses>.<anonymous>' call
|
|
3570
|
-
return this.
|
|
3831
|
+
return this.r1t_1.u1t().r();
|
|
3571
3832
|
};
|
|
3572
3833
|
function AbstractIndexedTheory(queue, tags) {
|
|
3573
3834
|
AbstractTheory.call(this, tags);
|
|
3574
|
-
this.
|
|
3835
|
+
this.t1t_1 = queue;
|
|
3575
3836
|
}
|
|
3576
|
-
protoOf(AbstractIndexedTheory).
|
|
3577
|
-
return this.
|
|
3837
|
+
protoOf(AbstractIndexedTheory).f1l = function () {
|
|
3838
|
+
return this.u1t().f1l();
|
|
3578
3839
|
};
|
|
3579
|
-
protoOf(AbstractIndexedTheory).
|
|
3580
|
-
return this.
|
|
3840
|
+
protoOf(AbstractIndexedTheory).u1t = function () {
|
|
3841
|
+
return this.t1t_1;
|
|
3581
3842
|
};
|
|
3582
|
-
protoOf(AbstractIndexedTheory).
|
|
3583
|
-
return this.
|
|
3843
|
+
protoOf(AbstractIndexedTheory).i1l = function () {
|
|
3844
|
+
return this.u1t().h1l();
|
|
3584
3845
|
};
|
|
3585
|
-
protoOf(AbstractIndexedTheory).
|
|
3586
|
-
return this.
|
|
3846
|
+
protoOf(AbstractIndexedTheory).j1l = function () {
|
|
3847
|
+
return this.u1t().j1l();
|
|
3587
3848
|
};
|
|
3588
|
-
protoOf(AbstractIndexedTheory).
|
|
3849
|
+
protoOf(AbstractIndexedTheory).p1l = function () {
|
|
3589
3850
|
// Inline function 'kotlin.collections.Iterable' call
|
|
3590
3851
|
return new _no_name_provided__qut3iv(this);
|
|
3591
3852
|
};
|
|
3592
|
-
protoOf(AbstractIndexedTheory).
|
|
3593
|
-
return this.
|
|
3853
|
+
protoOf(AbstractIndexedTheory).n1l = function (clause) {
|
|
3854
|
+
return this.u1t().n1l(clause);
|
|
3594
3855
|
};
|
|
3595
3856
|
protoOf(AbstractIndexedTheory).get = function (clause) {
|
|
3596
|
-
return this.
|
|
3857
|
+
return this.n1l(clause);
|
|
3597
3858
|
};
|
|
3598
3859
|
protoOf(AbstractIndexedTheory).l = function () {
|
|
3599
|
-
return toLong(this.
|
|
3860
|
+
return toLong(this.u1t().l());
|
|
3600
3861
|
};
|
|
3601
|
-
protoOf(AbstractIndexedTheory).
|
|
3602
|
-
return this.
|
|
3862
|
+
protoOf(AbstractIndexedTheory).k1l = function () {
|
|
3863
|
+
return this.u1t().isEmpty();
|
|
3603
3864
|
};
|
|
3604
|
-
protoOf(AbstractIndexedTheory).
|
|
3605
|
-
return !this.
|
|
3865
|
+
protoOf(AbstractIndexedTheory).f1s = function () {
|
|
3866
|
+
return !this.k1l();
|
|
3606
3867
|
};
|
|
3607
3868
|
function AbstractListedTheory(unificator, clauses, tags) {
|
|
3608
3869
|
AbstractTheory.call(this, tags);
|
|
3609
|
-
this.
|
|
3610
|
-
this.
|
|
3870
|
+
this.w1t_1 = clauses;
|
|
3871
|
+
this.x1t_1 = unificator;
|
|
3611
3872
|
}
|
|
3612
|
-
protoOf(AbstractListedTheory).
|
|
3613
|
-
return this.
|
|
3873
|
+
protoOf(AbstractListedTheory).p1l = function () {
|
|
3874
|
+
return this.w1t_1;
|
|
3614
3875
|
};
|
|
3615
|
-
protoOf(AbstractListedTheory).
|
|
3616
|
-
this.
|
|
3876
|
+
protoOf(AbstractListedTheory).y1t = function (_set____db54di) {
|
|
3877
|
+
this.x1t_1 = _set____db54di;
|
|
3617
3878
|
};
|
|
3618
|
-
protoOf(AbstractListedTheory).
|
|
3619
|
-
return this.
|
|
3879
|
+
protoOf(AbstractListedTheory).f1l = function () {
|
|
3880
|
+
return this.x1t_1;
|
|
3620
3881
|
};
|
|
3621
|
-
protoOf(AbstractListedTheory).
|
|
3882
|
+
protoOf(AbstractListedTheory).n1l = function (clause) {
|
|
3622
3883
|
// Inline function 'kotlin.collections.filter' call
|
|
3623
3884
|
// Inline function 'kotlin.collections.filterTo' call
|
|
3624
|
-
var this_0 = this.
|
|
3885
|
+
var this_0 = this.p1l();
|
|
3625
3886
|
var destination = ArrayList_init_$Create$_0();
|
|
3626
3887
|
var tmp0_iterator = this_0.r();
|
|
3627
3888
|
while (tmp0_iterator.s()) {
|
|
3628
3889
|
var element = tmp0_iterator.u();
|
|
3629
3890
|
// Inline function 'it.unibo.tuprolog.theory.impl.AbstractListedTheory.get.<anonymous>' call
|
|
3630
|
-
if (this.
|
|
3891
|
+
if (this.f1l().match(element, clause)) {
|
|
3631
3892
|
destination.o(element);
|
|
3632
3893
|
}
|
|
3633
3894
|
}
|
|
3634
3895
|
return asSequence(destination);
|
|
3635
3896
|
};
|
|
3636
3897
|
protoOf(AbstractListedTheory).get = function (clause) {
|
|
3637
|
-
return this.
|
|
3898
|
+
return this.n1l(clause);
|
|
3638
3899
|
};
|
|
3639
3900
|
function IndexedTheory_init_$Init$(unificator, clauses, tags, $this) {
|
|
3640
3901
|
tags = tags === VOID ? emptyMap() : tags;
|
|
3641
3902
|
IndexedTheory.call($this, Companion_instance_4.ofIterable(unificator, clauses), tags);
|
|
3642
|
-
TheoryUtils_instance.
|
|
3903
|
+
TheoryUtils_instance.m1m(clauses);
|
|
3643
3904
|
return $this;
|
|
3644
3905
|
}
|
|
3645
3906
|
function IndexedTheory_init_$Create$(unificator, clauses, tags) {
|
|
@@ -3655,13 +3916,13 @@
|
|
|
3655
3916
|
}
|
|
3656
3917
|
function _get_hashCodeCache__ny3r0q_0($this) {
|
|
3657
3918
|
// Inline function 'kotlin.getValue' call
|
|
3658
|
-
var this_0 = $this.
|
|
3919
|
+
var this_0 = $this.b1u_1;
|
|
3659
3920
|
hashCodeCache$factory_0();
|
|
3660
3921
|
return this_0.r2();
|
|
3661
3922
|
}
|
|
3662
3923
|
function _get_sizeCache__6eswog($this) {
|
|
3663
3924
|
// Inline function 'kotlin.getValue' call
|
|
3664
|
-
var this_0 = $this.
|
|
3925
|
+
var this_0 = $this.c1u_1;
|
|
3665
3926
|
sizeCache$factory();
|
|
3666
3927
|
return this_0.r2();
|
|
3667
3928
|
}
|
|
@@ -3678,42 +3939,42 @@
|
|
|
3678
3939
|
function IndexedTheory(queue, tags) {
|
|
3679
3940
|
AbstractIndexedTheory.call(this, queue, tags);
|
|
3680
3941
|
var tmp = this;
|
|
3681
|
-
tmp.
|
|
3942
|
+
tmp.b1u_1 = lazy(IndexedTheory$hashCodeCache$delegate$lambda(this));
|
|
3682
3943
|
var tmp_0 = this;
|
|
3683
|
-
tmp_0.
|
|
3944
|
+
tmp_0.c1u_1 = lazy(IndexedTheory$sizeCache$delegate$lambda(this));
|
|
3684
3945
|
}
|
|
3685
|
-
protoOf(IndexedTheory).
|
|
3946
|
+
protoOf(IndexedTheory).r1s = function (clauses, tags, unificator) {
|
|
3686
3947
|
return IndexedTheory_init_$Create$_0(unificator, clauses, tags);
|
|
3687
3948
|
};
|
|
3688
|
-
protoOf(IndexedTheory).
|
|
3689
|
-
var newTheory = Companion_instance_4.ofIterable(this.
|
|
3949
|
+
protoOf(IndexedTheory).l1t = function (clause) {
|
|
3950
|
+
var newTheory = Companion_instance_4.ofIterable(this.f1l(), this.p1l());
|
|
3690
3951
|
var retracted = newTheory.retrieveFirst(clause);
|
|
3691
|
-
return retracted.
|
|
3952
|
+
return retracted.j1m() ? new Failure_0(this) : new Success_0(new IndexedTheory(retracted.h1m(), this.vt()), ensureNotNull(retracted.p1l()));
|
|
3692
3953
|
};
|
|
3693
3954
|
protoOf(IndexedTheory).retract = function (clause) {
|
|
3694
|
-
return this.
|
|
3955
|
+
return this.l1t(clause);
|
|
3695
3956
|
};
|
|
3696
|
-
protoOf(IndexedTheory).
|
|
3697
|
-
return this.
|
|
3957
|
+
protoOf(IndexedTheory).i1s = function (theory) {
|
|
3958
|
+
return this.k1l() ? theory.toImmutableTheory() : theory.k1l() ? this : protoOf(AbstractIndexedTheory).i1s.call(this, theory);
|
|
3698
3959
|
};
|
|
3699
3960
|
protoOf(IndexedTheory).plusTheory = function (theory) {
|
|
3700
|
-
return this.
|
|
3961
|
+
return this.i1s(theory);
|
|
3701
3962
|
};
|
|
3702
|
-
protoOf(IndexedTheory).
|
|
3703
|
-
return Companion_instance_9.indexedOfIterable(this.
|
|
3963
|
+
protoOf(IndexedTheory).i1t = function () {
|
|
3964
|
+
return Companion_instance_9.indexedOfIterable(this.f1l(), this);
|
|
3704
3965
|
};
|
|
3705
3966
|
protoOf(IndexedTheory).toMutableTheory = function () {
|
|
3706
|
-
return this.
|
|
3967
|
+
return this.i1t();
|
|
3707
3968
|
};
|
|
3708
|
-
protoOf(IndexedTheory).
|
|
3709
|
-
var newTheory = Companion_instance_5.ofIterable(this.
|
|
3969
|
+
protoOf(IndexedTheory).t1s = function (clauses) {
|
|
3970
|
+
var newTheory = Companion_instance_5.ofIterable(this.f1l(), this.p1l());
|
|
3710
3971
|
var removed = dequeOf([]);
|
|
3711
3972
|
var tmp0_iterator = clauses.r();
|
|
3712
3973
|
while (tmp0_iterator.s()) {
|
|
3713
3974
|
var clause = tmp0_iterator.u();
|
|
3714
|
-
var result = newTheory.
|
|
3975
|
+
var result = newTheory.e1m(clause);
|
|
3715
3976
|
if (result.w12()) {
|
|
3716
|
-
removed.v(ensureNotNull(result.
|
|
3977
|
+
removed.v(ensureNotNull(result.p1l()));
|
|
3717
3978
|
}
|
|
3718
3979
|
}
|
|
3719
3980
|
var tmp;
|
|
@@ -3725,15 +3986,15 @@
|
|
|
3725
3986
|
return tmp;
|
|
3726
3987
|
};
|
|
3727
3988
|
protoOf(IndexedTheory).retractIterable = function (clauses) {
|
|
3728
|
-
return this.
|
|
3989
|
+
return this.t1s(clauses);
|
|
3729
3990
|
};
|
|
3730
|
-
protoOf(IndexedTheory).
|
|
3731
|
-
var newTheory = Companion_instance_4.ofIterable(this.
|
|
3732
|
-
var retracted = newTheory.
|
|
3733
|
-
return retracted.
|
|
3991
|
+
protoOf(IndexedTheory).x1l = function (clause) {
|
|
3992
|
+
var newTheory = Companion_instance_4.ofIterable(this.f1l(), this.p1l());
|
|
3993
|
+
var retracted = newTheory.w1l(clause);
|
|
3994
|
+
return retracted.j1m() ? new Failure_0(this) : new Success_0(new IndexedTheory(retracted.h1m(), this.vt()), ensureNotNull(retracted.p1l()));
|
|
3734
3995
|
};
|
|
3735
3996
|
protoOf(IndexedTheory).retractAll = function (clause) {
|
|
3736
|
-
return this.
|
|
3997
|
+
return this.x1l(clause);
|
|
3737
3998
|
};
|
|
3738
3999
|
protoOf(IndexedTheory).hashCode = function () {
|
|
3739
4000
|
return _get_hashCodeCache__ny3r0q_0(this);
|
|
@@ -3746,7 +4007,7 @@
|
|
|
3746
4007
|
if (tags === this.vt()) {
|
|
3747
4008
|
tmp = this;
|
|
3748
4009
|
} else {
|
|
3749
|
-
tmp = new IndexedTheory(this.
|
|
4010
|
+
tmp = new IndexedTheory(this.u1t(), tags);
|
|
3750
4011
|
}
|
|
3751
4012
|
return tmp;
|
|
3752
4013
|
};
|
|
@@ -3766,7 +4027,7 @@
|
|
|
3766
4027
|
function ListedTheory_init_$Init$(unificator, clauses, tags, $this) {
|
|
3767
4028
|
tags = tags === VOID ? emptyMap() : tags;
|
|
3768
4029
|
ListedTheory.call($this, unificator, toList_0(clauses), tags);
|
|
3769
|
-
TheoryUtils_instance.
|
|
4030
|
+
TheoryUtils_instance.m1m(clauses);
|
|
3770
4031
|
return $this;
|
|
3771
4032
|
}
|
|
3772
4033
|
function ListedTheory_init_$Create$(unificator, clauses, tags) {
|
|
@@ -3775,7 +4036,7 @@
|
|
|
3775
4036
|
function ListedTheory_init_$Init$_0(unificator, clauses, tags, $this) {
|
|
3776
4037
|
tags = tags === VOID ? emptyMap() : tags;
|
|
3777
4038
|
ListedTheory.call($this, unificator, toList(clauses), tags);
|
|
3778
|
-
TheoryUtils_instance.
|
|
4039
|
+
TheoryUtils_instance.j1s(clauses);
|
|
3779
4040
|
return $this;
|
|
3780
4041
|
}
|
|
3781
4042
|
function ListedTheory_init_$Create$_0(unificator, clauses, tags) {
|
|
@@ -3783,13 +4044,13 @@
|
|
|
3783
4044
|
}
|
|
3784
4045
|
function _get_hashCodeCache__ny3r0q_1($this) {
|
|
3785
4046
|
// Inline function 'kotlin.getValue' call
|
|
3786
|
-
var this_0 = $this.
|
|
4047
|
+
var this_0 = $this.g1u_1;
|
|
3787
4048
|
hashCodeCache$factory_1();
|
|
3788
4049
|
return this_0.r2();
|
|
3789
4050
|
}
|
|
3790
4051
|
function _get_sizeCache__6eswog_0($this) {
|
|
3791
4052
|
// Inline function 'kotlin.getValue' call
|
|
3792
|
-
var this_0 = $this.
|
|
4053
|
+
var this_0 = $this.h1u_1;
|
|
3793
4054
|
sizeCache$factory_0();
|
|
3794
4055
|
return this_0.r2();
|
|
3795
4056
|
}
|
|
@@ -3806,23 +4067,23 @@
|
|
|
3806
4067
|
function ListedTheory(unificator, clauses, tags) {
|
|
3807
4068
|
AbstractListedTheory.call(this, unificator, clauses, tags);
|
|
3808
4069
|
var tmp = this;
|
|
3809
|
-
tmp.
|
|
4070
|
+
tmp.g1u_1 = lazy(ListedTheory$hashCodeCache$delegate$lambda(this));
|
|
3810
4071
|
var tmp_0 = this;
|
|
3811
|
-
tmp_0.
|
|
4072
|
+
tmp_0.h1u_1 = lazy(ListedTheory$sizeCache$delegate$lambda(this));
|
|
3812
4073
|
}
|
|
3813
|
-
protoOf(ListedTheory).
|
|
4074
|
+
protoOf(ListedTheory).r1s = function (clauses, tags, unificator) {
|
|
3814
4075
|
return ListedTheory_init_$Create$_0(unificator, clauses, tags);
|
|
3815
4076
|
};
|
|
3816
|
-
protoOf(ListedTheory).
|
|
4077
|
+
protoOf(ListedTheory).l1t = function (clause) {
|
|
3817
4078
|
// Inline function 'kotlin.collections.filter' call
|
|
3818
4079
|
// Inline function 'kotlin.collections.filterTo' call
|
|
3819
|
-
var this_0 = this.
|
|
4080
|
+
var this_0 = this.p1l();
|
|
3820
4081
|
var destination = ArrayList_init_$Create$_0();
|
|
3821
4082
|
var tmp0_iterator = this_0.r();
|
|
3822
4083
|
while (tmp0_iterator.s()) {
|
|
3823
4084
|
var element = tmp0_iterator.u();
|
|
3824
4085
|
// Inline function 'it.unibo.tuprolog.theory.impl.ListedTheory.retract.<anonymous>' call
|
|
3825
|
-
if (this.
|
|
4086
|
+
if (this.f1l().match(element, clause)) {
|
|
3826
4087
|
destination.o(element);
|
|
3827
4088
|
}
|
|
3828
4089
|
}
|
|
@@ -3834,7 +4095,7 @@
|
|
|
3834
4095
|
var toBeActuallyRetracted = first(retractability);
|
|
3835
4096
|
// Inline function 'kotlin.collections.filter' call
|
|
3836
4097
|
// Inline function 'kotlin.collections.filterTo' call
|
|
3837
|
-
var this_1 = this.
|
|
4098
|
+
var this_1 = this.p1l();
|
|
3838
4099
|
var destination_0 = ArrayList_init_$Create$_0();
|
|
3839
4100
|
var tmp0_iterator_0 = this_1.r();
|
|
3840
4101
|
while (tmp0_iterator_0.s()) {
|
|
@@ -3845,21 +4106,21 @@
|
|
|
3845
4106
|
}
|
|
3846
4107
|
}
|
|
3847
4108
|
var newTheory = destination_0;
|
|
3848
|
-
tmp = new Success_0(new ListedTheory(this.
|
|
4109
|
+
tmp = new Success_0(new ListedTheory(this.f1l(), newTheory, this.vt()), listOf_0(toBeActuallyRetracted));
|
|
3849
4110
|
}
|
|
3850
4111
|
return tmp;
|
|
3851
4112
|
};
|
|
3852
4113
|
protoOf(ListedTheory).retract = function (clause) {
|
|
3853
|
-
return this.
|
|
4114
|
+
return this.l1t(clause);
|
|
3854
4115
|
};
|
|
3855
|
-
protoOf(ListedTheory).
|
|
3856
|
-
return Companion_instance_9.listedOfIterable(this.
|
|
4116
|
+
protoOf(ListedTheory).i1t = function () {
|
|
4117
|
+
return Companion_instance_9.listedOfIterable(this.f1l(), this);
|
|
3857
4118
|
};
|
|
3858
4119
|
protoOf(ListedTheory).toMutableTheory = function () {
|
|
3859
|
-
return this.
|
|
4120
|
+
return this.i1t();
|
|
3860
4121
|
};
|
|
3861
|
-
protoOf(ListedTheory).
|
|
3862
|
-
var residual = dequeOf_1(this.
|
|
4122
|
+
protoOf(ListedTheory).t1s = function (clauses) {
|
|
4123
|
+
var residual = dequeOf_1(this.p1l());
|
|
3863
4124
|
var removed = dequeOf([]);
|
|
3864
4125
|
var i = residual.r();
|
|
3865
4126
|
while (i.s()) {
|
|
@@ -3881,7 +4142,7 @@
|
|
|
3881
4142
|
while (tmp0_iterator.s()) {
|
|
3882
4143
|
var element = tmp0_iterator.u();
|
|
3883
4144
|
// Inline function 'it.unibo.tuprolog.theory.impl.ListedTheory.retract.<anonymous>' call
|
|
3884
|
-
if (this.
|
|
4145
|
+
if (this.f1l().match(element, current)) {
|
|
3885
4146
|
tmp$ret$0 = true;
|
|
3886
4147
|
break $l$block_0;
|
|
3887
4148
|
}
|
|
@@ -3897,23 +4158,23 @@
|
|
|
3897
4158
|
if (removed.y()) {
|
|
3898
4159
|
tmp_0 = new Failure_0(this);
|
|
3899
4160
|
} else {
|
|
3900
|
-
tmp_0 = new Success_0(new ListedTheory(this.
|
|
4161
|
+
tmp_0 = new Success_0(new ListedTheory(this.f1l(), residual, this.vt()), removed);
|
|
3901
4162
|
}
|
|
3902
4163
|
return tmp_0;
|
|
3903
4164
|
};
|
|
3904
4165
|
protoOf(ListedTheory).retractIterable = function (clauses) {
|
|
3905
|
-
return this.
|
|
4166
|
+
return this.t1s(clauses);
|
|
3906
4167
|
};
|
|
3907
|
-
protoOf(ListedTheory).
|
|
4168
|
+
protoOf(ListedTheory).x1l = function (clause) {
|
|
3908
4169
|
// Inline function 'kotlin.collections.filter' call
|
|
3909
4170
|
// Inline function 'kotlin.collections.filterTo' call
|
|
3910
|
-
var this_0 = this.
|
|
4171
|
+
var this_0 = this.p1l();
|
|
3911
4172
|
var destination = ArrayList_init_$Create$_0();
|
|
3912
4173
|
var tmp0_iterator = this_0.r();
|
|
3913
4174
|
while (tmp0_iterator.s()) {
|
|
3914
4175
|
var element = tmp0_iterator.u();
|
|
3915
4176
|
// Inline function 'it.unibo.tuprolog.theory.impl.ListedTheory.retractAll.<anonymous>' call
|
|
3916
|
-
if (this.
|
|
4177
|
+
if (this.f1l().match(element, clause)) {
|
|
3917
4178
|
destination.o(element);
|
|
3918
4179
|
}
|
|
3919
4180
|
}
|
|
@@ -3923,14 +4184,14 @@
|
|
|
3923
4184
|
tmp = new Failure_0(this);
|
|
3924
4185
|
} else {
|
|
3925
4186
|
// Inline function 'kotlin.collections.partition' call
|
|
3926
|
-
var this_1 = toList_0(this.
|
|
4187
|
+
var this_1 = toList_0(this.p1l());
|
|
3927
4188
|
var first = ArrayList_init_$Create$_0();
|
|
3928
4189
|
var second = ArrayList_init_$Create$_0();
|
|
3929
4190
|
var tmp0_iterator_0 = this_1.r();
|
|
3930
4191
|
while (tmp0_iterator_0.s()) {
|
|
3931
4192
|
var element_0 = tmp0_iterator_0.u();
|
|
3932
4193
|
// Inline function 'it.unibo.tuprolog.theory.impl.ListedTheory.retractAll.<anonymous>' call
|
|
3933
|
-
if (this.
|
|
4194
|
+
if (this.f1l().match(element_0, clause)) {
|
|
3934
4195
|
first.o(element_0);
|
|
3935
4196
|
} else {
|
|
3936
4197
|
second.o(element_0);
|
|
@@ -3939,12 +4200,12 @@
|
|
|
3939
4200
|
var partitionedClauses = new Pair(first, second);
|
|
3940
4201
|
var newTheory = partitionedClauses.ze_1;
|
|
3941
4202
|
var toBeActuallyRetracted = partitionedClauses.ye_1;
|
|
3942
|
-
tmp = new Success_0(new ListedTheory(this.
|
|
4203
|
+
tmp = new Success_0(new ListedTheory(this.f1l(), newTheory, this.vt()), toBeActuallyRetracted);
|
|
3943
4204
|
}
|
|
3944
4205
|
return tmp;
|
|
3945
4206
|
};
|
|
3946
4207
|
protoOf(ListedTheory).retractAll = function (clause) {
|
|
3947
|
-
return this.
|
|
4208
|
+
return this.x1l(clause);
|
|
3948
4209
|
};
|
|
3949
4210
|
protoOf(ListedTheory).hashCode = function () {
|
|
3950
4211
|
return _get_hashCodeCache__ny3r0q_1(this);
|
|
@@ -3953,16 +4214,16 @@
|
|
|
3953
4214
|
return _get_sizeCache__6eswog_0(this);
|
|
3954
4215
|
};
|
|
3955
4216
|
protoOf(ListedTheory).u12 = function (tags) {
|
|
3956
|
-
return tags === this.vt() ? this : new ListedTheory(this.
|
|
4217
|
+
return tags === this.vt() ? this : new ListedTheory(this.f1l(), this.p1l(), tags);
|
|
3957
4218
|
};
|
|
3958
4219
|
protoOf(ListedTheory).resetTags = function (tags) {
|
|
3959
4220
|
return this.u12(tags);
|
|
3960
4221
|
};
|
|
3961
|
-
protoOf(ListedTheory).
|
|
3962
|
-
return this.
|
|
4222
|
+
protoOf(ListedTheory).i1s = function (theory) {
|
|
4223
|
+
return this.k1l() ? theory.toImmutableTheory() : theory.k1l() ? this : protoOf(AbstractListedTheory).i1s.call(this, theory);
|
|
3963
4224
|
};
|
|
3964
4225
|
protoOf(ListedTheory).plusTheory = function (theory) {
|
|
3965
|
-
return this.
|
|
4226
|
+
return this.i1s(theory);
|
|
3966
4227
|
};
|
|
3967
4228
|
function hashCodeCache$factory_1() {
|
|
3968
4229
|
return getPropertyCallableRef('hashCodeCache', 1, KProperty1, function (receiver) {
|
|
@@ -3977,7 +4238,7 @@
|
|
|
3977
4238
|
function MutableIndexedTheory_init_$Init$(unificator, clauses, tags, $this) {
|
|
3978
4239
|
tags = tags === VOID ? emptyMap() : tags;
|
|
3979
4240
|
MutableIndexedTheory.call($this, Companion_instance_5.ofIterable(unificator, clauses), tags);
|
|
3980
|
-
TheoryUtils_instance.
|
|
4241
|
+
TheoryUtils_instance.m1m(clauses);
|
|
3981
4242
|
return $this;
|
|
3982
4243
|
}
|
|
3983
4244
|
function MutableIndexedTheory_init_$Create$(unificator, clauses, tags) {
|
|
@@ -3992,54 +4253,54 @@
|
|
|
3992
4253
|
return MutableIndexedTheory_init_$Init$_0(unificator, clauses, tags, objectCreate(protoOf(MutableIndexedTheory)));
|
|
3993
4254
|
}
|
|
3994
4255
|
function toRetractResult(_this__u8e3s4, $this) {
|
|
3995
|
-
return _this__u8e3s4.w12() ? new Success_0($this, ensureNotNull(_this__u8e3s4.
|
|
4256
|
+
return _this__u8e3s4.w12() ? new Success_0($this, ensureNotNull(_this__u8e3s4.p1l())) : new Failure_0($this);
|
|
3996
4257
|
}
|
|
3997
4258
|
function MutableIndexedTheory$retract$lambda(this$0) {
|
|
3998
4259
|
return function (it) {
|
|
3999
|
-
return this$0.
|
|
4260
|
+
return this$0.k1u_1.u1l(it);
|
|
4000
4261
|
};
|
|
4001
4262
|
}
|
|
4002
4263
|
function MutableIndexedTheory$retract$lambda_0(it) {
|
|
4003
4264
|
return it.w12();
|
|
4004
4265
|
}
|
|
4005
4266
|
function MutableIndexedTheory$retract$lambda_1(it) {
|
|
4006
|
-
return asSequence(ensureNotNull(it.
|
|
4267
|
+
return asSequence(ensureNotNull(it.p1l()));
|
|
4007
4268
|
}
|
|
4008
4269
|
function MutableIndexedTheory(queue, tags) {
|
|
4009
4270
|
AbstractIndexedTheory.call(this, queue, tags);
|
|
4010
|
-
this.
|
|
4271
|
+
this.k1u_1 = queue;
|
|
4011
4272
|
}
|
|
4012
|
-
protoOf(MutableIndexedTheory).
|
|
4013
|
-
return this.
|
|
4273
|
+
protoOf(MutableIndexedTheory).u1t = function () {
|
|
4274
|
+
return this.k1u_1;
|
|
4014
4275
|
};
|
|
4015
|
-
protoOf(MutableIndexedTheory).
|
|
4016
|
-
return protoOf(AbstractIndexedTheory).
|
|
4276
|
+
protoOf(MutableIndexedTheory).g1s = function (unificator) {
|
|
4277
|
+
return protoOf(AbstractIndexedTheory).g1s.call(this, unificator).toMutableTheory();
|
|
4017
4278
|
};
|
|
4018
4279
|
protoOf(MutableIndexedTheory).setUnificator = function (unificator) {
|
|
4019
|
-
return this.
|
|
4280
|
+
return this.g1s(unificator);
|
|
4020
4281
|
};
|
|
4021
|
-
protoOf(MutableIndexedTheory).
|
|
4282
|
+
protoOf(MutableIndexedTheory).i1t = function () {
|
|
4022
4283
|
return toMutableTheory.call(this);
|
|
4023
4284
|
};
|
|
4024
4285
|
protoOf(MutableIndexedTheory).toMutableTheory = function () {
|
|
4025
|
-
return this.
|
|
4286
|
+
return this.i1t();
|
|
4026
4287
|
};
|
|
4027
|
-
protoOf(MutableIndexedTheory).
|
|
4028
|
-
return toList_0(this.
|
|
4288
|
+
protoOf(MutableIndexedTheory).p1l = function () {
|
|
4289
|
+
return toList_0(this.k1u_1);
|
|
4029
4290
|
};
|
|
4030
4291
|
protoOf(MutableIndexedTheory).r = function () {
|
|
4031
|
-
return this.
|
|
4292
|
+
return this.k1u_1.r();
|
|
4032
4293
|
};
|
|
4033
|
-
protoOf(MutableIndexedTheory).
|
|
4294
|
+
protoOf(MutableIndexedTheory).r1s = function (clauses, tags, unificator) {
|
|
4034
4295
|
return MutableIndexedTheory_init_$Create$_0(unificator, clauses, tags);
|
|
4035
4296
|
};
|
|
4036
|
-
protoOf(MutableIndexedTheory).
|
|
4037
|
-
return toRetractResult(this.
|
|
4297
|
+
protoOf(MutableIndexedTheory).l1t = function (clause) {
|
|
4298
|
+
return toRetractResult(this.k1u_1.u1l(clause), this);
|
|
4038
4299
|
};
|
|
4039
4300
|
protoOf(MutableIndexedTheory).retract = function (clause) {
|
|
4040
|
-
return this.
|
|
4301
|
+
return this.l1t(clause);
|
|
4041
4302
|
};
|
|
4042
|
-
protoOf(MutableIndexedTheory).
|
|
4303
|
+
protoOf(MutableIndexedTheory).t1s = function (clauses) {
|
|
4043
4304
|
var tmp = asSequence(clauses);
|
|
4044
4305
|
var tmp_0 = map(tmp, MutableIndexedTheory$retract$lambda(this));
|
|
4045
4306
|
var tmp_1 = filter(tmp_0, MutableIndexedTheory$retract$lambda_0);
|
|
@@ -4053,134 +4314,134 @@
|
|
|
4053
4314
|
return tmp_2;
|
|
4054
4315
|
};
|
|
4055
4316
|
protoOf(MutableIndexedTheory).retractIterable = function (clauses) {
|
|
4056
|
-
return this.
|
|
4317
|
+
return this.t1s(clauses);
|
|
4057
4318
|
};
|
|
4058
|
-
protoOf(MutableIndexedTheory).
|
|
4059
|
-
return toRetractResult(this.
|
|
4319
|
+
protoOf(MutableIndexedTheory).x1l = function (clause) {
|
|
4320
|
+
return toRetractResult(this.k1u_1.w1l(clause), this);
|
|
4060
4321
|
};
|
|
4061
4322
|
protoOf(MutableIndexedTheory).retractAll = function (clause) {
|
|
4062
|
-
return this.
|
|
4323
|
+
return this.x1l(clause);
|
|
4063
4324
|
};
|
|
4064
|
-
protoOf(MutableIndexedTheory).
|
|
4065
|
-
return this.
|
|
4325
|
+
protoOf(MutableIndexedTheory).w1r = function (clause) {
|
|
4326
|
+
return this.o1s(TheoryUtils_instance.b1m(clause));
|
|
4066
4327
|
};
|
|
4067
4328
|
protoOf(MutableIndexedTheory).plus = function (clause) {
|
|
4068
|
-
return this.
|
|
4329
|
+
return this.w1r(clause);
|
|
4069
4330
|
};
|
|
4070
|
-
protoOf(MutableIndexedTheory).
|
|
4331
|
+
protoOf(MutableIndexedTheory).i1s = function (theory) {
|
|
4071
4332
|
var tmp;
|
|
4072
4333
|
if (theory === this) {
|
|
4073
|
-
tmp = this.
|
|
4334
|
+
tmp = this.p1s(toList_0(theory));
|
|
4074
4335
|
} else {
|
|
4075
|
-
tmp = this.
|
|
4336
|
+
tmp = this.p1s(theory);
|
|
4076
4337
|
}
|
|
4077
4338
|
return tmp;
|
|
4078
4339
|
};
|
|
4079
4340
|
protoOf(MutableIndexedTheory).plusTheory = function (theory) {
|
|
4080
|
-
return this.
|
|
4341
|
+
return this.i1s(theory);
|
|
4081
4342
|
};
|
|
4082
|
-
protoOf(MutableIndexedTheory).
|
|
4343
|
+
protoOf(MutableIndexedTheory).k1s = function (clause) {
|
|
4083
4344
|
// Inline function 'kotlin.also' call
|
|
4084
4345
|
// Inline function 'kotlin.contracts.contract' call
|
|
4085
4346
|
// Inline function 'it.unibo.tuprolog.theory.impl.MutableIndexedTheory.assertA.<anonymous>' call
|
|
4086
|
-
this.
|
|
4347
|
+
this.k1u_1.c1m(TheoryUtils_instance.b1m(clause));
|
|
4087
4348
|
return this;
|
|
4088
4349
|
};
|
|
4089
4350
|
protoOf(MutableIndexedTheory).assertA = function (clause) {
|
|
4090
|
-
return this.
|
|
4351
|
+
return this.k1s(clause);
|
|
4091
4352
|
};
|
|
4092
|
-
protoOf(MutableIndexedTheory).
|
|
4353
|
+
protoOf(MutableIndexedTheory).m1s = function (clauses) {
|
|
4093
4354
|
// Inline function 'kotlin.also' call
|
|
4094
4355
|
// Inline function 'kotlin.contracts.contract' call
|
|
4095
4356
|
// Inline function 'it.unibo.tuprolog.theory.impl.MutableIndexedTheory.assertA.<anonymous>' call
|
|
4096
|
-
var tmp0_iterator = asReversed(toList_0(TheoryUtils_instance.
|
|
4357
|
+
var tmp0_iterator = asReversed(toList_0(TheoryUtils_instance.m1m(clauses))).r();
|
|
4097
4358
|
while (tmp0_iterator.s()) {
|
|
4098
4359
|
var clause = tmp0_iterator.u();
|
|
4099
|
-
this.
|
|
4360
|
+
this.k1u_1.c1m(clause);
|
|
4100
4361
|
}
|
|
4101
4362
|
return this;
|
|
4102
4363
|
};
|
|
4103
4364
|
protoOf(MutableIndexedTheory).assertAIterable = function (clauses) {
|
|
4104
|
-
return this.
|
|
4365
|
+
return this.m1s(clauses);
|
|
4105
4366
|
};
|
|
4106
|
-
protoOf(MutableIndexedTheory).
|
|
4107
|
-
return this.
|
|
4367
|
+
protoOf(MutableIndexedTheory).n1s = function (clauses) {
|
|
4368
|
+
return this.m1s(asIterable(clauses));
|
|
4108
4369
|
};
|
|
4109
4370
|
protoOf(MutableIndexedTheory).assertASequence = function (clauses) {
|
|
4110
|
-
return this.
|
|
4371
|
+
return this.n1s(clauses);
|
|
4111
4372
|
};
|
|
4112
|
-
protoOf(MutableIndexedTheory).
|
|
4373
|
+
protoOf(MutableIndexedTheory).o1s = function (clause) {
|
|
4113
4374
|
// Inline function 'kotlin.also' call
|
|
4114
4375
|
// Inline function 'kotlin.contracts.contract' call
|
|
4115
4376
|
// Inline function 'it.unibo.tuprolog.theory.impl.MutableIndexedTheory.assertZ.<anonymous>' call
|
|
4116
|
-
this.
|
|
4377
|
+
this.k1u_1.d1m(TheoryUtils_instance.b1m(clause));
|
|
4117
4378
|
return this;
|
|
4118
4379
|
};
|
|
4119
4380
|
protoOf(MutableIndexedTheory).assertZ = function (clause) {
|
|
4120
|
-
return this.
|
|
4381
|
+
return this.o1s(clause);
|
|
4121
4382
|
};
|
|
4122
|
-
protoOf(MutableIndexedTheory).
|
|
4383
|
+
protoOf(MutableIndexedTheory).p1s = function (clauses) {
|
|
4123
4384
|
// Inline function 'kotlin.also' call
|
|
4124
4385
|
// Inline function 'kotlin.contracts.contract' call
|
|
4125
4386
|
// Inline function 'it.unibo.tuprolog.theory.impl.MutableIndexedTheory.assertZ.<anonymous>' call
|
|
4126
|
-
this.
|
|
4387
|
+
this.k1u_1.t1l(TheoryUtils_instance.m1m(clauses));
|
|
4127
4388
|
return this;
|
|
4128
4389
|
};
|
|
4129
4390
|
protoOf(MutableIndexedTheory).assertZIterable = function (clauses) {
|
|
4130
|
-
return this.
|
|
4391
|
+
return this.p1s(clauses);
|
|
4131
4392
|
};
|
|
4132
|
-
protoOf(MutableIndexedTheory).
|
|
4133
|
-
return this.
|
|
4393
|
+
protoOf(MutableIndexedTheory).q1s = function (clauses) {
|
|
4394
|
+
return this.p1s(TheoryUtils_instance.m1m(asIterable(clauses)));
|
|
4134
4395
|
};
|
|
4135
4396
|
protoOf(MutableIndexedTheory).assertZSequence = function (clauses) {
|
|
4136
|
-
return this.
|
|
4397
|
+
return this.q1s(clauses);
|
|
4137
4398
|
};
|
|
4138
|
-
protoOf(MutableIndexedTheory).
|
|
4139
|
-
return this.
|
|
4399
|
+
protoOf(MutableIndexedTheory).s1s = function (clauses) {
|
|
4400
|
+
return this.t1s(asIterable(clauses));
|
|
4140
4401
|
};
|
|
4141
4402
|
protoOf(MutableIndexedTheory).retractSequence = function (clauses) {
|
|
4142
|
-
return this.
|
|
4403
|
+
return this.s1s(clauses);
|
|
4143
4404
|
};
|
|
4144
|
-
protoOf(MutableIndexedTheory).
|
|
4145
|
-
return protoOf(AbstractIndexedTheory).
|
|
4405
|
+
protoOf(MutableIndexedTheory).b1s = function (indicator) {
|
|
4406
|
+
return protoOf(AbstractIndexedTheory).b1s.call(this, indicator).toMutableTheory();
|
|
4146
4407
|
};
|
|
4147
4408
|
protoOf(MutableIndexedTheory).abolish = function (indicator) {
|
|
4148
|
-
return this.
|
|
4409
|
+
return this.b1s(indicator);
|
|
4149
4410
|
};
|
|
4150
|
-
protoOf(MutableIndexedTheory).
|
|
4151
|
-
return Companion_instance_10.indexedOfIterable(this.
|
|
4411
|
+
protoOf(MutableIndexedTheory).v1r = function () {
|
|
4412
|
+
return Companion_instance_10.indexedOfIterable(this.f1l(), this);
|
|
4152
4413
|
};
|
|
4153
4414
|
protoOf(MutableIndexedTheory).toImmutableTheory = function () {
|
|
4154
|
-
return this.
|
|
4415
|
+
return this.v1r();
|
|
4155
4416
|
};
|
|
4156
4417
|
protoOf(MutableIndexedTheory).u12 = function (tags) {
|
|
4157
|
-
return tags === this.vt() ? this : new MutableIndexedTheory(this.
|
|
4418
|
+
return tags === this.vt() ? this : new MutableIndexedTheory(this.k1u_1, tags);
|
|
4158
4419
|
};
|
|
4159
4420
|
protoOf(MutableIndexedTheory).resetTags = function (tags) {
|
|
4160
4421
|
return this.u12(tags);
|
|
4161
4422
|
};
|
|
4162
|
-
protoOf(MutableIndexedTheory).
|
|
4163
|
-
return this.
|
|
4423
|
+
protoOf(MutableIndexedTheory).u1s = function () {
|
|
4424
|
+
return this.h1s(asSequence(this.p1l()));
|
|
4164
4425
|
};
|
|
4165
4426
|
protoOf(MutableIndexedTheory).clone = function () {
|
|
4166
|
-
return this.
|
|
4427
|
+
return this.u1s();
|
|
4167
4428
|
};
|
|
4168
4429
|
protoOf(MutableIndexedTheory).assertAFact = function (struct) {
|
|
4169
|
-
return this.
|
|
4430
|
+
return this.j1t(struct);
|
|
4170
4431
|
};
|
|
4171
4432
|
protoOf(MutableIndexedTheory).assertZFact = function (struct) {
|
|
4172
|
-
return this.
|
|
4433
|
+
return this.k1t(struct);
|
|
4173
4434
|
};
|
|
4174
4435
|
protoOf(MutableIndexedTheory).retractByHead = function (head) {
|
|
4175
|
-
return this.
|
|
4436
|
+
return this.m1t(head);
|
|
4176
4437
|
};
|
|
4177
4438
|
protoOf(MutableIndexedTheory).retractAllByHead = function (head) {
|
|
4178
|
-
return this.
|
|
4439
|
+
return this.n1t(head);
|
|
4179
4440
|
};
|
|
4180
4441
|
function MutableListedTheory_init_$Init$(unificator, clauses, tags, $this) {
|
|
4181
4442
|
tags = tags === VOID ? emptyMap() : tags;
|
|
4182
4443
|
MutableListedTheory.call($this, unificator, toMutableList(clauses), tags);
|
|
4183
|
-
TheoryUtils_instance.
|
|
4444
|
+
TheoryUtils_instance.m1m(clauses);
|
|
4184
4445
|
return $this;
|
|
4185
4446
|
}
|
|
4186
4447
|
function MutableListedTheory_init_$Create$(unificator, clauses, tags) {
|
|
@@ -4189,7 +4450,7 @@
|
|
|
4189
4450
|
function MutableListedTheory_init_$Init$_0(unificator, clauses, tags, $this) {
|
|
4190
4451
|
tags = tags === VOID ? emptyMap() : tags;
|
|
4191
4452
|
MutableListedTheory.call($this, unificator, toMutableList_0(clauses), tags);
|
|
4192
|
-
TheoryUtils_instance.
|
|
4453
|
+
TheoryUtils_instance.j1s(clauses);
|
|
4193
4454
|
return $this;
|
|
4194
4455
|
}
|
|
4195
4456
|
function MutableListedTheory_init_$Create$_0(unificator, clauses, tags) {
|
|
@@ -4197,32 +4458,32 @@
|
|
|
4197
4458
|
}
|
|
4198
4459
|
function MutableListedTheory(unificator, clauses, tags) {
|
|
4199
4460
|
AbstractListedTheory.call(this, unificator, clauses, tags);
|
|
4200
|
-
this.
|
|
4461
|
+
this.o1u_1 = clauses;
|
|
4201
4462
|
}
|
|
4202
|
-
protoOf(MutableListedTheory).
|
|
4203
|
-
return this.
|
|
4463
|
+
protoOf(MutableListedTheory).p1l = function () {
|
|
4464
|
+
return this.o1u_1;
|
|
4204
4465
|
};
|
|
4205
|
-
protoOf(MutableListedTheory).
|
|
4206
|
-
this.
|
|
4466
|
+
protoOf(MutableListedTheory).g1s = function (unificator) {
|
|
4467
|
+
this.y1t(unificator);
|
|
4207
4468
|
return this;
|
|
4208
4469
|
};
|
|
4209
4470
|
protoOf(MutableListedTheory).setUnificator = function (unificator) {
|
|
4210
|
-
return this.
|
|
4471
|
+
return this.g1s(unificator);
|
|
4211
4472
|
};
|
|
4212
|
-
protoOf(MutableListedTheory).
|
|
4473
|
+
protoOf(MutableListedTheory).i1t = function () {
|
|
4213
4474
|
return toMutableTheory.call(this);
|
|
4214
4475
|
};
|
|
4215
4476
|
protoOf(MutableListedTheory).toMutableTheory = function () {
|
|
4216
|
-
return this.
|
|
4477
|
+
return this.i1t();
|
|
4217
4478
|
};
|
|
4218
|
-
protoOf(MutableListedTheory).
|
|
4479
|
+
protoOf(MutableListedTheory).r1s = function (clauses, tags, unificator) {
|
|
4219
4480
|
return MutableListedTheory_init_$Create$_0(unificator, clauses, tags);
|
|
4220
4481
|
};
|
|
4221
|
-
protoOf(MutableListedTheory).
|
|
4222
|
-
var i = this.
|
|
4482
|
+
protoOf(MutableListedTheory).l1t = function (clause) {
|
|
4483
|
+
var i = this.o1u_1.z1();
|
|
4223
4484
|
while (i.s()) {
|
|
4224
4485
|
var c = i.u();
|
|
4225
|
-
if (this.
|
|
4486
|
+
if (this.f1l().match(c, clause)) {
|
|
4226
4487
|
i.t();
|
|
4227
4488
|
return new Success_0(this, listOf_0(c));
|
|
4228
4489
|
}
|
|
@@ -4230,10 +4491,10 @@
|
|
|
4230
4491
|
return new Failure_0(this);
|
|
4231
4492
|
};
|
|
4232
4493
|
protoOf(MutableListedTheory).retract = function (clause) {
|
|
4233
|
-
return this.
|
|
4494
|
+
return this.l1t(clause);
|
|
4234
4495
|
};
|
|
4235
|
-
protoOf(MutableListedTheory).
|
|
4236
|
-
var i = this.
|
|
4496
|
+
protoOf(MutableListedTheory).t1s = function (clauses) {
|
|
4497
|
+
var i = this.o1u_1.z1();
|
|
4237
4498
|
// Inline function 'kotlin.collections.mutableListOf' call
|
|
4238
4499
|
var retracted = ArrayList_init_$Create$_0();
|
|
4239
4500
|
while (i.s()) {
|
|
@@ -4241,7 +4502,7 @@
|
|
|
4241
4502
|
var tmp0_iterator = clauses.r();
|
|
4242
4503
|
while (tmp0_iterator.s()) {
|
|
4243
4504
|
var clause = tmp0_iterator.u();
|
|
4244
|
-
if (this.
|
|
4505
|
+
if (this.f1l().match(c, clause)) {
|
|
4245
4506
|
retracted.o(c);
|
|
4246
4507
|
i.t();
|
|
4247
4508
|
}
|
|
@@ -4256,15 +4517,15 @@
|
|
|
4256
4517
|
return tmp;
|
|
4257
4518
|
};
|
|
4258
4519
|
protoOf(MutableListedTheory).retractIterable = function (clauses) {
|
|
4259
|
-
return this.
|
|
4520
|
+
return this.t1s(clauses);
|
|
4260
4521
|
};
|
|
4261
|
-
protoOf(MutableListedTheory).
|
|
4262
|
-
var i = this.
|
|
4522
|
+
protoOf(MutableListedTheory).x1l = function (clause) {
|
|
4523
|
+
var i = this.o1u_1.z1();
|
|
4263
4524
|
// Inline function 'kotlin.collections.mutableListOf' call
|
|
4264
4525
|
var retracted = ArrayList_init_$Create$_0();
|
|
4265
4526
|
while (i.s()) {
|
|
4266
4527
|
var c = i.u();
|
|
4267
|
-
if (this.
|
|
4528
|
+
if (this.f1l().match(c, clause)) {
|
|
4268
4529
|
retracted.o(c);
|
|
4269
4530
|
i.t();
|
|
4270
4531
|
}
|
|
@@ -4278,119 +4539,119 @@
|
|
|
4278
4539
|
return tmp;
|
|
4279
4540
|
};
|
|
4280
4541
|
protoOf(MutableListedTheory).retractAll = function (clause) {
|
|
4281
|
-
return this.
|
|
4542
|
+
return this.x1l(clause);
|
|
4282
4543
|
};
|
|
4283
|
-
protoOf(MutableListedTheory).
|
|
4284
|
-
return this.
|
|
4544
|
+
protoOf(MutableListedTheory).w1r = function (clause) {
|
|
4545
|
+
return this.o1s(clause);
|
|
4285
4546
|
};
|
|
4286
4547
|
protoOf(MutableListedTheory).plus = function (clause) {
|
|
4287
|
-
return this.
|
|
4548
|
+
return this.w1r(clause);
|
|
4288
4549
|
};
|
|
4289
|
-
protoOf(MutableListedTheory).
|
|
4550
|
+
protoOf(MutableListedTheory).i1s = function (theory) {
|
|
4290
4551
|
var tmp;
|
|
4291
4552
|
if (theory === this) {
|
|
4292
|
-
tmp = this.
|
|
4553
|
+
tmp = this.p1s(toList_0(theory));
|
|
4293
4554
|
} else {
|
|
4294
|
-
tmp = this.
|
|
4555
|
+
tmp = this.p1s(theory);
|
|
4295
4556
|
}
|
|
4296
4557
|
return tmp;
|
|
4297
4558
|
};
|
|
4298
4559
|
protoOf(MutableListedTheory).plusTheory = function (theory) {
|
|
4299
|
-
return this.
|
|
4560
|
+
return this.i1s(theory);
|
|
4300
4561
|
};
|
|
4301
|
-
protoOf(MutableListedTheory).
|
|
4562
|
+
protoOf(MutableListedTheory).k1s = function (clause) {
|
|
4302
4563
|
// Inline function 'kotlin.also' call
|
|
4303
4564
|
// Inline function 'kotlin.contracts.contract' call
|
|
4304
4565
|
// Inline function 'it.unibo.tuprolog.theory.impl.MutableListedTheory.assertA.<anonymous>' call
|
|
4305
|
-
addFirst(this.
|
|
4566
|
+
addFirst(this.o1u_1, TheoryUtils_instance.b1m(clause));
|
|
4306
4567
|
return this;
|
|
4307
4568
|
};
|
|
4308
4569
|
protoOf(MutableListedTheory).assertA = function (clause) {
|
|
4309
|
-
return this.
|
|
4570
|
+
return this.k1s(clause);
|
|
4310
4571
|
};
|
|
4311
|
-
protoOf(MutableListedTheory).
|
|
4572
|
+
protoOf(MutableListedTheory).m1s = function (clauses) {
|
|
4312
4573
|
// Inline function 'kotlin.also' call
|
|
4313
4574
|
// Inline function 'kotlin.contracts.contract' call
|
|
4314
4575
|
// Inline function 'it.unibo.tuprolog.theory.impl.MutableListedTheory.assertA.<anonymous>' call
|
|
4315
|
-
addFirst_0(this.
|
|
4576
|
+
addFirst_0(this.o1u_1, TheoryUtils_instance.m1m(clauses));
|
|
4316
4577
|
return this;
|
|
4317
4578
|
};
|
|
4318
4579
|
protoOf(MutableListedTheory).assertAIterable = function (clauses) {
|
|
4319
|
-
return this.
|
|
4580
|
+
return this.m1s(clauses);
|
|
4320
4581
|
};
|
|
4321
|
-
protoOf(MutableListedTheory).
|
|
4322
|
-
return this.
|
|
4582
|
+
protoOf(MutableListedTheory).n1s = function (clauses) {
|
|
4583
|
+
return this.m1s(asIterable(clauses));
|
|
4323
4584
|
};
|
|
4324
4585
|
protoOf(MutableListedTheory).assertASequence = function (clauses) {
|
|
4325
|
-
return this.
|
|
4586
|
+
return this.n1s(clauses);
|
|
4326
4587
|
};
|
|
4327
|
-
protoOf(MutableListedTheory).
|
|
4588
|
+
protoOf(MutableListedTheory).o1s = function (clause) {
|
|
4328
4589
|
// Inline function 'kotlin.also' call
|
|
4329
4590
|
// Inline function 'kotlin.contracts.contract' call
|
|
4330
4591
|
// Inline function 'it.unibo.tuprolog.theory.impl.MutableListedTheory.assertZ.<anonymous>' call
|
|
4331
|
-
this.
|
|
4592
|
+
this.o1u_1.o(TheoryUtils_instance.b1m(clause));
|
|
4332
4593
|
return this;
|
|
4333
4594
|
};
|
|
4334
4595
|
protoOf(MutableListedTheory).assertZ = function (clause) {
|
|
4335
|
-
return this.
|
|
4596
|
+
return this.o1s(clause);
|
|
4336
4597
|
};
|
|
4337
|
-
protoOf(MutableListedTheory).
|
|
4598
|
+
protoOf(MutableListedTheory).p1s = function (clauses) {
|
|
4338
4599
|
// Inline function 'kotlin.also' call
|
|
4339
4600
|
// Inline function 'kotlin.contracts.contract' call
|
|
4340
4601
|
// Inline function 'it.unibo.tuprolog.theory.impl.MutableListedTheory.assertZ.<anonymous>' call
|
|
4341
|
-
addAll(this.
|
|
4602
|
+
addAll(this.o1u_1, TheoryUtils_instance.m1m(clauses));
|
|
4342
4603
|
return this;
|
|
4343
4604
|
};
|
|
4344
4605
|
protoOf(MutableListedTheory).assertZIterable = function (clauses) {
|
|
4345
|
-
return this.
|
|
4606
|
+
return this.p1s(clauses);
|
|
4346
4607
|
};
|
|
4347
|
-
protoOf(MutableListedTheory).
|
|
4348
|
-
return this.
|
|
4608
|
+
protoOf(MutableListedTheory).q1s = function (clauses) {
|
|
4609
|
+
return this.p1s(asIterable(clauses));
|
|
4349
4610
|
};
|
|
4350
4611
|
protoOf(MutableListedTheory).assertZSequence = function (clauses) {
|
|
4351
|
-
return this.
|
|
4612
|
+
return this.q1s(clauses);
|
|
4352
4613
|
};
|
|
4353
|
-
protoOf(MutableListedTheory).
|
|
4354
|
-
return this.
|
|
4614
|
+
protoOf(MutableListedTheory).s1s = function (clauses) {
|
|
4615
|
+
return this.t1s(asIterable(clauses));
|
|
4355
4616
|
};
|
|
4356
4617
|
protoOf(MutableListedTheory).retractSequence = function (clauses) {
|
|
4357
|
-
return this.
|
|
4618
|
+
return this.s1s(clauses);
|
|
4358
4619
|
};
|
|
4359
|
-
protoOf(MutableListedTheory).
|
|
4360
|
-
return protoOf(AbstractListedTheory).
|
|
4620
|
+
protoOf(MutableListedTheory).b1s = function (indicator) {
|
|
4621
|
+
return protoOf(AbstractListedTheory).b1s.call(this, indicator).toMutableTheory();
|
|
4361
4622
|
};
|
|
4362
4623
|
protoOf(MutableListedTheory).abolish = function (indicator) {
|
|
4363
|
-
return this.
|
|
4624
|
+
return this.b1s(indicator);
|
|
4364
4625
|
};
|
|
4365
|
-
protoOf(MutableListedTheory).
|
|
4366
|
-
return Companion_instance_10.listedOfIterable(this.
|
|
4626
|
+
protoOf(MutableListedTheory).v1r = function () {
|
|
4627
|
+
return Companion_instance_10.listedOfIterable(this.f1l(), this);
|
|
4367
4628
|
};
|
|
4368
4629
|
protoOf(MutableListedTheory).toImmutableTheory = function () {
|
|
4369
|
-
return this.
|
|
4630
|
+
return this.v1r();
|
|
4370
4631
|
};
|
|
4371
4632
|
protoOf(MutableListedTheory).u12 = function (tags) {
|
|
4372
|
-
return tags === this.vt() ? this : new MutableListedTheory(this.
|
|
4633
|
+
return tags === this.vt() ? this : new MutableListedTheory(this.f1l(), this.o1u_1, tags);
|
|
4373
4634
|
};
|
|
4374
4635
|
protoOf(MutableListedTheory).resetTags = function (tags) {
|
|
4375
4636
|
return this.u12(tags);
|
|
4376
4637
|
};
|
|
4377
|
-
protoOf(MutableListedTheory).
|
|
4378
|
-
return this.
|
|
4638
|
+
protoOf(MutableListedTheory).u1s = function () {
|
|
4639
|
+
return this.h1s(asSequence(this.o1u_1));
|
|
4379
4640
|
};
|
|
4380
4641
|
protoOf(MutableListedTheory).clone = function () {
|
|
4381
|
-
return this.
|
|
4642
|
+
return this.u1s();
|
|
4382
4643
|
};
|
|
4383
4644
|
protoOf(MutableListedTheory).assertAFact = function (struct) {
|
|
4384
|
-
return this.
|
|
4645
|
+
return this.j1t(struct);
|
|
4385
4646
|
};
|
|
4386
4647
|
protoOf(MutableListedTheory).assertZFact = function (struct) {
|
|
4387
|
-
return this.
|
|
4648
|
+
return this.k1t(struct);
|
|
4388
4649
|
};
|
|
4389
4650
|
protoOf(MutableListedTheory).retractByHead = function (head) {
|
|
4390
|
-
return this.
|
|
4651
|
+
return this.m1t(head);
|
|
4391
4652
|
};
|
|
4392
4653
|
protoOf(MutableListedTheory).retractAllByHead = function (head) {
|
|
4393
|
-
return this.
|
|
4654
|
+
return this.n1t(head);
|
|
4394
4655
|
};
|
|
4395
4656
|
function takeFirstAfterSkipping(_this__u8e3s4, n) {
|
|
4396
4657
|
var iter = _this__u8e3s4.r();
|
|
@@ -4409,50 +4670,66 @@
|
|
|
4409
4670
|
}
|
|
4410
4671
|
//region block: post-declaration
|
|
4411
4672
|
defineProp(protoOf(RetrieveResult), 'collection', function () {
|
|
4412
|
-
return this.
|
|
4673
|
+
return this.h1m();
|
|
4413
4674
|
});
|
|
4414
4675
|
defineProp(protoOf(RetrieveResult), 'clauses', function () {
|
|
4415
|
-
return this.
|
|
4676
|
+
return this.p1l();
|
|
4416
4677
|
});
|
|
4417
4678
|
defineProp(protoOf(RetrieveResult), 'firstClause', function () {
|
|
4418
|
-
return this.
|
|
4679
|
+
return this.i1m();
|
|
4419
4680
|
});
|
|
4420
|
-
protoOf(MutableReteClauseQueue).
|
|
4421
|
-
protoOf(ReteClauseQueue).
|
|
4422
|
-
protoOf(IndexedClause$Companion$wrap$1).
|
|
4423
|
-
protoOf(IndexedClause$Companion$wrap$1).
|
|
4681
|
+
protoOf(MutableReteClauseQueue).n1l = get;
|
|
4682
|
+
protoOf(ReteClauseQueue).n1l = get;
|
|
4683
|
+
protoOf(IndexedClause$Companion$wrap$1).k1n = get_innerClause;
|
|
4684
|
+
protoOf(IndexedClause$Companion$wrap$1).s1o = plus_1;
|
|
4424
4685
|
protoOf(IndexedClause$Companion$wrap$1).kt = compareTo;
|
|
4425
|
-
protoOf(SituatedIndexedClause$Companion$of$1).
|
|
4426
|
-
protoOf(SituatedIndexedClause$Companion$of$1).
|
|
4686
|
+
protoOf(SituatedIndexedClause$Companion$of$1).k1n = get_innerClause;
|
|
4687
|
+
protoOf(SituatedIndexedClause$Companion$of$1).s1o = plus_1;
|
|
4427
4688
|
protoOf(SituatedIndexedClause$Companion$of$1).kt = compareTo;
|
|
4428
|
-
protoOf(AbstractTheory).
|
|
4429
|
-
protoOf(AbstractTheory).
|
|
4430
|
-
protoOf(AbstractTheory).
|
|
4689
|
+
protoOf(AbstractTheory).v1s = get_isMutable;
|
|
4690
|
+
protoOf(AbstractTheory).j1l = get_rules;
|
|
4691
|
+
protoOf(AbstractTheory).i1l = get_directives;
|
|
4431
4692
|
protoOf(AbstractTheory).assertAFact = assertAFact;
|
|
4432
4693
|
protoOf(AbstractTheory).assertZFact = assertZFact;
|
|
4433
4694
|
protoOf(AbstractTheory).retractByHead = retractByHead;
|
|
4434
4695
|
protoOf(AbstractTheory).retractAllByHead = retractAllByHead;
|
|
4435
4696
|
protoOf(AbstractTheory).getTag = getTag;
|
|
4436
4697
|
protoOf(AbstractTheory).containsTag = containsTag;
|
|
4698
|
+
protoOf(IndexedTheoryFactory).emptyTheory = emptyTheory;
|
|
4699
|
+
protoOf(IndexedTheoryFactory).theoryOfIterable = theoryOfIterable;
|
|
4700
|
+
protoOf(IndexedTheoryFactory).theoryOf = theoryOf;
|
|
4701
|
+
protoOf(IndexedTheoryFactory).theoryOfSequence = theoryOfSequence;
|
|
4702
|
+
protoOf(IndexedTheoryFactory).emptyMutableTheory = emptyMutableTheory;
|
|
4703
|
+
protoOf(IndexedTheoryFactory).mutableTheoryOfIterable = mutableTheoryOfIterable;
|
|
4704
|
+
protoOf(IndexedTheoryFactory).mutableTheoryOf = mutableTheoryOf;
|
|
4705
|
+
protoOf(IndexedTheoryFactory).mutableTheoryOfSequence = mutableTheoryOfSequence;
|
|
4706
|
+
protoOf(ListedTheoryFactory).emptyTheory = emptyTheory;
|
|
4707
|
+
protoOf(ListedTheoryFactory).theoryOfIterable = theoryOfIterable;
|
|
4708
|
+
protoOf(ListedTheoryFactory).theoryOf = theoryOf;
|
|
4709
|
+
protoOf(ListedTheoryFactory).theoryOfSequence = theoryOfSequence;
|
|
4710
|
+
protoOf(ListedTheoryFactory).emptyMutableTheory = emptyMutableTheory;
|
|
4711
|
+
protoOf(ListedTheoryFactory).mutableTheoryOfIterable = mutableTheoryOfIterable;
|
|
4712
|
+
protoOf(ListedTheoryFactory).mutableTheoryOf = mutableTheoryOf;
|
|
4713
|
+
protoOf(ListedTheoryFactory).mutableTheoryOfSequence = mutableTheoryOfSequence;
|
|
4437
4714
|
defineProp(protoOf(RetractResult), 'theory', function () {
|
|
4438
|
-
return this.
|
|
4715
|
+
return this.c1s();
|
|
4439
4716
|
});
|
|
4440
4717
|
defineProp(protoOf(RetractResult), 'clauses', function () {
|
|
4441
|
-
return this.
|
|
4718
|
+
return this.p1l();
|
|
4442
4719
|
});
|
|
4443
4720
|
defineProp(protoOf(RetractResult), 'firstClause', function () {
|
|
4444
|
-
return this.
|
|
4721
|
+
return this.i1m();
|
|
4445
4722
|
});
|
|
4446
|
-
protoOf(MutableIndexedTheory).
|
|
4447
|
-
protoOf(MutableIndexedTheory).
|
|
4448
|
-
protoOf(MutableIndexedTheory).
|
|
4449
|
-
protoOf(MutableIndexedTheory).
|
|
4450
|
-
protoOf(MutableIndexedTheory).
|
|
4451
|
-
protoOf(MutableListedTheory).
|
|
4452
|
-
protoOf(MutableListedTheory).
|
|
4453
|
-
protoOf(MutableListedTheory).
|
|
4454
|
-
protoOf(MutableListedTheory).
|
|
4455
|
-
protoOf(MutableListedTheory).
|
|
4723
|
+
protoOf(MutableIndexedTheory).j1t = assertAFact_0;
|
|
4724
|
+
protoOf(MutableIndexedTheory).k1t = assertZFact_0;
|
|
4725
|
+
protoOf(MutableIndexedTheory).m1t = retractByHead_0;
|
|
4726
|
+
protoOf(MutableIndexedTheory).v1s = get_isMutable_0;
|
|
4727
|
+
protoOf(MutableIndexedTheory).n1t = retractAllByHead_0;
|
|
4728
|
+
protoOf(MutableListedTheory).j1t = assertAFact_0;
|
|
4729
|
+
protoOf(MutableListedTheory).k1t = assertZFact_0;
|
|
4730
|
+
protoOf(MutableListedTheory).m1t = retractByHead_0;
|
|
4731
|
+
protoOf(MutableListedTheory).v1s = get_isMutable_0;
|
|
4732
|
+
protoOf(MutableListedTheory).n1t = retractAllByHead_0;
|
|
4456
4733
|
//endregion
|
|
4457
4734
|
//region block: init
|
|
4458
4735
|
Companion_instance_4 = new Companion();
|