@flock/wirespec 0.22.5 → 0.22.6

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 (45) hide show
  1. package/arrow-arrow-core.mjs +8 -8
  2. package/clikt-clikt-mordant.mjs +79 -79
  3. package/clikt-clikt.mjs +1364 -1363
  4. package/clikt-clikt.mjs.map +1 -1
  5. package/colormath-root-colormath.mjs +436 -436
  6. package/kotlin-kotlin-stdlib.mjs +192 -191
  7. package/kotlin-kotlin-stdlib.mjs.map +1 -1
  8. package/kotlin-openapi-bindings.mjs +10204 -10204
  9. package/kotlin-rgxgen.mjs +1771 -1771
  10. package/kotlinx-io-kotlinx-io-core.mjs +425 -425
  11. package/kotlinx-serialization-kotlinx-serialization-core.mjs +1824 -1824
  12. package/kotlinx-serialization-kotlinx-serialization-json.mjs +1509 -1509
  13. package/mordant-mordant.mjs +1246 -1246
  14. package/package.json +1 -1
  15. package/wirespec-src-compiler-core.mjs +5661 -5333
  16. package/wirespec-src-compiler-core.mjs.map +1 -1
  17. package/wirespec-src-compiler-emitters-java.mjs +171 -187
  18. package/wirespec-src-compiler-emitters-java.mjs.map +1 -1
  19. package/wirespec-src-compiler-emitters-kotlin.mjs +138 -149
  20. package/wirespec-src-compiler-emitters-kotlin.mjs.map +1 -1
  21. package/wirespec-src-compiler-emitters-python.mjs +147 -160
  22. package/wirespec-src-compiler-emitters-python.mjs.map +1 -1
  23. package/wirespec-src-compiler-emitters-rust.mjs +356 -370
  24. package/wirespec-src-compiler-emitters-rust.mjs.map +1 -1
  25. package/wirespec-src-compiler-emitters-scala.mjs +165 -175
  26. package/wirespec-src-compiler-emitters-scala.mjs.map +1 -1
  27. package/wirespec-src-compiler-emitters-typescript.mjs +187 -313
  28. package/wirespec-src-compiler-emitters-typescript.mjs.map +1 -1
  29. package/wirespec-src-compiler-emitters-wirespec.mjs +79 -79
  30. package/wirespec-src-compiler-emitters-wirespec.mjs.map +1 -1
  31. package/wirespec-src-compiler-lib.mjs +194 -194
  32. package/wirespec-src-converter-asyncapi.mjs +545 -545
  33. package/wirespec-src-converter-avro.mjs +544 -544
  34. package/wirespec-src-converter-common.mjs +11 -11
  35. package/wirespec-src-converter-graphql.mjs +942 -942
  36. package/wirespec-src-converter-openapi.mjs +453 -453
  37. package/wirespec-src-ide-lsp.mjs +1359 -1359
  38. package/wirespec-src-plugin-arguments.mjs +153 -157
  39. package/wirespec-src-plugin-arguments.mjs.map +1 -1
  40. package/wirespec-src-plugin-cli.mjs +139 -142
  41. package/wirespec-src-plugin-cli.mjs.map +1 -1
  42. package/wirespec-src-plugin-extensions.mjs +1631 -1114
  43. package/wirespec-src-plugin-extensions.mjs.map +1 -1
  44. package/wirespec-src-plugin-npm.mjs +27 -27
  45. package/wirespec-src-tools-generator.mjs +17 -17
@@ -53,6 +53,12 @@ if (typeof Math.log2 === 'undefined') {
53
53
  return Math.log(x) * Math.LOG2E;
54
54
  };
