@tuprolog/arg2p-core 0.8.2 → 0.8.3
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-dsl-core.js +143 -143
- package/2p-dsl-core.js.map +1 -1
- package/2p-dsl-solve.js +6 -6
- package/2p-dsl-theory.js +5 -5
- package/2p-dsl-unify.js +9 -9
- package/arg2p-core.js +65 -66
- package/arg2p-core.js.map +1 -1
- package/kotlin-kotlin-stdlib.js +9 -9
- package/package.json +1 -1
package/arg2p-core.js
CHANGED
|
@@ -91,7 +91,6 @@
|
|
|
91
91
|
var Companion_instance_2 = kotlin_it_unibo_tuprolog_core.$_$.w;
|
|
92
92
|
var defineProp = kotlin_kotlin.$_$.g5;
|
|
93
93
|
var Companion_instance_3 = kotlin_it_unibo_tuprolog_dsl_solve.$_$.b;
|
|
94
|
-
var Companion_getInstance_1 = kotlin_it_unibo_tuprolog_solve.$_$.p1;
|
|
95
94
|
var copy = kotlin_it_unibo_tuprolog_solve.$_$.g;
|
|
96
95
|
var logicList = kotlin_it_unibo_tuprolog_dsl_core.$_$.a;
|
|
97
96
|
var logicListFromFrom = kotlin_it_unibo_tuprolog_core.$_$.d;
|
|
@@ -103,15 +102,15 @@
|
|
|
103
102
|
var solverOf = kotlin_it_unibo_tuprolog_dsl_solve.$_$.a;
|
|
104
103
|
var unifyAny = kotlin_it_unibo_tuprolog_dsl_unify.$_$.c;
|
|
105
104
|
var LogicProgrammingScopeWithSubstitutions = kotlin_it_unibo_tuprolog_dsl_core.$_$.o4;
|
|
106
|
-
var
|
|
107
|
-
var LogicProgrammingScopeWithTheories = kotlin_it_unibo_tuprolog_dsl_theory.$_$.h;
|
|
108
|
-
var BaseLogicProgrammingScope = kotlin_it_unibo_tuprolog_dsl_core.$_$.e;
|
|
105
|
+
var MinimalLogicProgrammingScope = kotlin_it_unibo_tuprolog_dsl_core.$_$.c5;
|
|
109
106
|
var Scope = kotlin_it_unibo_tuprolog_core.$_$.q1;
|
|
107
|
+
var LogicProgrammingScopeWithTheories = kotlin_it_unibo_tuprolog_dsl_theory.$_$.h;
|
|
110
108
|
var LogicProgrammingScopeWithUnification = kotlin_it_unibo_tuprolog_dsl_unify.$_$.j;
|
|
111
|
-
var
|
|
112
|
-
var LogicProgrammingScopeWithPrologStandardLibrary = kotlin_it_unibo_tuprolog_dsl_core.$_$.h4;
|
|
109
|
+
var LogicProgrammingScopeWithOperators = kotlin_it_unibo_tuprolog_dsl_core.$_$.w1;
|
|
113
110
|
var LogicProgrammingScopeWithResolution = kotlin_it_unibo_tuprolog_dsl_solve.$_$.c;
|
|
114
|
-
var
|
|
111
|
+
var LogicProgrammingScopeWithPrologStandardLibrary = kotlin_it_unibo_tuprolog_dsl_core.$_$.h4;
|
|
112
|
+
var BaseLogicProgrammingScope = kotlin_it_unibo_tuprolog_dsl_core.$_$.e;
|
|
113
|
+
var Companion_getInstance_1 = kotlin_it_unibo_tuprolog_core.$_$.i;
|
|
115
114
|
var lazy = kotlin_kotlin.$_$.aa;
|
|
116
115
|
var KProperty1 = kotlin_kotlin.$_$.u6;
|
|
117
116
|
var getPropertyCallableRef = kotlin_kotlin.$_$.k5;
|
|
@@ -122,16 +121,16 @@
|
|
|
122
121
|
var sequenceOf = kotlin_kotlin.$_$.y7;
|
|
123
122
|
var sequence = kotlin_kotlin.$_$.z7;
|
|
124
123
|
var Companion_instance_4 = kotlin_it_unibo_tuprolog_theory.$_$.a;
|
|
125
|
-
var
|
|
124
|
+
var Companion_getInstance_2 = kotlin_it_unibo_tuprolog_unify.$_$.b;
|
|
126
125
|
var mapCapacity = kotlin_kotlin.$_$.l3;
|
|
127
126
|
var coerceAtLeast = kotlin_kotlin.$_$.q6;
|
|
128
127
|
var LinkedHashMap_init_$Create$ = kotlin_kotlin.$_$.g;
|
|
129
|
-
var
|
|
130
|
-
var
|
|
128
|
+
var Companion_getInstance_3 = kotlin_it_unibo_tuprolog_core.$_$.v;
|
|
129
|
+
var Companion_getInstance_4 = kotlin_it_unibo_tuprolog_core.$_$.q;
|
|
131
130
|
var to = kotlin_kotlin.$_$.ha;
|
|
132
131
|
var mutableMapOf = kotlin_kotlin.$_$.v3;
|
|
133
|
-
var
|
|
134
|
-
var
|
|
132
|
+
var Companion_getInstance_5 = kotlin_it_unibo_tuprolog_solve.$_$.o1;
|
|
133
|
+
var Companion_getInstance_6 = kotlin_kotlin.$_$.r1;
|
|
135
134
|
var Long = kotlin_kotlin.$_$.p9;
|
|
136
135
|
var Companion_instance_5 = kotlin_it_unibo_tuprolog_solve.$_$.b1;
|
|
137
136
|
var Expected_LIST_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.b;
|
|
@@ -156,11 +155,11 @@
|
|
|
156
155
|
var RuleWrapper = kotlin_it_unibo_tuprolog_solve.$_$.z1;
|
|
157
156
|
var RuleWrapper_init_$Init$ = kotlin_it_unibo_tuprolog_solve.$_$.p;
|
|
158
157
|
var mapOf_0 = kotlin_kotlin.$_$.n3;
|
|
159
|
-
var
|
|
158
|
+
var Companion_getInstance_7 = kotlin_it_unibo_tuprolog_core.$_$.z;
|
|
160
159
|
var first_0 = kotlin_kotlin.$_$.x2;
|
|
161
160
|
var parseStruct = kotlin_it_unibo_tuprolog_parser_core.$_$.c;
|
|
162
161
|
var prolog = kotlin_it_unibo_tuprolog_dsl_solve.$_$.d;
|
|
163
|
-
var
|
|
162
|
+
var Companion_getInstance_8 = kotlin_it_unibo_tuprolog_solve.$_$.j1;
|
|
164
163
|
var Default_getInstance = kotlin_kotlin.$_$.o1;
|
|
165
164
|
var IntCompanionObject_instance = kotlin_kotlin.$_$.m1;
|
|
166
165
|
var listToTerm = kotlin_it_unibo_tuprolog_core.$_$.x2;
|
|
@@ -168,7 +167,7 @@
|
|
|
168
167
|
var listOf_0 = kotlin_kotlin.$_$.j3;
|
|
169
168
|
var WithoutSideEffects_0 = kotlin_it_unibo_tuprolog_solve.$_$.v1;
|
|
170
169
|
var Companion_instance_8 = kotlin_it_unibo_tuprolog_core.$_$.p;
|
|
171
|
-
var
|
|
170
|
+
var Companion_getInstance_9 = kotlin_it_unibo_tuprolog_core.$_$.l;
|
|
172
171
|
var IllegalArgumentException_init_$Create$ = kotlin_kotlin.$_$.r;
|
|
173
172
|
var KProperty0 = kotlin_kotlin.$_$.t6;
|
|
174
173
|
var Expected_VARIABLE_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.c;
|
|
@@ -210,9 +209,9 @@
|
|
|
210
209
|
setMetadataFor(BridgedGraph, 'BridgedGraph', classMeta);
|
|
211
210
|
setMetadataFor(BridgedSolution, 'BridgedSolution', classMeta);
|
|
212
211
|
setMetadataFor(JsBridge, 'JsBridge', objectMeta);
|
|
213
|
-
setMetadataFor(PrologWithArgumentationImpl, 'PrologWithArgumentationImpl', classMeta, VOID, [LogicProgrammingScopeWithSubstitutions,
|
|
212
|
+
setMetadataFor(PrologWithArgumentationImpl, 'PrologWithArgumentationImpl', classMeta, VOID, [LogicProgrammingScopeWithSubstitutions, MinimalLogicProgrammingScope, Scope, LogicProgrammingScopeWithTheories, LogicProgrammingScopeWithUnification, LogicProgrammingScopeWithOperators, LogicProgrammingScopeWithResolution, LogicProgrammingScopeWithPrologStandardLibrary, BaseLogicProgrammingScope], PrologWithArgumentationImpl);
|
|
214
213
|
function get_theoryOperators() {
|
|
215
|
-
return
|
|
214
|
+
return Companion_getInstance_1().DEFAULT;
|
|
216
215
|
}
|
|
217
216
|
function content() {
|
|
218
217
|
return this.g3c();
|
|
@@ -368,7 +367,7 @@
|
|
|
368
367
|
return $super === VOID ? this.m3a(staticLibs, dynamicLibs) : $super.m3a.call(this, staticLibs, dynamicLibs);
|
|
369
368
|
};
|
|
370
369
|
var Companion_instance_9;
|
|
371
|
-
function
|
|
370
|
+
function Companion_getInstance_10() {
|
|
372
371
|
return Companion_instance_9;
|
|
373
372
|
}
|
|
374
373
|
function Arg2pSolver() {
|
|
@@ -818,7 +817,7 @@
|
|
|
818
817
|
return JsBridge_instance;
|
|
819
818
|
}
|
|
820
819
|
function PrologWithArgumentationImpl() {
|
|
821
|
-
this.f3c_1 = Companion_instance_3.ofSolverFactory(
|
|
820
|
+
this.f3c_1 = Companion_instance_3.ofSolverFactory(ClassicSolverFactory_instance);
|
|
822
821
|
}
|
|
823
822
|
protoOf(PrologWithArgumentationImpl).w1g = function () {
|
|
824
823
|
return this.f3c_1.w1g();
|
|
@@ -1859,7 +1858,7 @@
|
|
|
1859
1858
|
function Cache() {
|
|
1860
1859
|
var tmp = this;
|
|
1861
1860
|
// Inline function 'kotlin.also' call
|
|
1862
|
-
var this_0 =
|
|
1861
|
+
var this_0 = ClassicSolverFactory_instance.rawMutableSolverOf(VOID, VOID, VOID, Companion_instance_0.emptyWithDefaultUnificator(), Companion_instance_4.empty(Companion_getInstance_2().y1k()));
|
|
1863
1862
|
// Inline function 'kotlin.contracts.contract' call
|
|
1864
1863
|
// Inline function 'it.unibo.tuprolog.argumentation.core.libs.basic.Cache.solver.<anonymous>' call
|
|
1865
1864
|
this_0.setFlag(Unknown_getInstance().w29_1, Unknown_getInstance().v29_1);
|
|
@@ -2043,7 +2042,7 @@
|
|
|
2043
2042
|
// Inline function 'kotlin.collections.set' call
|
|
2044
2043
|
var this_0 = this.k3e_1.i3d_1;
|
|
2045
2044
|
// Inline function 'kotlin.also' call
|
|
2046
|
-
var this_1 =
|
|
2045
|
+
var this_1 = ClassicSolverFactory_instance.mutableSolverWithDefaultBuiltinsAnd(VOID, VOID, VOID, Companion_instance_0.emptyWithDefaultUnificator(), Companion_instance_4.empty(Companion_getInstance_2().y1k()));
|
|
2047
2046
|
// Inline function 'kotlin.contracts.contract' call
|
|
2048
2047
|
// Inline function 'it.unibo.tuprolog.argumentation.core.libs.basic.DynamicCacheReset.solve.<anonymous>' call
|
|
2049
2048
|
this_1.setFlag(Unknown_getInstance().w29_1, Unknown_getInstance().v29_1);
|
|
@@ -2062,7 +2061,7 @@
|
|
|
2062
2061
|
};
|
|
2063
2062
|
protoOf(DynamicCacheSelected).v2g = function (request) {
|
|
2064
2063
|
var term = request.arguments.d1(0);
|
|
2065
|
-
return sequenceOf([request.replyWith(
|
|
2064
|
+
return sequenceOf([request.replyWith(Companion_getInstance_3().of(term.castToVar(), Companion_getInstance_4().ofInteger(this.m3e_1.h3d_1)), VOID, [])]);
|
|
2066
2065
|
};
|
|
2067
2066
|
protoOf(DynamicCacheSelected).solve = function (request) {
|
|
2068
2067
|
return this.v2g(request);
|
|
@@ -2097,7 +2096,7 @@
|
|
|
2097
2096
|
var this_0 = this.q3e_1.i3d_1;
|
|
2098
2097
|
var key = this.q3e_1.g3d_1;
|
|
2099
2098
|
// Inline function 'kotlin.also' call
|
|
2100
|
-
var this_1 =
|
|
2099
|
+
var this_1 = ClassicSolverFactory_instance.mutableSolverWithDefaultBuiltinsAnd(VOID, VOID, VOID, Companion_instance_0.emptyWithDefaultUnificator(), Companion_instance_4.ofIterable(Companion_getInstance_2().y1k(), ensureNotNull(this.q3e_1.i3d_1.x2(target)).n1v()));
|
|
2101
2100
|
// Inline function 'kotlin.contracts.contract' call
|
|
2102
2101
|
// Inline function 'it.unibo.tuprolog.argumentation.core.libs.basic.DynamicCacheBranch.solve.<anonymous>' call
|
|
2103
2102
|
this_1.setFlag(Unknown_getInstance().w29_1, Unknown_getInstance().v29_1);
|
|
@@ -2107,7 +2106,7 @@
|
|
|
2107
2106
|
var tmp1 = tmp0_this.g3d_1;
|
|
2108
2107
|
tmp0_this.g3d_1 = tmp1 + 1 | 0;
|
|
2109
2108
|
tmp.h3d_1 = tmp1;
|
|
2110
|
-
return sequenceOf([request.replyWith(
|
|
2109
|
+
return sequenceOf([request.replyWith(Companion_getInstance_3().of(result.castToVar(), Companion_getInstance_4().ofInteger(this.q3e_1.h3d_1)), VOID, [])]);
|
|
2111
2110
|
};
|
|
2112
2111
|
protoOf(DynamicCacheBranch).solve = function (request) {
|
|
2113
2112
|
return this.v2g(request);
|
|
@@ -2176,7 +2175,7 @@
|
|
|
2176
2175
|
this.h3d_1 = 0;
|
|
2177
2176
|
var tmp = this;
|
|
2178
2177
|
// Inline function 'kotlin.also' call
|
|
2179
|
-
var this_0 =
|
|
2178
|
+
var this_0 = ClassicSolverFactory_instance.mutableSolverWithDefaultBuiltinsAnd(VOID, VOID, VOID, Companion_instance_0.emptyWithDefaultUnificator(), Companion_instance_4.empty(Companion_getInstance_2().y1k()));
|
|
2180
2179
|
// Inline function 'kotlin.contracts.contract' call
|
|
2181
2180
|
// Inline function 'it.unibo.tuprolog.argumentation.core.libs.basic.Context.dynamicSolver.<anonymous>' call
|
|
2182
2181
|
this_0.setFlag(Unknown_getInstance().w29_1, Unknown_getInstance().v29_1);
|
|
@@ -2234,8 +2233,8 @@
|
|
|
2234
2233
|
case 0:
|
|
2235
2234
|
this.gb_1 = 2;
|
|
2236
2235
|
this.fb_1 = 1;
|
|
2237
|
-
var tmp_0 =
|
|
2238
|
-
|
|
2236
|
+
var tmp_0 = Companion_getInstance_5();
|
|
2237
|
+
Companion_getInstance_6();
|
|
2239
2238
|
var tmp_1 = this.h3f_1.solveWithOptions(this.i3f_1, tmp_0.allLazilyWithTimeout(new Long(-1, 2147483647)));
|
|
2240
2239
|
suspendResult = this.k3f_1.zd(map(tmp_1, DynamicLoader$AbstractWithLib$solve$slambda$lambda(this.j3f_1)), this);
|
|
2241
2240
|
if (suspendResult === get_COROUTINE_SUSPENDED()) {
|
|
@@ -2383,7 +2382,7 @@
|
|
|
2383
2382
|
return OperatorSet_init_$Create$([new Operator('::', Specifier_XFX_getInstance(), 700), new Operator(':::', Specifier_XFX_getInstance(), 700)]);
|
|
2384
2383
|
};
|
|
2385
2384
|
var Companion_instance_10;
|
|
2386
|
-
function
|
|
2385
|
+
function Companion_getInstance_11() {
|
|
2387
2386
|
return Companion_instance_10;
|
|
2388
2387
|
}
|
|
2389
2388
|
function DynamicLoader(solver) {
|
|
@@ -2416,7 +2415,7 @@
|
|
|
2416
2415
|
function EngineInterfaceBase() {
|
|
2417
2416
|
LazyRawPrologContent.call(this);
|
|
2418
2417
|
this.y3f_1 = 'prolog.argumentation.interface';
|
|
2419
|
-
this.z3f_1 = Companion_instance_11.w3f().plusOperatorSet(Companion_instance_10.w3f()).plusOperatorSet(
|
|
2418
|
+
this.z3f_1 = Companion_instance_11.w3f().plusOperatorSet(Companion_instance_10.w3f()).plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2420
2419
|
}
|
|
2421
2420
|
protoOf(EngineInterfaceBase).n2e = function () {
|
|
2422
2421
|
return this.y3f_1;
|
|
@@ -2550,7 +2549,7 @@
|
|
|
2550
2549
|
}
|
|
2551
2550
|
function ModuleCall$mineModulesPath$lambda($context) {
|
|
2552
2551
|
return function ($this$logicProgramming) {
|
|
2553
|
-
var tmp =
|
|
2552
|
+
var tmp = ClassicSolverFactory_instance.rawSolverOf(VOID, $context.k1v()).solve($this$logicProgramming.stringInvoke('modulesPath', $this$logicProgramming.w1g(), []));
|
|
2554
2553
|
return first(map(tmp, ModuleCall$mineModulesPath$lambda$lambda($this$logicProgramming)));
|
|
2555
2554
|
};
|
|
2556
2555
|
}
|
|
@@ -2562,7 +2561,7 @@
|
|
|
2562
2561
|
function ModuleCall$getCleanSolver$lambda_0($context, $modules, $module) {
|
|
2563
2562
|
return function ($this$logicProgramming) {
|
|
2564
2563
|
// Inline function 'kotlin.also' call
|
|
2565
|
-
var this_0 =
|
|
2564
|
+
var this_0 = ClassicSolverFactory_instance.rawSolverOf(VOID, $context.k1v());
|
|
2566
2565
|
// Inline function 'kotlin.contracts.contract' call
|
|
2567
2566
|
// Inline function 'it.unibo.tuprolog.argumentation.core.libs.extra.ModuleCall.getCleanSolver.<anonymous>.<anonymous>' call
|
|
2568
2567
|
// Inline function 'kotlin.collections.forEach' call
|
|
@@ -2615,7 +2614,7 @@
|
|
|
2615
2614
|
function AbstractModeBase() {
|
|
2616
2615
|
LazyRawPrologContent.call(this);
|
|
2617
2616
|
this.q3g_1 = 'prolog.argumentation.abstract';
|
|
2618
|
-
this.r3g_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2617
|
+
this.r3g_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2619
2618
|
}
|
|
2620
2619
|
protoOf(AbstractModeBase).n2e = function () {
|
|
2621
2620
|
return this.q3g_1;
|
|
@@ -2632,7 +2631,7 @@
|
|
|
2632
2631
|
function ArgumentationGraphBuilderBase() {
|
|
2633
2632
|
LazyRawPrologContent.call(this);
|
|
2634
2633
|
this.t3g_1 = 'prolog.argumentation.graph';
|
|
2635
|
-
this.u3g_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2634
|
+
this.u3g_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2636
2635
|
}
|
|
2637
2636
|
protoOf(ArgumentationGraphBuilderBase).n2e = function () {
|
|
2638
2637
|
return this.t3g_1;
|
|
@@ -2649,7 +2648,7 @@
|
|
|
2649
2648
|
function AttackRestrictionHandlerBase() {
|
|
2650
2649
|
LazyRawPrologContent.call(this);
|
|
2651
2650
|
this.w3g_1 = 'prolog.argumentation.graph.rebutrestriction';
|
|
2652
|
-
this.x3g_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2651
|
+
this.x3g_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2653
2652
|
}
|
|
2654
2653
|
protoOf(AttackRestrictionHandlerBase).n2e = function () {
|
|
2655
2654
|
return this.w3g_1;
|
|
@@ -2666,7 +2665,7 @@
|
|
|
2666
2665
|
function BpMetaGraphHandlerBase() {
|
|
2667
2666
|
LazyRawPrologContent.call(this);
|
|
2668
2667
|
this.z3g_1 = 'prolog.argumentation.graph.meta.bp';
|
|
2669
|
-
this.a3h_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2668
|
+
this.a3h_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2670
2669
|
}
|
|
2671
2670
|
protoOf(BpMetaGraphHandlerBase).n2e = function () {
|
|
2672
2671
|
return this.z3g_1;
|
|
@@ -2683,7 +2682,7 @@
|
|
|
2683
2682
|
function DefeasiblePreferencesHandlerBase() {
|
|
2684
2683
|
LazyRawPrologContent.call(this);
|
|
2685
2684
|
this.c3h_1 = 'prolog.argumentation.graph.preferences.defeasible';
|
|
2686
|
-
this.d3h_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2685
|
+
this.d3h_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2687
2686
|
}
|
|
2688
2687
|
protoOf(DefeasiblePreferencesHandlerBase).n2e = function () {
|
|
2689
2688
|
return this.c3h_1;
|
|
@@ -2700,7 +2699,7 @@
|
|
|
2700
2699
|
function GenericDefeasiblePreferencesHandlerBase() {
|
|
2701
2700
|
LazyRawPrologContent.call(this);
|
|
2702
2701
|
this.f3h_1 = 'prolog.argumentation.graph.preferences.defeasible.generic';
|
|
2703
|
-
this.g3h_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2702
|
+
this.g3h_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2704
2703
|
}
|
|
2705
2704
|
protoOf(GenericDefeasiblePreferencesHandlerBase).n2e = function () {
|
|
2706
2705
|
return this.f3h_1;
|
|
@@ -2717,7 +2716,7 @@
|
|
|
2717
2716
|
function StrictPreferencesHandlerBase() {
|
|
2718
2717
|
LazyRawPrologContent.call(this);
|
|
2719
2718
|
this.i3h_1 = 'prolog.argumentation.graph.preferences.strict';
|
|
2720
|
-
this.j3h_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2719
|
+
this.j3h_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2721
2720
|
}
|
|
2722
2721
|
protoOf(StrictPreferencesHandlerBase).n2e = function () {
|
|
2723
2722
|
return this.i3h_1;
|
|
@@ -2734,7 +2733,7 @@
|
|
|
2734
2733
|
function BinaryStatementLabeller() {
|
|
2735
2734
|
BinaryStatementLabeller_instance = this;
|
|
2736
2735
|
this.k3h_1 = 'prolog.argumentation.graph.labelling.statement.binary';
|
|
2737
|
-
this.l3h_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2736
|
+
this.l3h_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2738
2737
|
}
|
|
2739
2738
|
protoOf(BinaryStatementLabeller).n2e = function () {
|
|
2740
2739
|
return this.k3h_1;
|
|
@@ -2770,7 +2769,7 @@
|
|
|
2770
2769
|
function BpCompleteLabellerBase() {
|
|
2771
2770
|
LazyRawPrologContent.call(this);
|
|
2772
2771
|
this.q3h_1 = 'prolog.argumentation.graph.labelling.bpgroundedcomplete';
|
|
2773
|
-
this.r3h_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2772
|
+
this.r3h_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2774
2773
|
}
|
|
2775
2774
|
protoOf(BpCompleteLabellerBase).n2e = function () {
|
|
2776
2775
|
return this.q3h_1;
|
|
@@ -2787,7 +2786,7 @@
|
|
|
2787
2786
|
function BpLabellerBase() {
|
|
2788
2787
|
LazyRawPrologContent.call(this);
|
|
2789
2788
|
this.t3h_1 = 'prolog.argumentation.graph.labelling.bpgrounded';
|
|
2790
|
-
this.u3h_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2789
|
+
this.u3h_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2791
2790
|
}
|
|
2792
2791
|
protoOf(BpLabellerBase).n2e = function () {
|
|
2793
2792
|
return this.t3h_1;
|
|
@@ -2804,7 +2803,7 @@
|
|
|
2804
2803
|
function BpPartialLabellerBase() {
|
|
2805
2804
|
LazyRawPrologContent.call(this);
|
|
2806
2805
|
this.w3h_1 = 'prolog.argumentation.graph.labelling.bpgroundedpartial';
|
|
2807
|
-
this.x3h_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2806
|
+
this.x3h_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2808
2807
|
}
|
|
2809
2808
|
protoOf(BpPartialLabellerBase).n2e = function () {
|
|
2810
2809
|
return this.w3h_1;
|
|
@@ -2821,7 +2820,7 @@
|
|
|
2821
2820
|
function CompleteLabellerBase() {
|
|
2822
2821
|
LazyRawPrologContent.call(this);
|
|
2823
2822
|
this.z3h_1 = 'prolog.argumentation.graph.labelling.complete';
|
|
2824
|
-
this.a3i_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2823
|
+
this.a3i_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2825
2824
|
}
|
|
2826
2825
|
protoOf(CompleteLabellerBase).n2e = function () {
|
|
2827
2826
|
return this.z3h_1;
|
|
@@ -2838,7 +2837,7 @@
|
|
|
2838
2837
|
function GroundedLabellerBase() {
|
|
2839
2838
|
LazyRawPrologContent.call(this);
|
|
2840
2839
|
this.c3i_1 = 'prolog.argumentation.graph.labelling.grounded';
|
|
2841
|
-
this.d3i_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2840
|
+
this.d3i_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2842
2841
|
}
|
|
2843
2842
|
protoOf(GroundedLabellerBase).n2e = function () {
|
|
2844
2843
|
return this.c3i_1;
|
|
@@ -2855,7 +2854,7 @@
|
|
|
2855
2854
|
function GroundedLabellerOptimizedBase() {
|
|
2856
2855
|
LazyRawPrologContent.call(this);
|
|
2857
2856
|
this.f3i_1 = 'prolog.argumentation.graph.labelling.grounded.optimized';
|
|
2858
|
-
this.g3i_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2857
|
+
this.g3i_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2859
2858
|
}
|
|
2860
2859
|
protoOf(GroundedLabellerOptimizedBase).n2e = function () {
|
|
2861
2860
|
return this.f3i_1;
|
|
@@ -2872,7 +2871,7 @@
|
|
|
2872
2871
|
function PassThroughStatementLabeller() {
|
|
2873
2872
|
PassThroughStatementLabeller_instance = this;
|
|
2874
2873
|
this.h3i_1 = 'prolog.argumentation.graph.labelling.statement.pt';
|
|
2875
|
-
this.i3i_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2874
|
+
this.i3i_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2876
2875
|
}
|
|
2877
2876
|
protoOf(PassThroughStatementLabeller).n2e = function () {
|
|
2878
2877
|
return this.h3i_1;
|
|
@@ -2908,7 +2907,7 @@
|
|
|
2908
2907
|
function StatementLabellerBase() {
|
|
2909
2908
|
LazyRawPrologContent.call(this);
|
|
2910
2909
|
this.n3i_1 = 'prolog.argumentation.graph.labelling.statement';
|
|
2911
|
-
this.o3i_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
2910
|
+
this.o3i_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2912
2911
|
}
|
|
2913
2912
|
protoOf(StatementLabellerBase).n2e = function () {
|
|
2914
2913
|
return this.n3i_1;
|
|
@@ -2928,13 +2927,13 @@
|
|
|
2928
2927
|
return OperatorSet_init_$Create$([new Operator('=>', Specifier_XFX_getInstance(), 1199), new Operator(':=>', Specifier_XFX_getInstance(), 1199), new Operator(':->', Specifier_XFX_getInstance(), 1199), new Operator(':', Specifier_XFX_getInstance(), 1001), new Operator(':=', Specifier_XFX_getInstance(), 1199)]);
|
|
2929
2928
|
};
|
|
2930
2929
|
var Companion_instance_11;
|
|
2931
|
-
function
|
|
2930
|
+
function Companion_getInstance_12() {
|
|
2932
2931
|
return Companion_instance_11;
|
|
2933
2932
|
}
|
|
2934
2933
|
function RuleParserBase() {
|
|
2935
2934
|
LazyRawPrologContent.call(this);
|
|
2936
2935
|
this.q3i_1 = 'prolog.argumentation.parser';
|
|
2937
|
-
this.r3i_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_instance_11.w3f()).plusOperatorSet(
|
|
2936
|
+
this.r3i_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_instance_11.w3f()).plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
2938
2937
|
}
|
|
2939
2938
|
protoOf(RuleParserBase).n2e = function () {
|
|
2940
2939
|
return this.q3i_1;
|
|
@@ -2970,7 +2969,7 @@
|
|
|
2970
2969
|
if (tmp_0) {
|
|
2971
2970
|
tmp = $this$prolog.stringInvoke('~', ensureNotNull(item.asStruct()).av().d1(0), []);
|
|
2972
2971
|
} else {
|
|
2973
|
-
if (first($context.solve($this$prolog.stringInvoke('clause', item, [
|
|
2972
|
+
if (first($context.solve($this$prolog.stringInvoke('clause', item, [Companion_getInstance_7().j13_1]))).q1w()) {
|
|
2974
2973
|
tmp = $this$prolog.stringInvoke('prolog', item, []);
|
|
2975
2974
|
} else {
|
|
2976
2975
|
tmp = item;
|
|
@@ -2993,7 +2992,7 @@
|
|
|
2993
2992
|
}
|
|
2994
2993
|
function ConversionUtils$commonMap$lambda($first, $force, $context, $mapper) {
|
|
2995
2994
|
return function ($this$prolog) {
|
|
2996
|
-
var tmp =
|
|
2995
|
+
var tmp = Companion_getInstance_3();
|
|
2997
2996
|
var tmp_0 = $first.castToVar();
|
|
2998
2997
|
var tmp_1;
|
|
2999
2998
|
if ($force ? true : first($context.solve(parseStruct(Companion_getInstance_0(), 'prologStrictCompatibility'))).o1w()) {
|
|
@@ -3010,7 +3009,7 @@
|
|
|
3010
3009
|
return prolog(VOID, ConversionUtils$modifiers$lambda(target, context));
|
|
3011
3010
|
};
|
|
3012
3011
|
protoOf(ConversionUtils).t3i = function (context, first, force, mapper) {
|
|
3013
|
-
|
|
3012
|
+
Companion_getInstance_8().k2h(context, 0);
|
|
3014
3013
|
return prolog(VOID, ConversionUtils$commonMap$lambda(first, force, context, mapper));
|
|
3015
3014
|
};
|
|
3016
3015
|
protoOf(ConversionUtils).u3i = function (context, first, force, mapper, $super) {
|
|
@@ -3284,7 +3283,7 @@
|
|
|
3284
3283
|
WithoutSideEffects_0.call(this, 'extract_id');
|
|
3285
3284
|
}
|
|
3286
3285
|
protoOf(ExtractStrictIds).p2o = function (_this__u8e3s4, first, second) {
|
|
3287
|
-
var tmp =
|
|
3286
|
+
var tmp = Companion_getInstance_3();
|
|
3288
3287
|
var tmp_0 = ensureNotNull(second.asVar());
|
|
3289
3288
|
var tmp_1 = Companion_instance_8;
|
|
3290
3289
|
// Inline function 'kotlin.collections.map' call
|
|
@@ -3314,7 +3313,7 @@
|
|
|
3314
3313
|
WithoutSideEffects_0.call(this, 'rule_to_clause');
|
|
3315
3314
|
}
|
|
3316
3315
|
protoOf(RuleToClause).p2o = function (_this__u8e3s4, first, second) {
|
|
3317
|
-
var tmp =
|
|
3316
|
+
var tmp = Companion_getInstance_3();
|
|
3318
3317
|
var tmp_0 = ensureNotNull(second.asVar());
|
|
3319
3318
|
var tmp_1 = Companion_instance_8;
|
|
3320
3319
|
// Inline function 'kotlin.collections.map' call
|
|
@@ -3332,10 +3331,10 @@
|
|
|
3332
3331
|
var tmp_2;
|
|
3333
3332
|
switch (it.l()) {
|
|
3334
3333
|
case 2:
|
|
3335
|
-
tmp_2 =
|
|
3334
|
+
tmp_2 = Companion_getInstance_9().hx(Companion_getInstance_0().of('rl', [it.d1(1)]), [item]);
|
|
3336
3335
|
break;
|
|
3337
3336
|
case 3:
|
|
3338
|
-
tmp_2 =
|
|
3337
|
+
tmp_2 = Companion_getInstance_9().hx(Companion_getInstance_0().of('rl', [it.d1(2)]), [item]);
|
|
3339
3338
|
break;
|
|
3340
3339
|
default:
|
|
3341
3340
|
throw IllegalArgumentException_init_$Create$();
|
|
@@ -3392,7 +3391,7 @@
|
|
|
3392
3391
|
function StructuredModeBase() {
|
|
3393
3392
|
LazyRawPrologContent.call(this);
|
|
3394
3393
|
this.e3j_1 = 'prolog.argumentation.structured';
|
|
3395
|
-
this.f3j_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
3394
|
+
this.f3j_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
3396
3395
|
}
|
|
3397
3396
|
protoOf(StructuredModeBase).n2e = function () {
|
|
3398
3397
|
return this.e3j_1;
|
|
@@ -3409,7 +3408,7 @@
|
|
|
3409
3408
|
function DebugBase() {
|
|
3410
3409
|
LazyRawPrologContent.call(this);
|
|
3411
3410
|
this.h3j_1 = 'prolog.argumentation.debug';
|
|
3412
|
-
this.i3j_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
3411
|
+
this.i3j_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
3413
3412
|
}
|
|
3414
3413
|
protoOf(DebugBase).n2e = function () {
|
|
3415
3414
|
return this.h3j_1;
|
|
@@ -3426,7 +3425,7 @@
|
|
|
3426
3425
|
function SuperiorityRelationBase() {
|
|
3427
3426
|
LazyRawPrologContent.call(this);
|
|
3428
3427
|
this.k3j_1 = 'prolog.argumentation.superiority';
|
|
3429
|
-
this.l3j_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
3428
|
+
this.l3j_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
3430
3429
|
}
|
|
3431
3430
|
protoOf(SuperiorityRelationBase).n2e = function () {
|
|
3432
3431
|
return this.k3j_1;
|
|
@@ -3443,7 +3442,7 @@
|
|
|
3443
3442
|
function UtilsBase() {
|
|
3444
3443
|
LazyRawPrologContent.call(this);
|
|
3445
3444
|
this.n3j_1 = 'prolog.argumentation.utils';
|
|
3446
|
-
this.o3j_1 = Companion_instance_10.w3f().plusOperatorSet(
|
|
3445
|
+
this.o3j_1 = Companion_instance_10.w3f().plusOperatorSet(Companion_getInstance_1().DEFAULT);
|
|
3447
3446
|
}
|
|
3448
3447
|
protoOf(UtilsBase).n2e = function () {
|
|
3449
3448
|
return this.n3j_1;
|
|
@@ -3491,7 +3490,7 @@
|
|
|
3491
3490
|
case 0:
|
|
3492
3491
|
this.gb_1 = 2;
|
|
3493
3492
|
this.fb_1 = 1;
|
|
3494
|
-
suspendResult = this.f3k_1.wd(this.b3k_1.replyWith(
|
|
3493
|
+
suspendResult = this.f3k_1.wd(this.b3k_1.replyWith(Companion_getInstance_3().of(this.c3k_1, Companion_instance_8.ofList(plus(this.d3k_1.toList(), this.e3k_1.toList()))), VOID, []), this);
|
|
3495
3494
|
if (suspendResult === get_COROUTINE_SUSPENDED()) {
|
|
3496
3495
|
return suspendResult;
|
|
3497
3496
|
}
|
|
@@ -3648,7 +3647,7 @@
|
|
|
3648
3647
|
WithoutSideEffects_0.call(this, 'hash');
|
|
3649
3648
|
}
|
|
3650
3649
|
protoOf(ArgumentHash).p2o = function (_this__u8e3s4, first, second) {
|
|
3651
|
-
return sequenceOf([
|
|
3650
|
+
return sequenceOf([Companion_getInstance_3().of(ensureNotNull(second.asVar()), Companion_getInstance_4().ofInteger(getStringHashCode(first.toString())))]);
|
|
3652
3651
|
};
|
|
3653
3652
|
protoOf(ArgumentHash).k2g = function (_this__u8e3s4, first, second) {
|
|
3654
3653
|
return this.p2o(_this__u8e3s4, first, second);
|
|
@@ -3699,7 +3698,7 @@
|
|
|
3699
3698
|
var tmp0_iterator = this_0.r();
|
|
3700
3699
|
while (tmp0_iterator.s()) {
|
|
3701
3700
|
var element = tmp0_iterator.u();
|
|
3702
|
-
if (
|
|
3701
|
+
if (Companion_getInstance_2().y1k().match(element, this.b3l_1)) {
|
|
3703
3702
|
tmp$ret$0 = true;
|
|
3704
3703
|
break l$ret$1;
|
|
3705
3704
|
}
|
|
@@ -3797,7 +3796,7 @@
|
|
|
3797
3796
|
var tmp0_iterator_0 = this.n3l_1.pt().r();
|
|
3798
3797
|
while (tmp0_iterator_0.s()) {
|
|
3799
3798
|
var element_0 = tmp0_iterator_0.u();
|
|
3800
|
-
if (
|
|
3799
|
+
if (Companion_getInstance_2().y1k().match(element, element_0)) {
|
|
3801
3800
|
tmp$ret$0 = true;
|
|
3802
3801
|
break l$ret$1;
|
|
3803
3802
|
}
|
|
@@ -4132,7 +4131,7 @@
|
|
|
4132
4131
|
return new Argument(of$argRules(it), of$argTopRule(it), of$argConclusion(it), of$argGroundings(it), of$argDefeasibleRules(it), of$argDefeasiblePremises(it), of$argLastDefeasibleRules(it), term);
|
|
4133
4132
|
};
|
|
4134
4133
|
var Companion_instance_12;
|
|
4135
|
-
function
|
|
4134
|
+
function Companion_getInstance_13() {
|
|
4136
4135
|
return Companion_instance_12;
|
|
4137
4136
|
}
|
|
4138
4137
|
function Argument(rules, topRule, conclusion, groundings, defeasibleRules, defeasiblePremises, lastDefeasibleRules, term) {
|
|
@@ -4283,7 +4282,7 @@
|
|
|
4283
4282
|
return this_0;
|
|
4284
4283
|
};
|
|
4285
4284
|
var Companion_instance_13;
|
|
4286
|
-
function
|
|
4285
|
+
function Companion_getInstance_14() {
|
|
4287
4286
|
return Companion_instance_13;
|
|
4288
4287
|
}
|
|
4289
4288
|
function Graph(arguments_0, attacks, supports) {
|