@tuprolog/arg2p 0.14.2 → 0.16.2
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-core.js +3265 -3058
- package/2p-core.js.map +1 -1
- package/2p-dsl-core.js +526 -620
- package/2p-dsl-core.js.map +1 -1
- package/2p-dsl-solve.js +259 -259
- package/2p-dsl-solve.js.map +1 -1
- package/2p-dsl-theory.js +172 -171
- package/2p-dsl-theory.js.map +1 -1
- package/2p-dsl-unify.js +6 -6
- package/2p-dsl-unify.js.map +1 -1
- package/2p-parser-core.js +266 -875
- package/2p-parser-core.js.map +1 -1
- package/2p-parser-impl.js +5554 -0
- package/2p-parser-impl.js.map +1 -0
- package/2p-parser-theory.js +199 -45
- package/2p-parser-theory.js.map +1 -1
- package/2p-solve-classic.js +1075 -1081
- package/2p-solve-classic.js.map +1 -1
- package/2p-solve.js +4008 -4039
- package/2p-solve.js.map +1 -1
- package/2p-theory.js +1814 -1834
- package/2p-theory.js.map +1 -1
- package/2p-unify.js +648 -367
- package/2p-unify.js.map +1 -1
- package/2p-utils.js +475 -479
- package/2p-utils.js.map +1 -1
- package/arg2p-causality-solver.js +571 -265
- package/arg2p-causality-solver.js.map +1 -1
- package/arg2p-core.js +2199 -2029
- package/arg2p-core.js.map +1 -1
- package/arg2p.js +125 -125
- package/arg2p.js.map +1 -1
- package/kotlin-kotlin-stdlib.js +2965 -2707
- package/kotlin-kotlin-stdlib.js.map +1 -1
- package/kt-math.js +1598 -1598
- package/kt-math.js.map +1 -1
- package/package.json +2 -5
- package/2p-parser-js.js +0 -39
- package/2p-parser-js.js.map +0 -1
package/2p-dsl-theory.js
CHANGED
|
@@ -28,21 +28,21 @@
|
|
|
28
28
|
'use strict';
|
|
29
29
|
//region block: imports
|
|
30
30
|
var VOID = kotlin_kotlin.$_$.b;
|
|
31
|
-
var Companion_getInstance = kotlin_it_unibo_tuprolog_unify.$_$.
|
|
32
|
-
var protoOf = kotlin_kotlin.$_$.
|
|
33
|
-
var Companion_instance = kotlin_it_unibo_tuprolog_core.$_$.
|
|
34
|
-
var Companion_instance_0 = kotlin_it_unibo_tuprolog_dsl_core.$_$.
|
|
35
|
-
var Companion_instance_1 = kotlin_it_unibo_tuprolog_core.$_$.
|
|
31
|
+
var Companion_getInstance = kotlin_it_unibo_tuprolog_unify.$_$.a;
|
|
32
|
+
var protoOf = kotlin_kotlin.$_$.f7;
|
|
33
|
+
var Companion_instance = kotlin_it_unibo_tuprolog_core.$_$.m;
|
|
34
|
+
var Companion_instance_0 = kotlin_it_unibo_tuprolog_dsl_core.$_$.a;
|
|
35
|
+
var Companion_instance_1 = kotlin_it_unibo_tuprolog_core.$_$.v;
|
|
36
36
|
var IndexedTheoryFactory = kotlin_it_unibo_tuprolog_theory.$_$.c;
|
|
37
|
-
var initMetadataForCompanion = kotlin_kotlin.$_$.
|
|
38
|
-
var toString = kotlin_kotlin.$_$.
|
|
39
|
-
var IllegalArgumentException_init_$Create$ = kotlin_kotlin.$_$.
|
|
40
|
-
var Unit_instance = kotlin_kotlin.$_$.
|
|
41
|
-
var equals = kotlin_kotlin.$_$.
|
|
42
|
-
var logicListFromFrom = kotlin_it_unibo_tuprolog_core.$_$.
|
|
43
|
-
var logicListFromIterable = kotlin_it_unibo_tuprolog_core.$_$.
|
|
44
|
-
var logicListFromSequence = kotlin_it_unibo_tuprolog_core.$_$.
|
|
45
|
-
var mguWithOccurCheck = kotlin_it_unibo_tuprolog_unify.$_$.
|
|
37
|
+
var initMetadataForCompanion = kotlin_kotlin.$_$.t6;
|
|
38
|
+
var toString = kotlin_kotlin.$_$.i7;
|
|
39
|
+
var IllegalArgumentException_init_$Create$ = kotlin_kotlin.$_$.e1;
|
|
40
|
+
var Unit_instance = kotlin_kotlin.$_$.o;
|
|
41
|
+
var equals = kotlin_kotlin.$_$.l6;
|
|
42
|
+
var logicListFromFrom = kotlin_it_unibo_tuprolog_core.$_$.z;
|
|
43
|
+
var logicListFromIterable = kotlin_it_unibo_tuprolog_core.$_$.x;
|
|
44
|
+
var logicListFromSequence = kotlin_it_unibo_tuprolog_core.$_$.y;
|
|
45
|
+
var mguWithOccurCheck = kotlin_it_unibo_tuprolog_unify.$_$.b;
|
|
46
46
|
var stringInvoke = kotlin_it_unibo_tuprolog_dsl_core.$_$.v4;
|
|
47
47
|
var structOfAny = kotlin_it_unibo_tuprolog_dsl_core.$_$.a5;
|
|
48
48
|
var tupleOfAny = kotlin_it_unibo_tuprolog_dsl_core.$_$.b5;
|
|
@@ -53,7 +53,7 @@
|
|
|
53
53
|
var directiveOfAny = kotlin_it_unibo_tuprolog_dsl_core.$_$.r4;
|
|
54
54
|
var withScope = kotlin_it_unibo_tuprolog_dsl_core.$_$.z4;
|
|
55
55
|
var logicList = kotlin_it_unibo_tuprolog_dsl_core.$_$.x4;
|
|
56
|
-
var logicList_0 = kotlin_it_unibo_tuprolog_dsl_core.$_$.
|
|
56
|
+
var logicList_0 = kotlin_it_unibo_tuprolog_dsl_core.$_$.b;
|
|
57
57
|
var rule = kotlin_it_unibo_tuprolog_dsl_core.$_$.y4;
|
|
58
58
|
var clause2 = kotlin_it_unibo_tuprolog_dsl_core.$_$.s2;
|
|
59
59
|
var directive = kotlin_it_unibo_tuprolog_dsl_core.$_$.s4;
|
|
@@ -179,26 +179,27 @@
|
|
|
179
179
|
var matchAny = kotlin_it_unibo_tuprolog_dsl_unify.$_$.a;
|
|
180
180
|
var unify = kotlin_it_unibo_tuprolog_dsl_unify.$_$.i;
|
|
181
181
|
var unifyAny = kotlin_it_unibo_tuprolog_dsl_unify.$_$.c;
|
|
182
|
-
var LogicProgrammingScopeWithPrologStandardLibrary = kotlin_it_unibo_tuprolog_dsl_core.$_$.h4;
|
|
183
182
|
var LogicProgrammingScopeWithOperators = kotlin_it_unibo_tuprolog_dsl_core.$_$.w1;
|
|
184
|
-
var LogicProgrammingScopeWithUnification = kotlin_it_unibo_tuprolog_dsl_unify.$_$.j;
|
|
185
|
-
var MinimalLogicProgrammingScope = kotlin_it_unibo_tuprolog_dsl_core.$_$.c5;
|
|
186
183
|
var LogicProgrammingScopeWithSubstitutions = kotlin_it_unibo_tuprolog_dsl_core.$_$.o4;
|
|
184
|
+
var LogicProgrammingScopeWithUnification = kotlin_it_unibo_tuprolog_dsl_unify.$_$.j;
|
|
187
185
|
var BaseLogicProgrammingScope = kotlin_it_unibo_tuprolog_dsl_core.$_$.e;
|
|
188
|
-
var Scope = kotlin_it_unibo_tuprolog_core.$_$.
|
|
186
|
+
var Scope = kotlin_it_unibo_tuprolog_core.$_$.s1;
|
|
187
|
+
var LogicProgrammingScopeWithPrologStandardLibrary = kotlin_it_unibo_tuprolog_dsl_core.$_$.h4;
|
|
188
|
+
var MinimalLogicProgrammingScope = kotlin_it_unibo_tuprolog_dsl_core.$_$.c5;
|
|
189
189
|
var Unificator = kotlin_it_unibo_tuprolog_unify.$_$.c;
|
|
190
190
|
var TheoryFactory = kotlin_it_unibo_tuprolog_theory.$_$.f;
|
|
191
|
-
var initMetadataForClass = kotlin_kotlin.$_$.
|
|
192
|
-
var
|
|
193
|
-
var
|
|
194
|
-
var
|
|
195
|
-
var ArrayList_init_$Create$
|
|
196
|
-
var
|
|
197
|
-
var
|
|
191
|
+
var initMetadataForClass = kotlin_kotlin.$_$.s6;
|
|
192
|
+
var constructCallableReference = kotlin_kotlin.$_$.j6;
|
|
193
|
+
var Clause = kotlin_it_unibo_tuprolog_core.$_$.h1;
|
|
194
|
+
var getKClass = kotlin_kotlin.$_$.y7;
|
|
195
|
+
var ArrayList_init_$Create$ = kotlin_kotlin.$_$.p;
|
|
196
|
+
var ArrayList_init_$Create$_0 = kotlin_kotlin.$_$.q;
|
|
197
|
+
var addAll = kotlin_kotlin.$_$.y1;
|
|
198
|
+
var plus = kotlin_kotlin.$_$.e9;
|
|
198
199
|
var arrayConcat = kotlin_kotlin.$_$.a;
|
|
199
|
-
var listOf = kotlin_kotlin.$_$.
|
|
200
|
-
var flatten = kotlin_kotlin.$_$.
|
|
201
|
-
var initMetadataForInterface = kotlin_kotlin.$_$.
|
|
200
|
+
var listOf = kotlin_kotlin.$_$.n3;
|
|
201
|
+
var flatten = kotlin_kotlin.$_$.a3;
|
|
202
|
+
var initMetadataForInterface = kotlin_kotlin.$_$.u6;
|
|
202
203
|
//endregion
|
|
203
204
|
//region block: pre-declaration
|
|
204
205
|
initMetadataForCompanion(Companion);
|
|
@@ -215,8 +216,8 @@
|
|
|
215
216
|
while (inductionVariable < last) {
|
|
216
217
|
var item = clauseFunctions[inductionVariable];
|
|
217
218
|
inductionVariable = inductionVariable + 1 | 0;
|
|
218
|
-
var tmp$ret$
|
|
219
|
-
destination.
|
|
219
|
+
var tmp$ret$2 = this.convertToClause(item(this.newScope()));
|
|
220
|
+
destination.k(tmp$ret$2);
|
|
220
221
|
}
|
|
221
222
|
return this.theoryOfIterable(destination);
|
|
222
223
|
}
|
|
@@ -246,8 +247,8 @@
|
|
|
246
247
|
while (inductionVariable < last) {
|
|
247
248
|
var item = clauseFunctions[inductionVariable];
|
|
248
249
|
inductionVariable = inductionVariable + 1 | 0;
|
|
249
|
-
var tmp$ret$
|
|
250
|
-
destination.
|
|
250
|
+
var tmp$ret$2 = this.convertToClause(item(this.newScope()));
|
|
251
|
+
destination.k(tmp$ret$2);
|
|
251
252
|
}
|
|
252
253
|
return this.mutableTheoryOfIterable(destination);
|
|
253
254
|
}
|
|
@@ -269,39 +270,39 @@
|
|
|
269
270
|
return this.mutableTheoryOfIterable(flatten(listOf(arrayConcat([[clauses], otherClauses]))));
|
|
270
271
|
}
|
|
271
272
|
initMetadataForInterface(LogicProgrammingScopeWithTheories, 'LogicProgrammingScopeWithTheories', VOID, VOID, [BaseLogicProgrammingScope, Unificator, TheoryFactory]);
|
|
272
|
-
initMetadataForClass(LogicProgrammingScopeImpl, 'LogicProgrammingScopeImpl', VOID, VOID, [
|
|
273
|
+
initMetadataForClass(LogicProgrammingScopeImpl, 'LogicProgrammingScopeImpl', VOID, VOID, [LogicProgrammingScopeWithOperators, LogicProgrammingScopeWithSubstitutions, LogicProgrammingScopeWithUnification, BaseLogicProgrammingScope, Scope, LogicProgrammingScopeWithPrologStandardLibrary, MinimalLogicProgrammingScope, LogicProgrammingScopeWithTheories, Unificator, TheoryFactory]);
|
|
273
274
|
//endregion
|
|
274
275
|
function logicProgramming(unificator, function_0) {
|
|
275
|
-
unificator = unificator === VOID ? Companion_getInstance_0().
|
|
276
|
+
unificator = unificator === VOID ? Companion_getInstance_0().l31_1 : unificator;
|
|
276
277
|
return function_0(Companion_getInstance_0().ofUnificator(unificator));
|
|
277
278
|
}
|
|
278
279
|
function Companion() {
|
|
279
280
|
Companion_instance_2 = this;
|
|
280
|
-
this.
|
|
281
|
+
this.l31_1 = Companion_getInstance().g1m();
|
|
281
282
|
}
|
|
282
283
|
protoOf(Companion).empty = function () {
|
|
283
284
|
return this.of();
|
|
284
285
|
};
|
|
285
|
-
protoOf(Companion).
|
|
286
|
-
return new LogicProgrammingScopeImpl(scope, termificator.
|
|
286
|
+
protoOf(Companion).m31 = function (scope, termificator, variablesProvider, unificator, theoryFactory) {
|
|
287
|
+
return new LogicProgrammingScopeImpl(scope, termificator.a1i() === scope ? termificator : termificator.b1i(scope), variablesProvider.a1i() === scope ? variablesProvider : variablesProvider.b1i(scope), unificator, theoryFactory.n1m() === unificator ? theoryFactory : theoryFactory.f1u(unificator));
|
|
287
288
|
};
|
|
288
289
|
protoOf(Companion).of = function (scope, termificator, variablesProvider, unificator, theoryFactory, $super) {
|
|
289
290
|
scope = scope === VOID ? Companion_instance.empty() : scope;
|
|
290
291
|
termificator = termificator === VOID ? Companion_instance_0.default(scope) : termificator;
|
|
291
|
-
variablesProvider = variablesProvider === VOID ? Companion_instance_1.
|
|
292
|
-
unificator = unificator === VOID ? this.
|
|
292
|
+
variablesProvider = variablesProvider === VOID ? Companion_instance_1.q14(scope) : variablesProvider;
|
|
293
|
+
unificator = unificator === VOID ? this.l31_1 : unificator;
|
|
293
294
|
theoryFactory = theoryFactory === VOID ? new IndexedTheoryFactory(unificator) : theoryFactory;
|
|
294
|
-
return $super === VOID ? this.
|
|
295
|
+
return $super === VOID ? this.m31(scope, termificator, variablesProvider, unificator, theoryFactory) : $super.m31.call(this, scope, termificator, variablesProvider, unificator, theoryFactory);
|
|
295
296
|
};
|
|
296
|
-
protoOf(Companion).
|
|
297
|
-
return this.
|
|
297
|
+
protoOf(Companion).n31 = function (unificator, theoryFactory, scope, termificator, variablesProvider) {
|
|
298
|
+
return this.m31(scope, termificator, variablesProvider, unificator, theoryFactory);
|
|
298
299
|
};
|
|
299
300
|
protoOf(Companion).ofUnificator = function (unificator, theoryFactory, scope, termificator, variablesProvider, $super) {
|
|
300
301
|
theoryFactory = theoryFactory === VOID ? new IndexedTheoryFactory(unificator) : theoryFactory;
|
|
301
302
|
scope = scope === VOID ? Companion_instance.empty() : scope;
|
|
302
303
|
termificator = termificator === VOID ? Companion_instance_0.default(scope) : termificator;
|
|
303
|
-
variablesProvider = variablesProvider === VOID ? Companion_instance_1.
|
|
304
|
-
return $super === VOID ? this.
|
|
304
|
+
variablesProvider = variablesProvider === VOID ? Companion_instance_1.q14(scope) : variablesProvider;
|
|
305
|
+
return $super === VOID ? this.n31(unificator, theoryFactory, scope, termificator, variablesProvider) : $super.n31.call(this, unificator, theoryFactory, scope, termificator, variablesProvider);
|
|
305
306
|
};
|
|
306
307
|
var Companion_instance_2;
|
|
307
308
|
function Companion_getInstance_0() {
|
|
@@ -310,320 +311,320 @@
|
|
|
310
311
|
return Companion_instance_2;
|
|
311
312
|
}
|
|
312
313
|
function LogicProgrammingScopeImpl(scope, termificator, variablesProvider, unificator, theoryFactory) {
|
|
313
|
-
this.
|
|
314
|
-
this.
|
|
315
|
-
this.
|
|
316
|
-
this.
|
|
317
|
-
this.
|
|
314
|
+
this.o31_1 = scope;
|
|
315
|
+
this.p31_1 = termificator;
|
|
316
|
+
this.q31_1 = variablesProvider;
|
|
317
|
+
this.r31_1 = unificator;
|
|
318
|
+
this.s31_1 = theoryFactory;
|
|
318
319
|
// Inline function 'kotlin.require' call
|
|
319
|
-
if (!(this.
|
|
320
|
+
if (!(this.o31_1 === this.q31_1.a1i() && this.o31_1 === this.p31_1.a1i())) {
|
|
320
321
|
var message = 'The provided Scope should be the same object for both Termificator and VariablesProvider';
|
|
321
322
|
throw IllegalArgumentException_init_$Create$(toString(message));
|
|
322
323
|
}
|
|
323
324
|
// Inline function 'kotlin.require' call
|
|
324
|
-
if (!equals(this.
|
|
325
|
+
if (!equals(this.r31_1, this.s31_1.n1m())) {
|
|
325
326
|
var message_0 = 'The provided Unificator should be the same object for both Unificator and TheoryFactory';
|
|
326
327
|
throw IllegalArgumentException_init_$Create$(toString(message_0));
|
|
327
328
|
}
|
|
328
329
|
}
|
|
329
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
330
|
-
return this.
|
|
330
|
+
protoOf(LogicProgrammingScopeImpl).a1i = function () {
|
|
331
|
+
return this.o31_1;
|
|
331
332
|
};
|
|
332
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
333
|
-
return this.
|
|
333
|
+
protoOf(LogicProgrammingScopeImpl).x30 = function () {
|
|
334
|
+
return this.p31_1;
|
|
334
335
|
};
|
|
335
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
336
|
-
return this.
|
|
336
|
+
protoOf(LogicProgrammingScopeImpl).n1m = function () {
|
|
337
|
+
return this.r31_1;
|
|
337
338
|
};
|
|
338
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
339
|
-
return new LogicProgrammingScopeImpl(scope, this.
|
|
339
|
+
protoOf(LogicProgrammingScopeImpl).b1i = function (scope) {
|
|
340
|
+
return new LogicProgrammingScopeImpl(scope, this.p31_1.b1i(scope), this.q31_1.b1i(scope), this.r31_1, this.s31_1);
|
|
340
341
|
};
|
|
341
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
342
|
-
return new LogicProgrammingScopeImpl(this.
|
|
342
|
+
protoOf(LogicProgrammingScopeImpl).f1u = function (unificator) {
|
|
343
|
+
return new LogicProgrammingScopeImpl(this.o31_1, this.p31_1, this.q31_1, unificator, this.s31_1.f1u(unificator));
|
|
343
344
|
};
|
|
344
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
345
|
-
return this.
|
|
345
|
+
protoOf(LogicProgrammingScopeImpl).c31 = function () {
|
|
346
|
+
return this.b1i(Companion_instance.empty());
|
|
346
347
|
};
|
|
347
348
|
protoOf(LogicProgrammingScopeImpl).newScope = function () {
|
|
348
|
-
return this.
|
|
349
|
+
return this.c31();
|
|
349
350
|
};
|
|
350
351
|
protoOf(LogicProgrammingScopeImpl).structOf = function (functor, args) {
|
|
351
|
-
return this.
|
|
352
|
+
return this.q31_1.structOf(functor, args);
|
|
352
353
|
};
|
|
353
354
|
protoOf(LogicProgrammingScopeImpl).structOfSequence = function (functor, args) {
|
|
354
|
-
return this.
|
|
355
|
+
return this.q31_1.structOfSequence(functor, args);
|
|
355
356
|
};
|
|
356
357
|
protoOf(LogicProgrammingScopeImpl).structOfIterable = function (functor, args) {
|
|
357
|
-
return this.
|
|
358
|
+
return this.q31_1.structOfIterable(functor, args);
|
|
358
359
|
};
|
|
359
360
|
protoOf(LogicProgrammingScopeImpl).structOfList = function (functor, args) {
|
|
360
|
-
return this.
|
|
361
|
+
return this.q31_1.structOfList(functor, args);
|
|
361
362
|
};
|
|
362
363
|
protoOf(LogicProgrammingScopeImpl).tupleOf = function (terms) {
|
|
363
|
-
return this.
|
|
364
|
+
return this.q31_1.tupleOf(terms);
|
|
364
365
|
};
|
|
365
366
|
protoOf(LogicProgrammingScopeImpl).tupleOfIterable = function (terms) {
|
|
366
|
-
return this.
|
|
367
|
+
return this.q31_1.tupleOfIterable(terms);
|
|
367
368
|
};
|
|
368
369
|
protoOf(LogicProgrammingScopeImpl).tupleOfSequence = function (terms) {
|
|
369
|
-
return this.
|
|
370
|
+
return this.q31_1.tupleOfSequence(terms);
|
|
370
371
|
};
|
|
371
372
|
protoOf(LogicProgrammingScopeImpl).logicListOf = function (terms) {
|
|
372
|
-
return this.
|
|
373
|
+
return this.q31_1.logicListOf(terms);
|
|
373
374
|
};
|
|
374
375
|
protoOf(LogicProgrammingScopeImpl).logicListOfIterable = function (terms) {
|
|
375
|
-
return this.
|
|
376
|
+
return this.q31_1.logicListOfIterable(terms);
|
|
376
377
|
};
|
|
377
378
|
protoOf(LogicProgrammingScopeImpl).logicListOfSequence = function (terms) {
|
|
378
|
-
return this.
|
|
379
|
+
return this.q31_1.logicListOfSequence(terms);
|
|
379
380
|
};
|
|
380
381
|
protoOf(LogicProgrammingScopeImpl).blockOf = function (terms) {
|
|
381
|
-
return this.
|
|
382
|
+
return this.q31_1.blockOf(terms);
|
|
382
383
|
};
|
|
383
384
|
protoOf(LogicProgrammingScopeImpl).blockOfIterable = function (terms) {
|
|
384
|
-
return this.
|
|
385
|
+
return this.q31_1.blockOfIterable(terms);
|
|
385
386
|
};
|
|
386
387
|
protoOf(LogicProgrammingScopeImpl).blockOfSequence = function (terms) {
|
|
387
|
-
return this.
|
|
388
|
+
return this.q31_1.blockOfSequence(terms);
|
|
388
389
|
};
|
|
389
390
|
protoOf(LogicProgrammingScopeImpl).factOf = function (head) {
|
|
390
|
-
return this.
|
|
391
|
+
return this.q31_1.factOf(head);
|
|
391
392
|
};
|
|
392
393
|
protoOf(LogicProgrammingScopeImpl).consOf = function (head, tail) {
|
|
393
|
-
return this.
|
|
394
|
+
return this.q31_1.consOf(head, tail);
|
|
394
395
|
};
|
|
395
396
|
protoOf(LogicProgrammingScopeImpl).directiveOf = function (body1, body) {
|
|
396
|
-
return this.
|
|
397
|
+
return this.q31_1.directiveOf(body1, body);
|
|
397
398
|
};
|
|
398
399
|
protoOf(LogicProgrammingScopeImpl).containsVar = function (variable) {
|
|
399
|
-
return this.
|
|
400
|
+
return this.q31_1.containsVar(variable);
|
|
400
401
|
};
|
|
401
402
|
protoOf(LogicProgrammingScopeImpl).contains = function (variable) {
|
|
402
|
-
return this.
|
|
403
|
+
return this.q31_1.contains(variable);
|
|
403
404
|
};
|
|
404
405
|
protoOf(LogicProgrammingScopeImpl).get = function (variable) {
|
|
405
|
-
return this.
|
|
406
|
+
return this.q31_1.get(variable);
|
|
406
407
|
};
|
|
407
408
|
protoOf(LogicProgrammingScopeImpl).where = function (lambda) {
|
|
408
|
-
return this.
|
|
409
|
+
return this.q31_1.where(lambda);
|
|
409
410
|
};
|
|
410
411
|
protoOf(LogicProgrammingScopeImpl).with = function (lambda) {
|
|
411
|
-
return this.
|
|
412
|
+
return this.q31_1.with(lambda);
|
|
412
413
|
};
|
|
413
414
|
protoOf(LogicProgrammingScopeImpl).varOf = function (name) {
|
|
414
|
-
return this.
|
|
415
|
+
return this.q31_1.varOf(name);
|
|
415
416
|
};
|
|
416
417
|
protoOf(LogicProgrammingScopeImpl).varOfChar = function (name) {
|
|
417
|
-
return this.
|
|
418
|
+
return this.q31_1.varOfChar(name);
|
|
418
419
|
};
|
|
419
420
|
protoOf(LogicProgrammingScopeImpl).atomOf = function (value) {
|
|
420
|
-
return this.
|
|
421
|
+
return this.q31_1.atomOf(value);
|
|
421
422
|
};
|
|
422
423
|
protoOf(LogicProgrammingScopeImpl).atomOfChar = function (value) {
|
|
423
|
-
return this.
|
|
424
|
+
return this.q31_1.atomOfChar(value);
|
|
424
425
|
};
|
|
425
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
426
|
-
return this.
|
|
426
|
+
protoOf(LogicProgrammingScopeImpl).e11 = function (terms, last) {
|
|
427
|
+
return this.q31_1.e11(terms, last);
|
|
427
428
|
};
|
|
428
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
429
|
-
return this.
|
|
429
|
+
protoOf(LogicProgrammingScopeImpl).f11 = function (terms, last) {
|
|
430
|
+
return this.q31_1.f11(terms, last);
|
|
430
431
|
};
|
|
431
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
432
|
-
return this.
|
|
432
|
+
protoOf(LogicProgrammingScopeImpl).g11 = function (terms, last) {
|
|
433
|
+
return this.q31_1.g11(terms, last);
|
|
433
434
|
};
|
|
434
435
|
protoOf(LogicProgrammingScopeImpl).ruleOf = function (head, body1, body) {
|
|
435
|
-
return this.
|
|
436
|
+
return this.q31_1.ruleOf(head, body1, body);
|
|
436
437
|
};
|
|
437
438
|
protoOf(LogicProgrammingScopeImpl).clauseOf = function (head, body) {
|
|
438
|
-
return this.
|
|
439
|
+
return this.q31_1.clauseOf(head, body);
|
|
439
440
|
};
|
|
440
441
|
protoOf(LogicProgrammingScopeImpl).indicatorOf = function (name, arity) {
|
|
441
|
-
return this.
|
|
442
|
+
return this.q31_1.indicatorOf(name, arity);
|
|
442
443
|
};
|
|
443
444
|
protoOf(LogicProgrammingScopeImpl).indicatorOfStringInt = function (name, arity) {
|
|
444
|
-
return this.
|
|
445
|
+
return this.q31_1.indicatorOfStringInt(name, arity);
|
|
445
446
|
};
|
|
446
447
|
protoOf(LogicProgrammingScopeImpl).anonymous = function () {
|
|
447
|
-
return this.
|
|
448
|
+
return this.q31_1.anonymous();
|
|
448
449
|
};
|
|
449
450
|
protoOf(LogicProgrammingScopeImpl).whatever = function () {
|
|
450
|
-
return this.
|
|
451
|
+
return this.q31_1.whatever();
|
|
451
452
|
};
|
|
452
453
|
protoOf(LogicProgrammingScopeImpl).numOfBigDecimal = function (value) {
|
|
453
|
-
return this.
|
|
454
|
+
return this.q31_1.numOfBigDecimal(value);
|
|
454
455
|
};
|
|
455
456
|
protoOf(LogicProgrammingScopeImpl).numOfDouble = function (value) {
|
|
456
|
-
return this.
|
|
457
|
+
return this.q31_1.numOfDouble(value);
|
|
457
458
|
};
|
|
458
459
|
protoOf(LogicProgrammingScopeImpl).numOfFloat = function (value) {
|
|
459
|
-
return this.
|
|
460
|
+
return this.q31_1.numOfFloat(value);
|
|
460
461
|
};
|
|
461
462
|
protoOf(LogicProgrammingScopeImpl).numOfBigInteger = function (value) {
|
|
462
|
-
return this.
|
|
463
|
+
return this.q31_1.numOfBigInteger(value);
|
|
463
464
|
};
|
|
464
465
|
protoOf(LogicProgrammingScopeImpl).numOfInt = function (value) {
|
|
465
|
-
return this.
|
|
466
|
+
return this.q31_1.numOfInt(value);
|
|
466
467
|
};
|
|
467
468
|
protoOf(LogicProgrammingScopeImpl).numOfLong = function (value) {
|
|
468
|
-
return this.
|
|
469
|
+
return this.q31_1.numOfLong(value);
|
|
469
470
|
};
|
|
470
471
|
protoOf(LogicProgrammingScopeImpl).numOfShort = function (value) {
|
|
471
|
-
return this.
|
|
472
|
+
return this.q31_1.numOfShort(value);
|
|
472
473
|
};
|
|
473
474
|
protoOf(LogicProgrammingScopeImpl).numOfByte = function (value) {
|
|
474
|
-
return this.
|
|
475
|
+
return this.q31_1.numOfByte(value);
|
|
475
476
|
};
|
|
476
477
|
protoOf(LogicProgrammingScopeImpl).parseNum = function (value) {
|
|
477
|
-
return this.
|
|
478
|
+
return this.q31_1.parseNum(value);
|
|
478
479
|
};
|
|
479
480
|
protoOf(LogicProgrammingScopeImpl).numOf = function (value) {
|
|
480
|
-
return this.
|
|
481
|
+
return this.q31_1.numOf(value);
|
|
481
482
|
};
|
|
482
483
|
protoOf(LogicProgrammingScopeImpl).intOfBigInteger = function (value) {
|
|
483
|
-
return this.
|
|
484
|
+
return this.q31_1.intOfBigInteger(value);
|
|
484
485
|
};
|
|
485
486
|
protoOf(LogicProgrammingScopeImpl).intOf = function (value) {
|
|
486
|
-
return this.
|
|
487
|
+
return this.q31_1.intOf(value);
|
|
487
488
|
};
|
|
488
489
|
protoOf(LogicProgrammingScopeImpl).intOfLong = function (value) {
|
|
489
|
-
return this.
|
|
490
|
+
return this.q31_1.intOfLong(value);
|
|
490
491
|
};
|
|
491
492
|
protoOf(LogicProgrammingScopeImpl).intOfShort = function (value) {
|
|
492
|
-
return this.
|
|
493
|
+
return this.q31_1.intOfShort(value);
|
|
493
494
|
};
|
|
494
495
|
protoOf(LogicProgrammingScopeImpl).intOfByte = function (value) {
|
|
495
|
-
return this.
|
|
496
|
+
return this.q31_1.intOfByte(value);
|
|
496
497
|
};
|
|
497
498
|
protoOf(LogicProgrammingScopeImpl).parseInt = function (value) {
|
|
498
|
-
return this.
|
|
499
|
+
return this.q31_1.parseInt(value);
|
|
499
500
|
};
|
|
500
501
|
protoOf(LogicProgrammingScopeImpl).parseIntRadix = function (value, radix) {
|
|
501
|
-
return this.
|
|
502
|
+
return this.q31_1.parseIntRadix(value, radix);
|
|
502
503
|
};
|
|
503
504
|
protoOf(LogicProgrammingScopeImpl).realOfBigDecimal = function (value) {
|
|
504
|
-
return this.
|
|
505
|
+
return this.q31_1.realOfBigDecimal(value);
|
|
505
506
|
};
|
|
506
507
|
protoOf(LogicProgrammingScopeImpl).realOf = function (value) {
|
|
507
|
-
return this.
|
|
508
|
+
return this.q31_1.realOf(value);
|
|
508
509
|
};
|
|
509
510
|
protoOf(LogicProgrammingScopeImpl).realOfFloat = function (value) {
|
|
510
|
-
return this.
|
|
511
|
+
return this.q31_1.realOfFloat(value);
|
|
511
512
|
};
|
|
512
513
|
protoOf(LogicProgrammingScopeImpl).parseReal = function (value) {
|
|
513
|
-
return this.
|
|
514
|
+
return this.q31_1.parseReal(value);
|
|
514
515
|
};
|
|
515
516
|
protoOf(LogicProgrammingScopeImpl).truthOf = function (value) {
|
|
516
|
-
return this.
|
|
517
|
+
return this.q31_1.truthOf(value);
|
|
517
518
|
};
|
|
518
519
|
protoOf(LogicProgrammingScopeImpl).unifierOf = function (assignments) {
|
|
519
|
-
return this.
|
|
520
|
+
return this.q31_1.unifierOf(assignments);
|
|
520
521
|
};
|
|
521
522
|
protoOf(LogicProgrammingScopeImpl).unifierOfIterable = function (assignments) {
|
|
522
|
-
return this.
|
|
523
|
+
return this.q31_1.unifierOfIterable(assignments);
|
|
523
524
|
};
|
|
524
525
|
protoOf(LogicProgrammingScopeImpl).unifierOfSequence = function (assignments) {
|
|
525
|
-
return this.
|
|
526
|
+
return this.q31_1.unifierOfSequence(assignments);
|
|
526
527
|
};
|
|
527
528
|
protoOf(LogicProgrammingScopeImpl).substitutionOf = function (assignments) {
|
|
528
|
-
return this.
|
|
529
|
+
return this.q31_1.substitutionOf(assignments);
|
|
529
530
|
};
|
|
530
531
|
protoOf(LogicProgrammingScopeImpl).substitutionOfIterable = function (assignments) {
|
|
531
|
-
return this.
|
|
532
|
+
return this.q31_1.substitutionOfIterable(assignments);
|
|
532
533
|
};
|
|
533
534
|
protoOf(LogicProgrammingScopeImpl).substitutionOfSequence = function (assignments) {
|
|
534
|
-
return this.
|
|
535
|
+
return this.q31_1.substitutionOfSequence(assignments);
|
|
535
536
|
};
|
|
536
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
537
|
-
return this.
|
|
537
|
+
protoOf(LogicProgrammingScopeImpl).c11 = function () {
|
|
538
|
+
return this.q31_1.c11();
|
|
538
539
|
};
|
|
539
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
540
|
-
return this.
|
|
540
|
+
protoOf(LogicProgrammingScopeImpl).d11 = function () {
|
|
541
|
+
return this.q31_1.d11();
|
|
541
542
|
};
|
|
542
543
|
protoOf(LogicProgrammingScopeImpl).getValue = function (thisRef, property) {
|
|
543
|
-
return this.
|
|
544
|
+
return this.q31_1.getValue(thisRef, property);
|
|
544
545
|
};
|
|
545
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
546
|
-
return this.
|
|
546
|
+
protoOf(LogicProgrammingScopeImpl).d1i = function () {
|
|
547
|
+
return this.q31_1.d1i();
|
|
547
548
|
};
|
|
548
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
549
|
-
return this.
|
|
549
|
+
protoOf(LogicProgrammingScopeImpl).e1i = function () {
|
|
550
|
+
return this.q31_1.e1i();
|
|
550
551
|
};
|
|
551
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
552
|
-
return this.
|
|
552
|
+
protoOf(LogicProgrammingScopeImpl).e1k = function (term1, term2, occurCheckEnabled) {
|
|
553
|
+
return this.r31_1.e1k(term1, term2, occurCheckEnabled);
|
|
553
554
|
};
|
|
554
555
|
protoOf(LogicProgrammingScopeImpl).mgu = function (term1, term2) {
|
|
555
|
-
return this.
|
|
556
|
+
return this.r31_1.mgu(term1, term2);
|
|
556
557
|
};
|
|
557
558
|
protoOf(LogicProgrammingScopeImpl).matchWithOccurCheck = function (term1, term2, occurCheckEnabled) {
|
|
558
|
-
return this.
|
|
559
|
+
return this.r31_1.matchWithOccurCheck(term1, term2, occurCheckEnabled);
|
|
559
560
|
};
|
|
560
561
|
protoOf(LogicProgrammingScopeImpl).match = function (term1, term2) {
|
|
561
|
-
return this.
|
|
562
|
+
return this.r31_1.match(term1, term2);
|
|
562
563
|
};
|
|
563
564
|
protoOf(LogicProgrammingScopeImpl).unifyWithOccurCheck = function (term1, term2, occurCheckEnabled) {
|
|
564
|
-
return this.
|
|
565
|
+
return this.r31_1.unifyWithOccurCheck(term1, term2, occurCheckEnabled);
|
|
565
566
|
};
|
|
566
567
|
protoOf(LogicProgrammingScopeImpl).unify = function (term1, term2) {
|
|
567
|
-
return this.
|
|
568
|
+
return this.r31_1.unify(term1, term2);
|
|
568
569
|
};
|
|
569
570
|
protoOf(LogicProgrammingScopeImpl).mergeWithOccurCheck = function (substitution1, substitution2, occurCheckEnabled) {
|
|
570
|
-
return this.
|
|
571
|
+
return this.r31_1.mergeWithOccurCheck(substitution1, substitution2, occurCheckEnabled);
|
|
571
572
|
};
|
|
572
573
|
protoOf(LogicProgrammingScopeImpl).merge = function (substitution1, substitution2) {
|
|
573
|
-
return this.
|
|
574
|
+
return this.r31_1.merge(substitution1, substitution2);
|
|
574
575
|
};
|
|
575
576
|
protoOf(LogicProgrammingScopeImpl).theoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
576
|
-
return this.
|
|
577
|
+
return this.s31_1.theoryOfIterableWithUnificator(clauses, unificator);
|
|
577
578
|
};
|
|
578
579
|
protoOf(LogicProgrammingScopeImpl).theoryOfIterable = function (clauses) {
|
|
579
|
-
return this.
|
|
580
|
+
return this.s31_1.theoryOfIterable(clauses);
|
|
580
581
|
};
|
|
581
582
|
protoOf(LogicProgrammingScopeImpl).theoryOfWithUnificator = function (unificator, clauses) {
|
|
582
|
-
return this.
|
|
583
|
+
return this.s31_1.theoryOfWithUnificator(unificator, clauses);
|
|
583
584
|
};
|
|
584
585
|
protoOf(LogicProgrammingScopeImpl).theoryOf = function (clauses) {
|
|
585
|
-
return this.
|
|
586
|
+
return this.s31_1.theoryOf(clauses);
|
|
586
587
|
};
|
|
587
588
|
protoOf(LogicProgrammingScopeImpl).theoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
588
|
-
return this.
|
|
589
|
+
return this.s31_1.theoryOfSequenceWithUnificator(clauses, unificator);
|
|
589
590
|
};
|
|
590
591
|
protoOf(LogicProgrammingScopeImpl).theoryOfSequence = function (clauses) {
|
|
591
|
-
return this.
|
|
592
|
+
return this.s31_1.theoryOfSequence(clauses);
|
|
592
593
|
};
|
|
593
594
|
protoOf(LogicProgrammingScopeImpl).mutableTheoryOfIterableWithUnificator = function (clauses, unificator) {
|
|
594
|
-
return this.
|
|
595
|
+
return this.s31_1.mutableTheoryOfIterableWithUnificator(clauses, unificator);
|
|
595
596
|
};
|
|
596
597
|
protoOf(LogicProgrammingScopeImpl).mutableTheoryOfIterable = function (clauses) {
|
|
597
|
-
return this.
|
|
598
|
+
return this.s31_1.mutableTheoryOfIterable(clauses);
|
|
598
599
|
};
|
|
599
600
|
protoOf(LogicProgrammingScopeImpl).mutableTheoryOfWithUnificator = function (unificator, clauses) {
|
|
600
|
-
return this.
|
|
601
|
+
return this.s31_1.mutableTheoryOfWithUnificator(unificator, clauses);
|
|
601
602
|
};
|
|
602
603
|
protoOf(LogicProgrammingScopeImpl).mutableTheoryOf = function (clauses) {
|
|
603
|
-
return this.
|
|
604
|
+
return this.s31_1.mutableTheoryOf(clauses);
|
|
604
605
|
};
|
|
605
606
|
protoOf(LogicProgrammingScopeImpl).mutableTheoryOfSequenceWithUnificator = function (clauses, unificator) {
|
|
606
|
-
return this.
|
|
607
|
+
return this.s31_1.mutableTheoryOfSequenceWithUnificator(clauses, unificator);
|
|
607
608
|
};
|
|
608
609
|
protoOf(LogicProgrammingScopeImpl).mutableTheoryOfSequence = function (clauses) {
|
|
609
|
-
return this.
|
|
610
|
+
return this.s31_1.mutableTheoryOfSequence(clauses);
|
|
610
611
|
};
|
|
611
612
|
protoOf(LogicProgrammingScopeImpl).emptyTheoryWithUnificator = function (unificator) {
|
|
612
|
-
return this.
|
|
613
|
+
return this.s31_1.emptyTheoryWithUnificator(unificator);
|
|
613
614
|
};
|
|
614
615
|
protoOf(LogicProgrammingScopeImpl).emptyTheory = function () {
|
|
615
|
-
return this.
|
|
616
|
+
return this.s31_1.emptyTheory();
|
|
616
617
|
};
|
|
617
618
|
protoOf(LogicProgrammingScopeImpl).emptyMutableTheoryWithUnificator = function (unificator) {
|
|
618
|
-
return this.
|
|
619
|
+
return this.s31_1.emptyMutableTheoryWithUnificator(unificator);
|
|
619
620
|
};
|
|
620
621
|
protoOf(LogicProgrammingScopeImpl).emptyMutableTheory = function () {
|
|
621
|
-
return this.
|
|
622
|
+
return this.s31_1.emptyMutableTheory();
|
|
622
623
|
};
|
|
623
624
|
function LogicProgrammingScopeWithTheories$clauseOf$ref(p0) {
|
|
624
|
-
return function (
|
|
625
|
-
return p0.clauseOf(
|
|
626
|
-
};
|
|
625
|
+
return constructCallableReference(function (p0_0) {
|
|
626
|
+
return p0.clauseOf(p0_0, []);
|
|
627
|
+
}, 1, 0, 108, VOID, [p0]);
|
|
627
628
|
}
|
|
628
629
|
function LogicProgrammingScopeWithTheories() {
|
|
629
630
|
}
|
|
@@ -641,7 +642,7 @@
|
|
|
641
642
|
protoOf(LogicProgrammingScopeImpl).consOfAny = consOfAny;
|
|
642
643
|
protoOf(LogicProgrammingScopeImpl).directiveOfAny = directiveOfAny;
|
|
643
644
|
protoOf(LogicProgrammingScopeImpl).withScope = withScope;
|
|
644
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
645
|
+
protoOf(LogicProgrammingScopeImpl).d31 = logicList;
|
|
645
646
|
protoOf(LogicProgrammingScopeImpl).logicList = logicList_0;
|
|
646
647
|
protoOf(LogicProgrammingScopeImpl).rule = rule;
|
|
647
648
|
protoOf(LogicProgrammingScopeImpl).clause2 = clause2;
|
|
@@ -762,11 +763,11 @@
|
|
|
762
763
|
protoOf(LogicProgrammingScopeImpl).anyMguWith = anyMguWith;
|
|
763
764
|
protoOf(LogicProgrammingScopeImpl).anyMatches = anyMatches;
|
|
764
765
|
protoOf(LogicProgrammingScopeImpl).anyUnifyWith = anyUnifyWith;
|
|
765
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
766
|
+
protoOf(LogicProgrammingScopeImpl).i31 = mgu;
|
|
766
767
|
protoOf(LogicProgrammingScopeImpl).mguAny = mguAny;
|
|
767
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
768
|
+
protoOf(LogicProgrammingScopeImpl).j31 = match;
|
|
768
769
|
protoOf(LogicProgrammingScopeImpl).matchAny = matchAny;
|
|
769
|
-
protoOf(LogicProgrammingScopeImpl).
|
|
770
|
+
protoOf(LogicProgrammingScopeImpl).k31 = unify;
|
|
770
771
|
protoOf(LogicProgrammingScopeImpl).unifyAny = unifyAny;
|
|
771
772
|
protoOf(LogicProgrammingScopeImpl).convertToClause = convertToClause;
|
|
772
773
|
protoOf(LogicProgrammingScopeImpl).theory = theory;
|