@xiuper/mpp-core 0.0.2 → 0.2.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.
Files changed (65) hide show
  1. package/Kotlin-DateTime-library-kotlinx-datetime.js +1796 -1796
  2. package/Kotlin-Immutable-Collections-kotlinx-collections-immutable.js +278 -278
  3. package/Xiuper-mpp-codegraph.js +240 -240
  4. package/kaml.js +639 -639
  5. package/koog-agents-agents-core.js +4606 -4606
  6. package/koog-agents-agents-tools.js +41 -41
  7. package/koog-agents-agents-utils.js +52 -52
  8. package/koog-http-client-http-client-core.js +4 -4
  9. package/koog-http-client-http-client-ktor.js +166 -166
  10. package/koog-prompt-prompt-executor-prompt-executor-clients-prompt-executor-anthropic-client.js +906 -906
  11. package/koog-prompt-prompt-executor-prompt-executor-clients-prompt-executor-deepseek-client.js +299 -299
  12. package/koog-prompt-prompt-executor-prompt-executor-clients-prompt-executor-google-client.js +838 -838
  13. package/koog-prompt-prompt-executor-prompt-executor-clients-prompt-executor-ollama-client.js +452 -452
  14. package/koog-prompt-prompt-executor-prompt-executor-clients-prompt-executor-openai-client-base.js +1002 -1002
  15. package/koog-prompt-prompt-executor-prompt-executor-clients-prompt-executor-openai-client.js +3358 -3358
  16. package/koog-prompt-prompt-executor-prompt-executor-clients-prompt-executor-openrouter-client.js +532 -532
  17. package/koog-prompt-prompt-executor-prompt-executor-clients.js +29 -29
  18. package/koog-prompt-prompt-executor-prompt-executor-llms.js +25 -25
  19. package/koog-prompt-prompt-executor-prompt-executor-model.js +4 -4
  20. package/koog-prompt-prompt-llm.js +120 -120
  21. package/koog-prompt-prompt-markdown.js +30 -30
  22. package/koog-prompt-prompt-model.js +1055 -1055
  23. package/koog-prompt-prompt-structure.js +342 -342
  24. package/koog-utils.js +10 -10
  25. package/kotlin-kotlin-stdlib.js +453 -411
  26. package/kotlin-kotlin-stdlib.js.map +1 -1
  27. package/kotlin-logging.js +116 -116
  28. package/kotlin-sdk-kotlin-sdk-client.js +260 -260
  29. package/kotlin-sdk-kotlin-sdk-core.js +2568 -2568
  30. package/kotlinx-atomicfu.js +5 -5
  31. package/kotlinx-coroutines-core.js +532 -654
  32. package/kotlinx-coroutines-core.js.map +1 -1
  33. package/kotlinx-io-kotlinx-io-bytestring.js +40 -40
  34. package/kotlinx-io-kotlinx-io-core.js +605 -605
  35. package/kotlinx-serialization-kotlinx-serialization-core.js +75 -75
  36. package/kotlinx-serialization-kotlinx-serialization-json.js +95 -95
  37. package/kotlinx-serialization-kotlinx-serialization-json.js.map +1 -1
  38. package/ktor-ktor-client-content-negotiation.js +163 -163
  39. package/ktor-ktor-client-core.js +2237 -2235
  40. package/ktor-ktor-client-core.js.map +1 -1
  41. package/ktor-ktor-events.js +15 -15
  42. package/ktor-ktor-http-cio.js +725 -725
  43. package/ktor-ktor-http.js +805 -805
  44. package/ktor-ktor-io.js +766 -766
  45. package/ktor-ktor-network.js +285 -285
  46. package/ktor-ktor-serialization-kotlinx-json.js +1 -1
  47. package/ktor-ktor-serialization-kotlinx.js +130 -130
  48. package/ktor-ktor-serialization.js +68 -68
  49. package/ktor-ktor-server-cio.js +724 -724
  50. package/ktor-ktor-server-core.js +1793 -1793
  51. package/ktor-ktor-server-sse.js +125 -125
  52. package/ktor-ktor-sse.js +40 -40
  53. package/ktor-ktor-utils.js +690 -690
  54. package/ktor-ktor-websockets.js +49 -49
  55. package/markdown.js +1561 -1561
  56. package/okio-parent-okio.js +368 -368
  57. package/package.json +1 -1
  58. package/snakeyaml-engine-kmp.js +2005 -2005
  59. package/urlencoder-urlencoder-lib.js +43 -43
  60. package/xiuper-mpp-core.d.ts +45 -7
  61. package/xiuper-mpp-core.js +22405 -18664
  62. package/xiuper-mpp-core.js.map +1 -1
  63. package/autodev-mpp-core.d.ts +0 -1312
  64. package/autodev-mpp-core.js +0 -86483
  65. package/autodev-mpp-core.js.map +0 -1
@@ -13,35 +13,35 @@
13
13
  'use strict';
14
14
  //region block: imports
15
15
  var imul = Math.imul;
16
- var THROW_CCE = kotlin_kotlin.$_$.zk;
17
- var protoOf = kotlin_kotlin.$_$.we;
18
- var initMetadataForCompanion = kotlin_kotlin.$_$.vd;
19
- var equals = kotlin_kotlin.$_$.md;
16
+ var THROW_CCE = kotlin_kotlin.$_$.dl;
17
+ var protoOf = kotlin_kotlin.$_$.ze;
18
+ var initMetadataForCompanion = kotlin_kotlin.$_$.yd;
19
+ var equals = kotlin_kotlin.$_$.pd;
20
20
  var AbstractMap = kotlin_kotlin.$_$.j6;
21
- var hashCode = kotlin_kotlin.$_$.td;
21
+ var hashCode = kotlin_kotlin.$_$.wd;
22
22
  var KtMap = kotlin_kotlin.$_$.v6;
23
- var isInterface = kotlin_kotlin.$_$.je;
24
- var initMetadataForClass = kotlin_kotlin.$_$.ud;
23
+ var isInterface = kotlin_kotlin.$_$.me;
24
+ var initMetadataForClass = kotlin_kotlin.$_$.xd;
25
25
  var VOID = kotlin_kotlin.$_$.h;
26
26
  var AbstractMutableMap = kotlin_kotlin.$_$.k6;
27
27
  var KtMutableMap = kotlin_kotlin.$_$.x6;
28
28
  var Entry = kotlin_kotlin.$_$.t6;
29
- var toString = kotlin_kotlin.$_$.gm;
29
+ var toString = kotlin_kotlin.$_$.km;
30
30
  var Unit_instance = kotlin_kotlin.$_$.h6;
31
31
  var NoSuchElementException_init_$Create$ = kotlin_kotlin.$_$.p2;
32
32
  var AbstractSet = kotlin_kotlin.$_$.l6;
33
33
  var Collection = kotlin_kotlin.$_$.n6;
34
34
  var KtSet = kotlin_kotlin.$_$.z6;
35
35
  var AbstractCollection = kotlin_kotlin.$_$.i6;
36
- var objectCreate = kotlin_kotlin.$_$.ve;
37
- var until = kotlin_kotlin.$_$.of;
38
- var step = kotlin_kotlin.$_$.nf;
39
- var countOneBits = kotlin_kotlin.$_$.pl;
36
+ var objectCreate = kotlin_kotlin.$_$.ye;
37
+ var until = kotlin_kotlin.$_$.rf;
38
+ var step = kotlin_kotlin.$_$.qf;
39
+ var countOneBits = kotlin_kotlin.$_$.tl;
40
40
  var arrayCopy = kotlin_kotlin.$_$.d7;
41
41
  var copyOf = kotlin_kotlin.$_$.f8;
42
- var ensureNotNull = kotlin_kotlin.$_$.sl;
42
+ var ensureNotNull = kotlin_kotlin.$_$.wl;
43
43
  var ConcurrentModificationException_init_$Create$ = kotlin_kotlin.$_$.s1;
44
- var initMetadataForObject = kotlin_kotlin.$_$.ae;
44
+ var initMetadataForObject = kotlin_kotlin.$_$.de;
45
45
  var AssertionError_init_$Create$ = kotlin_kotlin.$_$.r1;
46
46
  //endregion
47
47
  //region block: pre-declaration
@@ -78,17 +78,17 @@
78
78
  initMetadataForObject(MapImplementation, 'MapImplementation');
79
79
  //endregion
80
80
  function persistentMapOf() {
81
- return Companion_getInstance_1().cfz();
81
+ return Companion_getInstance_1().hfy();
82
82
  }
83
83
  function createEntries($this) {
84
84
  return new PersistentHashMapEntries($this);
85
85
  }
86
86
  function Companion() {
87
87
  Companion_instance = this;
88
- this.dfz_1 = new PersistentHashMap(Companion_getInstance_0().efz_1, 0);
88
+ this.ify_1 = new PersistentHashMap(Companion_getInstance_0().jfy_1, 0);
89
89
  }
90
- protoOf(Companion).cfz = function () {
91
- var tmp = this.dfz_1;
90
+ protoOf(Companion).hfy = function () {
91
+ var tmp = this.ify_1;
92
92
  return tmp instanceof PersistentHashMap ? tmp : THROW_CCE();
93
93
  };
94
94
  var Companion_instance;
@@ -98,10 +98,10 @@
98
98
  return Companion_instance;
99
99
  }
