@tuprolog/arg2p-causality-solver 0.16.2 → 0.16.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-io-lib.js +15 -0
- package/2p-io-lib.js.map +1 -0
- package/2p-solve.js +1 -1
- package/README.md +59 -12
- package/kotlin-kotlin-stdlib.js +95 -95
- package/kotlin-kotlin-stdlib.js.map +1 -1
- package/okio-parent-okio-nodefilesystem.js +15 -0
- package/okio-parent-okio-nodefilesystem.js.map +1 -0
- package/okio-parent-okio.js +15 -0
- package/okio-parent-okio.js.map +1 -0
- package/package.json +5 -2
package/2p-io-lib.js
ADDED
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
(function (factory) {
|
|
2
|
+
if (typeof define === 'function' && define.amd)
|
|
3
|
+
define(['exports'], factory);
|
|
4
|
+
else if (typeof exports === 'object')
|
|
5
|
+
factory(module.exports);
|
|
6
|
+
else
|
|
7
|
+
globalThis['2p-io-lib'] = factory(typeof globalThis['2p-io-lib'] === 'undefined' ? {} : globalThis['2p-io-lib']);
|
|
8
|
+
}(function (_) {
|
|
9
|
+
'use strict';
|
|
10
|
+
//region block: pre-declaration
|
|
11
|
+
//endregion
|
|
12
|
+
return _;
|
|
13
|
+
}));
|
|
14
|
+
|
|
15
|
+
//# sourceMappingURL=2p-io-lib.js.map
|
package/2p-io-lib.js.map
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":[],"sourcesContent":[],"ignoreList":[],"x_google_ignoreList":[],"names":[],"mappings":";;;;;;;;;;;;;"}
|
package/2p-solve.js
CHANGED
|
@@ -928,7 +928,7 @@
|
|
|
928
928
|
initMetadataForClass(ExtensionLibrary, 'ExtensionLibrary', VOID, AbstractLibrary);
|
|
929
929
|
initMetadataForClass(LibraryImpl, 'LibraryImpl', VOID, AbstractLibrary);
|
|
930
930
|
initMetadataForCompanion(Companion_37);
|
|
931
|
-
initMetadataForClass(RuntimeImpl, 'RuntimeImpl', VOID, AbstractPluggable, [
|
|
931
|
+
initMetadataForClass(RuntimeImpl, 'RuntimeImpl', VOID, AbstractPluggable, [KtMap, Pluggable]);
|
|
932
932
|
initMetadataForClass(PrimitiveWrapper, 'PrimitiveWrapper', VOID, AbstractWrapper);
|
|
933
933
|
initMetadataForClass(BinaryRelation, 'BinaryRelation', VOID, PrimitiveWrapper);
|
|
934
934
|
initMetadataForClass(NonBacktrackable, 'NonBacktrackable', VOID, BinaryRelation);
|
package/README.md
CHANGED
|
@@ -5,6 +5,50 @@ Built on top of the [tuProlog](https://apice.unibo.it/xwiki/bin/view/Tuprolog/)
|
|
|
5
5
|
|
|
6
6
|
More details are available on the [official wiki](https://tuprolog.github.io/arg2p-kt/).
|
|
7
7
|
|
|
8
|
+
## References
|
|
9
|
+
|
|
10
|
+
Arg2P is described in:
|
|
11
|
+
|
|
12
|
+
- Roberta Calegari, Andrea Omicini, Giuseppe Pisano, Giovanni Sartor.
|
|
13
|
+
**Arg2P: an argumentation framework for explainable intelligent systems.**
|
|
14
|
+
_Journal of Logic and Computation_, 32(2):369–401, 2022.
|
|
15
|
+
[doi:10.1093/logcom/exab089](https://doi.org/10.1093/logcom/exab089)
|
|
16
|
+
- Giuseppe Pisano.
|
|
17
|
+
**Argumentation for legal reasoning: meta-models, technology and beyond.**
|
|
18
|
+
PhD thesis, Alma Mater Studiorum — Università di Bologna, 2024.
|
|
19
|
+
[doi:10.48676/unibo/amsdottorato/11671](https://doi.org/10.48676/unibo/amsdottorato/11671)
|
|
20
|
+
|
|
21
|
+
Individual features — burden of persuasion, defeasible preferences, modularity, causality, distributed
|
|
22
|
+
reasoning — have their own papers, listed on the
|
|
23
|
+
[References](https://tuprolog.github.io/arg2p-kt/docs/references/) page of the wiki.
|
|
24
|
+
|
|
25
|
+
### Cite me
|
|
26
|
+
|
|
27
|
+
If you use Arg2P in academic work, please cite:
|
|
28
|
+
|
|
29
|
+
```bibtex
|
|
30
|
+
@article{arg2p,
|
|
31
|
+
author = {Calegari, Roberta and Omicini, Andrea and Pisano, Giuseppe and Sartor, Giovanni},
|
|
32
|
+
title = {{Arg2P}: an argumentation framework for explainable intelligent systems},
|
|
33
|
+
journal = {Journal of Logic and Computation},
|
|
34
|
+
volume = {32},
|
|
35
|
+
number = {2},
|
|
36
|
+
pages = {369--401},
|
|
37
|
+
year = {2022},
|
|
38
|
+
doi = {10.1093/logcom/exab089}
|
|
39
|
+
}
|
|
40
|
+
```
|
|
41
|
+
|
|
42
|
+
```bibtex
|
|
43
|
+
@phdthesis{pisano2024argumentation,
|
|
44
|
+
author = {Pisano, Giuseppe},
|
|
45
|
+
title = {Argumentation for legal reasoning: meta-models, technology and beyond},
|
|
46
|
+
school = {Alma Mater Studiorum --- Universit\`a di Bologna},
|
|
47
|
+
year = {2024},
|
|
48
|
+
doi = {10.48676/unibo/amsdottorato/11671}
|
|
49
|
+
}
|
|
50
|
+
```
|
|
51
|
+
|
|
8
52
|
---
|
|
9
53
|
|
|
10
54
|
## Getting Started
|
|
@@ -13,14 +57,15 @@ Arg2p is available as a [2P-Kt](https://github.com/tuProlog/2p-kt/) library.
|
|
|
13
57
|
|
|
14
58
|
#### JVM Library - Gradle
|
|
15
59
|
|
|
16
|
-
To import the Arg2p module
|
|
60
|
+
To import the Arg2p module into your Kotlin-based Gradle project, declare the dependency in your `build.gradle(.kts)` file
|
|
61
|
+
(the version below is the latest release, see the [releases page](https://github.com/tuProlog/arg2p-kt/releases/latest)):
|
|
17
62
|
```kotlin
|
|
18
63
|
repositories {
|
|
19
64
|
mavenCentral()
|
|
20
65
|
}
|
|
21
66
|
|
|
22
67
|
dependencies {
|
|
23
|
-
implementation("it.unibo.tuprolog.argumentation:arg2p-jvm:
|
|
68
|
+
implementation("it.unibo.tuprolog.argumentation:arg2p-jvm:0.16.2")
|
|
24
69
|
}
|
|
25
70
|
```
|
|
26
71
|
|
|
@@ -52,7 +97,7 @@ To use the library, add the dependency to your `package.json`:
|
|
|
52
97
|
```json
|
|
53
98
|
{
|
|
54
99
|
"dependencies": {
|
|
55
|
-
"@tuprolog/arg2p": "
|
|
100
|
+
"@tuprolog/arg2p": "0.16.2"
|
|
56
101
|
}
|
|
57
102
|
}
|
|
58
103
|
```
|
|
@@ -62,12 +107,12 @@ To use the library, add the dependency to your `package.json`:
|
|
|
62
107
|
```js
|
|
63
108
|
const arg2p = require('@tuprolog/arg2p').it.unibo.tuprolog.argumentation.bridge.JsBridge
|
|
64
109
|
|
|
65
|
-
const graph = arg2p.solve('
|
|
110
|
+
const graph = arg2p.solve('arg2p::solve', `
|
|
66
111
|
f1 :=> d.
|
|
67
112
|
f2 :=> -d.`, `
|
|
68
113
|
graphBuildMode(standard_af).
|
|
69
114
|
statementLabellingMode(statement).
|
|
70
|
-
argumentLabellingMode(
|
|
115
|
+
argumentLabellingMode(grounded).
|
|
71
116
|
orderingPrinciple(last).
|
|
72
117
|
orderingComparator(elitist).
|
|
73
118
|
graphExtension(standardPref).
|
|
@@ -91,14 +136,14 @@ GitHub repository](https://github.com/tuProlog/arg2p-kt/releases/latest).
|
|
|
91
136
|
|
|
92
137
|
In the [latest release](https://github.com/tuProlog/arg2p-kt/releases/latest) page, download the _Asset_ named:
|
|
93
138
|
```
|
|
94
|
-
arg2p-ide
|
|
139
|
+
arg2p-ide-<VERSION>-redist.jar
|
|
95
140
|
```
|
|
96
|
-
a self-contained, executable Jar containing the 2P-Kt-based Prolog interpreter (
|
|
97
|
-
|
|
141
|
+
a self-contained, executable Jar containing the 2P-Kt-based Prolog interpreter (`<VERSION>` is the release
|
|
142
|
+
version, `0.16.2` at the time of writing).
|
|
98
143
|
|
|
99
|
-
After you download the
|
|
144
|
+
After you download the jar, you can simply launch it by running:
|
|
100
145
|
```bash
|
|
101
|
-
java -jar arg2p-ide-
|
|
146
|
+
java -jar arg2p-ide-0.16.2-redist.jar
|
|
102
147
|
```
|
|
103
148
|
If your JVM is properly configured, you can also start the IDE by double-clicking the JAR file.
|
|
104
149
|
|
|
@@ -111,7 +156,7 @@ If your JVM is properly configured, you can also start the IDE by double-clickin
|
|
|
111
156
|
### Additional Tabs
|
|
112
157
|
|
|
113
158
|
- **Graph Tab:** Displays a graphical representation of the abstract argumentation graph.
|
|
114
|
-
- **Arg Flag Tab:** Shows and allows modification of Arg2P flags. Detailed descriptions are on the [
|
|
159
|
+
- **Arg Flag Tab:** Shows and allows modification of Arg2P flags. Detailed descriptions are on the [Flags Reference](https://tuprolog.github.io/arg2p-kt/docs/flags/) page of the wiki.
|
|
115
160
|
|
|
116
161
|
---
|
|
117
162
|
|
|
@@ -121,7 +166,9 @@ Try Arg2P directly in your browser using the [Web Playground](https://tuprolog.g
|
|
|
121
166
|
|
|
122
167
|

|
|
123
168
|
|
|
124
|
-
It
|
|
169
|
+
No installation required. It runs in two modes: **Structured**, to write a theory and query it as in the
|
|
170
|
+
desktop IDE, and **Abstract**, to draw an argumentation framework and evaluate it with `abstract::solve/5`
|
|
171
|
+
under any of the supported semantics. It ships ready-made examples, and setups can be shared as a link.
|
|
125
172
|
|
|
126
173
|
---
|
|
127
174
|
|
package/kotlin-kotlin-stdlib.js
CHANGED
|
@@ -131,7 +131,7 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
131
131
|
initMetadataForInterface(Comparator, 'Comparator');
|
|
132
132
|
initMetadataForObject(Unit, 'Unit');
|
|
133
133
|
initMetadataForClass(AbstractCollection, 'AbstractCollection', VOID, VOID, [Collection]);
|
|
134
|
-
initMetadataForClass(AbstractMutableCollection, 'AbstractMutableCollection', VOID, AbstractCollection, [
|
|
134
|
+
initMetadataForClass(AbstractMutableCollection, 'AbstractMutableCollection', VOID, AbstractCollection, [MutableIterable, Collection]);
|
|
135
135
|
initMetadataForClass(IteratorImpl, 'IteratorImpl');
|
|
136
136
|
initMetadataForClass(ListIteratorImpl, 'ListIteratorImpl', VOID, IteratorImpl);
|
|
137
137
|
initMetadataForClass(AbstractMutableList, 'AbstractMutableList', VOID, AbstractMutableCollection, [MutableIterable, KtList, Collection]);
|
|
@@ -139,19 +139,19 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
139
139
|
initMetadataForClass(SubList, 'SubList', VOID, AbstractMutableList, [RandomAccess]);
|
|
140
140
|
initMetadataForClass(AbstractMap, 'AbstractMap', VOID, VOID, [KtMap]);
|
|
141
141
|
initMetadataForClass(AbstractMutableMap, 'AbstractMutableMap', VOID, AbstractMap, [KtMap]);
|
|
142
|
-
initMetadataForClass(AbstractMutableSet, 'AbstractMutableSet', VOID, AbstractMutableCollection, [
|
|
142
|
+
initMetadataForClass(AbstractMutableSet, 'AbstractMutableSet', VOID, AbstractMutableCollection, [MutableIterable, KtSet, Collection]);
|
|
143
143
|
initMetadataForCompanion(Companion_1);
|
|
144
144
|
initMetadataForClass(ArrayList, 'ArrayList', ArrayList_init_$Create$, AbstractMutableList, [MutableIterable, KtList, Collection, RandomAccess]);
|
|
145
145
|
initMetadataForClass(HashMap, 'HashMap', HashMap_init_$Create$, AbstractMutableMap, [KtMap]);
|
|
146
|
-
initMetadataForClass(HashMapKeys, 'HashMapKeys', VOID, AbstractMutableSet, [
|
|
147
|
-
initMetadataForClass(HashMapValues, 'HashMapValues', VOID, AbstractMutableCollection, [
|
|
148
|
-
initMetadataForClass(HashMapEntrySetBase, 'HashMapEntrySetBase', VOID, AbstractMutableSet, [
|
|
146
|
+
initMetadataForClass(HashMapKeys, 'HashMapKeys', VOID, AbstractMutableSet, [MutableIterable, KtSet, Collection]);
|
|
147
|
+
initMetadataForClass(HashMapValues, 'HashMapValues', VOID, AbstractMutableCollection, [MutableIterable, Collection]);
|
|
148
|
+
initMetadataForClass(HashMapEntrySetBase, 'HashMapEntrySetBase', VOID, AbstractMutableSet, [MutableIterable, KtSet, Collection]);
|
|
149
149
|
initMetadataForClass(HashMapEntrySet, 'HashMapEntrySet', VOID, HashMapEntrySetBase);
|
|
150
150
|
initMetadataForClass(HashMapKeysDefault$iterator$1);
|
|
151
151
|
initMetadataForClass(HashMapKeysDefault, 'HashMapKeysDefault', VOID, AbstractMutableSet);
|
|
152
152
|
initMetadataForClass(HashMapValuesDefault$iterator$1);
|
|
153
153
|
initMetadataForClass(HashMapValuesDefault, 'HashMapValuesDefault', VOID, AbstractMutableCollection);
|
|
154
|
-
initMetadataForClass(HashSet, 'HashSet', HashSet_init_$Create$, AbstractMutableSet, [
|
|
154
|
+
initMetadataForClass(HashSet, 'HashSet', HashSet_init_$Create$, AbstractMutableSet, [MutableIterable, KtSet, Collection]);
|
|
155
155
|
initMetadataForCompanion(Companion_2);
|
|
156
156
|
initMetadataForClass(Itr, 'Itr');
|
|
157
157
|
initMetadataForClass(KeysItr, 'KeysItr', VOID, Itr);
|
|
@@ -196,7 +196,7 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
196
196
|
initMetadataForInterface(InternalMap, 'InternalMap');
|
|
197
197
|
initMetadataForClass(InternalHashMap, 'InternalHashMap', InternalHashMap_init_$Create$, VOID, [InternalMap]);
|
|
198
198
|
initMetadataForClass(LinkedHashMap, 'LinkedHashMap', LinkedHashMap_init_$Create$, HashMap, [KtMap]);
|
|
199
|
-
initMetadataForClass(LinkedHashSet, 'LinkedHashSet', LinkedHashSet_init_$Create$, HashSet, [
|
|
199
|
+
initMetadataForClass(LinkedHashSet, 'LinkedHashSet', LinkedHashSet_init_$Create$, HashSet, [MutableIterable, KtSet, Collection]);
|
|
200
200
|
initMetadataForClass(BaseOutput, 'BaseOutput');
|
|
201
201
|
initMetadataForClass(NodeJsOutput, 'NodeJsOutput', VOID, BaseOutput);
|
|
202
202
|
initMetadataForClass(BufferedOutput, 'BufferedOutput', BufferedOutput, BaseOutput);
|
|
@@ -214,9 +214,9 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
214
214
|
initMetadataForClass(ClassCastException, 'ClassCastException', ClassCastException_init_$Create$, RuntimeException);
|
|
215
215
|
initMetadataForClass(NullPointerException, 'NullPointerException', NullPointerException_init_$Create$, RuntimeException);
|
|
216
216
|
initMetadataForClass(NumberFormatException, 'NumberFormatException', NumberFormatException_init_$Create$, IllegalArgumentException);
|
|
217
|
-
initMetadataForClass(ArithmeticException, 'ArithmeticException', ArithmeticException_init_$Create$, RuntimeException);
|
|
218
217
|
initMetadataForClass(Error_0, 'Error', Error_init_$Create$, Error);
|
|
219
218
|
initMetadataForClass(AssertionError, 'AssertionError', AssertionError_init_$Create$, Error_0);
|
|
219
|
+
initMetadataForClass(ArithmeticException, 'ArithmeticException', ArithmeticException_init_$Create$, RuntimeException);
|
|
220
220
|
initMetadataForClass(UninitializedPropertyAccessException, 'UninitializedPropertyAccessException', UninitializedPropertyAccessException_init_$Create$, RuntimeException);
|
|
221
221
|
initMetadataForClass(ConcurrentModificationException, 'ConcurrentModificationException', ConcurrentModificationException_init_$Create$, RuntimeException);
|
|
222
222
|
initMetadataForClass(NoWhenBranchMatchedException, 'NoWhenBranchMatchedException', NoWhenBranchMatchedException_init_$Create$, RuntimeException);
|
|
@@ -391,12 +391,12 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
391
391
|
function sliceArray(_this__u8e3s4, indices) {
|
|
392
392
|
if (indices.g()) {
|
|
393
393
|
// Inline function 'kotlin.collections.copyOfRange' call
|
|
394
|
-
return
|
|
394
|
+
return copyOfRange(_this__u8e3s4, 0, 0);
|
|
395
395
|
}
|
|
396
396
|
var tmp2 = indices.h();
|
|
397
397
|
// Inline function 'kotlin.collections.copyOfRange' call
|
|
398
398
|
var toIndex = indices.i() + 1 | 0;
|
|
399
|
-
return
|
|
399
|
+
return copyOfRange(_this__u8e3s4, tmp2, toIndex);
|
|
400
400
|
}
|
|
401
401
|
function requireNoNulls(_this__u8e3s4) {
|
|
402
402
|
var inductionVariable = 0;
|
|
@@ -1674,44 +1674,44 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
1674
1674
|
}
|
|
1675
1675
|
return tmp;
|
|
1676
1676
|
}
|
|
1677
|
-
function
|
|
1677
|
+
function contentHashCodeInternal(_this__u8e3s4) {
|
|
1678
1678
|
// Inline function 'kotlin.js.asDynamic' call
|
|
1679
1679
|
var a = _this__u8e3s4;
|
|
1680
|
-
|
|
1681
|
-
|
|
1682
|
-
|
|
1683
|
-
return true;
|
|
1684
|
-
if (a == null || b == null || !isArrayish(b) || a.length != b.length)
|
|
1685
|
-
return false;
|
|
1680
|
+
if (a == null)
|
|
1681
|
+
return 0;
|
|
1682
|
+
var result = 1;
|
|
1686
1683
|
var inductionVariable = 0;
|
|
1687
1684
|
var last = a.length;
|
|
1688
1685
|
if (inductionVariable < last)
|
|
1689
1686
|
do {
|
|
1690
1687
|
var i = inductionVariable;
|
|
1691
1688
|
inductionVariable = inductionVariable + 1 | 0;
|
|
1692
|
-
|
|
1693
|
-
return false;
|
|
1694
|
-
}
|
|
1689
|
+
result = imul(result, 31) + hashCode(a[i]) | 0;
|
|
1695
1690
|
}
|
|
1696
1691
|
while (inductionVariable < last);
|
|
1697
|
-
return
|
|
1692
|
+
return result;
|
|
1698
1693
|
}
|
|
1699
|
-
function
|
|
1694
|
+
function contentEqualsInternal(_this__u8e3s4, other) {
|
|
1700
1695
|
// Inline function 'kotlin.js.asDynamic' call
|
|
1701
1696
|
var a = _this__u8e3s4;
|
|
1702
|
-
|
|
1703
|
-
|
|
1704
|
-
|
|
1697
|
+
// Inline function 'kotlin.js.asDynamic' call
|
|
1698
|
+
var b = other;
|
|
1699
|
+
if (a === b)
|
|
1700
|
+
return true;
|
|
1701
|
+
if (a == null || b == null || !isArrayish(b) || a.length != b.length)
|
|
1702
|
+
return false;
|
|
1705
1703
|
var inductionVariable = 0;
|
|
1706
1704
|
var last = a.length;
|
|
1707
1705
|
if (inductionVariable < last)
|
|
1708
1706
|
do {
|
|
1709
1707
|
var i = inductionVariable;
|
|
1710
1708
|
inductionVariable = inductionVariable + 1 | 0;
|
|
1711
|
-
|
|
1709
|
+
if (!equals(a[i], b[i])) {
|
|
1710
|
+
return false;
|
|
1711
|
+
}
|
|
1712
1712
|
}
|
|
1713
1713
|
while (inductionVariable < last);
|
|
1714
|
-
return
|
|
1714
|
+
return true;
|
|
1715
1715
|
}
|
|
1716
1716
|
function arrayToString(array) {
|
|
1717
1717
|
return joinToString(array, ', ', '[', ']', VOID, VOID, arrayToString$lambda);
|
|
@@ -1813,6 +1813,45 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
1813
1813
|
function defineProp(obj, name, getter, setter, enumerable) {
|
|
1814
1814
|
return Object.defineProperty(obj, name, {configurable: true, get: getter, set: setter, enumerable: enumerable});
|
|
1815
1815
|
}
|
|
1816
|
+
function hashCode(obj) {
|
|
1817
|
+
if (obj == null)
|
|
1818
|
+
return 0;
|
|
1819
|
+
var typeOf = typeof obj;
|
|
1820
|
+
var tmp;
|
|
1821
|
+
switch (typeOf) {
|
|
1822
|
+
case 'object':
|
|
1823
|
+
tmp = 'function' === typeof obj.hashCode ? obj.hashCode() : getObjectHashCode(obj);
|
|
1824
|
+
break;
|
|
1825
|
+
case 'function':
|
|
1826
|
+
tmp = isCallableReference(obj) ? getCallableReferenceHashCode(obj) : getObjectHashCode(obj);
|
|
1827
|
+
break;
|
|
1828
|
+
case 'number':
|
|
1829
|
+
tmp = getNumberHashCode(obj);
|
|
1830
|
+
break;
|
|
1831
|
+
case 'boolean':
|
|
1832
|
+
// Inline function 'kotlin.js.unsafeCast' call
|
|
1833
|
+
|
|
1834
|
+
tmp = getBooleanHashCode(obj);
|
|
1835
|
+
break;
|
|
1836
|
+
case 'string':
|
|
1837
|
+
tmp = getStringHashCode(String(obj));
|
|
1838
|
+
break;
|
|
1839
|
+
case 'bigint':
|
|
1840
|
+
// Inline function 'kotlin.js.unsafeCast' call
|
|
1841
|
+
|
|
1842
|
+
tmp = getBigIntHashCode(obj);
|
|
1843
|
+
break;
|
|
1844
|
+
case 'symbol':
|
|
1845
|
+
tmp = getSymbolHashCode(obj);
|
|
1846
|
+
break;
|
|
1847
|
+
default:
|
|
1848
|
+
tmp = function () {
|
|
1849
|
+
throw new Error('Unexpected typeof `' + typeOf + '`');
|
|
1850
|
+
}();
|
|
1851
|
+
break;
|
|
1852
|
+
}
|
|
1853
|
+
return tmp;
|
|
1854
|
+
}
|
|
1816
1855
|
function equals(obj1, obj2) {
|
|
1817
1856
|
if (obj1 == null) {
|
|
1818
1857
|
return obj2 == null;
|
|
@@ -1867,45 +1906,6 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
1867
1906
|
}
|
|
1868
1907
|
return obj1 === obj2;
|
|
1869
1908
|
}
|
|
1870
|
-
function hashCode(obj) {
|
|
1871
|
-
if (obj == null)
|
|
1872
|
-
return 0;
|
|
1873
|
-
var typeOf = typeof obj;
|
|
1874
|
-
var tmp;
|
|
1875
|
-
switch (typeOf) {
|
|
1876
|
-
case 'object':
|
|
1877
|
-
tmp = 'function' === typeof obj.hashCode ? obj.hashCode() : getObjectHashCode(obj);
|
|
1878
|
-
break;
|
|
1879
|
-
case 'function':
|
|
1880
|
-
tmp = isCallableReference(obj) ? getCallableReferenceHashCode(obj) : getObjectHashCode(obj);
|
|
1881
|
-
break;
|
|
1882
|
-
case 'number':
|
|
1883
|
-
tmp = getNumberHashCode(obj);
|
|
1884
|
-
break;
|
|
1885
|
-
case 'boolean':
|
|
1886
|
-
// Inline function 'kotlin.js.unsafeCast' call
|
|
1887
|
-
|
|
1888
|
-
tmp = getBooleanHashCode(obj);
|
|
1889
|
-
break;
|
|
1890
|
-
case 'string':
|
|
1891
|
-
tmp = getStringHashCode(String(obj));
|
|
1892
|
-
break;
|
|
1893
|
-
case 'bigint':
|
|
1894
|
-
// Inline function 'kotlin.js.unsafeCast' call
|
|
1895
|
-
|
|
1896
|
-
tmp = getBigIntHashCode(obj);
|
|
1897
|
-
break;
|
|
1898
|
-
case 'symbol':
|
|
1899
|
-
tmp = getSymbolHashCode(obj);
|
|
1900
|
-
break;
|
|
1901
|
-
default:
|
|
1902
|
-
tmp = function () {
|
|
1903
|
-
throw new Error('Unexpected typeof `' + typeOf + '`');
|
|
1904
|
-
}();
|
|
1905
|
-
break;
|
|
1906
|
-
}
|
|
1907
|
-
return tmp;
|
|
1908
|
-
}
|
|
1909
1909
|
function toString_1(o) {
|
|
1910
1910
|
var tmp;
|
|
1911
1911
|
if (o == null) {
|
|
@@ -2631,6 +2631,11 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
2631
2631
|
// Inline function 'kotlin.js.asDynamic' call
|
|
2632
2632
|
return _this__u8e3s4.slice(fromIndex, toIndex);
|
|
2633
2633
|
}
|
|
2634
|
+
function copyOfRange_0(_this__u8e3s4, fromIndex, toIndex) {
|
|
2635
|
+
Companion_instance_4.w2(fromIndex, toIndex, _this__u8e3s4.length);
|
|
2636
|
+
// Inline function 'kotlin.js.asDynamic' call
|
|
2637
|
+
return _this__u8e3s4.slice(fromIndex, toIndex);
|
|
2638
|
+
}
|
|
2634
2639
|
function copyOf(_this__u8e3s4, newSize) {
|
|
2635
2640
|
// Inline function 'kotlin.require' call
|
|
2636
2641
|
if (!(newSize >= 0)) {
|
|
@@ -2661,11 +2666,6 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
2661
2666
|
}
|
|
2662
2667
|
return arrayCopyResize(_this__u8e3s4, newSize, null);
|
|
2663
2668
|
}
|
|
2664
|
-
function copyOfRange_0(_this__u8e3s4, fromIndex, toIndex) {
|
|
2665
|
-
Companion_instance_4.w2(fromIndex, toIndex, _this__u8e3s4.length);
|
|
2666
|
-
// Inline function 'kotlin.js.asDynamic' call
|
|
2667
|
-
return _this__u8e3s4.slice(fromIndex, toIndex);
|
|
2668
|
-
}
|
|
2669
2669
|
function digitToIntImpl(_this__u8e3s4) {
|
|
2670
2670
|
// Inline function 'kotlin.code' call
|
|
2671
2671
|
var ch = Char__toInt_impl_vasixd(_this__u8e3s4);
|
|
@@ -4621,29 +4621,6 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
4621
4621
|
function NumberFormatException() {
|
|
4622
4622
|
captureStack(this, NumberFormatException);
|
|
4623
4623
|
}
|
|
4624
|
-
function ArithmeticException_init_$Init$($this) {
|
|
4625
|
-
RuntimeException_init_$Init$($this);
|
|
4626
|
-
ArithmeticException.call($this);
|
|
4627
|
-
return $this;
|
|
4628
|
-
}
|
|
4629
|
-
function ArithmeticException_init_$Create$() {
|
|
4630
|
-
var tmp = ArithmeticException_init_$Init$(objectCreate(protoOf(ArithmeticException)));
|
|
4631
|
-
captureStack(tmp, ArithmeticException_init_$Create$);
|
|
4632
|
-
return tmp;
|
|
4633
|
-
}
|
|
4634
|
-
function ArithmeticException_init_$Init$_0(message, $this) {
|
|
4635
|
-
RuntimeException_init_$Init$_0(message, $this);
|
|
4636
|
-
ArithmeticException.call($this);
|
|
4637
|
-
return $this;
|
|
4638
|
-
}
|
|
4639
|
-
function ArithmeticException_init_$Create$_0(message) {
|
|
4640
|
-
var tmp = ArithmeticException_init_$Init$_0(message, objectCreate(protoOf(ArithmeticException)));
|
|
4641
|
-
captureStack(tmp, ArithmeticException_init_$Create$_0);
|
|
4642
|
-
return tmp;
|
|
4643
|
-
}
|
|
4644
|
-
function ArithmeticException() {
|
|
4645
|
-
captureStack(this, ArithmeticException);
|
|
4646
|
-
}
|
|
4647
4624
|
function AssertionError_init_$Init$($this) {
|
|
4648
4625
|
Error_init_$Init$($this);
|
|
4649
4626
|
AssertionError.call($this);
|
|
@@ -4667,6 +4644,29 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
4667
4644
|
function AssertionError() {
|
|
4668
4645
|
captureStack(this, AssertionError);
|
|
4669
4646
|
}
|
|
4647
|
+
function ArithmeticException_init_$Init$($this) {
|
|
4648
|
+
RuntimeException_init_$Init$($this);
|
|
4649
|
+
ArithmeticException.call($this);
|
|
4650
|
+
return $this;
|
|
4651
|
+
}
|
|
4652
|
+
function ArithmeticException_init_$Create$() {
|
|
4653
|
+
var tmp = ArithmeticException_init_$Init$(objectCreate(protoOf(ArithmeticException)));
|
|
4654
|
+
captureStack(tmp, ArithmeticException_init_$Create$);
|
|
4655
|
+
return tmp;
|
|
4656
|
+
}
|
|
4657
|
+
function ArithmeticException_init_$Init$_0(message, $this) {
|
|
4658
|
+
RuntimeException_init_$Init$_0(message, $this);
|
|
4659
|
+
ArithmeticException.call($this);
|
|
4660
|
+
return $this;
|
|
4661
|
+
}
|
|
4662
|
+
function ArithmeticException_init_$Create$_0(message) {
|
|
4663
|
+
var tmp = ArithmeticException_init_$Init$_0(message, objectCreate(protoOf(ArithmeticException)));
|
|
4664
|
+
captureStack(tmp, ArithmeticException_init_$Create$_0);
|
|
4665
|
+
return tmp;
|
|
4666
|
+
}
|
|
4667
|
+
function ArithmeticException() {
|
|
4668
|
+
captureStack(this, ArithmeticException);
|
|
4669
|
+
}
|
|
4670
4670
|
function UninitializedPropertyAccessException_init_$Init$($this) {
|
|
4671
4671
|
RuntimeException_init_$Init$($this);
|
|
4672
4672
|
UninitializedPropertyAccessException.call($this);
|
|
@@ -8634,7 +8634,7 @@ if (typeof String.prototype.startsWith === 'undefined') {
|
|
|
8634
8634
|
_.$_$.a2 = asSequence;
|
|
8635
8635
|
_.$_$.b2 = collectionSizeOrDefault;
|
|
8636
8636
|
_.$_$.c2 = contains_0;
|
|
8637
|
-
_.$_$.d2 =
|
|
8637
|
+
_.$_$.d2 = copyOfRange_0;
|
|
8638
8638
|
_.$_$.e2 = copyOf_0;
|
|
8639
8639
|
_.$_$.f2 = copyOf;
|
|
8640
8640
|
_.$_$.g2 = copyToArray;
|