git-digger 1.5.8 → 1.5.9

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.
@@ -32,6 +32,11 @@ if (typeof Array.prototype.fill === 'undefined') {
32
32
  Object.defineProperty(TypedArray.prototype, 'fill', {value: Array.prototype.fill});
33
33
  }
34
34
  });
35
+ if (typeof Math.log10 === 'undefined') {
36
+ Math.log10 = function (x) {
37
+ return Math.log(x) * Math.LOG10E;
38
+ };
39
+ }
35
40
  if (typeof Math.log2 === 'undefined') {
36
41
  Math.log2 = function (x) {
37
42
  return Math.log(x) * Math.LOG2E;
@@ -48,10 +53,11 @@ if (typeof Math.clz32 === 'undefined') {
48
53
  };
49
54
  }(Math.log, Math.LN2);
50
55
  }
51
- if (typeof Math.log10 === 'undefined') {
52
- Math.log10 = function (x) {
53
- return Math.log(x) * Math.LOG10E;
54
- };
56
+ if (typeof String.prototype.startsWith === 'undefined') {
57
+ Object.defineProperty(String.prototype, 'startsWith', {value: function (searchString, position) {
58
+ position = position || 0;
59
+ return this.lastIndexOf(searchString, position) === position;
60
+ }});
55
61
  }
56
62
  if (typeof String.prototype.endsWith === 'undefined') {
57
63
  Object.defineProperty(String.prototype, 'endsWith', {value: function (searchString, position) {
@@ -64,12 +70,6 @@ if (typeof String.prototype.endsWith === 'undefined') {
64
70
  return lastIndex !== -1 && lastIndex === position;
65
71
  }});
66
72
  }
67
- if (typeof String.prototype.startsWith === 'undefined') {
68
- Object.defineProperty(String.prototype, 'startsWith', {value: function (searchString, position) {
69
- position = position || 0;
70
- return this.lastIndexOf(searchString, position) === position;
71
- }});
72
- }
73
73
  if (typeof Math.imul === 'undefined') {
74
74
  Math.imul = function imul(a, b) {
75
75
  return (a & 4.29490176E9) * (b & 65535) + (a & 65535) * (b | 0) | 0;
@@ -1213,21 +1213,24 @@ if (typeof Math.imul === 'undefined') {
1213
1213
  protoOf(HashMap).l = function () {
1214
1214
  return this.f3_1.l();
1215
1215
  };
1216
+ protoOf(HashMap).i3 = function (from) {
1217
+ return this.f3_1.i3(from);
1218
+ };
1216
1219
  function HashMap() {
1217
1220
  this.g3_1 = null;
1218
1221
  }
1219
1222
  function HashMapKeys(backing) {
1220
1223
  AbstractMutableSet.call(this);
1221
- this.i3_1 = backing;
1224
+ this.j3_1 = backing;
1222
1225
  }
1223
1226
  protoOf(HashMapKeys).l = function () {
1224
- return this.i3_1.l();
1227
+ return this.j3_1.l();
1225
1228
  };
1226
1229
  protoOf(HashMapKeys).y = function () {
1227
- return this.i3_1.l() === 0;
1230
+ return this.j3_1.l() === 0;
1228
1231
  };
1229
1232
  protoOf(HashMapKeys).n = function (element) {
1230
- return this.i3_1.h3(element);
1233
+ return this.j3_1.h3(element);
1231
1234
  };
1232
1235
  protoOf(HashMapKeys).o = function (element) {
1233
1236
  throw UnsupportedOperationException_init_$Create$();
@@ -1236,85 +1239,85 @@ if (typeof Math.imul === 'undefined') {
1236
1239
  throw UnsupportedOperationException_init_$Create$();
1237
1240
  };
1238
1241
  protoOf(HashMapKeys).p = function (element) {
1239
- return !(this.i3_1.k2(element) == null);
1242
+ return !(this.j3_1.k2(element) == null);
1240
1243
  };
1241
1244
  protoOf(HashMapKeys).r = function () {
1242
- return this.i3_1.j3();
1245
+ return this.j3_1.k3();
1243
1246
  };
1244
1247
  protoOf(HashMapKeys).q = function () {
1245
- return this.i3_1.q();
1248
+ return this.j3_1.q();
1246
1249
  };
1247
1250
  function HashMapEntrySet(backing) {
1248
1251
  HashMapEntrySetBase.call(this, backing);
1249
1252
  }
1250
1253
  protoOf(HashMapEntrySet).r = function () {
1251
- return this.l3_1.m3();
1254
+ return this.m3_1.n3();
1252
1255
  };
1253
1256
  function HashMapEntrySetBase(backing) {
1254
1257
  AbstractMutableSet.call(this);
1255
- this.l3_1 = backing;
1258
+ this.m3_1 = backing;
1256
1259
  }
1257
1260
  protoOf(HashMapEntrySetBase).l = function () {
1258
- return this.l3_1.l();
1261
+ return this.m3_1.l();
1259
1262
  };
1260
1263
  protoOf(HashMapEntrySetBase).y = function () {
1261
- return this.l3_1.l() === 0;
1264
+ return this.m3_1.l() === 0;
1262
1265
  };
1263
- protoOf(HashMapEntrySetBase).n3 = function (element) {
1264
- return this.l3_1.q3(element);
1266
+ protoOf(HashMapEntrySetBase).o3 = function (element) {
1267
+ return this.m3_1.r3(element);
1265
1268
  };
1266
1269
  protoOf(HashMapEntrySetBase).n = function (element) {
1267
1270
  if (!(!(element == null) ? isInterface(element, Entry) : false))
1268
1271
  return false;
1269
- return this.n3((!(element == null) ? isInterface(element, Entry) : false) ? element : THROW_CCE());
1272
+ return this.o3((!(element == null) ? isInterface(element, Entry) : false) ? element : THROW_CCE());
1270
1273
  };
1271
- protoOf(HashMapEntrySetBase).o3 = function (element) {
1274
+ protoOf(HashMapEntrySetBase).p3 = function (element) {
1272
1275
  throw UnsupportedOperationException_init_$Create$();
1273
1276
  };
1274
1277
  protoOf(HashMapEntrySetBase).o = function (element) {
1275
- return this.o3((!(element == null) ? isInterface(element, Entry) : false) ? element : THROW_CCE());
1278
+ return this.p3((!(element == null) ? isInterface(element, Entry) : false) ? element : THROW_CCE());
1276
1279
  };
1277
1280
  protoOf(HashMapEntrySetBase).v = function (elements) {
1278
1281
  throw UnsupportedOperationException_init_$Create$();
1279
1282
  };
1280
- protoOf(HashMapEntrySetBase).p3 = function (element) {
1281
- return this.l3_1.r3(element);
1283
+ protoOf(HashMapEntrySetBase).q3 = function (element) {
1284
+ return this.m3_1.s3(element);
1282
1285
  };
1283
1286
  protoOf(HashMapEntrySetBase).p = function (element) {
1284
1287
  if (!(!(element == null) ? isInterface(element, Entry) : false))
1285
1288
  return false;
1286
- return this.p3((!(element == null) ? isInterface(element, Entry) : false) ? element : THROW_CCE());
1289
+ return this.q3((!(element == null) ? isInterface(element, Entry) : false) ? element : THROW_CCE());
1287
1290
  };
1288
1291
  protoOf(HashMapEntrySetBase).x = function (elements) {
1289
- return this.l3_1.s3(elements);
1292
+ return this.m3_1.t3(elements);
1290
1293
  };
1291
1294
  protoOf(HashMapEntrySetBase).q = function () {
1292
- return this.l3_1.q();
1295
+ return this.m3_1.q();
1293
1296
  };
1294
1297
  function HashMapKeysDefault$iterator$1($entryIterator) {
1295
- this.t3_1 = $entryIterator;
1298
+ this.u3_1 = $entryIterator;
1296
1299
  }
1297
1300
  protoOf(HashMapKeysDefault$iterator$1).s = function () {
1298
- return this.t3_1.s();
1301
+ return this.u3_1.s();
1299
1302
  };
1300
1303
  protoOf(HashMapKeysDefault$iterator$1).u = function () {
1301
- return this.t3_1.u().m2();
1304
+ return this.u3_1.u().m2();
1302
1305
  };
1303
1306
  protoOf(HashMapKeysDefault$iterator$1).t = function () {
1304
- return this.t3_1.t();
1307
+ return this.u3_1.t();
1305
1308
  };
1306
1309
  function HashMapKeysDefault(backingMap) {
1307
1310
  AbstractMutableSet.call(this);
1308
- this.u3_1 = backingMap;
1311
+ this.v3_1 = backingMap;
1309
1312
  }
1310
- protoOf(HashMapKeysDefault).v3 = function (element) {
1313
+ protoOf(HashMapKeysDefault).w3 = function (element) {
1311
1314
  throw UnsupportedOperationException_init_$Create$_0('Add is not supported on keys');
1312
1315
  };
1313
1316
  protoOf(HashMapKeysDefault).o = function (element) {
1314
- return this.v3((element == null ? true : !(element == null)) ? element : THROW_CCE());
1317
+ return this.w3((element == null ? true : !(element == null)) ? element : THROW_CCE());
1315
1318
  };
1316
1319
  protoOf(HashMapKeysDefault).h3 = function (element) {
1317
- return this.u3_1.q2(element);
1320
+ return this.v3_1.q2(element);
1318
1321
  };
1319
1322
  protoOf(HashMapKeysDefault).n = function (element) {
1320
1323
  if (!(element == null ? true : !(element == null)))
@@ -1322,13 +1325,13 @@ if (typeof Math.imul === 'undefined') {
1322
1325
  return this.h3((element == null ? true : !(element == null)) ? element : THROW_CCE());
1323
1326
  };
1324
1327
  protoOf(HashMapKeysDefault).r = function () {
1325
- var entryIterator = this.u3_1.l2().r();
1328
+ var entryIterator = this.v3_1.l2().r();
1326
1329
  return new HashMapKeysDefault$iterator$1(entryIterator);
1327
1330
  };
1328
1331
  protoOf(HashMapKeysDefault).k2 = function (element) {
1329
1332
  this.q();
1330
- if (this.u3_1.q2(element)) {
1331
- this.u3_1.k2(element);
1333
+ if (this.v3_1.q2(element)) {
1334
+ this.v3_1.k2(element);
1332
1335
  return true;
1333
1336
  }
1334
1337
  return false;
@@ -1339,15 +1342,15 @@ if (typeof Math.imul === 'undefined') {
1339
1342
  return this.k2((element == null ? true : !(element == null)) ? element : THROW_CCE());
1340
1343
  };
1341
1344
  protoOf(HashMapKeysDefault).l = function () {
1342
- return this.u3_1.l();
1345
+ return this.v3_1.l();
1343
1346
  };
1344
1347
  protoOf(HashMapKeysDefault).q = function () {
1345
- return this.u3_1.q();
1348
+ return this.v3_1.q();
1346
1349
  };
1347
1350
  function HashSet_init_$Init$(map, $this) {
1348
1351
  AbstractMutableSet.call($this);
1349
1352
  HashSet.call($this);
1350
- $this.w3_1 = map;
1353
+ $this.x3_1 = map;
1351
1354
  return $this;
1352
1355
  }
1353
1356
  function HashSet_init_$Init$_0($this) {
@@ -1362,7 +1365,7 @@ if (typeof Math.imul === 'undefined') {
1362
1365
  var tmp0_iterator = elements.r();
1363
1366
  while (tmp0_iterator.s()) {
1364
1367
  var element = tmp0_iterator.u();
1365
- $this.w3_1.j2(element, true);
1368
+ $this.x3_1.j2(element, true);
1366
1369
  }
1367
1370
  return $this;
1368
1371
  }
@@ -1378,22 +1381,22 @@ if (typeof Math.imul === 'undefined') {
1378
1381
  return HashSet_init_$Init$_3(initialCapacity, objectCreate(protoOf(HashSet)));
1379
1382
  }
1380
1383
  protoOf(HashSet).o = function (element) {
1381
- return this.w3_1.j2(element, true) == null;
1384
+ return this.x3_1.j2(element, true) == null;
1382
1385
  };
1383
1386
  protoOf(HashSet).n = function (element) {
1384
- return this.w3_1.h3(element);
1387
+ return this.x3_1.h3(element);
1385
1388
  };
1386
1389
  protoOf(HashSet).y = function () {
1387
- return this.w3_1.l() === 0;
1390
+ return this.x3_1.l() === 0;
1388
1391
  };
1389
1392
  protoOf(HashSet).r = function () {
1390
- return this.w3_1.j3();
1393
+ return this.x3_1.k3();
1391
1394
  };
1392
1395
  protoOf(HashSet).p = function (element) {
1393
- return !(this.w3_1.k2(element) == null);
1396
+ return !(this.x3_1.k2(element) == null);
1394
1397
  };
1395
1398
  protoOf(HashSet).l = function () {
1396
- return this.w3_1.l();
1399
+ return this.x3_1.l();
1397
1400
  };
1398
1401
  function HashSet() {
1399
1402
  }
@@ -1420,7 +1423,7 @@ if (typeof Math.imul === 'undefined') {
1420
1423
  }
1421
1424
  function InternalHashMap_init_$Init$_1(original, $this) {
1422
1425
  InternalHashMap_init_$Init$_0(original.l(), $this);
1423
- $this.h4(original);
1426
+ $this.i3(original);
1424
1427
  return $this;
1425
1428
  }
1426
1429
  function InternalHashMap_init_$Create$_1(original) {
@@ -1441,24 +1444,24 @@ if (typeof Math.imul === 'undefined') {
1441
1444
  return InternalHashMap_init_$Init$_2(initialCapacity, loadFactor, objectCreate(protoOf(InternalHashMap)));
1442
1445
  }
1443
1446
  function _get_capacity__a9k9f3($this) {
1444
- return $this.x3_1.length;
1447
+ return $this.y3_1.length;
1445
1448
  }
1446
1449
  function _get_hashSize__tftcho($this) {
1447
- return $this.a4_1.length;
1450
+ return $this.b4_1.length;
1448
1451
  }
1449
1452
  function registerModification($this) {
1450
- $this.e4_1 = $this.e4_1 + 1 | 0;
1453
+ $this.f4_1 = $this.f4_1 + 1 | 0;
1451
1454
  }
1452
1455
  function ensureExtraCapacity($this, n) {
1453
1456
  if (shouldCompact($this, n)) {
1454
1457
  rehash($this, _get_hashSize__tftcho($this));
1455
1458
  } else {
1456
- ensureCapacity($this, $this.c4_1 + n | 0);
1459
+ ensureCapacity($this, $this.d4_1 + n | 0);
1457
1460
  }
1458
1461
  }
1459
1462
  function shouldCompact($this, extraCapacity) {
1460
- var spareCapacity = _get_capacity__a9k9f3($this) - $this.c4_1 | 0;
1461
- var gaps = $this.c4_1 - $this.l() | 0;
1463
+ var spareCapacity = _get_capacity__a9k9f3($this) - $this.d4_1 | 0;
1464
+ var gaps = $this.d4_1 - $this.l() | 0;
1462
1465
  return (spareCapacity < extraCapacity ? (gaps + spareCapacity | 0) >= extraCapacity : false) ? gaps >= (_get_capacity__a9k9f3($this) / 4 | 0) : false;
1463
1466
  }
1464
1467
  function ensureCapacity($this, minCapacity) {
@@ -1466,11 +1469,11 @@ if (typeof Math.imul === 'undefined') {
1466
1469
  throw RuntimeException_init_$Create$_0('too many elements');
1467
1470
  if (minCapacity > _get_capacity__a9k9f3($this)) {
1468
1471
  var newSize = Companion_instance_5.i4(_get_capacity__a9k9f3($this), minCapacity);
1469
- $this.x3_1 = copyOfUninitializedElements($this.x3_1, newSize);
1472
+ $this.y3_1 = copyOfUninitializedElements($this.y3_1, newSize);
1470
1473
  var tmp = $this;
1471
- var tmp0_safe_receiver = $this.y3_1;
1472
- tmp.y3_1 = tmp0_safe_receiver == null ? null : copyOfUninitializedElements(tmp0_safe_receiver, newSize);
1473
- $this.z3_1 = copyOf_0($this.z3_1, newSize);
1474
+ var tmp0_safe_receiver = $this.z3_1;
1475
+ tmp.z3_1 = tmp0_safe_receiver == null ? null : copyOfUninitializedElements(tmp0_safe_receiver, newSize);
1476
+ $this.a4_1 = copyOf_0($this.a4_1, newSize);
1474
1477
  var newHashSize = computeHashSize(Companion_instance_0, newSize);
1475
1478
  if (newHashSize > _get_hashSize__tftcho($this)) {
1476
1479
  rehash($this, newHashSize);
@@ -1478,23 +1481,23 @@ if (typeof Math.imul === 'undefined') {
1478
1481
  }
1479
1482
  }
1480
1483
  function allocateValuesArray($this) {
1481
- var curValuesArray = $this.y3_1;
1484
+ var curValuesArray = $this.z3_1;
1482
1485
  if (!(curValuesArray == null))
1483
1486
  return curValuesArray;
1484
1487
  var newValuesArray = arrayOfUninitializedElements(_get_capacity__a9k9f3($this));
1485
- $this.y3_1 = newValuesArray;
1488
+ $this.z3_1 = newValuesArray;
1486
1489
  return newValuesArray;
1487
1490
  }
1488
1491
  function hash($this, key) {
1489
- return key == null ? 0 : imul(hashCode(key), -1640531527) >>> $this.d4_1 | 0;
1492
+ return key == null ? 0 : imul(hashCode(key), -1640531527) >>> $this.e4_1 | 0;
1490
1493
  }
1491
1494
  function compact($this) {
1492
1495
  var i = 0;
1493
1496
  var j = 0;
1494
- var valuesArray = $this.y3_1;
1495
- while (i < $this.c4_1) {
1496
- if ($this.z3_1[i] >= 0) {
1497
- $this.x3_1[j] = $this.x3_1[i];
1497
+ var valuesArray = $this.z3_1;
1498
+ while (i < $this.d4_1) {
1499
+ if ($this.a4_1[i] >= 0) {
1500
+ $this.y3_1[j] = $this.y3_1[i];
1498
1501
  if (!(valuesArray == null)) {
1499
1502
  valuesArray[j] = valuesArray[i];
1500
1503
  }
@@ -1502,27 +1505,27 @@ if (typeof Math.imul === 'undefined') {
1502
1505
  }
1503
1506
  i = i + 1 | 0;
1504
1507
  }
1505
- resetRange($this.x3_1, j, $this.c4_1);
1508
+ resetRange($this.y3_1, j, $this.d4_1);
1506
1509
  if (valuesArray == null)
1507
1510
  null;
1508
1511
  else {
1509
- resetRange(valuesArray, j, $this.c4_1);
1512
+ resetRange(valuesArray, j, $this.d4_1);
1510
1513
  }
1511
- $this.c4_1 = j;
1514
+ $this.d4_1 = j;
1512
1515
  }
1513
1516
  function rehash($this, newHashSize) {
1514
1517
  registerModification($this);
1515
- if ($this.c4_1 > $this.f4_1) {
1518
+ if ($this.d4_1 > $this.g4_1) {
1516
1519
  compact($this);
1517
1520
  }
1518
1521
  if (!(newHashSize === _get_hashSize__tftcho($this))) {
1519
- $this.a4_1 = new Int32Array(newHashSize);
1520
- $this.d4_1 = computeShift(Companion_instance_0, newHashSize);
1522
+ $this.b4_1 = new Int32Array(newHashSize);
1523
+ $this.e4_1 = computeShift(Companion_instance_0, newHashSize);
1521
1524
  } else {
1522
- fill($this.a4_1, 0, 0, _get_hashSize__tftcho($this));
1525
+ fill($this.b4_1, 0, 0, _get_hashSize__tftcho($this));
1523
1526
  }
1524
1527
  var i = 0;
1525
- while (i < $this.c4_1) {
1528
+ while (i < $this.d4_1) {
1526
1529
  var tmp0 = i;
1527
1530
  i = tmp0 + 1 | 0;
1528
1531
  if (!putRehash($this, tmp0)) {
@@ -1531,13 +1534,13 @@ if (typeof Math.imul === 'undefined') {
1531
1534
  }
1532
1535
  }
1533
1536
  function putRehash($this, i) {
1534
- var hash_0 = hash($this, $this.x3_1[i]);
1535
- var probesLeft = $this.b4_1;
1537
+ var hash_0 = hash($this, $this.y3_1[i]);
1538
+ var probesLeft = $this.c4_1;
1536
1539
  while (true) {
1537
- var index = $this.a4_1[hash_0];
1540
+ var index = $this.b4_1[hash_0];
1538
1541
  if (index === 0) {
1539
- $this.a4_1[hash_0] = i + 1 | 0;
1540
- $this.z3_1[i] = hash_0;
1542
+ $this.b4_1[hash_0] = i + 1 | 0;
1543
+ $this.a4_1[i] = hash_0;
1541
1544
  return true;
1542
1545
  }
1543
1546
  probesLeft = probesLeft - 1 | 0;
@@ -1551,12 +1554,12 @@ if (typeof Math.imul === 'undefined') {
1551
1554
  }
1552
1555
  function findKey($this, key) {
1553
1556
  var hash_0 = hash($this, key);
1554
- var probesLeft = $this.b4_1;
1557
+ var probesLeft = $this.c4_1;
1555
1558
  while (true) {
1556
- var index = $this.a4_1[hash_0];
1559
+ var index = $this.b4_1[hash_0];
1557
1560
  if (index === 0)
1558
1561
  return -1;
1559
- if (index > 0 ? equals_0($this.x3_1[index - 1 | 0], key) : false)
1562
+ if (index > 0 ? equals_0($this.y3_1[index - 1 | 0], key) : false)
1560
1563
  return index - 1 | 0;
1561
1564
  probesLeft = probesLeft - 1 | 0;
1562
1565
  if (probesLeft < 0)
@@ -1571,28 +1574,28 @@ if (typeof Math.imul === 'undefined') {
1571
1574
  $this.q();
1572
1575
  retry: while (true) {
1573
1576
  var hash_0 = hash($this, key);
1574
- var tentativeMaxProbeDistance = coerceAtMost(imul($this.b4_1, 2), _get_hashSize__tftcho($this) / 2 | 0);
1577
+ var tentativeMaxProbeDistance = coerceAtMost(imul($this.c4_1, 2), _get_hashSize__tftcho($this) / 2 | 0);
1575
1578
  var probeDistance = 0;
1576
1579
  while (true) {
1577
- var index = $this.a4_1[hash_0];
1580
+ var index = $this.b4_1[hash_0];
1578
1581
  if (index <= 0) {
1579
- if ($this.c4_1 >= _get_capacity__a9k9f3($this)) {
1582
+ if ($this.d4_1 >= _get_capacity__a9k9f3($this)) {
1580
1583
  ensureExtraCapacity($this, 1);
1581
1584
  continue retry;
1582
1585
  }
1583
- var tmp1 = $this.c4_1;
1584
- $this.c4_1 = tmp1 + 1 | 0;
1586
+ var tmp1 = $this.d4_1;
1587
+ $this.d4_1 = tmp1 + 1 | 0;
1585
1588
  var putIndex = tmp1;
1586
- $this.x3_1[putIndex] = key;
1587
- $this.z3_1[putIndex] = hash_0;
1588
- $this.a4_1[hash_0] = putIndex + 1 | 0;
1589
- $this.f4_1 = $this.f4_1 + 1 | 0;
1589
+ $this.y3_1[putIndex] = key;
1590
+ $this.a4_1[putIndex] = hash_0;
1591
+ $this.b4_1[hash_0] = putIndex + 1 | 0;
1592
+ $this.g4_1 = $this.g4_1 + 1 | 0;
1590
1593
  registerModification($this);
1591
- if (probeDistance > $this.b4_1)
1592
- $this.b4_1 = probeDistance;
1594
+ if (probeDistance > $this.c4_1)
1595
+ $this.c4_1 = probeDistance;
1593
1596
  return putIndex;
1594
1597
  }
1595
- if (equals_0($this.x3_1[index - 1 | 0], key)) {
1598
+ if (equals_0($this.y3_1[index - 1 | 0], key)) {
1596
1599
  return -index | 0;
1597
1600
  }
1598
1601
  probeDistance = probeDistance + 1 | 0;
@@ -1616,54 +1619,54 @@ if (typeof Math.imul === 'undefined') {
1616
1619
  return index;
1617
1620
  }
1618
1621
  function removeKeyAt($this, index) {
1619
- resetAt($this.x3_1, index);
1620
- removeHashAt($this, $this.z3_1[index]);
1621
- $this.z3_1[index] = -1;
1622
- $this.f4_1 = $this.f4_1 - 1 | 0;
1622
+ resetAt($this.y3_1, index);
1623
+ removeHashAt($this, $this.a4_1[index]);
1624
+ $this.a4_1[index] = -1;
1625
+ $this.g4_1 = $this.g4_1 - 1 | 0;
1623
1626
  registerModification($this);
1624
1627
  }
1625
1628
  function removeHashAt($this, removedHash) {
1626
1629
  var hash_0 = removedHash;
1627
1630
  var hole = removedHash;
1628
1631
  var probeDistance = 0;
1629
- var patchAttemptsLeft = coerceAtMost(imul($this.b4_1, 2), _get_hashSize__tftcho($this) / 2 | 0);
1632
+ var patchAttemptsLeft = coerceAtMost(imul($this.c4_1, 2), _get_hashSize__tftcho($this) / 2 | 0);
1630
1633
  while (true) {
1631
1634
  var tmp0 = hash_0;
1632
1635
  hash_0 = tmp0 - 1 | 0;
1633
1636
  if (tmp0 === 0)
1634
1637
  hash_0 = _get_hashSize__tftcho($this) - 1 | 0;
1635
1638
  probeDistance = probeDistance + 1 | 0;
1636
- if (probeDistance > $this.b4_1) {
1637
- $this.a4_1[hole] = 0;
1639
+ if (probeDistance > $this.c4_1) {
1640
+ $this.b4_1[hole] = 0;
1638
1641
  return Unit_instance;
1639
1642
  }
1640
- var index = $this.a4_1[hash_0];
1643
+ var index = $this.b4_1[hash_0];
1641
1644
  if (index === 0) {
1642
- $this.a4_1[hole] = 0;
1645
+ $this.b4_1[hole] = 0;
1643
1646
  return Unit_instance;
1644
1647
  }
1645
1648
  if (index < 0) {
1646
- $this.a4_1[hole] = -1;
1649
+ $this.b4_1[hole] = -1;
1647
1650
  hole = hash_0;
1648
1651
  probeDistance = 0;
1649
1652
  } else {
1650
- var otherHash = hash($this, $this.x3_1[index - 1 | 0]);
1653
+ var otherHash = hash($this, $this.y3_1[index - 1 | 0]);
1651
1654
  if (((otherHash - hash_0 | 0) & (_get_hashSize__tftcho($this) - 1 | 0)) >= probeDistance) {
1652
- $this.a4_1[hole] = index;
1653
- $this.z3_1[index - 1 | 0] = hole;
1655
+ $this.b4_1[hole] = index;
1656
+ $this.a4_1[index - 1 | 0] = hole;
1654
1657
  hole = hash_0;
1655
1658
  probeDistance = 0;
1656
1659
  }
1657
1660
  }
1658
1661
  patchAttemptsLeft = patchAttemptsLeft - 1 | 0;
1659
1662
  if (patchAttemptsLeft < 0) {
1660
- $this.a4_1[hole] = -1;
1663
+ $this.b4_1[hole] = -1;
1661
1664
  return Unit_instance;
1662
1665
  }
1663
1666
  }
1664
1667
  }
1665
1668
  function contentEquals($this, other) {
1666
- return $this.f4_1 === other.l() ? $this.s3(other.l2()) : false;
1669
+ return $this.g4_1 === other.l() ? $this.t3(other.l2()) : false;
1667
1670
  }
1668
1671
  function putEntry($this, entry) {
1669
1672
  var index = addKey($this, entry.m2());
@@ -1705,16 +1708,16 @@ if (typeof Math.imul === 'undefined') {
1705
1708
  this.n4_1 = map;
1706
1709
  this.o4_1 = 0;
1707
1710
  this.p4_1 = -1;
1708
- this.q4_1 = this.n4_1.e4_1;
1711
+ this.q4_1 = this.n4_1.f4_1;
1709
1712
  this.r4();
1710
1713
  }
1711
1714
  protoOf(Itr).r4 = function () {
1712
- while (this.o4_1 < this.n4_1.c4_1 ? this.n4_1.z3_1[this.o4_1] < 0 : false) {
1715
+ while (this.o4_1 < this.n4_1.d4_1 ? this.n4_1.a4_1[this.o4_1] < 0 : false) {
1713
1716
  this.o4_1 = this.o4_1 + 1 | 0;
1714
1717
  }
1715
1718
  };
1716
1719
  protoOf(Itr).s = function () {
1717
- return this.o4_1 < this.n4_1.c4_1;
1720
+ return this.o4_1 < this.n4_1.d4_1;
1718
1721
  };
1719
1722
  protoOf(Itr).t = function () {
1720
1723
  this.s4();
@@ -1728,10 +1731,10 @@ if (typeof Math.imul === 'undefined') {
1728
1731
  this.n4_1.q();
1729
1732
  removeKeyAt(this.n4_1, this.p4_1);
1730
1733
  this.p4_1 = -1;
1731
- this.q4_1 = this.n4_1.e4_1;
1734
+ this.q4_1 = this.n4_1.f4_1;
1732
1735
  };
1733
1736
  protoOf(Itr).s4 = function () {
1734
- if (!(this.n4_1.e4_1 === this.q4_1))
1737
+ if (!(this.n4_1.f4_1 === this.q4_1))
1735
1738
  throw ConcurrentModificationException_init_$Create$();
1736
1739
  };
1737
1740
  function KeysItr(map) {
@@ -1739,13 +1742,13 @@ if (typeof Math.imul === 'undefined') {
1739
1742
  }
1740
1743
  protoOf(KeysItr).u = function () {
1741
1744
  this.s4();
1742
- if (this.o4_1 >= this.n4_1.c4_1)
1745
+ if (this.o4_1 >= this.n4_1.d4_1)
1743
1746
  throw NoSuchElementException_init_$Create$();
1744
1747
  var tmp = this;
1745
1748
  var tmp1 = this.o4_1;
1746
1749
  this.o4_1 = tmp1 + 1 | 0;
1747
1750
  tmp.p4_1 = tmp1;
1748
- var result = this.n4_1.x3_1[this.p4_1];
1751
+ var result = this.n4_1.y3_1[this.p4_1];
1749
1752
  this.r4();
1750
1753
  return result;
1751
1754
  };
@@ -1754,7 +1757,7 @@ if (typeof Math.imul === 'undefined') {
1754
1757
  }
1755
1758
  protoOf(EntriesItr).u = function () {
1756
1759
  this.s4();
1757
- if (this.o4_1 >= this.n4_1.c4_1)
1760
+ if (this.o4_1 >= this.n4_1.d4_1)
1758
1761
  throw NoSuchElementException_init_$Create$();
1759
1762
  var tmp = this;
1760
1763
  var tmp1 = this.o4_1;
@@ -1765,38 +1768,38 @@ if (typeof Math.imul === 'undefined') {
1765
1768
  return result;
1766
1769
  };
1767
1770
  protoOf(EntriesItr).b5 = function () {
1768
- if (this.o4_1 >= this.n4_1.c4_1)
1771
+ if (this.o4_1 >= this.n4_1.d4_1)
1769
1772
  throw NoSuchElementException_init_$Create$();
1770
1773
  var tmp = this;
1771
1774
  var tmp1 = this.o4_1;
1772
1775
  this.o4_1 = tmp1 + 1 | 0;
1773
1776
  tmp.p4_1 = tmp1;
1774
1777
  // Inline function 'kotlin.hashCode' call
1775
- var tmp0_safe_receiver = this.n4_1.x3_1[this.p4_1];
1778
+ var tmp0_safe_receiver = this.n4_1.y3_1[this.p4_1];
1776
1779
  var tmp1_elvis_lhs = tmp0_safe_receiver == null ? null : hashCode(tmp0_safe_receiver);
1777
1780
  var tmp_0 = tmp1_elvis_lhs == null ? 0 : tmp1_elvis_lhs;
1778
1781
  // Inline function 'kotlin.hashCode' call
1779
- var tmp0_safe_receiver_0 = ensureNotNull(this.n4_1.y3_1)[this.p4_1];
1782
+ var tmp0_safe_receiver_0 = ensureNotNull(this.n4_1.z3_1)[this.p4_1];
1780
1783
  var tmp1_elvis_lhs_0 = tmp0_safe_receiver_0 == null ? null : hashCode(tmp0_safe_receiver_0);
1781
1784
  var result = tmp_0 ^ (tmp1_elvis_lhs_0 == null ? 0 : tmp1_elvis_lhs_0);
1782
1785
  this.r4();
1783
1786
  return result;
1784
1787
  };
1785
1788
  protoOf(EntriesItr).c5 = function (sb) {
1786
- if (this.o4_1 >= this.n4_1.c4_1)
1789
+ if (this.o4_1 >= this.n4_1.d4_1)
1787
1790
  throw NoSuchElementException_init_$Create$();
1788
1791
  var tmp = this;
1789
1792
  var tmp1 = this.o4_1;
1790
1793
  this.o4_1 = tmp1 + 1 | 0;
1791
1794
  tmp.p4_1 = tmp1;
1792
- var key = this.n4_1.x3_1[this.p4_1];
1795
+ var key = this.n4_1.y3_1[this.p4_1];
1793
1796
  if (equals_0(key, this.n4_1)) {
1794
1797
  sb.f5('(this Map)');
1795
1798
  } else {
1796
1799
  sb.e5(key);
1797
1800
  }
1798
1801
  sb.g5(_Char___init__impl__6a9atx(61));
1799
- var value = ensureNotNull(this.n4_1.y3_1)[this.p4_1];
1802
+ var value = ensureNotNull(this.n4_1.z3_1)[this.p4_1];
1800
1803
  if (equals_0(value, this.n4_1)) {
1801
1804
  sb.f5('(this Map)');
1802
1805
  } else {
@@ -1809,10 +1812,10 @@ if (typeof Math.imul === 'undefined') {
1809
1812
  this.i5_1 = index;
1810
1813
  }
1811
1814
  protoOf(EntryRef).m2 = function () {
1812
- return this.h5_1.x3_1[this.i5_1];
1815
+ return this.h5_1.y3_1[this.i5_1];
1813
1816
  };
1814
1817
  protoOf(EntryRef).n2 = function () {
1815
- return ensureNotNull(this.h5_1.y3_1)[this.i5_1];
1818
+ return ensureNotNull(this.h5_1.z3_1)[this.i5_1];
1816
1819
  };
1817
1820
  protoOf(EntryRef).equals = function (other) {
1818
1821
  var tmp;
@@ -1843,25 +1846,25 @@ if (typeof Math.imul === 'undefined') {
1843
1846
  return '' + this.m2() + '=' + this.n2();
1844
1847
  };
1845
1848
  function InternalHashMap(keysArray, valuesArray, presenceArray, hashArray, maxProbeDistance, length) {
1846
- this.x3_1 = keysArray;
1847
- this.y3_1 = valuesArray;
1848
- this.z3_1 = presenceArray;
1849
- this.a4_1 = hashArray;
1850
- this.b4_1 = maxProbeDistance;
1851
- this.c4_1 = length;
1852
- this.d4_1 = computeShift(Companion_instance_0, _get_hashSize__tftcho(this));
1853
- this.e4_1 = 0;
1849
+ this.y3_1 = keysArray;
1850
+ this.z3_1 = valuesArray;
1851
+ this.a4_1 = presenceArray;
1852
+ this.b4_1 = hashArray;
1853
+ this.c4_1 = maxProbeDistance;
1854
+ this.d4_1 = length;
1855
+ this.e4_1 = computeShift(Companion_instance_0, _get_hashSize__tftcho(this));
1854
1856
  this.f4_1 = 0;
1855
- this.g4_1 = false;
1857
+ this.g4_1 = 0;
1858
+ this.h4_1 = false;
1856
1859
  }
1857
1860
  protoOf(InternalHashMap).l = function () {
1858
- return this.f4_1;
1861
+ return this.g4_1;
1859
1862
  };
1860
1863
  protoOf(InternalHashMap).s2 = function (key) {
1861
1864
  var index = findKey(this, key);
1862
1865
  if (index < 0)
1863
1866
  return null;
1864
- return ensureNotNull(this.y3_1)[index];
1867
+ return ensureNotNull(this.z3_1)[index];
1865
1868
  };
1866
1869
  protoOf(InternalHashMap).h3 = function (key) {
1867
1870
  return findKey(this, key) >= 0;
@@ -1878,7 +1881,7 @@ if (typeof Math.imul === 'undefined') {
1878
1881
  return null;
1879
1882
  }
1880
1883
  };
1881
- protoOf(InternalHashMap).h4 = function (from) {
1884
+ protoOf(InternalHashMap).i3 = function (from) {
1882
1885
  this.q();
1883
1886
  putAllEntries(this, from.l2());
1884
1887
  };
@@ -1886,7 +1889,7 @@ if (typeof Math.imul === 'undefined') {
1886
1889
  var index = removeKey(this, key);
1887
1890
  if (index < 0)
1888
1891
  return null;
1889
- var valuesArray = ensureNotNull(this.y3_1);
1892
+ var valuesArray = ensureNotNull(this.z3_1);
1890
1893
  var oldValue = valuesArray[index];
1891
1894
  resetAt(valuesArray, index);
1892
1895
  return oldValue;
@@ -1908,17 +1911,17 @@ if (typeof Math.imul === 'undefined') {
1908
1911
  };
1909
1912
  protoOf(InternalHashMap).hashCode = function () {
1910
1913
  var result = 0;
1911
- var it = this.m3();
1914
+ var it = this.n3();
1912
1915
  while (it.s()) {
1913
1916
  result = result + it.b5() | 0;
1914
1917
  }
1915
1918
  return result;
1916
1919
  };
1917
1920
  protoOf(InternalHashMap).toString = function () {
1918
- var sb = StringBuilder_init_$Create$(2 + imul(this.f4_1, 3) | 0);
1921
+ var sb = StringBuilder_init_$Create$(2 + imul(this.g4_1, 3) | 0);
1919
1922
  sb.f5('{');
1920
1923
  var i = 0;
1921
- var it = this.m3();
1924
+ var it = this.n3();
1922
1925
  while (it.s()) {
1923
1926
  if (i > 0) {
1924
1927
  sb.f5(', ');
@@ -1930,32 +1933,32 @@ if (typeof Math.imul === 'undefined') {
1930
1933
  return sb.toString();
1931
1934
  };
1932
1935
  protoOf(InternalHashMap).q = function () {
1933
- if (this.g4_1)
1936
+ if (this.h4_1)
1934
1937
  throw UnsupportedOperationException_init_$Create$();
1935
1938
  };
1936
- protoOf(InternalHashMap).q3 = function (entry) {
1939
+ protoOf(InternalHashMap).r3 = function (entry) {
1937
1940
  var index = findKey(this, entry.m2());
1938
1941
  if (index < 0)
1939
1942
  return false;
1940
- return equals_0(ensureNotNull(this.y3_1)[index], entry.n2());
1943
+ return equals_0(ensureNotNull(this.z3_1)[index], entry.n2());
1941
1944
  };
1942
1945
  protoOf(InternalHashMap).j5 = function (entry) {
1943
- return this.q3(isInterface(entry, Entry) ? entry : THROW_CCE());
1946
+ return this.r3(isInterface(entry, Entry) ? entry : THROW_CCE());
1944
1947
  };
1945
- protoOf(InternalHashMap).r3 = function (entry) {
1948
+ protoOf(InternalHashMap).s3 = function (entry) {
1946
1949
  this.q();
1947
1950
  var index = findKey(this, entry.m2());
1948
1951
  if (index < 0)
1949
1952
  return false;
1950
- if (!equals_0(ensureNotNull(this.y3_1)[index], entry.n2()))
1953
+ if (!equals_0(ensureNotNull(this.z3_1)[index], entry.n2()))
1951
1954
  return false;
1952
1955
  removeKeyAt(this, index);
1953
1956
  return true;
1954
1957
  };
1955
- protoOf(InternalHashMap).j3 = function () {
1958
+ protoOf(InternalHashMap).k3 = function () {
1956
1959
  return new KeysItr(this);
1957
1960
  };
1958
- protoOf(InternalHashMap).m3 = function () {
1961
+ protoOf(InternalHashMap).n3 = function () {
1959
1962
  return new EntriesItr(this);
1960
1963
  };
1961
1964
  function InternalMap() {
@@ -2018,7 +2021,7 @@ if (typeof Math.imul === 'undefined') {
2018
2021
  return LinkedHashSet_init_$Init$_2(initialCapacity, objectCreate(protoOf(LinkedHashSet)));
2019
2022
  }
2020
2023
  protoOf(LinkedHashSet).q = function () {
2021
- return this.w3_1.q();
2024
+ return this.x3_1.q();
2022
2025
  };
2023
2026
  function LinkedHashSet() {
2024
2027
  }
@@ -7905,6 +7908,14 @@ if (typeof Math.imul === 'undefined') {
7905
7908
  putAll(this_0, pairs);
7906
7909
  return this_0;
7907
7910
  }
7911
+ function plus_4(_this__u8e3s4, map) {
7912
+ // Inline function 'kotlin.apply' call
7913
+ var this_0 = LinkedHashMap_init_$Create$_1(_this__u8e3s4);
7914
+ // Inline function 'kotlin.contracts.contract' call
7915
+ // Inline function 'kotlin.collections.plus.<anonymous>' call
7916
+ this_0.i3(map);
7917
+ return this_0;
7918
+ }
7908
7919
  function removeLastOrNull(_this__u8e3s4) {
7909
7920
  return _this__u8e3s4.y() ? null : _this__u8e3s4.e1(get_lastIndex_1(_this__u8e3s4));
7910
7921
  }
@@ -10959,7 +10970,7 @@ if (typeof Math.imul === 'undefined') {
10959
10970
  return toString_2(quotient, base) + toString_2(rem, base);
10960
10971
  }
10961
10972
  //region block: post-declaration
10962
- protoOf(InternalHashMap).s3 = containsAllEntries;
10973
+ protoOf(InternalHashMap).t3 = containsAllEntries;
10963
10974
  //endregion
10964
10975
  //region block: init
10965
10976
  Unit_instance = new Unit();
@@ -11141,193 +11152,194 @@ if (typeof Math.imul === 'undefined') {
11141
11152
  _.$_$.x5 = minus;
11142
11153
  _.$_$.y5 = mutableListOf;
11143
11154
  _.$_$.z5 = mutableMapOf;
11144
- _.$_$.a6 = plus_1;
11145
- _.$_$.b6 = plus_2;
11146
- _.$_$.c6 = plus;
11147
- _.$_$.d6 = plus_0;
11148
- _.$_$.e6 = removeLastOrNull;
11149
- _.$_$.f6 = removeLast;
11150
- _.$_$.g6 = reversed;
11151
- _.$_$.h6 = setOf;
11152
- _.$_$.i6 = setOf_0;
11153
- _.$_$.j6 = single_0;
11154
- _.$_$.k6 = slice_0;
11155
- _.$_$.l6 = slice;
11156
- _.$_$.m6 = sortWith;
11157
- _.$_$.n6 = sortedWith;
11158
- _.$_$.o6 = sorted;
11159
- _.$_$.p6 = sort;
11160
- _.$_$.q6 = sum;
11161
- _.$_$.r6 = takeLast;
11162
- _.$_$.s6 = take;
11163
- _.$_$.t6 = toBooleanArray;
11164
- _.$_$.u6 = toHashSet;
11165
- _.$_$.v6 = toList_1;
11166
- _.$_$.w6 = toList_0;
11167
- _.$_$.x6 = toList;
11168
- _.$_$.y6 = toMap;
11169
- _.$_$.z6 = toMutableList_0;
11170
- _.$_$.a7 = toMutableMap;
11171
- _.$_$.b7 = toSet_0;
11172
- _.$_$.c7 = toSet;
11173
- _.$_$.d7 = withDefault;
11174
- _.$_$.e7 = withIndex;
11175
- _.$_$.f7 = withIndex_0;
11176
- _.$_$.g7 = zip;
11177
- _.$_$.h7 = compareValues;
11178
- _.$_$.i7 = enumEntries;
11179
- _.$_$.j7 = println_0;
11180
- _.$_$.k7 = println;
11181
- _.$_$.l7 = print;
11182
- _.$_$.m7 = arrayIterator;
11183
- _.$_$.n7 = booleanArray;
11184
- _.$_$.o7 = captureStack;
11185
- _.$_$.p7 = charArrayOf;
11186
- _.$_$.q7 = charArray;
11187
- _.$_$.r7 = charSequenceGet;
11188
- _.$_$.s7 = charSequenceLength;
11189
- _.$_$.t7 = charSequenceSubSequence;
11190
- _.$_$.u7 = classMeta;
11191
- _.$_$.v7 = compareTo_0;
11192
- _.$_$.w7 = equals_0;
11193
- _.$_$.x7 = fillArrayVal;
11194
- _.$_$.y7 = getBooleanHashCode;
11195
- _.$_$.z7 = getNumberHashCode;
11196
- _.$_$.a8 = getPropertyCallableRef;
11197
- _.$_$.b8 = getStringHashCode;
11198
- _.$_$.c8 = hashCode;
11199
- _.$_$.d8 = interfaceMeta;
11200
- _.$_$.e8 = isArray;
11201
- _.$_$.f8 = isBooleanArray;
11202
- _.$_$.g8 = isByteArray;
11203
- _.$_$.h8 = isCharArray;
11204
- _.$_$.i8 = isCharSequence;
11205
- _.$_$.j8 = isDoubleArray;
11206
- _.$_$.k8 = isFloatArray;
11207
- _.$_$.l8 = isIntArray;
11208
- _.$_$.m8 = isInterface;
11209
- _.$_$.n8 = isLongArray;
11210
- _.$_$.o8 = isShortArray;
11211
- _.$_$.p8 = get_js;
11212
- _.$_$.q8 = json;
11213
- _.$_$.r8 = numberRangeToNumber;
11214
- _.$_$.s8 = numberToChar;
11215
- _.$_$.t8 = numberToDouble;
11216
- _.$_$.u8 = numberToInt;
11217
- _.$_$.v8 = numberToLong;
11218
- _.$_$.w8 = objectCreate;
11219
- _.$_$.x8 = objectMeta;
11220
- _.$_$.y8 = protoOf;
11221
- _.$_$.z8 = setMetadataFor;
11222
- _.$_$.a9 = toLong;
11223
- _.$_$.b9 = toString_1;
11224
- _.$_$.c9 = roundToInt;
11225
- _.$_$.d9 = withSign;
11226
- _.$_$.e9 = IntRange;
11227
- _.$_$.f9 = coerceAtLeast_1;
11228
- _.$_$.g9 = coerceAtLeast;
11229
- _.$_$.h9 = coerceAtLeast_0;
11230
- _.$_$.i9 = coerceAtMost;
11231
- _.$_$.j9 = coerceIn;
11232
- _.$_$.k9 = coerceIn_0;
11233
- _.$_$.l9 = until;
11234
- _.$_$.m9 = KClass;
11235
- _.$_$.n9 = KMutableProperty0;
11236
- _.$_$.o9 = KMutableProperty1;
11237
- _.$_$.p9 = KProperty0;
11238
- _.$_$.q9 = KProperty1;
11239
- _.$_$.r9 = KTypeParameter;
11240
- _.$_$.s9 = filter;
11241
- _.$_$.t9 = generateSequence_0;
11242
- _.$_$.u9 = generateSequence;
11243
- _.$_$.v9 = joinToString_1;
11244
- _.$_$.w9 = mapNotNull;
11245
- _.$_$.x9 = map;
11246
- _.$_$.y9 = maxOrNull_0;
11247
- _.$_$.z9 = toList_2;
11248
- _.$_$.aa = Regex;
11249
- _.$_$.ba = chunked;
11250
- _.$_$.ca = commonPrefixWith;
11251
- _.$_$.da = concatToString;
11252
- _.$_$.ea = contains_5;
11253
- _.$_$.fa = contains_6;
11254
- _.$_$.ga = drop_0;
11255
- _.$_$.ha = endsWith;
11256
- _.$_$.ia = equals;
11257
- _.$_$.ja = firstOrNull_0;
11258
- _.$_$.ka = first_1;
11259
- _.$_$.la = get;
11260
- _.$_$.ma = indexOf_6;
11261
- _.$_$.na = indexOf_5;
11262
- _.$_$.oa = isBlank;
11263
- _.$_$.pa = isDigit;
11264
- _.$_$.qa = isHighSurrogate;
11265
- _.$_$.ra = isLowSurrogate;
11266
- _.$_$.sa = isLowerCase;
11267
- _.$_$.ta = isWhitespace;
11268
- _.$_$.ua = get_lastIndex_2;
11269
- _.$_$.va = lastIndexOf;
11270
- _.$_$.wa = matches;
11271
- _.$_$.xa = padStart;
11272
- _.$_$.ya = prependIndent;
11273
- _.$_$.za = removePrefix;
11274
- _.$_$.ab = removeSuffix;
11275
- _.$_$.bb = removeSurrounding;
11276
- _.$_$.cb = repeat;
11277
- _.$_$.db = replace;
11278
- _.$_$.eb = replace_0;
11279
- _.$_$.fb = slice_1;
11280
- _.$_$.gb = split_1;
11281
- _.$_$.hb = split;
11282
- _.$_$.ib = startsWith;
11283
- _.$_$.jb = startsWith_2;
11284
- _.$_$.kb = startsWith_1;
11285
- _.$_$.lb = substringBefore;
11286
- _.$_$.mb = take_1;
11287
- _.$_$.nb = titlecase;
11288
- _.$_$.ob = toIntOrNull;
11289
- _.$_$.pb = toInt_0;
11290
- _.$_$.qb = toInt;
11291
- _.$_$.rb = trimIndent;
11292
- _.$_$.sb = trimMargin;
11293
- _.$_$.tb = trimStart;
11294
- _.$_$.ub = trim;
11295
- _.$_$.vb = Duration;
11296
- _.$_$.wb = ArithmeticException;
11297
- _.$_$.xb = Char;
11298
- _.$_$.yb = ClassCastException;
11299
- _.$_$.zb = Comparable;
11300
- _.$_$.ac = Comparator;
11301
- _.$_$.bc = Enum;
11302
- _.$_$.cc = Exception;
11303
- _.$_$.dc = IllegalArgumentException;
11304
- _.$_$.ec = IllegalStateException;
11305
- _.$_$.fc = Long;
11306
- _.$_$.gc = Pair;
11307
- _.$_$.hc = Result;
11308
- _.$_$.ic = RuntimeException;
11309
- _.$_$.jc = THROW_CCE;
11310
- _.$_$.kc = Triple;
11311
- _.$_$.lc = UByteArray;
11312
- _.$_$.mc = UByte;
11313
- _.$_$.nc = UIntArray;
11314
- _.$_$.oc = UInt;
11315
- _.$_$.pc = ULongArray;
11316
- _.$_$.qc = ULong;
11317
- _.$_$.rc = UShortArray;
11318
- _.$_$.sc = UShort;
11319
- _.$_$.tc = Unit;
11320
- _.$_$.uc = addSuppressed;
11321
- _.$_$.vc = arrayOf;
11322
- _.$_$.wc = createFailure;
11323
- _.$_$.xc = ensureNotNull;
11324
- _.$_$.yc = isFinite_0;
11325
- _.$_$.zc = isFinite;
11326
- _.$_$.ad = lazy;
11327
- _.$_$.bd = lazy_0;
11328
- _.$_$.cd = noWhenBranchMatchedException;
11329
- _.$_$.dd = toString_0;
11330
- _.$_$.ed = to;
11155
+ _.$_$.a6 = plus_4;
11156
+ _.$_$.b6 = plus_1;
11157
+ _.$_$.c6 = plus_2;
11158
+ _.$_$.d6 = plus;
11159
+ _.$_$.e6 = plus_0;
11160
+ _.$_$.f6 = removeLastOrNull;
11161
+ _.$_$.g6 = removeLast;
11162
+ _.$_$.h6 = reversed;
11163
+ _.$_$.i6 = setOf;
11164
+ _.$_$.j6 = setOf_0;
11165
+ _.$_$.k6 = single_0;
11166
+ _.$_$.l6 = slice_0;
11167
+ _.$_$.m6 = slice;
11168
+ _.$_$.n6 = sortWith;
11169
+ _.$_$.o6 = sortedWith;
11170
+ _.$_$.p6 = sorted;
11171
+ _.$_$.q6 = sort;
11172
+ _.$_$.r6 = sum;
11173
+ _.$_$.s6 = takeLast;
11174
+ _.$_$.t6 = take;
11175
+ _.$_$.u6 = toBooleanArray;
11176
+ _.$_$.v6 = toHashSet;
11177
+ _.$_$.w6 = toList_1;
11178
+ _.$_$.x6 = toList_0;
11179
+ _.$_$.y6 = toList;
11180
+ _.$_$.z6 = toMap;
11181
+ _.$_$.a7 = toMutableList_0;
11182
+ _.$_$.b7 = toMutableMap;
11183
+ _.$_$.c7 = toSet_0;
11184
+ _.$_$.d7 = toSet;
11185
+ _.$_$.e7 = withDefault;
11186
+ _.$_$.f7 = withIndex;
11187
+ _.$_$.g7 = withIndex_0;
11188
+ _.$_$.h7 = zip;
11189
+ _.$_$.i7 = compareValues;
11190
+ _.$_$.j7 = enumEntries;
11191
+ _.$_$.k7 = println_0;
11192
+ _.$_$.l7 = println;
11193
+ _.$_$.m7 = print;
11194
+ _.$_$.n7 = arrayIterator;
11195
+ _.$_$.o7 = booleanArray;
11196
+ _.$_$.p7 = captureStack;
11197
+ _.$_$.q7 = charArrayOf;
11198
+ _.$_$.r7 = charArray;
11199
+ _.$_$.s7 = charSequenceGet;
11200
+ _.$_$.t7 = charSequenceLength;
11201
+ _.$_$.u7 = charSequenceSubSequence;
11202
+ _.$_$.v7 = classMeta;
11203
+ _.$_$.w7 = compareTo_0;
11204
+ _.$_$.x7 = equals_0;
11205
+ _.$_$.y7 = fillArrayVal;
11206
+ _.$_$.z7 = getBooleanHashCode;
11207
+ _.$_$.a8 = getNumberHashCode;
11208
+ _.$_$.b8 = getPropertyCallableRef;
11209
+ _.$_$.c8 = getStringHashCode;
11210
+ _.$_$.d8 = hashCode;
11211
+ _.$_$.e8 = interfaceMeta;
11212
+ _.$_$.f8 = isArray;
11213
+ _.$_$.g8 = isBooleanArray;
11214
+ _.$_$.h8 = isByteArray;
11215
+ _.$_$.i8 = isCharArray;
11216
+ _.$_$.j8 = isCharSequence;
11217
+ _.$_$.k8 = isDoubleArray;
11218
+ _.$_$.l8 = isFloatArray;
11219
+ _.$_$.m8 = isIntArray;
11220
+ _.$_$.n8 = isInterface;
11221
+ _.$_$.o8 = isLongArray;
11222
+ _.$_$.p8 = isShortArray;
11223
+ _.$_$.q8 = get_js;
11224
+ _.$_$.r8 = json;
11225
+ _.$_$.s8 = numberRangeToNumber;
11226
+ _.$_$.t8 = numberToChar;
11227
+ _.$_$.u8 = numberToDouble;
11228
+ _.$_$.v8 = numberToInt;
11229
+ _.$_$.w8 = numberToLong;
11230
+ _.$_$.x8 = objectCreate;
11231
+ _.$_$.y8 = objectMeta;
11232
+ _.$_$.z8 = protoOf;
11233
+ _.$_$.a9 = setMetadataFor;
11234
+ _.$_$.b9 = toLong;
11235
+ _.$_$.c9 = toString_1;
11236
+ _.$_$.d9 = roundToInt;
11237
+ _.$_$.e9 = withSign;
11238
+ _.$_$.f9 = IntRange;
11239
+ _.$_$.g9 = coerceAtLeast_1;
11240
+ _.$_$.h9 = coerceAtLeast;
11241
+ _.$_$.i9 = coerceAtLeast_0;
11242
+ _.$_$.j9 = coerceAtMost;
11243
+ _.$_$.k9 = coerceIn;
11244
+ _.$_$.l9 = coerceIn_0;
11245
+ _.$_$.m9 = until;
11246
+ _.$_$.n9 = KClass;
11247
+ _.$_$.o9 = KMutableProperty0;
11248
+ _.$_$.p9 = KMutableProperty1;
11249
+ _.$_$.q9 = KProperty0;
11250
+ _.$_$.r9 = KProperty1;
11251
+ _.$_$.s9 = KTypeParameter;
11252
+ _.$_$.t9 = filter;
11253
+ _.$_$.u9 = generateSequence_0;
11254
+ _.$_$.v9 = generateSequence;
11255
+ _.$_$.w9 = joinToString_1;
11256
+ _.$_$.x9 = mapNotNull;
11257
+ _.$_$.y9 = map;
11258
+ _.$_$.z9 = maxOrNull_0;
11259
+ _.$_$.aa = toList_2;
11260
+ _.$_$.ba = Regex;
11261
+ _.$_$.ca = chunked;
11262
+ _.$_$.da = commonPrefixWith;
11263
+ _.$_$.ea = concatToString;
11264
+ _.$_$.fa = contains_5;
11265
+ _.$_$.ga = contains_6;
11266
+ _.$_$.ha = drop_0;
11267
+ _.$_$.ia = endsWith;
11268
+ _.$_$.ja = equals;
11269
+ _.$_$.ka = firstOrNull_0;
11270
+ _.$_$.la = first_1;
11271
+ _.$_$.ma = get;
11272
+ _.$_$.na = indexOf_6;
11273
+ _.$_$.oa = indexOf_5;
11274
+ _.$_$.pa = isBlank;
11275
+ _.$_$.qa = isDigit;
11276
+ _.$_$.ra = isHighSurrogate;
11277
+ _.$_$.sa = isLowSurrogate;
11278
+ _.$_$.ta = isLowerCase;
11279
+ _.$_$.ua = isWhitespace;
11280
+ _.$_$.va = get_lastIndex_2;
11281
+ _.$_$.wa = lastIndexOf;
11282
+ _.$_$.xa = matches;
11283
+ _.$_$.ya = padStart;
11284
+ _.$_$.za = prependIndent;
11285
+ _.$_$.ab = removePrefix;
11286
+ _.$_$.bb = removeSuffix;
11287
+ _.$_$.cb = removeSurrounding;
11288
+ _.$_$.db = repeat;
11289
+ _.$_$.eb = replace;
11290
+ _.$_$.fb = replace_0;
11291
+ _.$_$.gb = slice_1;
11292
+ _.$_$.hb = split_1;
11293
+ _.$_$.ib = split;
11294
+ _.$_$.jb = startsWith;
11295
+ _.$_$.kb = startsWith_2;
11296
+ _.$_$.lb = startsWith_1;
11297
+ _.$_$.mb = substringBefore;
11298
+ _.$_$.nb = take_1;
11299
+ _.$_$.ob = titlecase;
11300
+ _.$_$.pb = toIntOrNull;
11301
+ _.$_$.qb = toInt_0;
11302
+ _.$_$.rb = toInt;
11303
+ _.$_$.sb = trimIndent;
11304
+ _.$_$.tb = trimMargin;
11305
+ _.$_$.ub = trimStart;
11306
+ _.$_$.vb = trim;
11307
+ _.$_$.wb = Duration;
11308
+ _.$_$.xb = ArithmeticException;
11309
+ _.$_$.yb = Char;
11310
+ _.$_$.zb = ClassCastException;
11311
+ _.$_$.ac = Comparable;
11312
+ _.$_$.bc = Comparator;
11313
+ _.$_$.cc = Enum;
11314
+ _.$_$.dc = Exception;
11315
+ _.$_$.ec = IllegalArgumentException;
11316
+ _.$_$.fc = IllegalStateException;
11317
+ _.$_$.gc = Long;
11318
+ _.$_$.hc = Pair;
11319
+ _.$_$.ic = Result;
11320
+ _.$_$.jc = RuntimeException;
11321
+ _.$_$.kc = THROW_CCE;
11322
+ _.$_$.lc = Triple;
11323
+ _.$_$.mc = UByteArray;
11324
+ _.$_$.nc = UByte;
11325
+ _.$_$.oc = UIntArray;
11326
+ _.$_$.pc = UInt;
11327
+ _.$_$.qc = ULongArray;
11328
+ _.$_$.rc = ULong;
11329
+ _.$_$.sc = UShortArray;
11330
+ _.$_$.tc = UShort;
11331
+ _.$_$.uc = Unit;
11332
+ _.$_$.vc = addSuppressed;
11333
+ _.$_$.wc = arrayOf;
11334
+ _.$_$.xc = createFailure;
11335
+ _.$_$.yc = ensureNotNull;
11336
+ _.$_$.zc = isFinite_0;
11337
+ _.$_$.ad = isFinite;
11338
+ _.$_$.bd = lazy;
11339
+ _.$_$.cd = lazy_0;
11340
+ _.$_$.dd = noWhenBranchMatchedException;
11341
+ _.$_$.ed = toString_0;
11342
+ _.$_$.fd = to;
11331
11343
  //endregion
11332
11344
  return _;
11333
11345
  }(module.exports));