100
100
  function PersistentHashMap$equals$lambda(a, b) {
101
- return equals(a, b.ffz_1);
101
+ return equals(a, b.kfy_1);
102
102
  }
103
103
  function PersistentHashMap$equals$lambda_0(a, b) {
104
- return equals(a, b.ffz_1);
104
+ return equals(a, b.kfy_1);
105
105
  }
106
106
  function PersistentHashMap$equals$lambda_1(a, b) {
107
107
  return equals(a, b);
@@ -112,11 +112,11 @@
112
112
  function PersistentHashMap(node, size) {
113
113
  Companion_getInstance();
114
114
  AbstractMap.call(this);
115
- this.kfz_1 = node;
116
- this.lfz_1 = size;
115
+ this.pfy_1 = node;
116
+ this.qfy_1 = size;
117
117
  }
118
118
  protoOf(PersistentHashMap).s = function () {
119
- return this.lfz_1;
119
+ return this.qfy_1;
120
120
  };
121
121
  protoOf(PersistentHashMap).k2 = function () {
122
122
  return new PersistentHashMapKeys(this);
@@ -131,19 +131,19 @@
131
131
  // Inline function 'kotlin.hashCode' call
132
132
  var tmp1_elvis_lhs = key == null ? null : hashCode(key);
133
133
  var tmp$ret$0 = tmp1_elvis_lhs == null ? 0 : tmp1_elvis_lhs;
134
- return this.kfz_1.qfz(tmp$ret$0, key, 0);
134
+ return this.pfy_1.vfy(tmp$ret$0, key, 0);
135
135
  };
136
136
  protoOf(PersistentHashMap).j2 = function (key) {
137
137
  // Inline function 'kotlin.hashCode' call
138
138
  var tmp1_elvis_lhs = key == null ? null : hashCode(key);
139
139
  var tmp$ret$0 = tmp1_elvis_lhs == null ? 0 : tmp1_elvis_lhs;
140
- return this.kfz_1.rfz(tmp$ret$0, key, 0);
140
+ return this.pfy_1.wfy(tmp$ret$0, key, 0);
141
141
  };
142
142
  protoOf(PersistentHashMap).r2 = function (key, value) {
143
143
  // Inline function 'kotlin.hashCode' call
144
144
  var tmp1_elvis_lhs = key == null ? null : hashCode(key);
145
145
  var tmp$ret$0 = tmp1_elvis_lhs == null ? 0 : tmp1_elvis_lhs;
146
- var tmp0_elvis_lhs = this.kfz_1.sfz(tmp$ret$0, key, value, 0);
146
+ var tmp0_elvis_lhs = this.pfy_1.xfy(tmp$ret$0, key, value, 0);
147
147
  var tmp;
148
148
  if (tmp0_elvis_lhs == null) {
149
149
  return this;
@@ -151,42 +151,42 @@
151
151
  tmp = tmp0_elvis_lhs;
152
152
  }
153
153
  var newNodeResult = tmp;
154
- return new PersistentHashMap(newNodeResult.tfz_1, this.lfz_1 + newNodeResult.ufz_1 | 0);
154
+ return new PersistentHashMap(newNodeResult.yfy_1, this.qfy_1 + newNodeResult.zfy_1 | 0);
155
155
  };
156
156
  protoOf(PersistentHashMap).s2 = function (key) {
157
157
  // Inline function 'kotlin.hashCode' call
158
158
  var tmp1_elvis_lhs = key == null ? null : hashCode(key);
159
159
  var tmp$ret$0 = tmp1_elvis_lhs == null ? 0 : tmp1_elvis_lhs;
160
- var newNode = this.kfz_1.vfz(tmp$ret$0, key, 0);
161
- if (this.kfz_1 === newNode) {
160
+ var newNode = this.pfy_1.afz(tmp$ret$0, key, 0);
161
+ if (this.pfy_1 === newNode) {
162
162
  return this;
163
163
  }
164
164
  if (newNode == null) {
165
- return Companion_getInstance().cfz();
165
+ return Companion_getInstance().hfy();
166
166
  }
167
- return new PersistentHashMap(newNode, this.lfz_1 - 1 | 0);
167
+ return new PersistentHashMap(newNode, this.qfy_1 - 1 | 0);
168
168
  };
169
169
  protoOf(PersistentHashMap).equals = function (other) {
170
170
  if (other === this)
171
171
  return true;
172
172
  if (!(!(other == null) ? isInterface(other, KtMap) : false))
173
173
  return false;
174
- if (!(this.lfz_1 === other.s()))
174
+ if (!(this.qfy_1 === other.s()))
175
175
  return false;
176
176
  var tmp;
177
177
  if (other instanceof PersistentOrderedMap) {
178
- tmp = this.kfz_1.bg0(other.lg0_1.kfz_1, PersistentHashMap$equals$lambda);
178
+ tmp = this.pfy_1.gfz(other.qfz_1.pfy_1, PersistentHashMap$equals$lambda);
179
179
  } else {
180
180
  if (other instanceof PersistentOrderedMapBuilder) {
181
- var tmp_0 = other.gg0_1.ag0_1;
182
- tmp = this.kfz_1.bg0(tmp_0, PersistentHashMap$equals$lambda_0);
181
+ var tmp_0 = other.lfz_1.ffz_1;
182
+ tmp = this.pfy_1.gfz(tmp_0, PersistentHashMap$equals$lambda_0);
183
183
  } else {
184
184
  if (other instanceof PersistentHashMap) {
185
- tmp = this.kfz_1.bg0(other.kfz_1, PersistentHashMap$equals$lambda_1);
185
+ tmp = this.pfy_1.gfz(other.pfy_1, PersistentHashMap$equals$lambda_1);
186
186
  } else {
187
187
  if (other instanceof PersistentHashMapBuilder) {
188
- var tmp_1 = other.ag0_1;
189
- tmp = this.kfz_1.bg0(tmp_1, PersistentHashMap$equals$lambda_2);
188
+ var tmp_1 = other.ffz_1;
189
+ tmp = this.pfy_1.gfz(tmp_1, PersistentHashMap$equals$lambda_2);
190
190
  } else {
191
191
  tmp = protoOf(AbstractMap).equals.call(this, other);
192
192
  }
@@ -231,14 +231,14 @@
231
231
  PersistentHashMapBaseIterator.call(this, node, tmp_0);
232
232
  }
233
233
  function MapEntry(key, value) {
234
- this.pg0_1 = key;
235
- this.qg0_1 = value;
234
+ this.ufz_1 = key;
235
+ this.vfz_1 = value;
236
236
  }
237
237
  protoOf(MapEntry).a1 = function () {
238
- return this.pg0_1;
238
+ return this.ufz_1;
239
239
  };
240
240
  protoOf(MapEntry).b1 = function () {
241
- return this.qg0_1;
241
+ return this.vfz_1;
242
242
  };
243
243
  protoOf(MapEntry).hashCode = function () {
244
244
  // Inline function 'kotlin.hashCode' call
@@ -266,137 +266,137 @@
266
266
  return toString(this.a1()) + '=' + toString(this.b1());
267
267
  };
268
268
  function moveToNextNodeWithData($this, pathIndex) {
269
- if ($this.mg0_1[pathIndex].ug0()) {
269
+ if ($this.rfz_1[pathIndex].zfz()) {
270
270
  return pathIndex;
271
271
  }
272
- if ($this.mg0_1[pathIndex].yg0()) {
273
- var node = $this.mg0_1[pathIndex].vg0();
272
+ if ($this.rfz_1[pathIndex].dg0()) {
273
+ var node = $this.rfz_1[pathIndex].ag0();
274
274
  if (pathIndex === 6) {
275
- $this.mg0_1[pathIndex + 1 | 0].xg0(node.pfz_1, node.pfz_1.length);
275
+ $this.rfz_1[pathIndex + 1 | 0].cg0(node.ufy_1, node.ufy_1.length);
276
276
  } else {
277
- $this.mg0_1[pathIndex + 1 | 0].xg0(node.pfz_1, imul(2, node.wg0()));
277
+ $this.rfz_1[pathIndex + 1 | 0].cg0(node.ufy_1, imul(2, node.bg0()));
278
278
  }
279
279
  return moveToNextNodeWithData($this, pathIndex + 1 | 0);
280
280
  }
281
281
  return -1;
282
282
  }
283
283
  function ensureNextEntryIsReady($this) {
284
- if ($this.mg0_1[$this.ng0_1].ug0()) {
284
+ if ($this.rfz_1[$this.sfz_1].zfz()) {
285
285
  return Unit_instance;
286
286
  }
287
- var inductionVariable = $this.ng0_1;
287
+ var inductionVariable = $this.sfz_1;
288
288
  if (0 <= inductionVariable)
289
289
  do {
290
290
  var i = inductionVariable;
291
291
  inductionVariable = inductionVariable + -1 | 0;
292
292
  var result = moveToNextNodeWithData($this, i);
293
- if (result === -1 && $this.mg0_1[i].yg0()) {
294
- $this.mg0_1[i].zg0();
293
+ if (result === -1 && $this.rfz_1[i].dg0()) {
294
+ $this.rfz_1[i].eg0();
295
295
  result = moveToNextNodeWithData($this, i);
296
296
  }
297
297
  if (!(result === -1)) {
298
- $this.ng0_1 = result;
298
+ $this.sfz_1 = result;
299
299
  return Unit_instance;
300
300
  }
301
301
  if (i > 0) {
302
- $this.mg0_1[i - 1 | 0].zg0();
302
+ $this.rfz_1[i - 1 | 0].eg0();
303
303
  }
304
- $this.mg0_1[i].xg0(Companion_getInstance_0().efz_1.pfz_1, 0);
304
+ $this.rfz_1[i].cg0(Companion_getInstance_0().jfy_1.ufy_1, 0);
305
305
  }
306
306
  while (0 <= inductionVariable);
307
- $this.og0_1 = false;
307
+ $this.tfz_1 = false;
308
308
  }
309
309
  function checkHasNext($this) {
310
310
  if (!$this.q())
311
311
  throw NoSuchElementException_init_$Create$();
312
312
  }
313
313
  function PersistentHashMapBaseIterator(node, path) {
314
- this.mg0_1 = path;
315
- this.ng0_1 = 0;
316
- this.og0_1 = true;
317
- this.mg0_1[0].xg0(node.pfz_1, imul(2, node.wg0()));
318
- this.ng0_1 = 0;
314
+ this.rfz_1 = path;
315
+ this.sfz_1 = 0;
316
+ this.tfz_1 = true;
317
+ this.rfz_1[0].cg0(node.ufy_1, imul(2, node.bg0()));
318
+ this.sfz_1 = 0;
319
319
  ensureNextEntryIsReady(this);
320
320
  }
321
321
  protoOf(PersistentHashMapBaseIterator).q = function () {
322
- return this.og0_1;
322
+ return this.tfz_1;
323
323
  };
324
324
  protoOf(PersistentHashMapBaseIterator).r = function () {
325
325
  checkHasNext(this);
326
- var result = this.mg0_1[this.ng0_1].r();
326
+ var result = this.rfz_1[this.sfz_1].r();
327
327
  ensureNextEntryIsReady(this);
328
328
  return result;
329
329
  };
330
330
  function TrieNodeBaseIterator() {
331
- this.rg0_1 = Companion_getInstance_0().efz_1.pfz_1;
332
- this.sg0_1 = 0;
333
- this.tg0_1 = 0;
331
+ this.wfz_1 = Companion_getInstance_0().jfy_1.ufy_1;
332
+ this.xfz_1 = 0;
333
+ this.yfz_1 = 0;
334
334
  }
335
- protoOf(TrieNodeBaseIterator).ag1 = function (buffer, dataSize, index) {
336
- this.rg0_1 = buffer;
337
- this.sg0_1 = dataSize;
338
- this.tg0_1 = index;
335
+ protoOf(TrieNodeBaseIterator).fg0 = function (buffer, dataSize, index) {
336
+ this.wfz_1 = buffer;
337
+ this.xfz_1 = dataSize;
338
+ this.yfz_1 = index;
339
339
  };
340
- protoOf(TrieNodeBaseIterator).xg0 = function (buffer, dataSize) {
341
- this.ag1(buffer, dataSize, 0);
340
+ protoOf(TrieNodeBaseIterator).cg0 = function (buffer, dataSize) {
341
+ this.fg0(buffer, dataSize, 0);
342
342
  };
343
- protoOf(TrieNodeBaseIterator).ug0 = function () {
344
- return this.tg0_1 < this.sg0_1;
343
+ protoOf(TrieNodeBaseIterator).zfz = function () {
344
+ return this.yfz_1 < this.xfz_1;
345
345
  };
346
- protoOf(TrieNodeBaseIterator).yg0 = function () {
347
- assert(this.tg0_1 >= this.sg0_1);
348
- return this.tg0_1 < this.rg0_1.length;
346
+ protoOf(TrieNodeBaseIterator).dg0 = function () {
347
+ assert(this.yfz_1 >= this.xfz_1);
348
+ return this.yfz_1 < this.wfz_1.length;
349
349
  };
350
- protoOf(TrieNodeBaseIterator).vg0 = function () {
351
- assert(this.yg0());
352
- var tmp = this.rg0_1[this.tg0_1];
350
+ protoOf(TrieNodeBaseIterator).ag0 = function () {
351
+ assert(this.dg0());
352
+ var tmp = this.wfz_1[this.yfz_1];
353
353
  return tmp instanceof TrieNode ? tmp : THROW_CCE();
354
354
  };
355
- protoOf(TrieNodeBaseIterator).zg0 = function () {
356
- assert(this.yg0());
357
- this.tg0_1 = this.tg0_1 + 1 | 0;
355
+ protoOf(TrieNodeBaseIterator).eg0 = function () {
356
+ assert(this.dg0());
357
+ this.yfz_1 = this.yfz_1 + 1 | 0;
358
358
  };
359
359
  protoOf(TrieNodeBaseIterator).q = function () {
360
- return this.ug0();
360
+ return this.zfz();
361
361
  };
362
362
  function TrieNodeKeysIterator() {
363
363
  TrieNodeBaseIterator.call(this);
364
364
  }
365
365
  protoOf(TrieNodeKeysIterator).r = function () {
366
- assert(this.ug0());
367
- this.tg0_1 = this.tg0_1 + 2 | 0;
368
- var tmp = this.rg0_1[this.tg0_1 - 2 | 0];
366
+ assert(this.zfz());
367
+ this.yfz_1 = this.yfz_1 + 2 | 0;
368
+ var tmp = this.wfz_1[this.yfz_1 - 2 | 0];
369
369
  return (tmp == null ? true : !(tmp == null)) ? tmp : THROW_CCE();
370
370
  };
371
371
  function TrieNodeValuesIterator() {
372
372
  TrieNodeBaseIterator.call(this);
373
373
  }
374
374
  protoOf(TrieNodeValuesIterator).r = function () {
375
- assert(this.ug0());
376
- this.tg0_1 = this.tg0_1 + 2 | 0;
377
- var tmp = this.rg0_1[this.tg0_1 - 1 | 0];
375
+ assert(this.zfz());
376
+ this.yfz_1 = this.yfz_1 + 2 | 0;
377
+ var tmp = this.wfz_1[this.yfz_1 - 1 | 0];
378
378
  return (tmp == null ? true : !(tmp == null)) ? tmp : THROW_CCE();
379
379
  };
380
380
  function TrieNodeEntriesIterator() {
381
381
  TrieNodeBaseIterator.call(this);
382
382
  }
383
383
  protoOf(TrieNodeEntriesIterator).r = function () {
384
- assert(this.ug0());
385
- this.tg0_1 = this.tg0_1 + 2 | 0;
386
- var tmp = this.rg0_1[this.tg0_1 - 2 | 0];
384
+ assert(this.zfz());
385
+ this.yfz_1 = this.yfz_1 + 2 | 0;
386
+ var tmp = this.wfz_1[this.yfz_1 - 2 | 0];
387
387
  var tmp_0 = (tmp == null ? true : !(tmp == null)) ? tmp : THROW_CCE();
388
- var tmp_1 = this.rg0_1[this.tg0_1 - 1 | 0];
388
+ var tmp_1 = this.wfz_1[this.yfz_1 - 1 | 0];
389
389
  return new MapEntry(tmp_0, (tmp_1 == null ? true : !(tmp_1 == null)) ? tmp_1 : THROW_CCE());
390
390
  };
391
391
  function PersistentHashMapKeys(map) {
392
392
  AbstractSet.call(this);
393
- this.kg1_1 = map;
393
+ this.pg0_1 = map;
394
394
  }
395
395
  protoOf(PersistentHashMapKeys).s = function () {
396
- return this.kg1_1.lfz_1;
396
+ return this.pg0_1.qfy_1;
397
397
  };
398
398
  protoOf(PersistentHashMapKeys).q6 = function (element) {
399
- return this.kg1_1.h2(element);
399
+ return this.pg0_1.h2(element);
400
400
  };
401
401
  protoOf(PersistentHashMapKeys).w = function (element) {
402
402
  if (!(element == null ? true : !(element == null)))
@@ -404,17 +404,17 @@
404
404
  return this.q6((element == null ? true : !(element == null)) ? element : THROW_CCE());
405
405
  };
406
406
  protoOf(PersistentHashMapKeys).p = function () {
407
- return new PersistentHashMapKeysIterator(this.kg1_1.kfz_1);
407
+ return new PersistentHashMapKeysIterator(this.pg0_1.pfy_1);
408
408
  };
409
409
  function PersistentHashMapValues(map) {
410
410
  AbstractCollection.call(this);
411
- this.lg1_1 = map;
411
+ this.qg0_1 = map;
412
412
  }
413
413
  protoOf(PersistentHashMapValues).s = function () {
414
- return this.lg1_1.lfz_1;
414
+ return this.qg0_1.qfy_1;
415
415
  };
416
416
  protoOf(PersistentHashMapValues).v6 = function (element) {
417
- return this.lg1_1.i2(element);
417
+ return this.qg0_1.i2(element);
418
418
  };
419
419
  protoOf(PersistentHashMapValues).w = function (element) {
420
420
  if (!(element == null ? true : !(element == null)))
@@ -422,25 +422,25 @@
422
422
  return this.v6((element == null ? true : !(element == null)) ? element : THROW_CCE());
423
423
  };
424
424
  protoOf(PersistentHashMapValues).p = function () {
425
- return new PersistentHashMapValuesIterator(this.lg1_1.kfz_1);
425
+ return new PersistentHashMapValuesIterator(this.qg0_1.pfy_1);
426
426
  };
427
427
  function PersistentHashMapEntries(map) {
428
428
  AbstractSet.call(this);
429
- this.mg1_1 = map;
429
+ this.rg0_1 = map;
430
430
  }
431
431
  protoOf(PersistentHashMapEntries).s = function () {
432
- return this.mg1_1.lfz_1;
432
+ return this.rg0_1.qfy_1;
433
433
  };
434
- protoOf(PersistentHashMapEntries).ng1 = function (element) {
435
- return MapImplementation_instance.og1(this.mg1_1, element);
434
+ protoOf(PersistentHashMapEntries).sg0 = function (element) {
435
+ return MapImplementation_instance.tg0(this.rg0_1, element);
436
436
  };
437
437
  protoOf(PersistentHashMapEntries).w = function (element) {
438
438
  if (!(!(element == null) ? isInterface(element, Entry) : false))
439
439
  return false;
440
- return this.ng1((!(element == null) ? isInterface(element, Entry) : false) ? element : THROW_CCE());
440
+ return this.sg0((!(element == null) ? isInterface(element, Entry) : false) ? element : THROW_CCE());
441
441
  };
442
442
  protoOf(PersistentHashMapEntries).p = function () {
443
- return new PersistentHashMapEntriesIterator(this.mg1_1.kfz_1);
443
+ return new PersistentHashMapEntriesIterator(this.rg0_1.pfy_1);
444
444
  };
445
445
  function TrieNode_init_$Init$(dataMap, nodeMap, buffer, $this) {
446
446
  TrieNode.call($this, dataMap, nodeMap, buffer, null);
@@ -450,8 +450,8 @@
450
450
  return TrieNode_init_$Init$(dataMap, nodeMap, buffer, objectCreate(protoOf(TrieNode)));
451
451
  }
452
452
  function ModificationResult(node, sizeDelta) {
453
- this.tfz_1 = node;
454
- this.ufz_1 = sizeDelta;
453
+ this.yfy_1 = node;
454
+ this.zfy_1 = sizeDelta;
455
455
  }
456
456
  function asInsertResult($this) {
457
457
  return new ModificationResult($this, 1);
@@ -460,58 +460,58 @@
460
460
  return new ModificationResult($this, 0);
461
461
  }
462
462
  function hasNodeAt($this, positionMask) {
463
- return !(($this.nfz_1 & positionMask) === 0);
463
+ return !(($this.sfy_1 & positionMask) === 0);
464
464
  }
465
465
  function keyAtIndex($this, keyIndex) {
466
- var tmp = $this.pfz_1[keyIndex];
466
+ var tmp = $this.ufy_1[keyIndex];
467
467
  return (tmp == null ? true : !(tmp == null)) ? tmp : THROW_CCE();
468
468
  }
469
469
  function valueAtKeyIndex($this, keyIndex) {
470
- var tmp = $this.pfz_1[keyIndex + 1 | 0];
470
+ var tmp = $this.ufy_1[keyIndex + 1 | 0];
471
471
  return (tmp == null ? true : !(tmp == null)) ? tmp : THROW_CCE();
472
472
  }
473
473
  function insertEntryAt($this, positionMask, key, value) {
474
- var keyIndex = $this.pg1(positionMask);
475
- var newBuffer = insertEntryAtIndex($this.pfz_1, keyIndex, key, value);
476
- return TrieNode_init_$Create$($this.mfz_1 | positionMask, $this.nfz_1, newBuffer);
474
+ var keyIndex = $this.ug0(positionMask);
475
+ var newBuffer = insertEntryAtIndex($this.ufy_1, keyIndex, key, value);
476
+ return TrieNode_init_$Create$($this.rfy_1 | positionMask, $this.sfy_1, newBuffer);
477
477
  }
478
478
  function updateValueAtIndex($this, keyIndex, value) {
479
479
  // Inline function 'kotlin.collections.copyOf' call
480
480
  // Inline function 'kotlin.js.asDynamic' call
481
- var newBuffer = $this.pfz_1.slice();
481
+ var newBuffer = $this.ufy_1.slice();
482
482
  newBuffer[keyIndex + 1 | 0] = value;
483
- return TrieNode_init_$Create$($this.mfz_1, $this.nfz_1, newBuffer);
483
+ return TrieNode_init_$Create$($this.rfy_1, $this.sfy_1, newBuffer);
484
484
  }
485
485
  function updateNodeAtIndex($this, nodeIndex, positionMask, newNode, owner) {
486
- var newNodeBuffer = newNode.pfz_1;
487
- if (newNodeBuffer.length === 2 && newNode.nfz_1 === 0) {
488
- if ($this.pfz_1.length === 1) {
489
- newNode.mfz_1 = $this.nfz_1;
486
+ var newNodeBuffer = newNode.ufy_1;
487
+ if (newNodeBuffer.length === 2 && newNode.sfy_1 === 0) {
488
+ if ($this.ufy_1.length === 1) {
489
+ newNode.rfy_1 = $this.sfy_1;
490
490
  return newNode;
491
491
  }
492
- var keyIndex = $this.pg1(positionMask);
493
- var newBuffer = replaceNodeWithEntry($this.pfz_1, nodeIndex, keyIndex, newNodeBuffer[0], newNodeBuffer[1]);
494
- return new TrieNode($this.mfz_1 ^ positionMask, $this.nfz_1 ^ positionMask, newBuffer, owner);
492
+ var keyIndex = $this.ug0(positionMask);
493
+ var newBuffer = replaceNodeWithEntry($this.ufy_1, nodeIndex, keyIndex, newNodeBuffer[0], newNodeBuffer[1]);
494
+ return new TrieNode($this.rfy_1 ^ positionMask, $this.sfy_1 ^ positionMask, newBuffer, owner);
495
495
  }
496
- if (!(owner == null) && $this.ofz_1 === owner) {
497
- $this.pfz_1[nodeIndex] = newNode;
496
+ if (!(owner == null) && $this.tfy_1 === owner) {
497
+ $this.ufy_1[nodeIndex] = newNode;
498
498
  return $this;
499
499
  }
500
500
  // Inline function 'kotlin.collections.copyOf' call
501
501
  // Inline function 'kotlin.js.asDynamic' call
502
- var newBuffer_0 = $this.pfz_1.slice();
502
+ var newBuffer_0 = $this.ufy_1.slice();
503
503
  newBuffer_0[nodeIndex] = newNode;
504
- return new TrieNode($this.mfz_1, $this.nfz_1, newBuffer_0, owner);
504
+ return new TrieNode($this.rfy_1, $this.sfy_1, newBuffer_0, owner);
505
505
  }
506
506
  function updateNodeAtIndex$default($this, nodeIndex, positionMask, newNode, owner, $super) {
507
507
  owner = owner === VOID ? null : owner;
508
508
  return updateNodeAtIndex($this, nodeIndex, positionMask, newNode, owner);
509
509
  }
510
510
  function removeNodeAtIndex($this, nodeIndex, positionMask) {
511
- if ($this.pfz_1.length === 1)
511
+ if ($this.ufy_1.length === 1)
512
512
  return null;
513
- var newBuffer = removeNodeAtIndex_0($this.pfz_1, nodeIndex);
514
- return TrieNode_init_$Create$($this.mfz_1, $this.nfz_1 ^ positionMask, newBuffer);
513
+ var newBuffer = removeNodeAtIndex_0($this.ufy_1, nodeIndex);
514
+ return TrieNode_init_$Create$($this.rfy_1, $this.sfy_1 ^ positionMask, newBuffer);
515
515
  }
516
516
  function bufferMoveEntryToNode($this, keyIndex, positionMask, newKeyHash, newKey, newValue, shift, owner) {
517
517
  var storedKey = keyAtIndex($this, keyIndex);
@@ -520,12 +520,12 @@
520
520
  var storedKeyHash = tmp1_elvis_lhs == null ? 0 : tmp1_elvis_lhs;
521
521
  var storedValue = valueAtKeyIndex($this, keyIndex);
522
522
  var newNode = makeNode($this, storedKeyHash, storedKey, storedValue, newKeyHash, newKey, newValue, shift + 5 | 0, owner);
523
- var nodeIndex = $this.qg1(positionMask) + 1 | 0;
524
- return replaceEntryWithNode($this.pfz_1, keyIndex, nodeIndex, newNode);
523
+ var nodeIndex = $this.vg0(positionMask) + 1 | 0;
524
+ return replaceEntryWithNode($this.ufy_1, keyIndex, nodeIndex, newNode);
525
525
  }
526
526
  function moveEntryToNode($this, keyIndex, positionMask, newKeyHash, newKey, newValue, shift) {
527
527
  var newBuffer = bufferMoveEntryToNode($this, keyIndex, positionMask, newKeyHash, newKey, newValue, shift, null);
528
- return TrieNode_init_$Create$($this.mfz_1 ^ positionMask, $this.nfz_1 | positionMask, newBuffer);
528
+ return TrieNode_init_$Create$($this.rfy_1 ^ positionMask, $this.sfy_1 | positionMask, newBuffer);
529
529
  }
530
530
  function makeNode($this, keyHash1, key1, value1, keyHash2, key2, value2, shift, owner) {
531
531
  if (shift > 30) {
@@ -562,19 +562,19 @@
562
562
  return new TrieNode(0, tmp_0, tmp$ret$11, owner);
563
563
  }
564
564
  function removeEntryAtIndex($this, keyIndex, positionMask) {
565
- if ($this.pfz_1.length === 2)
565
+ if ($this.ufy_1.length === 2)
566
566
  return null;
567
- var newBuffer = removeEntryAtIndex_0($this.pfz_1, keyIndex);
568
- return TrieNode_init_$Create$($this.mfz_1 ^ positionMask, $this.nfz_1, newBuffer);
567
+ var newBuffer = removeEntryAtIndex_0($this.ufy_1, keyIndex);
568
+ return TrieNode_init_$Create$($this.rfy_1 ^ positionMask, $this.sfy_1, newBuffer);
569
569
  }
570
570
  function collisionRemoveEntryAtIndex($this, i) {
571
- if ($this.pfz_1.length === 2)
571
+ if ($this.ufy_1.length === 2)
572
572
  return null;
573
- var newBuffer = removeEntryAtIndex_0($this.pfz_1, i);
573
+ var newBuffer = removeEntryAtIndex_0($this.ufy_1, i);
574
574
  return TrieNode_init_$Create$(0, 0, newBuffer);
575
575
  }
576
576
  function collisionKeyIndex($this, key) {
577
- var progression = step(until(0, $this.pfz_1.length), 2);
577
+ var progression = step(until(0, $this.ufy_1.length), 2);
578
578
  var inductionVariable = progression.d1_1;
579
579
  var last = progression.e1_1;
580
580
  var step_0 = progression.f1_1;
@@ -603,11 +603,11 @@
603
603
  }
604
604
  // Inline function 'kotlin.collections.copyOf' call
605
605
  // Inline function 'kotlin.js.asDynamic' call
606
- var newBuffer = $this.pfz_1.slice();
606
+ var newBuffer = $this.ufy_1.slice();
607
607
  newBuffer[keyIndex + 1 | 0] = value;
608
608
  return asUpdateResult(TrieNode_init_$Create$(0, 0, newBuffer));
609
609
  }
610
- var newBuffer_0 = insertEntryAtIndex($this.pfz_1, 0, key, value);
610
+ var newBuffer_0 = insertEntryAtIndex($this.ufy_1, 0, key, value);
611
611
  return asInsertResult(TrieNode_init_$Create$(0, 0, newBuffer_0));
612
612
  }
613
613
  function collisionRemove($this, key) {
@@ -625,7 +625,7 @@
625
625
  var tmp = this;
626
626
  // Inline function 'kotlin.emptyArray' call
627
627
  var tmp$ret$0 = [];
628
- tmp.efz_1 = TrieNode_init_$Create$(0, 0, tmp$ret$0);
628
+ tmp.jfy_1 = TrieNode_init_$Create$(0, 0, tmp$ret$0);
629
629
  }
630
630
  var Companion_instance_0;
631
631
  function Companion_getInstance_0() {
@@ -635,63 +635,63 @@
635
635
  }
636
636
  function TrieNode(dataMap, nodeMap, buffer, ownedBy) {
637
637
  Companion_getInstance_0();
638
- this.mfz_1 = dataMap;
639
- this.nfz_1 = nodeMap;
640
- this.ofz_1 = ownedBy;
641
- this.pfz_1 = buffer;
638
+ this.rfy_1 = dataMap;
639
+ this.sfy_1 = nodeMap;
640
+ this.tfy_1 = ownedBy;
641
+ this.ufy_1 = buffer;
642
642
  }
643
- protoOf(TrieNode).wg0 = function () {
644
- return countOneBits(this.mfz_1);
643
+ protoOf(TrieNode).bg0 = function () {
644
+ return countOneBits(this.rfy_1);
645
645
  };
646
- protoOf(TrieNode).rg1 = function (positionMask) {
647
- return !((this.mfz_1 & positionMask) === 0);
646
+ protoOf(TrieNode).wg0 = function (positionMask) {
647
+ return !((this.rfy_1 & positionMask) === 0);
648
648
  };
649
- protoOf(TrieNode).pg1 = function (positionMask) {
650
- return imul(2, countOneBits(this.mfz_1 & (positionMask - 1 | 0)));
649
+ protoOf(TrieNode).ug0 = function (positionMask) {
650
+ return imul(2, countOneBits(this.rfy_1 & (positionMask - 1 | 0)));
651
651
  };
652
- protoOf(TrieNode).qg1 = function (positionMask) {
653
- return (this.pfz_1.length - 1 | 0) - countOneBits(this.nfz_1 & (positionMask - 1 | 0)) | 0;
652
+ protoOf(TrieNode).vg0 = function (positionMask) {
653
+ return (this.ufy_1.length - 1 | 0) - countOneBits(this.sfy_1 & (positionMask - 1 | 0)) | 0;
654
654
  };
655
- protoOf(TrieNode).sg1 = function (nodeIndex) {
656
- var tmp = this.pfz_1[nodeIndex];
655
+ protoOf(TrieNode).xg0 = function (nodeIndex) {
656
+ var tmp = this.ufy_1[nodeIndex];
657
657
  return tmp instanceof TrieNode ? tmp : THROW_CCE();
658
658
  };
659
- protoOf(TrieNode).qfz = function (keyHash, key, shift) {
659
+ protoOf(TrieNode).vfy = function (keyHash, key, shift) {
660
660
  var keyPositionMask = 1 << indexSegment(keyHash, shift);
661
- if (this.rg1(keyPositionMask)) {
662
- return equals(key, keyAtIndex(this, this.pg1(keyPositionMask)));
661
+ if (this.wg0(keyPositionMask)) {
662
+ return equals(key, keyAtIndex(this, this.ug0(keyPositionMask)));
663
663
  }
664
664
  if (hasNodeAt(this, keyPositionMask)) {
665
- var targetNode = this.sg1(this.qg1(keyPositionMask));
665
+ var targetNode = this.xg0(this.vg0(keyPositionMask));
666
666
  if (shift === 30) {
667
667
  return collisionContainsKey(targetNode, key);
668
668
  }
669
- return targetNode.qfz(keyHash, key, shift + 5 | 0);
669
+ return targetNode.vfy(keyHash, key, shift + 5 | 0);
670
670
  }
671
671
  return false;
672
672
  };
673
- protoOf(TrieNode).rfz = function (keyHash, key, shift) {
673
+ protoOf(TrieNode).wfy = function (keyHash, key, shift) {
674
674
  var keyPositionMask = 1 << indexSegment(keyHash, shift);
675
- if (this.rg1(keyPositionMask)) {
676
- var keyIndex = this.pg1(keyPositionMask);
675
+ if (this.wg0(keyPositionMask)) {
676
+ var keyIndex = this.ug0(keyPositionMask);
677
677
  if (equals(key, keyAtIndex(this, keyIndex))) {
678
678
  return valueAtKeyIndex(this, keyIndex);
679
679
  }
680
680
  return null;
681
681
  }
682
682
  if (hasNodeAt(this, keyPositionMask)) {
683
- var targetNode = this.sg1(this.qg1(keyPositionMask));
683
+ var targetNode = this.xg0(this.vg0(keyPositionMask));
684
684
  if (shift === 30) {
685
685
  return collisionGet(targetNode, key);
686
686
  }
687
- return targetNode.rfz(keyHash, key, shift + 5 | 0);
687
+ return targetNode.wfy(keyHash, key, shift + 5 | 0);
688
688
  }
689
689
  return null;
690
690
  };
691
- protoOf(TrieNode).sfz = function (keyHash, key, value, shift) {
691
+ protoOf(TrieNode).xfy = function (keyHash, key, value, shift) {
692
692
  var keyPositionMask = 1 << indexSegment(keyHash, shift);
693
- if (this.rg1(keyPositionMask)) {
694
- var keyIndex = this.pg1(keyPositionMask);
693
+ if (this.wg0(keyPositionMask)) {
694
+ var keyIndex = this.ug0(keyPositionMask);
695
695
  if (equals(key, keyAtIndex(this, keyIndex))) {
696
696
  if (valueAtKeyIndex(this, keyIndex) === value)
697
697
  return null;
@@ -700,8 +700,8 @@
700
700
  return asInsertResult(moveEntryToNode(this, keyIndex, keyPositionMask, keyHash, key, value, shift));
701
701
  }
702
702
  if (hasNodeAt(this, keyPositionMask)) {
703
- var nodeIndex = this.qg1(keyPositionMask);
704
- var targetNode = this.sg1(nodeIndex);
703
+ var nodeIndex = this.vg0(keyPositionMask);
704
+ var targetNode = this.xg0(nodeIndex);
705
705
  var tmp;
706
706
  if (shift === 30) {
707
707
  var tmp0_elvis_lhs = collisionPut(targetNode, key, value);
@@ -713,7 +713,7 @@
713
713
  }
714
714
  tmp = tmp_0;
715
715
  } else {
716
- var tmp1_elvis_lhs = targetNode.sfz(keyHash, key, value, shift + 5 | 0);
716
+ var tmp1_elvis_lhs = targetNode.xfy(keyHash, key, value, shift + 5 | 0);
717
717
  var tmp_1;
718
718
  if (tmp1_elvis_lhs == null) {
719
719
  return null;
@@ -726,44 +726,44 @@
726
726
  // Inline function 'kotlinx.collections.immutable.implementations.immutableMap.ModificationResult.replaceNode' call
727
727
  // Inline function 'kotlin.apply' call
728
728
  var tmp_2 = putResult;
729
- var node = putResult.tfz_1;
730
- tmp_2.tfz_1 = updateNodeAtIndex$default(this, nodeIndex, keyPositionMask, node);
729
+ var node = putResult.yfy_1;
730
+ tmp_2.yfy_1 = updateNodeAtIndex$default(this, nodeIndex, keyPositionMask, node);
731
731
  return putResult;
732
732
  }
733
733
  return asInsertResult(insertEntryAt(this, keyPositionMask, key, value));
734
734
  };
735
- protoOf(TrieNode).vfz = function (keyHash, key, shift) {
735
+ protoOf(TrieNode).afz = function (keyHash, key, shift) {
736
736
  var keyPositionMask = 1 << indexSegment(keyHash, shift);
737
- if (this.rg1(keyPositionMask)) {
738
- var keyIndex = this.pg1(keyPositionMask);
737
+ if (this.wg0(keyPositionMask)) {
738
+ var keyIndex = this.ug0(keyPositionMask);
739
739
  if (equals(key, keyAtIndex(this, keyIndex))) {
740
740
  return removeEntryAtIndex(this, keyIndex, keyPositionMask);
741
741
  }
742
742
  return this;
743
743
  }
744
744
  if (hasNodeAt(this, keyPositionMask)) {
745
- var nodeIndex = this.qg1(keyPositionMask);
746
- var targetNode = this.sg1(nodeIndex);
745
+ var nodeIndex = this.vg0(keyPositionMask);
746
+ var targetNode = this.xg0(nodeIndex);
747
747
  var tmp;
748
748
  if (shift === 30) {
749
749
  tmp = collisionRemove(targetNode, key);
750
750
  } else {
751
- tmp = targetNode.vfz(keyHash, key, shift + 5 | 0);
751
+ tmp = targetNode.afz(keyHash, key, shift + 5 | 0);
752
752
  }
753
753
  var newNode = tmp;
754
754
  return replaceNode(this, targetNode, newNode, nodeIndex, keyPositionMask);
755
755
  }
756
756
  return this;
757
757
  };
758
- protoOf(TrieNode).bg0 = function (that, equalityComparator) {
758
+ protoOf(TrieNode).gfz = function (that, equalityComparator) {
759
759
  if (this === that)
760
760
  return true;
761
- if (!(this.mfz_1 === that.mfz_1) || !(this.nfz_1 === that.nfz_1))
761
+ if (!(this.rfy_1 === that.rfy_1) || !(this.sfy_1 === that.sfy_1))
762
762
  return false;
763
- if (this.mfz_1 === 0 && this.nfz_1 === 0) {
764
- if (!(this.pfz_1.length === that.pfz_1.length))
763
+ if (this.rfy_1 === 0 && this.sfy_1 === 0) {
764
+ if (!(this.ufy_1.length === that.ufy_1.length))
765
765
  return false;
766
- var tmp0 = step(until(0, this.pfz_1.length), 2);
766
+ var tmp0 = step(until(0, this.ufy_1.length), 2);
767
767
  var tmp$ret$0;
768
768
  $l$block_0: {
769
769
  // Inline function 'kotlin.collections.all' call
@@ -805,7 +805,7 @@
805
805
  }
806
806
  return tmp$ret$0;
807
807
  }
808
- var valueSize = imul(countOneBits(this.mfz_1), 2);
808
+ var valueSize = imul(countOneBits(this.rfy_1), 2);
809
809
  var progression = step(until(0, valueSize), 2);
810
810
  var inductionVariable_0 = progression.d1_1;
811
811
  var last_0 = progression.e1_1;
@@ -821,12 +821,12 @@
821
821
  }
822
822
  while (!(i_0 === last_0));
823
823
  var inductionVariable_1 = valueSize;
824
- var last_1 = this.pfz_1.length;
824
+ var last_1 = this.ufy_1.length;
825
825
  if (inductionVariable_1 < last_1)
826
826
  do {
827
827
  var i_1 = inductionVariable_1;
828
828
  inductionVariable_1 = inductionVariable_1 + 1 | 0;
829
- if (!this.sg1(i_1).bg0(that.sg1(i_1), equalityComparator))
829
+ if (!this.xg0(i_1).gfz(that.xg0(i_1), equalityComparator))
830
830
  return false;
831
831
  }
832
832
  while (inductionVariable_1 < last_1);
@@ -909,10 +909,10 @@
909
909
  }
910
910
  function Companion_1() {
911
911
  Companion_instance_1 = this;
912
- this.bfz_1 = new PersistentOrderedMap(EndOfChain_instance, EndOfChain_instance, Companion_getInstance().cfz());
912
+ this.gfy_1 = new PersistentOrderedMap(EndOfChain_instance, EndOfChain_instance, Companion_getInstance().hfy());
913
913
  }
914
- protoOf(Companion_1).cfz = function () {
915
- var tmp = this.bfz_1;
914
+ protoOf(Companion_1).hfy = function () {
915
+ var tmp = this.gfy_1;
916
916
  return tmp instanceof PersistentOrderedMap ? tmp : THROW_CCE();
917
917
  };
918
918
  var Companion_instance_1;
@@ -922,26 +922,26 @@
922
922
  return Companion_instance_1;
923
923
  }
924
924
  function PersistentOrderedMap$equals$lambda(a, b) {
925
- return equals(a.ffz_1, b.ffz_1);
925
+ return equals(a.kfy_1, b.kfy_1);
926
926
  }
927
927
  function PersistentOrderedMap$equals$lambda_0(a, b) {
928
- return equals(a.ffz_1, b.ffz_1);
928
+ return equals(a.kfy_1, b.kfy_1);
929
929
  }
930
930
  function PersistentOrderedMap$equals$lambda_1(a, b) {
931
- return equals(a.ffz_1, b);
931
+ return equals(a.kfy_1, b);
932
932
  }
933
933
  function PersistentOrderedMap$equals$lambda_2(a, b) {
934
- return equals(a.ffz_1, b);
934
+ return equals(a.kfy_1, b);
935
935
  }
936
936
  function PersistentOrderedMap(firstKey, lastKey, hashMap) {
937
937
  Companion_getInstance_1();
938
938
  AbstractMap.call(this);
939
- this.jg0_1 = firstKey;
940
- this.kg0_1 = lastKey;
941
- this.lg0_1 = hashMap;
939
+ this.ofz_1 = firstKey;
940
+ this.pfz_1 = lastKey;
941
+ this.qfz_1 = hashMap;
942
942
  }
943
943
  protoOf(PersistentOrderedMap).s = function () {
944
- return this.lg0_1.lfz_1;
944
+ return this.qfz_1.qfy_1;
945
945
  };
946
946
  protoOf(PersistentOrderedMap).k2 = function () {
947
947
  return new PersistentOrderedMapKeys(this);
@@ -953,33 +953,33 @@
953
953
  return createEntries_0(this);
954
954
  };
955
955
  protoOf(PersistentOrderedMap).h2 = function (key) {
956
- return this.lg0_1.h2(key);
956
+ return this.qfz_1.h2(key);
957
957
  };
958
958
  protoOf(PersistentOrderedMap).j2 = function (key) {
959
- var tmp0_safe_receiver = this.lg0_1.j2(key);
960
- return tmp0_safe_receiver == null ? null : tmp0_safe_receiver.ffz_1;
959
+ var tmp0_safe_receiver = this.qfz_1.j2(key);
960
+ return tmp0_safe_receiver == null ? null : tmp0_safe_receiver.kfy_1;
961
961
  };
962
962
  protoOf(PersistentOrderedMap).r2 = function (key, value) {
963
963
  if (this.m()) {
964
- var newMap = this.lg0_1.r2(key, LinkedValue_init_$Create$(value));
964
+ var newMap = this.qfz_1.r2(key, LinkedValue_init_$Create$(value));
965
965
  return new PersistentOrderedMap(key, key, newMap);
966
966
  }
967
- var links = this.lg0_1.j2(key);
967
+ var links = this.qfz_1.j2(key);
968
968
  if (!(links == null)) {
969
- if (links.ffz_1 === value) {
969
+ if (links.kfy_1 === value) {
970
970
  return this;
971
971
  }
972
- var newMap_0 = this.lg0_1.r2(key, links.tg1(value));
973
- return new PersistentOrderedMap(this.jg0_1, this.kg0_1, newMap_0);
972
+ var newMap_0 = this.qfz_1.r2(key, links.yg0(value));
973
+ return new PersistentOrderedMap(this.ofz_1, this.pfz_1, newMap_0);
974
974
  }
975
- var tmp = this.kg0_1;
975
+ var tmp = this.pfz_1;
976
976
  var lastKey = (tmp == null ? true : !(tmp == null)) ? tmp : THROW_CCE();
977
- var lastLinks = ensureNotNull(this.lg0_1.j2(lastKey));
978
- var newMap_1 = this.lg0_1.r2(lastKey, lastLinks.ug1(key)).r2(key, LinkedValue_init_$Create$_0(value, lastKey));
979
- return new PersistentOrderedMap(this.jg0_1, key, newMap_1);
977
+ var lastLinks = ensureNotNull(this.qfz_1.j2(lastKey));
978
+ var newMap_1 = this.qfz_1.r2(lastKey, lastLinks.zg0(key)).r2(key, LinkedValue_init_$Create$_0(value, lastKey));
979
+ return new PersistentOrderedMap(this.ofz_1, key, newMap_1);
980
980
  };
981
981
  protoOf(PersistentOrderedMap).s2 = function (key) {
982
- var tmp0_elvis_lhs = this.lg0_1.j2(key);
982
+ var tmp0_elvis_lhs = this.qfz_1.j2(key);
983
983
  var tmp;
984
984
  if (tmp0_elvis_lhs == null) {
985
985
  return this;
@@ -987,29 +987,29 @@
987
987
  tmp = tmp0_elvis_lhs;
988
988
  }
989
989
  var links = tmp;
990
- var newMap = this.lg0_1.s2(key);
991
- if (links.vg1()) {
990
+ var newMap = this.qfz_1.s2(key);
991
+ if (links.ag1()) {
992
992
  var tmp0 = newMap;
993
993
  // Inline function 'kotlin.collections.get' call
994
- var key_0 = links.gfz_1;
994
+ var key_0 = links.lfy_1;
995
995
  var tmp$ret$0 = (isInterface(tmp0, KtMap) ? tmp0 : THROW_CCE()).j2(key_0);
996
996
  var previousLinks = ensureNotNull(tmp$ret$0);
997
997
  var tmp_0 = newMap;
998
- var tmp_1 = links.gfz_1;
999
- newMap = tmp_0.r2((tmp_1 == null ? true : !(tmp_1 == null)) ? tmp_1 : THROW_CCE(), previousLinks.ug1(links.hfz_1));
998
+ var tmp_1 = links.lfy_1;
999
+ newMap = tmp_0.r2((tmp_1 == null ? true : !(tmp_1 == null)) ? tmp_1 : THROW_CCE(), previousLinks.zg0(links.mfy_1));
1000
1000
  }
1001
- if (links.xg1()) {
1001
+ if (links.cg1()) {
1002
1002
  var tmp0_0 = newMap;
1003
1003
  // Inline function 'kotlin.collections.get' call
1004
- var key_1 = links.hfz_1;
1004
+ var key_1 = links.mfy_1;
1005
1005
  var tmp$ret$1 = (isInterface(tmp0_0, KtMap) ? tmp0_0 : THROW_CCE()).j2(key_1);
1006
1006
  var nextLinks = ensureNotNull(tmp$ret$1);
1007
1007
  var tmp_2 = newMap;
1008
- var tmp_3 = links.hfz_1;
1009
- newMap = tmp_2.r2((tmp_3 == null ? true : !(tmp_3 == null)) ? tmp_3 : THROW_CCE(), nextLinks.wg1(links.gfz_1));
1008
+ var tmp_3 = links.mfy_1;
1009
+ newMap = tmp_2.r2((tmp_3 == null ? true : !(tmp_3 == null)) ? tmp_3 : THROW_CCE(), nextLinks.bg1(links.lfy_1));
1010
1010
  }
1011
- var newFirstKey = !links.vg1() ? links.hfz_1 : this.jg0_1;
1012
- var newLastKey = !links.xg1() ? links.gfz_1 : this.kg0_1;
1011
+ var newFirstKey = !links.ag1() ? links.mfy_1 : this.ofz_1;
1012
+ var newLastKey = !links.cg1() ? links.lfy_1 : this.pfz_1;
1013
1013
  return new PersistentOrderedMap(newFirstKey, newLastKey, newMap);
1014
1014
  };
1015
1015
  protoOf(PersistentOrderedMap).equals = function (other) {
@@ -1021,18 +1021,18 @@
1021
1021
  return false;
1022
1022
  var tmp;
1023
1023
  if (other instanceof PersistentOrderedMap) {
1024
- tmp = this.lg0_1.kfz_1.bg0(other.lg0_1.kfz_1, PersistentOrderedMap$equals$lambda);
1024
+ tmp = this.qfz_1.pfy_1.gfz(other.qfz_1.pfy_1, PersistentOrderedMap$equals$lambda);
1025
1025
  } else {
1026
1026
  if (other instanceof PersistentOrderedMapBuilder) {
1027
- var tmp_0 = other.gg0_1.ag0_1;
1028
- tmp = this.lg0_1.kfz_1.bg0(tmp_0, PersistentOrderedMap$equals$lambda_0);
1027
+ var tmp_0 = other.lfz_1.ffz_1;
1028
+ tmp = this.qfz_1.pfy_1.gfz(tmp_0, PersistentOrderedMap$equals$lambda_0);
1029
1029
  } else {
1030
1030
  if (other instanceof PersistentHashMap) {
1031
- tmp = this.lg0_1.kfz_1.bg0(other.kfz_1, PersistentOrderedMap$equals$lambda_1);
1031
+ tmp = this.qfz_1.pfy_1.gfz(other.pfy_1, PersistentOrderedMap$equals$lambda_1);
1032
1032
  } else {
1033
1033
  if (other instanceof PersistentHashMapBuilder) {
1034
- var tmp_1 = other.ag0_1;
1035
- tmp = this.lg0_1.kfz_1.bg0(tmp_1, PersistentOrderedMap$equals$lambda_2);
1034
+ var tmp_1 = other.ffz_1;
1035
+ tmp = this.qfz_1.pfy_1.gfz(tmp_1, PersistentOrderedMap$equals$lambda_2);
1036
1036
  } else {
1037
1037
  tmp = protoOf(AbstractMap).equals.call(this, other);
1038
1038
  }
@@ -1059,97 +1059,97 @@
1059
1059
  return LinkedValue_init_$Init$_0(value, previous, objectCreate(protoOf(LinkedValue)));
1060
1060
  }
1061
1061
  function LinkedValue(value, previous, next) {
1062
- this.ffz_1 = value;
1063
- this.gfz_1 = previous;
1064
- this.hfz_1 = next;
1062
+ this.kfy_1 = value;
1063
+ this.lfy_1 = previous;
1064
+ this.mfy_1 = next;
1065
1065
  }
1066
- protoOf(LinkedValue).tg1 = function (newValue) {
1067
- return new LinkedValue(newValue, this.gfz_1, this.hfz_1);
1066
+ protoOf(LinkedValue).yg0 = function (newValue) {
1067
+ return new LinkedValue(newValue, this.lfy_1, this.mfy_1);
1068
1068
  };
1069
- protoOf(LinkedValue).wg1 = function (newPrevious) {
1070
- return new LinkedValue(this.ffz_1, newPrevious, this.hfz_1);
1069
+ protoOf(LinkedValue).bg1 = function (newPrevious) {
1070
+ return new LinkedValue(this.kfy_1, newPrevious, this.mfy_1);
1071
1071
  };
1072
- protoOf(LinkedValue).ug1 = function (newNext) {
1073
- return new LinkedValue(this.ffz_1, this.gfz_1, newNext);
1072
+ protoOf(LinkedValue).zg0 = function (newNext) {
1073
+ return new LinkedValue(this.kfy_1, this.lfy_1, newNext);
1074
1074
  };
1075
- protoOf(LinkedValue).xg1 = function () {
1076
- return !(this.hfz_1 === EndOfChain_instance);
1075
+ protoOf(LinkedValue).cg1 = function () {
1076
+ return !(this.mfy_1 === EndOfChain_instance);
1077
1077
  };
1078
- protoOf(LinkedValue).vg1 = function () {
1079
- return !(this.gfz_1 === EndOfChain_instance);
1078
+ protoOf(LinkedValue).ag1 = function () {
1079
+ return !(this.lfy_1 === EndOfChain_instance);
1080
1080
  };
1081
1081
  function PersistentOrderedMapBuilder() {
1082
1082
  }
1083
1083
  function PersistentOrderedMapKeysIterator(map) {
1084
- this.yg1_1 = new PersistentOrderedMapLinksIterator(map.jg0_1, map.lg0_1);
1084
+ this.dg1_1 = new PersistentOrderedMapLinksIterator(map.ofz_1, map.qfz_1);
1085
1085
  }
1086
1086
  protoOf(PersistentOrderedMapKeysIterator).q = function () {
1087
- return this.yg1_1.q();
1087
+ return this.dg1_1.q();
1088
1088
  };
1089
1089
  protoOf(PersistentOrderedMapKeysIterator).r = function () {
1090
- var tmp = this.yg1_1.zg1_1;
1090
+ var tmp = this.dg1_1.eg1_1;
1091
1091
  var nextKey = (tmp == null ? true : !(tmp == null)) ? tmp : THROW_CCE();
1092
- this.yg1_1.r();
1092
+ this.dg1_1.r();
1093
1093
  return nextKey;
1094
1094
  };
1095
1095
  function PersistentOrderedMapValuesIterator(map) {
1096
- this.cg2_1 = new PersistentOrderedMapLinksIterator(map.jg0_1, map.lg0_1);
1096
+ this.hg1_1 = new PersistentOrderedMapLinksIterator(map.ofz_1, map.qfz_1);
1097
1097
  }
1098
1098
  protoOf(PersistentOrderedMapValuesIterator).q = function () {
1099
- return this.cg2_1.q();
1099
+ return this.hg1_1.q();
1100
1100
  };
1101
1101
  protoOf(PersistentOrderedMapValuesIterator).r = function () {
1102
- return this.cg2_1.r().ffz_1;
1102
+ return this.hg1_1.r().kfy_1;
1103
1103
  };
1104
1104
  function PersistentOrderedMapEntriesIterator(map) {
1105
- this.dg2_1 = new PersistentOrderedMapLinksIterator(map.jg0_1, map.lg0_1);
1105
+ this.ig1_1 = new PersistentOrderedMapLinksIterator(map.ofz_1, map.qfz_1);
1106
1106
  }
1107
1107
  protoOf(PersistentOrderedMapEntriesIterator).q = function () {
1108
- return this.dg2_1.q();
1108
+ return this.ig1_1.q();
1109
1109
  };
1110
1110
  protoOf(PersistentOrderedMapEntriesIterator).r = function () {
1111
- var tmp = this.dg2_1.zg1_1;
1111
+ var tmp = this.ig1_1.eg1_1;
1112
1112
  var nextKey = (tmp == null ? true : !(tmp == null)) ? tmp : THROW_CCE();
1113
- var nextValue = this.dg2_1.r().ffz_1;
1113
+ var nextValue = this.ig1_1.r().kfy_1;
1114
1114
  return new MapEntry(nextKey, nextValue);
1115
1115
  };
1116
1116
  function PersistentOrderedMapLinksIterator(nextKey, hashMap) {
1117
- this.zg1_1 = nextKey;
1118
- this.ag2_1 = hashMap;
1119
- this.bg2_1 = 0;
1117
+ this.eg1_1 = nextKey;
1118
+ this.fg1_1 = hashMap;
1119
+ this.gg1_1 = 0;
1120
1120
  }
1121
1121
  protoOf(PersistentOrderedMapLinksIterator).q = function () {
1122
- return this.bg2_1 < this.ag2_1.s();
1122
+ return this.gg1_1 < this.fg1_1.s();
1123
1123
  };
1124
1124
  protoOf(PersistentOrderedMapLinksIterator).r = function () {
1125
1125
  if (!this.q()) {
1126
1126
  throw NoSuchElementException_init_$Create$();
1127
1127
  }
1128
- var tmp0 = this.ag2_1;
1129
- var tmp = this.zg1_1;
1128
+ var tmp0 = this.fg1_1;
1129
+ var tmp = this.eg1_1;
1130
1130
  // Inline function 'kotlin.collections.getOrElse' call
1131
1131
  var key = (tmp == null ? true : !(tmp == null)) ? tmp : THROW_CCE();
1132
1132
  var tmp0_elvis_lhs = tmp0.j2(key);
1133
1133
  var tmp_0;
1134
1134
  if (tmp0_elvis_lhs == null) {
1135
- throw ConcurrentModificationException_init_$Create$('Hash code of a key (' + toString(this.zg1_1) + ') has changed after it was added to the persistent map.');
1135
+ throw ConcurrentModificationException_init_$Create$('Hash code of a key (' + toString(this.eg1_1) + ') has changed after it was added to the persistent map.');
1136
1136
  } else {
1137
1137
  tmp_0 = tmp0_elvis_lhs;
1138
1138
  }
1139
1139
  var result = tmp_0;
1140
- this.bg2_1 = this.bg2_1 + 1 | 0;
1141
- this.zg1_1 = result.hfz_1;
1140
+ this.gg1_1 = this.gg1_1 + 1 | 0;
1141
+ this.eg1_1 = result.mfy_1;
1142
1142
  return result;
1143
1143
  };
1144
1144
  function PersistentOrderedMapKeys(map) {
1145
1145
  AbstractSet.call(this);
1146
- this.eg2_1 = map;
1146
+ this.jg1_1 = map;
1147
1147
  }
1148
1148
  protoOf(PersistentOrderedMapKeys).s = function () {
1149
- return this.eg2_1.s();
1149
+ return this.jg1_1.s();
1150
1150
  };
1151
1151
  protoOf(PersistentOrderedMapKeys).q6 = function (element) {
1152
- return this.eg2_1.h2(element);
1152
+ return this.jg1_1.h2(element);
1153
1153
  };
1154
1154
  protoOf(PersistentOrderedMapKeys).w = function (element) {
1155
1155
  if (!(element == null ? true : !(element == null)))
@@ -1157,17 +1157,17 @@
1157
1157
  return this.q6((element == null ? true : !(element == null)) ? element : THROW_CCE());
1158
1158
  };
1159
1159
  protoOf(PersistentOrderedMapKeys).p = function () {
1160
- return new PersistentOrderedMapKeysIterator(this.eg2_1);
1160
+ return new PersistentOrderedMapKeysIterator(this.jg1_1);
1161
1161
  };
1162
1162
  function PersistentOrderedMapValues(map) {
1163
1163
  AbstractCollection.call(this);
1164
- this.fg2_1 = map;
1164
+ this.kg1_1 = map;
1165
1165
  }
1166
1166
  protoOf(PersistentOrderedMapValues).s = function () {
1167
- return this.fg2_1.s();
1167
+ return this.kg1_1.s();
1168
1168
  };
1169
1169
  protoOf(PersistentOrderedMapValues).v6 = function (element) {
1170
- return this.fg2_1.i2(element);
1170
+ return this.kg1_1.i2(element);
1171
1171
  };
1172
1172
  protoOf(PersistentOrderedMapValues).w = function (element) {
1173
1173
  if (!(element == null ? true : !(element == null)))
@@ -1175,25 +1175,25 @@
1175
1175
  return this.v6((element == null ? true : !(element == null)) ? element : THROW_CCE());
1176
1176
  };
1177
1177
  protoOf(PersistentOrderedMapValues).p = function () {
1178
- return new PersistentOrderedMapValuesIterator(this.fg2_1);
1178
+ return new PersistentOrderedMapValuesIterator(this.kg1_1);
1179
1179
  };
1180
1180
  function PersistentOrderedMapEntries(map) {
1181
1181
  AbstractSet.call(this);
1182
- this.gg2_1 = map;
1182
+ this.lg1_1 = map;
1183
1183
  }
1184
1184
  protoOf(PersistentOrderedMapEntries).s = function () {
1185
- return this.gg2_1.s();
1185
+ return this.lg1_1.s();
1186
1186
  };
1187
- protoOf(PersistentOrderedMapEntries).ng1 = function (element) {
1188
- return MapImplementation_instance.og1(this.gg2_1, element);
1187
+ protoOf(PersistentOrderedMapEntries).sg0 = function (element) {
1188
+ return MapImplementation_instance.tg0(this.lg1_1, element);
1189
1189
  };
1190
1190
  protoOf(PersistentOrderedMapEntries).w = function (element) {
1191
1191
  if (!(!(element == null) ? isInterface(element, Entry) : false))
1192
1192
  return false;
1193
- return this.ng1((!(element == null) ? isInterface(element, Entry) : false) ? element : THROW_CCE());
1193
+ return this.sg0((!(element == null) ? isInterface(element, Entry) : false) ? element : THROW_CCE());
1194
1194
  };
1195
1195
  protoOf(PersistentOrderedMapEntries).p = function () {
1196
- return new PersistentOrderedMapEntriesIterator(this.gg2_1);
1196
+ return new PersistentOrderedMapEntriesIterator(this.lg1_1);
1197
1197
  };
1198
1198
  function EndOfChain() {
1199
1199
  }
@@ -1203,7 +1203,7 @@
1203
1203
  }
1204
1204
  function MapImplementation() {
1205
1205
  }
1206
- protoOf(MapImplementation).og1 = function (map, element) {
1206
+ protoOf(MapImplementation).tg0 = function (map, element) {
1207
1207
  var tmp = !(element == null) ? element : THROW_CCE();
1208
1208
  if (!(!(tmp == null) ? isInterface(tmp, Entry) : false))
1209
1209
  return false;