55
55
  }
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
+ }});
61
+ }
56
62
  if (typeof String.prototype.endsWith === 'undefined') {
57
63
  Object.defineProperty(String.prototype, 'endsWith', {value: function (searchString, position) {
58
64
  var subjectString = this.toString();
@@ -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
  //endregion
74
74
  //region block: imports
75
75
  var imul_0 = Math.imul;
@@ -101,8 +101,8 @@ initMetadataForInterface(KtMap, 'Map');
101
101
  initMetadataForInterface(KtSet, 'Set', VOID, VOID, [Collection]);
102
102
  initMetadataForInterface(KtMutableMap, 'MutableMap', VOID, VOID, [KtMap]);
103
103
  initMetadataForInterface(MutableIterable, 'MutableIterable');
104
- initMetadataForInterface(KtMutableList, 'MutableList', VOID, VOID, [KtList, Collection, MutableIterable]);
105
- initMetadataForInterface(KtMutableSet, 'MutableSet', VOID, VOID, [KtSet, Collection, MutableIterable]);
104
+ initMetadataForInterface(KtMutableList, 'MutableList', VOID, VOID, [KtList, MutableIterable, Collection]);
105
+ initMetadataForInterface(KtMutableSet, 'MutableSet', VOID, VOID, [KtSet, MutableIterable, Collection]);
106
106
  initMetadataForCompanion(Companion_0);
107
107
  initMetadataForClass(Enum, 'Enum', VOID, VOID, [Comparable]);
108
108
  initMetadataForCompanion(Companion_1);
@@ -122,7 +122,7 @@ initMetadataForObject(OtherLowercase, 'OtherLowercase');
122
122
  initMetadataForInterface(Comparator, 'Comparator');
123
123
  initMetadataForObject(Unit, 'Unit');
124
124
  initMetadataForClass(AbstractCollection, 'AbstractCollection', VOID, VOID, [Collection]);
125
- initMetadataForClass(AbstractMutableCollection, 'AbstractMutableCollection', VOID, AbstractCollection, [Collection, MutableIterable]);
125
+ initMetadataForClass(AbstractMutableCollection, 'AbstractMutableCollection', VOID, AbstractCollection, [MutableIterable, Collection]);
126
126
  initMetadataForClass(IteratorImpl, 'IteratorImpl');
127
127
  initMetadataForClass(ListIteratorImpl, 'ListIteratorImpl', VOID, IteratorImpl);
128
128
  initMetadataForClass(AbstractMutableList, 'AbstractMutableList', VOID, AbstractMutableCollection, [KtMutableList]);
@@ -135,7 +135,7 @@ initMetadataForCompanion(Companion_2);
135
135
  initMetadataForClass(ArrayList, 'ArrayList', ArrayList_init_$Create$, AbstractMutableList, [KtMutableList, RandomAccess]);
136
136
  initMetadataForClass(HashMap, 'HashMap', HashMap_init_$Create$, AbstractMutableMap, [KtMutableMap]);
137
137
  initMetadataForClass(HashMapKeys, 'HashMapKeys', VOID, AbstractMutableSet, [KtMutableSet]);
138
- initMetadataForClass(HashMapValues, 'HashMapValues', VOID, AbstractMutableCollection, [Collection, MutableIterable]);
138
+ initMetadataForClass(HashMapValues, 'HashMapValues', VOID, AbstractMutableCollection, [MutableIterable, Collection]);
139
139
  initMetadataForClass(HashMapEntrySetBase, 'HashMapEntrySetBase', VOID, AbstractMutableSet, [KtMutableSet]);
140
140
  initMetadataForClass(HashMapEntrySet, 'HashMapEntrySet', VOID, HashMapEntrySetBase);
141
141
  initMetadataForClass(HashMapKeysDefault$iterator$1);
@@ -792,11 +792,16 @@ function joinTo_0(_this__u8e3s4, buffer, separator, prefix, postfix, limit, trun
792
792
  buffer.y(postfix);
793
793
  return buffer;
794
794
  }
795
+ function first(_this__u8e3s4) {
796
+ if (_this__u8e3s4.r())
797
+ throw NoSuchElementException_init_$Create$_0('List is empty.');
798
+ return _this__u8e3s4.b1(0);
799
+ }
795
800
  function lastOrNull(_this__u8e3s4) {
796
- return _this__u8e3s4.r() ? null : _this__u8e3s4.c1(_this__u8e3s4.b1() - 1 | 0);
801
+ return _this__u8e3s4.r() ? null : _this__u8e3s4.b1(_this__u8e3s4.c1() - 1 | 0);
797
802
  }
798
803
  function toIntArray(_this__u8e3s4) {
799
- var result = new Int32Array(_this__u8e3s4.b1());
804
+ var result = new Int32Array(_this__u8e3s4.c1());
800
805
  var index = 0;
801
806
  var _iterator__ex2g4s = _this__u8e3s4.t();
802
807
  while (_iterator__ex2g4s.u()) {
@@ -809,7 +814,7 @@ function toIntArray(_this__u8e3s4) {
809
814
  }
810
815
  function plus(_this__u8e3s4, elements) {
811
816
  if (isInterface(elements, Collection)) {
812
- var result = ArrayList_init_$Create$_0(_this__u8e3s4.b1() + elements.b1() | 0);
817
+ var result = ArrayList_init_$Create$_0(_this__u8e3s4.c1() + elements.c1() | 0);
813
818
  result.g1(_this__u8e3s4);
814
819
  result.g1(elements);
815
820
  return result;
@@ -845,14 +850,14 @@ function zipWithNext(_this__u8e3s4) {
845
850
  function toSet_0(_this__u8e3s4) {
846
851
  if (isInterface(_this__u8e3s4, Collection)) {
847
852
  var tmp;
848
- switch (_this__u8e3s4.b1()) {
853
+ switch (_this__u8e3s4.c1()) {
849
854
  case 0:
850
855
  tmp = emptySet();
851
856
  break;
852
857
  case 1:
853
858
  var tmp_0;
854
859
  if (isInterface(_this__u8e3s4, KtList)) {
855
- tmp_0 = _this__u8e3s4.c1(0);
860
+ tmp_0 = _this__u8e3s4.b1(0);
856
861
  } else {
857
862
  tmp_0 = _this__u8e3s4.t().v();
858
863
  }
@@ -860,7 +865,7 @@ function toSet_0(_this__u8e3s4) {
860
865
  tmp = setOf(tmp_0);
861
866
  break;
862
867
  default:
863
- tmp = toCollection_0(_this__u8e3s4, LinkedHashSet_init_$Create$_1(mapCapacity(_this__u8e3s4.b1())));
868
+ tmp = toCollection_0(_this__u8e3s4, LinkedHashSet_init_$Create$_1(mapCapacity(_this__u8e3s4.c1())));
864
869
  break;
865
870
  }
866
871
  return tmp;
@@ -873,15 +878,15 @@ function dropLast(_this__u8e3s4, n) {
873
878
  var message = 'Requested element count ' + n + ' is less than zero.';
874
879
  throw IllegalArgumentException_init_$Create$_0(toString_1(message));
875
880
  }
876
- return take(_this__u8e3s4, coerceAtLeast(_this__u8e3s4.b1() - n | 0, 0));
881
+ return take(_this__u8e3s4, coerceAtLeast(_this__u8e3s4.c1() - n | 0, 0));
877
882
  }
878
883
  function last_0(_this__u8e3s4) {
879
884
  if (_this__u8e3s4.r())
880
885
  throw NoSuchElementException_init_$Create$_0('List is empty.');
881
- return _this__u8e3s4.c1(get_lastIndex_3(_this__u8e3s4));
886
+ return _this__u8e3s4.b1(get_lastIndex_3(_this__u8e3s4));
882
887
  }
883
888
  function plus_0(_this__u8e3s4, element) {
884
- var result = ArrayList_init_$Create$_0(_this__u8e3s4.b1() + 1 | 0);
889
+ var result = ArrayList_init_$Create$_0(_this__u8e3s4.c1() + 1 | 0);
885
890
  result.g1(_this__u8e3s4);
886
891
  result.x(element);
887
892
  return result;
@@ -893,11 +898,6 @@ function asSequence_0(_this__u8e3s4) {
893
898
  function distinct(_this__u8e3s4) {
894
899
  return toList_0(toMutableSet(_this__u8e3s4));
895
900
  }
896
- function first(_this__u8e3s4) {
897
- if (_this__u8e3s4.r())
898
- throw NoSuchElementException_init_$Create$_0('List is empty.');
899
- return _this__u8e3s4.c1(0);
900
- }
901
901
  function drop(_this__u8e3s4, n) {
902
902
  // Inline function 'kotlin.require' call
903
903
  if (!(n >= 0)) {
@@ -908,7 +908,7 @@ function drop(_this__u8e3s4, n) {
908
908
  return toList_0(_this__u8e3s4);
909
909
  var list;
910
910
  if (isInterface(_this__u8e3s4, Collection)) {
911
- var resultSize = _this__u8e3s4.b1() - n | 0;
911
+ var resultSize = _this__u8e3s4.c1() - n | 0;
912
912
  if (resultSize <= 0)
913
913
  return emptyList();
914
914
  if (resultSize === 1)
@@ -917,12 +917,12 @@ function drop(_this__u8e3s4, n) {
917
917
  if (isInterface(_this__u8e3s4, KtList)) {
918
918
  if (isInterface(_this__u8e3s4, RandomAccess)) {
919
919
  var inductionVariable = n;
920
- var last = _this__u8e3s4.b1();
920
+ var last = _this__u8e3s4.c1();
921
921
  if (inductionVariable < last)
922
922
  do {
923
923
  var index = inductionVariable;
924
924
  inductionVariable = inductionVariable + 1 | 0;
925
- list.x(_this__u8e3s4.c1(index));
925
+ list.x(_this__u8e3s4.b1(index));
926
926
  }
927
927
  while (inductionVariable < last);
928
928
  } else {
@@ -951,21 +951,34 @@ function drop(_this__u8e3s4, n) {
951
951
  return optimizeReadOnlyList(list);
952
952
  }
953
953
  function firstOrNull(_this__u8e3s4) {
954
- return _this__u8e3s4.r() ? null : _this__u8e3s4.c1(0);
954
+ return _this__u8e3s4.r() ? null : _this__u8e3s4.b1(0);
955
955
  }
956
956
  function single_0(_this__u8e3s4) {
957
957
  var tmp;
958
- switch (_this__u8e3s4.b1()) {
958
+ switch (_this__u8e3s4.c1()) {
959
959
  case 0:
960
960
  throw NoSuchElementException_init_$Create$_0('List is empty.');
961
961
  case 1:
962
- tmp = _this__u8e3s4.c1(0);
962
+ tmp = _this__u8e3s4.b1(0);
963
963
  break;
964
964
  default:
965
965
  throw IllegalArgumentException_init_$Create$_0('List has more than one element.');
966
966
  }
967
967
  return tmp;
968
968
  }
969
+ function single_1(_this__u8e3s4) {
970
+ if (isInterface(_this__u8e3s4, KtList))
971
+ return single_0(_this__u8e3s4);
972
+ else {
973
+ var iterator = _this__u8e3s4.t();
974
+ if (!iterator.u())
975
+ throw NoSuchElementException_init_$Create$_0('Collection is empty.');
976
+ var single = iterator.v();
977
+ if (iterator.u())
978
+ throw IllegalArgumentException_init_$Create$_0('Collection has more than one element.');
979
+ return single;
980
+ }
981
+ }
969
982
  function take(_this__u8e3s4, n) {
970
983
  // Inline function 'kotlin.require' call
971
984
  if (!(n >= 0)) {
@@ -975,7 +988,7 @@ function take(_this__u8e3s4, n) {
975
988
  if (n === 0)
976
989
  return emptyList();
977
990
  if (isInterface(_this__u8e3s4, Collection)) {
978
- if (n >= _this__u8e3s4.b1())
991
+ if (n >= _this__u8e3s4.c1())
979
992
  return toList_0(_this__u8e3s4);
980
993
  if (n === 1)
981
994
  return listOf(first_0(_this__u8e3s4));
@@ -993,19 +1006,19 @@ function take(_this__u8e3s4, n) {
993
1006
  return optimizeReadOnlyList(list);
994
1007
  }
995
1008
  function getOrNull_0(_this__u8e3s4, index) {
996
- return (0 <= index ? index < _this__u8e3s4.b1() : false) ? _this__u8e3s4.c1(index) : null;
1009
+ return (0 <= index ? index < _this__u8e3s4.c1() : false) ? _this__u8e3s4.b1(index) : null;
997
1010
  }
998
1011
  function toList_0(_this__u8e3s4) {
999
1012
  if (isInterface(_this__u8e3s4, Collection)) {
1000
1013
  var tmp;
1001
- switch (_this__u8e3s4.b1()) {
1014
+ switch (_this__u8e3s4.c1()) {
1002
1015
  case 0:
1003
1016
  tmp = emptyList();
1004
1017
  break;
1005
1018
  case 1:
1006
1019
  var tmp_0;
1007
1020
  if (isInterface(_this__u8e3s4, KtList)) {
1008
- tmp_0 = _this__u8e3s4.c1(0);
1021
+ tmp_0 = _this__u8e3s4.b1(0);
1009
1022
  } else {
1010
1023
  tmp_0 = _this__u8e3s4.t().v();
1011
1024
  }
@@ -1070,7 +1083,7 @@ function withIndex_0(_this__u8e3s4) {
1070
1083
  return new IndexingIterable(withIndex$lambda_0(_this__u8e3s4));
1071
1084
  }
1072
1085
  function singleOrNull(_this__u8e3s4) {
1073
- return _this__u8e3s4.b1() === 1 ? _this__u8e3s4.c1(0) : null;
1086
+ return _this__u8e3s4.c1() === 1 ? _this__u8e3s4.b1(0) : null;
1074
1087
  }
1075
1088
  function contains_6(_this__u8e3s4, element) {
1076
1089
  if (isInterface(_this__u8e3s4, Collection))
@@ -1086,7 +1099,7 @@ function none(_this__u8e3s4) {
1086
1099
  return !_this__u8e3s4.t().u();
1087
1100
  }
1088
1101
  function plus_1(_this__u8e3s4, elements) {
1089
- var result = ArrayList_init_$Create$_0(_this__u8e3s4.b1() + elements.length | 0);
1102
+ var result = ArrayList_init_$Create$_0(_this__u8e3s4.c1() + elements.length | 0);
1090
1103
  result.g1(_this__u8e3s4);
1091
1104
  addAll_0(result, elements);
1092
1105
  return result;
@@ -1118,7 +1131,7 @@ function toHashSet(_this__u8e3s4) {
1118
1131
  return toCollection_0(_this__u8e3s4, HashSet_init_$Create$_1(mapCapacity(collectionSizeOrDefault(_this__u8e3s4, 12))));
1119
1132
  }
1120
1133
  function toBooleanArray(_this__u8e3s4) {
1121
- var result = booleanArray(_this__u8e3s4.b1());
1134
+ var result = booleanArray(_this__u8e3s4.c1());
1122
1135
  var index = 0;
1123
1136
  var _iterator__ex2g4s = _this__u8e3s4.t();
1124
1137
  while (_iterator__ex2g4s.u()) {
@@ -1137,7 +1150,7 @@ function takeLast(_this__u8e3s4, n) {
1137
1150
  }
1138
1151
  if (n === 0)
1139
1152
  return emptyList();
1140
- var size = _this__u8e3s4.b1();
1153
+ var size = _this__u8e3s4.c1();
1141
1154
  if (n >= size)
1142
1155
  return toList_0(_this__u8e3s4);
1143
1156
  if (n === 1)
@@ -1149,7 +1162,7 @@ function takeLast(_this__u8e3s4, n) {
1149
1162
  do {
1150
1163
  var index = inductionVariable;
1151
1164
  inductionVariable = inductionVariable + 1 | 0;
1152
- list.x(_this__u8e3s4.c1(index));
1165
+ list.x(_this__u8e3s4.b1(index));
1153
1166
  }
1154
1167
  while (inductionVariable < size);
1155
1168
  } else {
@@ -1181,7 +1194,7 @@ function toCollection_0(_this__u8e3s4, destination) {
1181
1194
  }
1182
1195
  function sortedWith(_this__u8e3s4, comparator) {
1183
1196
  if (isInterface(_this__u8e3s4, Collection)) {
1184
- if (_this__u8e3s4.b1() <= 1)
1197
+ if (_this__u8e3s4.c1() <= 1)
1185
1198
  return toList_0(_this__u8e3s4);
1186
1199
  // Inline function 'kotlin.collections.toTypedArray' call
1187
1200
  var tmp = copyToArray(_this__u8e3s4);
@@ -1214,19 +1227,6 @@ function indexOf_5(_this__u8e3s4, element) {
1214
1227
  }
1215
1228
  return -1;
1216
1229
  }
1217
- function single_1(_this__u8e3s4) {
1218
- if (isInterface(_this__u8e3s4, KtList))
1219
- return single_0(_this__u8e3s4);
1220
- else {
1221
- var iterator = _this__u8e3s4.t();
1222
- if (!iterator.u())
1223
- throw NoSuchElementException_init_$Create$_0('Collection is empty.');
1224
- var single = iterator.v();
1225
- if (iterator.u())
1226
- throw IllegalArgumentException_init_$Create$_0('Collection has more than one element.');
1227
- return single;
1228
- }
1229
- }
1230
1230
  function minOrNull(_this__u8e3s4) {
1231
1231
  var iterator = _this__u8e3s4.t();
1232
1232
  if (!iterator.u())
@@ -1253,7 +1253,7 @@ function intersect(_this__u8e3s4, other) {
1253
1253
  return set;
1254
1254
  }
1255
1255
  function toCharArray(_this__u8e3s4) {
1256
- var result = charArray(_this__u8e3s4.b1());
1256
+ var result = charArray(_this__u8e3s4.c1());
1257
1257
  var index = 0;
1258
1258
  var _iterator__ex2g4s = _this__u8e3s4.t();
1259
1259
  while (_iterator__ex2g4s.u()) {
@@ -1276,7 +1276,7 @@ function withIndex$lambda_0($this_withIndex) {
1276
1276
  };
1277
1277
  }
1278
1278
  function toList_1(_this__u8e3s4) {
1279
- if (_this__u8e3s4.b1() === 0)
1279
+ if (_this__u8e3s4.c1() === 0)
1280
1280
  return emptyList();
1281
1281
  var iterator = _this__u8e3s4.m1().t();
1282
1282
  if (!iterator.u())
@@ -1287,7 +1287,7 @@ function toList_1(_this__u8e3s4) {
1287
1287
  var tmp$ret$0 = new Pair(first.n1(), first.o1());
1288
1288
  return listOf(tmp$ret$0);
1289
1289
  }
1290
- var result = ArrayList_init_$Create$_0(_this__u8e3s4.b1());
1290
+ var result = ArrayList_init_$Create$_0(_this__u8e3s4.c1());
1291
1291
  // Inline function 'kotlin.collections.toPair' call
1292
1292
  var tmp$ret$1 = new Pair(first.n1(), first.o1());
1293
1293
  result.x(tmp$ret$1);
@@ -1567,7 +1567,7 @@ function minus_0(_this__u8e3s4, elements) {
1567
1567
  return result;
1568
1568
  }
1569
1569
  function plus_3(_this__u8e3s4, element) {
1570
- var result = LinkedHashSet_init_$Create$_1(mapCapacity(_this__u8e3s4.b1() + 1 | 0));
1570
+ var result = LinkedHashSet_init_$Create$_1(mapCapacity(_this__u8e3s4.c1() + 1 | 0));
1571
1571
  result.g1(_this__u8e3s4);
1572
1572
  result.x(element);
1573
1573
  return result;
@@ -1579,10 +1579,10 @@ function plus_4(_this__u8e3s4, elements) {
1579
1579
  tmp = null;
1580
1580
  } else {
1581
1581
  // Inline function 'kotlin.let' call
1582
- tmp = _this__u8e3s4.b1() + tmp0_safe_receiver | 0;
1582
+ tmp = _this__u8e3s4.c1() + tmp0_safe_receiver | 0;
1583
1583
  }
1584
1584
  var tmp1_elvis_lhs = tmp;
1585
- var result = LinkedHashSet_init_$Create$_1(mapCapacity(tmp1_elvis_lhs == null ? imul_0(_this__u8e3s4.b1(), 2) : tmp1_elvis_lhs));
1585
+ var result = LinkedHashSet_init_$Create$_1(mapCapacity(tmp1_elvis_lhs == null ? imul_0(_this__u8e3s4.c1(), 2) : tmp1_elvis_lhs));
1586
1586
  result.g1(_this__u8e3s4);
1587
1587
  addAll(result, elements);
1588
1588
  return result;
@@ -3862,6 +3862,12 @@ function ulongToString(value, base) {
3862
3862
  function collectionToArray(collection) {
3863
3863
  return collectionToArrayCommonImpl(collection);
3864
3864
  }
3865
+ function mapOf(pair) {
3866
+ return hashMapOf([pair]);
3867
+ }
3868
+ function setOf(element) {
3869
+ return hashSetOf([element]);
3870
+ }
3865
3871
  function listOf(element) {
3866
3872
  // Inline function 'kotlin.arrayOf' call
3867
3873
  // Inline function 'kotlin.js.unsafeCast' call
@@ -3869,12 +3875,6 @@ function listOf(element) {
3869
3875
  var tmp$ret$0 = [element];
3870
3876
  return new ArrayList(tmp$ret$0);
3871
3877
  }
3872
- function mapOf(pair) {
3873
- return hashMapOf([pair]);
3874
- }
3875
- function setOf(element) {
3876
- return hashSetOf([element]);
3877
- }
3878
3878
  function copyToArray(collection) {
3879
3879
  var tmp;
3880
3880
  // Inline function 'kotlin.js.asDynamic' call
@@ -3946,7 +3946,7 @@ function checkBuilderCapacity(capacity) {
3946
3946
  }
3947
3947
  }
3948
3948
  function collectionsSort(list, comparator) {
3949
- if (list.b1() <= 1)
3949
+ if (list.c1() <= 1)
3950
3950
  return Unit_instance;
3951
3951
  var array = copyToArray(list);
3952
3952
  sortArrayWith(array, comparator);
@@ -4006,7 +4006,7 @@ function IteratorImpl($outer) {
4006
4006
  this.k4_1 = -1;
4007
4007
  }
4008
4008
  protoOf(IteratorImpl).u = function () {
4009
- return this.j4_1 < this.l4_1.b1();
4009
+ return this.j4_1 < this.l4_1.c1();
4010
4010
  };
4011
4011
  protoOf(IteratorImpl).v = function () {
4012
4012
  if (!this.u())
@@ -4015,7 +4015,7 @@ protoOf(IteratorImpl).v = function () {
4015
4015
  var _unary__edvuaz = this.j4_1;
4016
4016
  this.j4_1 = _unary__edvuaz + 1 | 0;
4017
4017
  tmp.k4_1 = _unary__edvuaz;
4018
- return this.l4_1.c1(this.k4_1);
4018
+ return this.l4_1.b1(this.k4_1);
4019
4019
  };
4020
4020
  protoOf(IteratorImpl).i4 = function () {
4021
4021
  // Inline function 'kotlin.check' call
@@ -4030,7 +4030,7 @@ protoOf(IteratorImpl).i4 = function () {
4030
4030
  function ListIteratorImpl($outer, index) {
4031
4031
  this.q4_1 = $outer;
4032
4032
  IteratorImpl.call(this, $outer);
4033
- Companion_instance_5.r4(index, this.q4_1.b1());
4033
+ Companion_instance_5.r4(index, this.q4_1.c1());
4034
4034
  this.j4_1 = index;
4035
4035
  }
4036
4036
  protoOf(ListIteratorImpl).s4 = function () {
@@ -4045,7 +4045,7 @@ protoOf(ListIteratorImpl).u4 = function () {
4045
4045
  var tmp = this;
4046
4046
  this.j4_1 = this.j4_1 - 1 | 0;
4047
4047
  tmp.k4_1 = this.j4_1;
4048
- return this.q4_1.c1(this.k4_1);
4048
+ return this.q4_1.b1(this.k4_1);
4049
4049
  };
4050
4050
  protoOf(ListIteratorImpl).v4 = function () {
4051
4051
  return this.j4_1 - 1 | 0;
@@ -4055,7 +4055,7 @@ function SubList(list, fromIndex, toIndex) {
4055
4055
  this.x4_1 = list;
4056
4056
  this.y4_1 = fromIndex;
4057
4057
  this.z4_1 = 0;
4058
- Companion_instance_5.z3(this.y4_1, toIndex, this.x4_1.b1());
4058
+ Companion_instance_5.z3(this.y4_1, toIndex, this.x4_1.c1());
4059
4059
  this.z4_1 = toIndex - this.y4_1 | 0;
4060
4060
  }
4061
4061
  protoOf(SubList).b3 = function (index, element) {
@@ -4063,9 +4063,9 @@ protoOf(SubList).b3 = function (index, element) {
4063
4063
  this.x4_1.b3(this.y4_1 + index | 0, element);
4064
4064
  this.z4_1 = this.z4_1 + 1 | 0;
4065
4065
  };
4066
- protoOf(SubList).c1 = function (index) {
4066
+ protoOf(SubList).b1 = function (index) {
4067
4067
  Companion_instance_5.a5(index, this.z4_1);
4068
- return this.x4_1.c1(this.y4_1 + index | 0);
4068
+ return this.x4_1.b1(this.y4_1 + index | 0);
4069
4069
  };
4070
4070
  protoOf(SubList).c3 = function (index) {
4071
4071
  Companion_instance_5.a5(index, this.z4_1);
@@ -4081,7 +4081,7 @@ protoOf(SubList).b5 = function (fromIndex, toIndex) {
4081
4081
  this.x4_1.b5(this.y4_1 + fromIndex | 0, this.y4_1 + toIndex | 0);
4082
4082
  this.z4_1 = this.z4_1 - (toIndex - fromIndex | 0) | 0;
4083
4083
  };
4084
- protoOf(SubList).b1 = function () {
4084
+ protoOf(SubList).c1 = function () {
4085
4085
  return this.z4_1;
4086
4086
  };
4087
4087
  protoOf(SubList).h4 = function () {
@@ -4098,12 +4098,12 @@ function AbstractMutableList() {
4098
4098
  }
4099
4099
  protoOf(AbstractMutableList).x = function (element) {
4100
4100
  this.h4();
4101
- this.b3(this.b1(), element);
4101
+ this.b3(this.c1(), element);
4102
4102
  return true;
4103
4103
  };
4104
4104
  protoOf(AbstractMutableList).z2 = function () {
4105
4105
  this.h4();
4106
- this.b5(0, this.b1());
4106
+ this.b5(0, this.c1());
4107
4107
  };
4108
4108
  protoOf(AbstractMutableList).y1 = function (elements) {
4109
4109
  this.h4();
@@ -4315,19 +4315,19 @@ function ArrayList_init_$Create$_1(elements) {
4315
4315
  return ArrayList_init_$Init$_1(elements, objectCreate(protoOf(ArrayList)));
4316
4316
  }
4317
4317
  function increaseLength($this, amount) {
4318
- var previous = $this.b1();
4318
+ var previous = $this.c1();
4319
4319
  // Inline function 'kotlin.js.asDynamic' call
4320
- $this.e1_1.length = $this.b1() + amount | 0;
4320
+ $this.e1_1.length = $this.c1() + amount | 0;
4321
4321
  return previous;
4322
4322
  }
4323
4323
  function rangeCheck($this, index) {
4324
4324
  // Inline function 'kotlin.apply' call
4325
- Companion_instance_5.a5(index, $this.b1());
4325
+ Companion_instance_5.a5(index, $this.c1());
4326
4326
  return index;
4327
4327
  }
4328
4328
  function insertionRangeCheck($this, index) {
4329
4329
  // Inline function 'kotlin.apply' call
4330
- Companion_instance_5.r4(index, $this.b1());
4330
+ Companion_instance_5.r4(index, $this.c1());
4331
4331
  return index;
4332
4332
  }
4333
4333
  function ArrayList(array) {
@@ -4339,14 +4339,14 @@ function ArrayList(array) {
4339
4339
  protoOf(ArrayList).q5 = function () {
4340
4340
  this.h4();
4341
4341
  this.f1_1 = true;
4342
- return this.b1() > 0 ? this : Companion_getInstance_2().p5_1;
4342
+ return this.c1() > 0 ? this : Companion_getInstance_2().p5_1;
4343
4343
  };
4344
4344
  protoOf(ArrayList).r5 = function (minCapacity) {
4345
4345
  };
4346
- protoOf(ArrayList).b1 = function () {
4346
+ protoOf(ArrayList).c1 = function () {
4347
4347
  return this.e1_1.length;
4348
4348
  };
4349
- protoOf(ArrayList).c1 = function (index) {
4349
+ protoOf(ArrayList).b1 = function (index) {
4350
4350
  return this.e1_1[rangeCheck(this, index)];
4351
4351
  };
4352
4352
  protoOf(ArrayList).a3 = function (index, element) {
@@ -4374,7 +4374,7 @@ protoOf(ArrayList).g1 = function (elements) {
4374
4374
  this.h4();
4375
4375
  if (elements.r())
4376
4376
  return false;
4377
- var offset = increaseLength(this, elements.b1());
4377
+ var offset = increaseLength(this, elements.c1());
4378
4378
  // Inline function 'kotlin.collections.forEachIndexed' call
4379
4379
  var index = 0;
4380
4380
  var _iterator__ex2g4s = elements.t();
@@ -4640,8 +4640,8 @@ protoOf(HashMap).v2 = function (key, value) {
4640
4640
  protoOf(HashMap).w2 = function (key) {
4641
4641
  return this.x5_1.w2(key);
4642
4642
  };
4643
- protoOf(HashMap).b1 = function () {
4644
- return this.x5_1.b1();
4643
+ protoOf(HashMap).c1 = function () {
4644
+ return this.x5_1.c1();
4645
4645
  };
4646
4646
  protoOf(HashMap).x2 = function (from) {
4647
4647
  return this.x5_1.x2(from);
@@ -4653,11 +4653,11 @@ function HashMapKeys(backing) {
4653
4653
  AbstractMutableSet.call(this);
4654
4654
  this.a6_1 = backing;
4655
4655
  }
4656
- protoOf(HashMapKeys).b1 = function () {
4657
- return this.a6_1.b1();
4656
+ protoOf(HashMapKeys).c1 = function () {
4657
+ return this.a6_1.c1();
4658
4658
  };
4659
4659
  protoOf(HashMapKeys).r = function () {
4660
- return this.a6_1.b1() === 0;
4660
+ return this.a6_1.c1() === 0;
4661
4661
  };
4662
4662
  protoOf(HashMapKeys).i1 = function (element) {
4663
4663
  return this.a6_1.z5(element);
@@ -4681,11 +4681,11 @@ function HashMapValues(backing) {
4681
4681
  AbstractMutableCollection.call(this);
4682
4682
  this.e6_1 = backing;
4683
4683
  }
4684
- protoOf(HashMapValues).b1 = function () {
4685
- return this.e6_1.b1();
4684
+ protoOf(HashMapValues).c1 = function () {
4685
+ return this.e6_1.c1();
4686
4686
  };
4687
4687
  protoOf(HashMapValues).r = function () {
4688
- return this.e6_1.b1() === 0;
4688
+ return this.e6_1.c1() === 0;
4689
4689
  };
4690
4690
  protoOf(HashMapValues).f6 = function (element) {
4691
4691
  return this.e6_1.r2(element);
@@ -4731,11 +4731,11 @@ function HashMapEntrySetBase(backing) {
4731
4731
  AbstractMutableSet.call(this);
4732
4732
  this.m6_1 = backing;
4733
4733
  }
4734
- protoOf(HashMapEntrySetBase).b1 = function () {
4735
- return this.m6_1.b1();
4734
+ protoOf(HashMapEntrySetBase).c1 = function () {
4735
+ return this.m6_1.c1();
4736
4736
  };
4737
4737
  protoOf(HashMapEntrySetBase).r = function () {
4738
- return this.m6_1.b1() === 0;
4738
+ return this.m6_1.c1() === 0;
4739
4739
  };
4740
4740
  protoOf(HashMapEntrySetBase).o6 = function (element) {
4741
4741
  return this.m6_1.r6(element);
@@ -4815,8 +4815,8 @@ protoOf(HashMapKeysDefault).y2 = function (element) {
4815
4815
  return false;
4816
4816
  return this.w2(element);
4817
4817
  };
4818
- protoOf(HashMapKeysDefault).b1 = function () {
4819
- return this.v6_1.b1();
4818
+ protoOf(HashMapKeysDefault).c1 = function () {
4819
+ return this.v6_1.c1();
4820
4820
  };
4821
4821
  protoOf(HashMapKeysDefault).h4 = function () {
4822
4822
  return this.v6_1.h4();
@@ -4855,8 +4855,8 @@ protoOf(HashMapValuesDefault).t = function () {
4855
4855
  var entryIterator = this.y6_1.m1().t();
4856
4856
  return new HashMapValuesDefault$iterator$1(entryIterator);
4857
4857
  };
4858
- protoOf(HashMapValuesDefault).b1 = function () {
4859
- return this.y6_1.b1();
4858
+ protoOf(HashMapValuesDefault).c1 = function () {
4859
+ return this.y6_1.c1();
4860
4860
  };
4861
4861
  protoOf(HashMapValuesDefault).h4 = function () {
4862
4862
  return this.y6_1.h4();
@@ -4875,7 +4875,7 @@ function HashSet_init_$Create$() {
4875
4875
  return HashSet_init_$Init$_0(objectCreate(protoOf(HashSet)));
4876
4876
  }
4877
4877
  function HashSet_init_$Init$_1(elements, $this) {
4878
- HashSet_init_$Init$(InternalHashMap_init_$Create$_0(elements.b1()), $this);
4878
+ HashSet_init_$Init$(InternalHashMap_init_$Create$_0(elements.c1()), $this);
4879
4879
  var _iterator__ex2g4s = elements.t();
4880
4880
  while (_iterator__ex2g4s.u()) {
4881
4881
  var element = _iterator__ex2g4s.v();
@@ -4904,7 +4904,7 @@ protoOf(HashSet).i1 = function (element) {
4904
4904
  return this.v1_1.z5(element);
4905
4905
  };
4906
4906
  protoOf(HashSet).r = function () {
4907
- return this.v1_1.b1() === 0;
4907
+ return this.v1_1.c1() === 0;
4908
4908
  };
4909
4909
  protoOf(HashSet).t = function () {
4910
4910
  return this.v1_1.c6();
@@ -4912,8 +4912,8 @@ protoOf(HashSet).t = function () {
4912
4912
  protoOf(HashSet).y2 = function (element) {
4913
4913
  return !(this.v1_1.w2(element) == null);
4914
4914
  };
4915
- protoOf(HashSet).b1 = function () {
4916
- return this.v1_1.b1();
4915
+ protoOf(HashSet).c1 = function () {
4916
+ return this.v1_1.c1();
4917
4917
  };
4918
4918
  function HashSet() {
4919
4919
  }
@@ -4943,7 +4943,7 @@ function InternalHashMap_init_$Create$_0(initialCapacity) {
4943
4943
  return InternalHashMap_init_$Init$_0(initialCapacity, objectCreate(protoOf(InternalHashMap)));
4944
4944
  }
4945
4945
  function InternalHashMap_init_$Init$_1(original, $this) {
4946
- InternalHashMap_init_$Init$_0(original.b1(), $this);
4946
+ InternalHashMap_init_$Init$_0(original.c1(), $this);
4947
4947
  $this.x2(original);
4948
4948
  return $this;
4949
4949
  }
@@ -4980,7 +4980,7 @@ function ensureExtraCapacity($this, n) {
4980
4980
  }
4981
4981
  function shouldCompact($this, extraCapacity) {
4982
4982
  var spareCapacity = _get_capacity__a9k9f3($this) - $this.e7_1 | 0;
4983
- var gaps = $this.e7_1 - $this.b1() | 0;
4983
+ var gaps = $this.e7_1 - $this.c1() | 0;
4984
4984
  return spareCapacity < extraCapacity && (gaps + spareCapacity | 0) >= extraCapacity && gaps >= (_get_capacity__a9k9f3($this) / 4 | 0);
4985
4985
  }
4986
4986
  function ensureCapacity($this, minCapacity) {
@@ -5184,7 +5184,7 @@ function removeHashAt($this, removedHash) {
5184
5184
  }
5185
5185
  }
5186
5186
  function contentEquals_1($this, other) {
5187
- return $this.h7_1 === other.b1() && $this.t6(other.m1());
5187
+ return $this.h7_1 === other.c1() && $this.t6(other.m1());
5188
5188
  }
5189
5189
  function putEntry($this, entry) {
5190
5190
  var index = addKey($this, entry.n1());
@@ -5203,7 +5203,7 @@ function putEntry($this, entry) {
5203
5203
  function putAllEntries($this, from) {
5204
5204
  if (from.r())
5205
5205
  return false;
5206
- ensureExtraCapacity($this, from.b1());
5206
+ ensureExtraCapacity($this, from.c1());
5207
5207
  var it = from.t();
5208
5208
  var updated = false;
5209
5209
  while (it.u()) {
@@ -5389,7 +5389,7 @@ function InternalHashMap(keysArray, valuesArray, presenceArray, hashArray, maxPr
5389
5389
  this.h7_1 = 0;
5390
5390
  this.i7_1 = false;
5391
5391
  }
5392
- protoOf(InternalHashMap).b1 = function () {
5392
+ protoOf(InternalHashMap).c1 = function () {
5393
5393
  return this.h7_1;
5394
5394
  };
5395
5395
  protoOf(InternalHashMap).l8 = function () {
@@ -5570,7 +5570,7 @@ function EmptyHolder_getInstance() {
5570
5570
  protoOf(LinkedHashMap).q5 = function () {
5571
5571
  this.x5_1.l8();
5572
5572
  var tmp;
5573
- if (this.b1() > 0) {
5573
+ if (this.c1() > 0) {
5574
5574
  tmp = this;
5575
5575
  } else {
5576
5576
  // Inline function 'kotlin.js.unsafeCast' call
@@ -5636,7 +5636,7 @@ function EmptyHolder_getInstance_0() {
5636
5636
  }
5637
5637
  protoOf(LinkedHashSet).q5 = function () {
5638
5638
  this.v1_1.l8();
5639
- return this.b1() > 0 ? this : EmptyHolder_getInstance_0().u8_1;
5639
+ return this.c1() > 0 ? this : EmptyHolder_getInstance_0().u8_1;
5640
5640
  };
5641
5641
  protoOf(LinkedHashSet).h4 = function () {
5642
5642
  return this.v1_1.d6();
@@ -7436,11 +7436,11 @@ function substituteGroupRefs(match, replacement) {
7436
7436
  if (!(_Char___init__impl__6a9atx(48) <= containsArg ? containsArg <= _Char___init__impl__6a9atx(57) : false))
7437
7437
  throw IllegalArgumentException_init_$Create$_0('Invalid capturing group reference');
7438
7438
  var groups = match.jd();
7439
- var endIndex_0 = readGroupIndex(replacement, index, groups.b1());
7439
+ var endIndex_0 = readGroupIndex(replacement, index, groups.c1());
7440
7440
  var groupIndex = toInt_0(substring(replacement, index, endIndex_0));
7441
- if (groupIndex >= groups.b1())
7441
+ if (groupIndex >= groups.c1())
7442
7442
  throw IndexOutOfBoundsException_init_$Create$_0('Group with index ' + groupIndex + ' does not exist');
7443
- var tmp2_safe_receiver = groups.c1(groupIndex);
7443
+ var tmp2_safe_receiver = groups.b1(groupIndex);
7444
7444
  var tmp3_elvis_lhs = tmp2_safe_receiver == null ? null : tmp2_safe_receiver.id_1;
7445
7445
  result.q(tmp3_elvis_lhs == null ? '' : tmp3_elvis_lhs);
7446
7446
  index = endIndex_0;
@@ -7502,7 +7502,7 @@ function toFlags$lambda(it) {
7502
7502
  }
7503
7503
  function findNext$o$groups$o$iterator$lambda(this$0) {
7504
7504
  return function (it) {
7505
- return this$0.c1(it);
7505
+ return this$0.b1(it);
7506
7506
  };
7507
7507
  }
7508
7508
  function hasOwnPrototypeProperty($this, o, name) {
@@ -7530,14 +7530,14 @@ function findNext$1$groups$1($match, this$0) {
7530
7530
  this.md_1 = this$0;
7531
7531
  AbstractCollection.call(this);
7532
7532
  }
7533
- protoOf(findNext$1$groups$1).b1 = function () {
7533
+ protoOf(findNext$1$groups$1).c1 = function () {
7534
7534
  return this.ld_1.length;
7535
7535
  };
7536
7536
  protoOf(findNext$1$groups$1).t = function () {
7537
7537
  var tmp = asSequence_0(get_indices_1(this));
7538
7538
  return map(tmp, findNext$o$groups$o$iterator$lambda(this)).t();
7539
7539
  };
7540
- protoOf(findNext$1$groups$1).c1 = function (index) {
7540
+ protoOf(findNext$1$groups$1).b1 = function (index) {
7541
7541
  // Inline function 'kotlin.js.get' call
7542
7542
  // Inline function 'kotlin.js.asDynamic' call
7543
7543
  var tmp0_safe_receiver = this.ld_1[index];
@@ -7575,10 +7575,10 @@ function findNext$1$groupValues$1($match) {
7575
7575
  this.ud_1 = $match;
7576
7576
  AbstractList.call(this);
7577
7577
  }
7578
- protoOf(findNext$1$groupValues$1).b1 = function () {
7578
+ protoOf(findNext$1$groupValues$1).c1 = function () {
7579
7579
  return this.ud_1.length;
7580
7580
  };
7581
- protoOf(findNext$1$groupValues$1).c1 = function (index) {
7581
+ protoOf(findNext$1$groupValues$1).b1 = function (index) {
7582
7582
  // Inline function 'kotlin.js.get' call
7583
7583
  // Inline function 'kotlin.js.asDynamic' call
7584
7584
  var tmp0_elvis_lhs = this.ud_1[index];
@@ -8012,7 +8012,7 @@ protoOf(AbstractCollection).o2 = function (elements) {
8012
8012
  return tmp$ret$0;
8013
8013
  };
8014
8014
  protoOf(AbstractCollection).r = function () {
8015
- return this.b1() === 0;
8015
+ return this.c1() === 0;
8016
8016
  };
8017
8017
  protoOf(AbstractCollection).toString = function () {
8018
8018
  return joinToString_0(this, ', ', '[', ']', VOID, VOID, AbstractCollection$toString$lambda(this));
@@ -8069,14 +8069,14 @@ function SubList_0(list, fromIndex, toIndex) {
8069
8069
  this.he_1 = list;
8070
8070
  this.ie_1 = fromIndex;
8071
8071
  this.je_1 = 0;
8072
- Companion_instance_5.z3(this.ie_1, toIndex, this.he_1.b1());
8072
+ Companion_instance_5.z3(this.ie_1, toIndex, this.he_1.c1());
8073
8073
  this.je_1 = toIndex - this.ie_1 | 0;
8074
8074
  }
8075
- protoOf(SubList_0).c1 = function (index) {
8075
+ protoOf(SubList_0).b1 = function (index) {
8076
8076
  Companion_instance_5.a5(index, this.je_1);
8077
- return this.he_1.c1(this.ie_1 + index | 0);
8077
+ return this.he_1.b1(this.ie_1 + index | 0);
8078
8078
  };
8079
- protoOf(SubList_0).b1 = function () {
8079
+ protoOf(SubList_0).c1 = function () {
8080
8080
  return this.je_1;
8081
8081
  };
8082
8082
  protoOf(SubList_0).p2 = function (fromIndex, toIndex) {
@@ -8088,19 +8088,19 @@ function IteratorImpl_0($outer) {
8088
8088
  this.ke_1 = 0;
8089
8089
  }
8090
8090
  protoOf(IteratorImpl_0).u = function () {
8091
- return this.ke_1 < this.le_1.b1();
8091
+ return this.ke_1 < this.le_1.c1();
8092
8092
  };
8093
8093
  protoOf(IteratorImpl_0).v = function () {
8094
8094
  if (!this.u())
8095
8095
  throw NoSuchElementException_init_$Create$();
8096
8096
  var _unary__edvuaz = this.ke_1;
8097
8097
  this.ke_1 = _unary__edvuaz + 1 | 0;
8098
- return this.le_1.c1(_unary__edvuaz);
8098
+ return this.le_1.b1(_unary__edvuaz);
8099
8099
  };
8100
8100
  function ListIteratorImpl_0($outer, index) {
8101
8101
  this.oe_1 = $outer;
8102
8102
  IteratorImpl_0.call(this, $outer);
8103
- Companion_instance_5.r4(index, this.oe_1.b1());
8103
+ Companion_instance_5.r4(index, this.oe_1.c1());
8104
8104
  this.ke_1 = index;
8105
8105
  }
8106
8106
  protoOf(ListIteratorImpl_0).s4 = function () {
@@ -8113,7 +8113,7 @@ protoOf(ListIteratorImpl_0).u4 = function () {
8113
8113
  if (!this.s4())
8114
8114
  throw NoSuchElementException_init_$Create$();
8115
8115
  this.ke_1 = this.ke_1 - 1 | 0;
8116
- return this.oe_1.c1(this.ke_1);
8116
+ return this.oe_1.b1(this.ke_1);
8117
8117
  };
8118
8118
  protoOf(ListIteratorImpl_0).v4 = function () {
8119
8119
  return this.ke_1 - 1 | 0;
@@ -8167,7 +8167,7 @@ protoOf(Companion_5).d5 = function (c) {
8167
8167
  return hashCode;
8168
8168
  };
8169
8169
  protoOf(Companion_5).c5 = function (c, other) {
8170
- if (!(c.b1() === other.b1()))
8170
+ if (!(c.c1() === other.c1()))
8171
8171
  return false;
8172
8172
  var otherIterator = other.t();
8173
8173
  var _iterator__ex2g4s = c.t();
@@ -8287,8 +8287,8 @@ protoOf(AbstractMap$keys$1).t = function () {
8287
8287
  var entryIterator = this.re_1.m1().t();
8288
8288
  return new AbstractMap$keys$1$iterator$1(entryIterator);
8289
8289
  };
8290
- protoOf(AbstractMap$keys$1).b1 = function () {
8291
- return this.re_1.b1();
8290
+ protoOf(AbstractMap$keys$1).c1 = function () {
8291
+ return this.re_1.c1();
8292
8292
  };
8293
8293
  function AbstractMap$toString$lambda(this$0) {
8294
8294
  return function (it) {
@@ -8311,8 +8311,8 @@ protoOf(AbstractMap$values$1).t = function () {
8311
8311
  var entryIterator = this.se_1.m1().t();
8312
8312
  return new AbstractMap$values$1$iterator$1(entryIterator);
8313
8313
  };
8314
- protoOf(AbstractMap$values$1).b1 = function () {
8315
- return this.se_1.b1();
8314
+ protoOf(AbstractMap$values$1).c1 = function () {
8315
+ return this.se_1.c1();
8316
8316
  };
8317
8317
  function AbstractMap() {
8318
8318
  this.k5_1 = null;
@@ -8375,7 +8375,7 @@ protoOf(AbstractMap).equals = function (other) {
8375
8375
  return true;
8376
8376
  if (!(!(other == null) ? isInterface(other, KtMap) : false))
8377
8377
  return false;
8378
- if (!(this.b1() === other.b1()))
8378
+ if (!(this.c1() === other.c1()))
8379
8379
  return false;
8380
8380
  var tmp0 = other.m1();
8381
8381
  var tmp$ret$0;
@@ -8411,10 +8411,10 @@ protoOf(AbstractMap).hashCode = function () {
8411
8411
  return hashCode_0(this.m1());
8412
8412
  };
8413
8413
  protoOf(AbstractMap).r = function () {
8414
- return this.b1() === 0;
8414
+ return this.c1() === 0;
8415
8415
  };
8416
- protoOf(AbstractMap).b1 = function () {
8417
- return this.m1().b1();
8416
+ protoOf(AbstractMap).c1 = function () {
8417
+ return this.m1().c1();
8418
8418
  };
8419
8419
  protoOf(AbstractMap).t2 = function () {
8420
8420
  if (this.k5_1 == null) {
@@ -8448,7 +8448,7 @@ protoOf(Companion_7).o5 = function (c) {
8448
8448
  return hashCode;
8449
8449
  };
8450
8450
  protoOf(Companion_7).n5 = function (c, other) {
8451
- if (!(c.b1() === other.b1()))
8451
+ if (!(c.c1() === other.c1()))
8452
8452
  return false;
8453
8453
  return c.o2(other);
8454
8454
  };
@@ -8475,7 +8475,7 @@ function collectionToArrayCommonImpl(collection) {
8475
8475
  return [];
8476
8476
  }
8477
8477
  // Inline function 'kotlin.arrayOfNulls' call
8478
- var size = collection.b1();
8478
+ var size = collection.c1();
8479
8479
  var destination = Array(size);
8480
8480
  var iterator = collection.t();
8481
8481
  var index = 0;
@@ -8511,17 +8511,17 @@ function listOfNotNull_0(elements) {
8511
8511
  return filterNotNull(elements);
8512
8512
  }
8513
8513
  function get_lastIndex_3(_this__u8e3s4) {
8514
- return _this__u8e3s4.b1() - 1 | 0;
8514
+ return _this__u8e3s4.c1() - 1 | 0;
8515
8515
  }
8516
8516
  function get_indices_1(_this__u8e3s4) {
8517
- return numberRangeToNumber(0, _this__u8e3s4.b1() - 1 | 0);
8517
+ return numberRangeToNumber(0, _this__u8e3s4.c1() - 1 | 0);
8518
8518
  }
8519
8519
  function optimizeReadOnlyList(_this__u8e3s4) {
8520
- switch (_this__u8e3s4.b1()) {
8520
+ switch (_this__u8e3s4.c1()) {
8521
8521
  case 0:
8522
8522
  return emptyList();
8523
8523
  case 1:
8524
- return listOf(_this__u8e3s4.c1(0));
8524
+ return listOf(_this__u8e3s4.b1(0));
8525
8525
  default:
8526
8526
  return _this__u8e3s4;
8527
8527
  }
@@ -8545,7 +8545,7 @@ protoOf(EmptyList).hashCode = function () {
8545
8545
  protoOf(EmptyList).toString = function () {
8546
8546
  return '[]';
8547
8547
  };
8548
- protoOf(EmptyList).b1 = function () {
8548
+ protoOf(EmptyList).c1 = function () {
8549
8549
  return 0;
8550
8550
  };
8551
8551
  protoOf(EmptyList).r = function () {
@@ -8571,7 +8571,7 @@ protoOf(EmptyList).ve = function (elements) {
8571
8571
  protoOf(EmptyList).o2 = function (elements) {
8572
8572
  return this.ve(elements);
8573
8573
  };
8574
- protoOf(EmptyList).c1 = function (index) {
8574
+ protoOf(EmptyList).b1 = function (index) {
8575
8575
  throw IndexOutOfBoundsException_init_$Create$_0("Empty list doesn't contain element at index " + index + '.');
8576
8576
  };
8577
8577
  protoOf(EmptyList).we = function (element) {
@@ -8639,13 +8639,13 @@ function throwCountOverflow() {
8639
8639
  }
8640
8640
  function binarySearch(_this__u8e3s4, element, fromIndex, toIndex) {
8641
8641
  fromIndex = fromIndex === VOID ? 0 : fromIndex;
8642
- toIndex = toIndex === VOID ? _this__u8e3s4.b1() : toIndex;
8643
- rangeCheck_0(_this__u8e3s4.b1(), fromIndex, toIndex);
8642
+ toIndex = toIndex === VOID ? _this__u8e3s4.c1() : toIndex;
8643
+ rangeCheck_0(_this__u8e3s4.c1(), fromIndex, toIndex);
8644
8644
  var low = fromIndex;
8645
8645
  var high = toIndex - 1 | 0;
8646
8646
  while (low <= high) {
8647
8647
  var mid = (low + high | 0) >>> 1 | 0;
8648
- var midVal = _this__u8e3s4.c1(mid);
8648
+ var midVal = _this__u8e3s4.b1(mid);
8649
8649
  var cmp = compareValues(midVal, element);
8650
8650
  if (cmp < 0)
8651
8651
  low = mid + 1 | 0;
@@ -8705,7 +8705,7 @@ function flatten(_this__u8e3s4) {
8705
8705
  function collectionSizeOrDefault(_this__u8e3s4, default_0) {
8706
8706
  var tmp;
8707
8707
  if (isInterface(_this__u8e3s4, Collection)) {
8708
- tmp = _this__u8e3s4.b1();
8708
+ tmp = _this__u8e3s4.c1();
8709
8709
  } else {
8710
8710
  tmp = default_0;
8711
8711
  }
@@ -8720,7 +8720,7 @@ protoOf(IndexingIterable).t = function () {
8720
8720
  function collectionSizeOrNull(_this__u8e3s4) {
8721
8721
  var tmp;
8722
8722
  if (isInterface(_this__u8e3s4, Collection)) {
8723
- tmp = _this__u8e3s4.b1();
8723
+ tmp = _this__u8e3s4.c1();
8724
8724
  } else {
8725
8725
  tmp = null;
8726
8726
  }
@@ -8763,14 +8763,14 @@ function emptyMap() {
8763
8763
  function toMap(_this__u8e3s4) {
8764
8764
  if (isInterface(_this__u8e3s4, Collection)) {
8765
8765
  var tmp;
8766
- switch (_this__u8e3s4.b1()) {
8766
+ switch (_this__u8e3s4.c1()) {
8767
8767
  case 0:
8768
8768
  tmp = emptyMap();
8769
8769
  break;
8770
8770
  case 1:
8771
8771
  var tmp_0;
8772
8772
  if (isInterface(_this__u8e3s4, KtList)) {
8773
- tmp_0 = _this__u8e3s4.c1(0);
8773
+ tmp_0 = _this__u8e3s4.b1(0);
8774
8774
  } else {
8775
8775
  tmp_0 = _this__u8e3s4.t().v();
8776
8776
  }
@@ -8778,7 +8778,7 @@ function toMap(_this__u8e3s4) {
8778
8778
  tmp = mapOf(tmp_0);
8779
8779
  break;
8780
8780
  default:
8781
- tmp = toMap_0(_this__u8e3s4, LinkedHashMap_init_$Create$_0(mapCapacity(_this__u8e3s4.b1())));
8781
+ tmp = toMap_0(_this__u8e3s4, LinkedHashMap_init_$Create$_0(mapCapacity(_this__u8e3s4.c1())));
8782
8782
  break;
8783
8783
  }
8784
8784
  return tmp;
@@ -8797,6 +8797,18 @@ function mapOf_0(pairs) {
8797
8797
  function getValue(_this__u8e3s4, key) {
8798
8798
  return getOrImplicitDefault(_this__u8e3s4, key);
8799
8799
  }
8800
+ function plus_7(_this__u8e3s4, pair) {
8801
+ var tmp;
8802
+ if (_this__u8e3s4.r()) {
8803
+ tmp = mapOf(pair);
8804
+ } else {
8805
+ // Inline function 'kotlin.apply' call
8806
+ var this_0 = LinkedHashMap_init_$Create$_1(_this__u8e3s4);
8807
+ this_0.v2(pair.ff_1, pair.gf_1);
8808
+ tmp = this_0;
8809
+ }
8810
+ return tmp;
8811
+ }
8800
8812
  function minus_1(_this__u8e3s4, keys) {
8801
8813
  // Inline function 'kotlin.apply' call
8802
8814
  var this_0 = toMutableMap(_this__u8e3s4);
@@ -8811,18 +8823,6 @@ function minus_2(_this__u8e3s4, key) {
8811
8823
  this_0.w2(key);
8812
8824
  return optimizeReadOnlyMap(this_0);
8813
8825
  }
8814
- function plus_7(_this__u8e3s4, pair) {
8815
- var tmp;
8816
- if (_this__u8e3s4.r()) {
8817
- tmp = mapOf(pair);
8818
- } else {
8819
- // Inline function 'kotlin.apply' call
8820
- var this_0 = LinkedHashMap_init_$Create$_1(_this__u8e3s4);
8821
- this_0.v2(pair.ff_1, pair.gf_1);
8822
- tmp = this_0;
8823
- }
8824
- return tmp;
8825
- }
8826
8826
  function toMutableMap(_this__u8e3s4) {
8827
8827
  return LinkedHashMap_init_$Create$_1(_this__u8e3s4);
8828
8828
  }
@@ -8857,7 +8857,7 @@ protoOf(EmptyMap).hashCode = function () {
8857
8857
  protoOf(EmptyMap).toString = function () {
8858
8858
  return '{}';
8859
8859
  };
8860
- protoOf(EmptyMap).b1 = function () {
8860
+ protoOf(EmptyMap).c1 = function () {
8861
8861
  return 0;
8862
8862
  };
8863
8863
  protoOf(EmptyMap).r = function () {
@@ -8901,7 +8901,7 @@ function toMap_0(_this__u8e3s4, destination) {
8901
8901
  }
8902
8902
  function optimizeReadOnlyMap(_this__u8e3s4) {
8903
8903
  var tmp;
8904
- switch (_this__u8e3s4.b1()) {
8904
+ switch (_this__u8e3s4.c1()) {
8905
8905
  case 0:
8906
8906
  tmp = emptyMap();
8907
8907
  break;
@@ -9008,7 +9008,7 @@ function filterInPlace(_this__u8e3s4, predicate, predicateResultToRemove) {
9008
9008
  $l$loop: do {
9009
9009
  var readIndex = inductionVariable;
9010
9010
  inductionVariable = inductionVariable + 1 | 0;
9011
- var element = _this__u8e3s4.c1(readIndex);
9011
+ var element = _this__u8e3s4.b1(readIndex);
9012
9012
  if (predicate(element) === predicateResultToRemove)
9013
9013
  continue $l$loop;
9014
9014
  if (!(writeIndex === readIndex)) {
@@ -9017,7 +9017,7 @@ function filterInPlace(_this__u8e3s4, predicate, predicateResultToRemove) {
9017
9017
  writeIndex = writeIndex + 1 | 0;
9018
9018
  }
9019
9019
  while (!(readIndex === last));
9020
- if (writeIndex < _this__u8e3s4.b1()) {
9020
+ if (writeIndex < _this__u8e3s4.c1()) {
9021
9021
  var inductionVariable_0 = get_lastIndex_3(_this__u8e3s4);
9022
9022
  var last_0 = writeIndex;
9023
9023
  if (last_0 <= inductionVariable_0)
@@ -9091,11 +9091,11 @@ function ReversedList(delegate) {
9091
9091
  AbstractMutableList.call(this);
9092
9092
  this.qf_1 = delegate;
9093
9093
  }
9094
- protoOf(ReversedList).b1 = function () {
9095
- return this.qf_1.b1();
9094
+ protoOf(ReversedList).c1 = function () {
9095
+ return this.qf_1.c1();
9096
9096
  };
9097
- protoOf(ReversedList).c1 = function (index) {
9098
- return this.qf_1.c1(reverseElementIndex(this, index));
9097
+ protoOf(ReversedList).b1 = function (index) {
9098
+ return this.qf_1.b1(reverseElementIndex(this, index));
9099
9099
  };
9100
9100
  protoOf(ReversedList).z2 = function () {
9101
9101
  return this.qf_1.z2();
@@ -9147,11 +9147,11 @@ function ReversedListReadOnly(delegate) {
9147
9147
  AbstractList.call(this);
9148
9148
  this.vf_1 = delegate;
9149
9149
  }
9150
- protoOf(ReversedListReadOnly).b1 = function () {
9151
- return this.vf_1.b1();
9150
+ protoOf(ReversedListReadOnly).c1 = function () {
9151
+ return this.vf_1.c1();
9152
9152
  };
9153
- protoOf(ReversedListReadOnly).c1 = function (index) {
9154
- return this.vf_1.c1(reverseElementIndex(this, index));
9153
+ protoOf(ReversedListReadOnly).b1 = function (index) {
9154
+ return this.vf_1.b1(reverseElementIndex(this, index));
9155
9155
  };
9156
9156
  protoOf(ReversedListReadOnly).t = function () {
9157
9157
  return this.h1(0);
@@ -9170,10 +9170,10 @@ function reverseElementIndex(_this__u8e3s4, index) {
9170
9170
  }
9171
9171
  function reversePositionIndex(_this__u8e3s4, index) {
9172
9172
  var tmp;
9173
- if (0 <= index ? index <= _this__u8e3s4.b1() : false) {
9174
- tmp = _this__u8e3s4.b1() - index | 0;
9173
+ if (0 <= index ? index <= _this__u8e3s4.c1() : false) {
9174
+ tmp = _this__u8e3s4.c1() - index | 0;
9175
9175
  } else {
9176
- throw IndexOutOfBoundsException_init_$Create$_0('Position index ' + index + ' must be in range [' + numberRangeToNumber(0, _this__u8e3s4.b1()).toString() + '].');
9176
+ throw IndexOutOfBoundsException_init_$Create$_0('Position index ' + index + ' must be in range [' + numberRangeToNumber(0, _this__u8e3s4.c1()).toString() + '].');
9177
9177
  }
9178
9178
  return tmp;
9179
9179
  }
@@ -9604,7 +9604,7 @@ function hashSetOf(elements) {
9604
9604
  return toCollection(elements, HashSet_init_$Create$_1(mapCapacity(elements.length)));
9605
9605
  }
9606
9606
  function optimizeReadOnlySet(_this__u8e3s4) {
9607
- switch (_this__u8e3s4.b1()) {
9607
+ switch (_this__u8e3s4.c1()) {
9608
9608
  case 0:
9609
9609
  return emptySet();
9610
9610
  case 1:
@@ -9632,7 +9632,7 @@ protoOf(EmptySet).hashCode = function () {
9632
9632
  protoOf(EmptySet).toString = function () {
9633
9633
  return '[]';
9634
9634
  };
9635
- protoOf(EmptySet).b1 = function () {
9635
+ protoOf(EmptySet).c1 = function () {
9636
9636
  return 0;
9637
9637
  };
9638
9638
  protoOf(EmptySet).r = function () {
@@ -9755,10 +9755,10 @@ function EnumEntriesList(entries) {
9755
9755
  AbstractList.call(this);
9756
9756
  this.uh_1 = entries;
9757
9757
  }
9758
- protoOf(EnumEntriesList).b1 = function () {
9758
+ protoOf(EnumEntriesList).c1 = function () {
9759
9759
  return this.uh_1.length;
9760
9760
  };
9761
- protoOf(EnumEntriesList).c1 = function (index) {
9761
+ protoOf(EnumEntriesList).b1 = function (index) {
9762
9762
  Companion_instance_5.a5(index, this.uh_1.length);
9763
9763
  return this.uh_1[index];
9764
9764
  };
@@ -10241,7 +10241,7 @@ function replaceIndentByMargin(_this__u8e3s4, newIndent, marginPrefix) {
10241
10241
  throw IllegalArgumentException_init_$Create$_0(toString_1(message));
10242
10242
  }
10243
10243
  var lines_0 = lines(_this__u8e3s4);
10244
- var tmp2 = _this__u8e3s4.length + imul_0(newIndent.length, lines_0.b1()) | 0;
10244
+ var tmp2 = _this__u8e3s4.length + imul_0(newIndent.length, lines_0.c1()) | 0;
10245
10245
  // Inline function 'kotlin.text.reindent' call
10246
10246
  var indentAddFunction = getIndentFunction(newIndent);
10247
10247
  var lastIndex = get_lastIndex_3(lines_0);
@@ -10325,7 +10325,7 @@ function replaceIndent(_this__u8e3s4, newIndent) {
10325
10325
  }
10326
10326
  var tmp0_elvis_lhs = minOrNull(destination_0);
10327
10327
  var minCommonIndent = tmp0_elvis_lhs == null ? 0 : tmp0_elvis_lhs;
10328
- var tmp2 = _this__u8e3s4.length + imul_0(newIndent.length, lines_0.b1()) | 0;
10328
+ var tmp2 = _this__u8e3s4.length + imul_0(newIndent.length, lines_0.c1()) | 0;
10329
10329
  // Inline function 'kotlin.text.reindent' call
10330
10330
  var indentAddFunction = getIndentFunction(newIndent);
10331
10331
  var lastIndex = get_lastIndex_3(lines_0);
@@ -10912,7 +10912,7 @@ function split_0(_this__u8e3s4, delimiter, ignoreCase, limit) {
10912
10912
  var tmp$ret$0 = toString_1(charSequenceSubSequence(_this__u8e3s4, tmp2, endIndex));
10913
10913
  result.x(tmp$ret$0);
10914
10914
  currentOffset = nextIndex + delimiter.length | 0;
10915
- if (isLimited && result.b1() === (limit - 1 | 0))
10915
+ if (isLimited && result.c1() === (limit - 1 | 0))
10916
10916
  break $l$loop;
10917
10917
  nextIndex = indexOf_7(_this__u8e3s4, delimiter, currentOffset, ignoreCase);
10918
10918
  }
@@ -11307,7 +11307,7 @@ protoOf(DelimitedRangesSequence).t = function () {
11307
11307
  return new DelimitedRangesSequence$iterator$1(this);
11308
11308
  };
11309
11309
  function findAnyOf(_this__u8e3s4, strings, startIndex, ignoreCase, last) {
11310
- if (!ignoreCase && strings.b1() === 1) {
11310
+ if (!ignoreCase && strings.c1() === 1) {
11311
11311
  var string = single_1(strings);
11312
11312
  var index = !last ? indexOf_7(_this__u8e3s4, string, startIndex) : lastIndexOf_0(_this__u8e3s4, string, startIndex);
11313
11313
  return index < 0 ? null : to(index, string);
@@ -13123,7 +13123,7 @@ function UByteArray__equals_impl_roka4u($this, other) {
13123
13123
  function UByteArray(storage) {
13124
13124
  this.dl_1 = storage;
13125
13125
  }
13126
- protoOf(UByteArray).b1 = function () {
13126
+ protoOf(UByteArray).c1 = function () {
13127
13127
  return _UByteArray___get_size__impl__h6pkdv(this.dl_1);
13128
13128
  };
13129
13129
  protoOf(UByteArray).t = function () {
@@ -13286,7 +13286,7 @@ function UIntArray__equals_impl_flcmof($this, other) {
13286
13286
  function UIntArray(storage) {
13287
13287
  this.ol_1 = storage;
13288
13288
  }
13289
- protoOf(UIntArray).b1 = function () {
13289
+ protoOf(UIntArray).c1 = function () {
13290
13290
  return _UIntArray___get_size__impl__r6l8ci(this.ol_1);
13291
13291
  };
13292
13292
  protoOf(UIntArray).t = function () {
@@ -13449,7 +13449,7 @@ function ULongArray__equals_impl_vwitwa($this, other) {
13449
13449
  function ULongArray(storage) {
13450
13450
  this.zl_1 = storage;
13451
13451
  }
13452
- protoOf(ULongArray).b1 = function () {
13452
+ protoOf(ULongArray).c1 = function () {
13453
13453
  return _ULongArray___get_size__impl__ju6dtr(this.zl_1);
13454
13454
  };
13455
13455
  protoOf(ULongArray).t = function () {
@@ -13614,7 +13614,7 @@ function UShortArray__equals_impl_tyc3mk($this, other) {
13614
13614
  function UShortArray(storage) {
13615
13615
  this.km_1 = storage;
13616
13616
  }
13617
- protoOf(UShortArray).b1 = function () {
13617
+ protoOf(UShortArray).c1 = function () {
13618
13618
  return _UShortArray___get_size__impl__jqto1b(this.km_1);
13619
13619
  };
13620
13620
  protoOf(UShortArray).t = function () {
@@ -14111,6 +14111,7 @@ export {
14111
14111
  setOf_0 as setOf45ia9pnfhe90,
14112
14112
  singleOrNull as singleOrNullrknfaxokm1sl,
14113
14113
  single_0 as singleo93pzdgfc557,
14114
+ single_1 as single3ds7xj9roxi5z,
14114
14115
  sortWith_0 as sortWith4fnm6b3vw03s,
14115
14116
  sortedWith as sortedWith2csnbbb21k0lg,
14116
14117
  sorted as sorted36owlv5kvgyz2,