@nestia/e2e 0.3.2 → 0.3.3

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,15 +1,15 @@
1
- /**
2
- * Utility functions for arrays.
3
- *
4
- * @author Jeongho Nam - https://github.com/samchon
5
- */
6
- export declare namespace ArrayUtil {
7
- const asyncFilter: <Input>(elements: readonly Input[]) => (pred: (elem: Input, index: number, array: readonly Input[]) => Promise<boolean>) => Promise<Input[]>;
8
- const asyncForEach: <Input>(elements: readonly Input[]) => (closure: (elem: Input, index: number, array: readonly Input[]) => Promise<any>) => Promise<void>;
9
- const asyncMap: <Input>(elements: readonly Input[]) => <Output>(closure: (elem: Input, index: number, array: readonly Input[]) => Promise<Output>) => Promise<Output[]>;
10
- const asyncRepeat: (count: number) => <T>(closure: (index: number) => Promise<T>) => Promise<T[]>;
11
- const has: <T>(elements: readonly T[]) => (pred: (elem: T) => boolean) => boolean;
12
- const repeat: (count: number) => <T>(closure: (index: number) => T) => T[];
13
- const flat: <T>(matrix: T[][]) => T[];
14
- const subsets: <T>(array: T[]) => T[][];
15
- }
1
+ /**
2
+ * Utility functions for arrays.
3
+ *
4
+ * @author Jeongho Nam - https://github.com/samchon
5
+ */
6
+ export declare namespace ArrayUtil {
7
+ const asyncFilter: <Input>(elements: readonly Input[]) => (pred: (elem: Input, index: number, array: readonly Input[]) => Promise<boolean>) => Promise<Input[]>;
8
+ const asyncForEach: <Input>(elements: readonly Input[]) => (closure: (elem: Input, index: number, array: readonly Input[]) => Promise<any>) => Promise<void>;
9
+ const asyncMap: <Input>(elements: readonly Input[]) => <Output>(closure: (elem: Input, index: number, array: readonly Input[]) => Promise<Output>) => Promise<Output[]>;
10
+ const asyncRepeat: (count: number) => <T>(closure: (index: number) => Promise<T>) => Promise<T[]>;
11
+ const has: <T>(elements: readonly T[]) => (pred: (elem: T) => boolean) => boolean;
12
+ const repeat: (count: number) => <T>(closure: (index: number) => T) => T[];
13
+ const flat: <T>(matrix: T[][]) => T[];
14
+ const subsets: <T>(array: T[]) => T[][];
15
+ }
package/lib/ArrayUtil.js CHANGED
@@ -1,227 +1,227 @@
1
- "use strict";
2
- var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
3
- function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
4
- return new (P || (P = Promise))(function (resolve, reject) {
5
- function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
6
- function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
7
- function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
8
- step((generator = generator.apply(thisArg, _arguments || [])).next());
9
- });
10
- };
11
- var __generator = (this && this.__generator) || function (thisArg, body) {
12
- var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
13
- return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
14
- function verb(n) { return function (v) { return step([n, v]); }; }
15
- function step(op) {
16
- if (f) throw new TypeError("Generator is already executing.");
17
- while (g && (g = 0, op[0] && (_ = 0)), _) try {
18
- if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
19
- if (y = 0, t) op = [op[0] & 2, t.value];
20
- switch (op[0]) {
21
- case 0: case 1: t = op; break;
22
- case 4: _.label++; return { value: op[1], done: false };
23
- case 5: _.label++; y = op[1]; op = [0]; continue;
24
- case 7: op = _.ops.pop(); _.trys.pop(); continue;
25
- default:
26
- if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
27
- if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
28
- if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
29
- if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
30
- if (t[2]) _.ops.pop();
31
- _.trys.pop(); continue;
32
- }
33
- op = body.call(thisArg, _);
34
- } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
35
- if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
36
- }
37
- };
38
- var __values = (this && this.__values) || function(o) {
39
- var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
40
- if (m) return m.call(o);
41
- if (o && typeof o.length === "number") return {
42
- next: function () {
43
- if (o && i >= o.length) o = void 0;
44
- return { value: o && o[i++], done: !o };
45
- }
46
- };
47
- throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
48
- };
49
- var __read = (this && this.__read) || function (o, n) {
50
- var m = typeof Symbol === "function" && o[Symbol.iterator];
51
- if (!m) return o;
52
- var i = m.call(o), r, ar = [], e;
53
- try {
54
- while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
55
- }
56
- catch (error) { e = { error: error }; }
57
- finally {
58
- try {
59
- if (r && !r.done && (m = i["return"])) m.call(i);
60
- }
61
- finally { if (e) throw e.error; }
62
- }
63
- return ar;
64
- };
65
- var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
66
- if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
67
- if (ar || !(i in from)) {
68
- if (!ar) ar = Array.prototype.slice.call(from, 0, i);
69
- ar[i] = from[i];
70
- }
71
- }
72
- return to.concat(ar || Array.prototype.slice.call(from));
73
- };
74
- Object.defineProperty(exports, "__esModule", { value: true });
75
- exports.ArrayUtil = void 0;
76
- /**
77
- * Utility functions for arrays.
78
- *
79
- * @author Jeongho Nam - https://github.com/samchon
80
- */
81
- var ArrayUtil;
82
- (function (ArrayUtil) {
83
- var _this = this;
84
- ArrayUtil.asyncFilter = function (elements) {
85
- return function (pred) { return __awaiter(_this, void 0, void 0, function () {
86
- var ret;
87
- var _this = this;
88
- return __generator(this, function (_a) {
89
- switch (_a.label) {
90
- case 0:
91
- ret = [];
92
- return [4 /*yield*/, ArrayUtil.asyncForEach(elements)(function (elem, index, array) { return __awaiter(_this, void 0, void 0, function () {
93
- var flag;
94
- return __generator(this, function (_a) {
95
- switch (_a.label) {
96
- case 0: return [4 /*yield*/, pred(elem, index, array)];
97
- case 1:
98
- flag = _a.sent();
99
- if (flag === true)
100
- ret.push(elem);
101
- return [2 /*return*/];
102
- }
103
- });
104
- }); })];
105
- case 1:
106
- _a.sent();
107
- return [2 /*return*/, ret];
108
- }
109
- });
110
- }); };
111
- };
112
- ArrayUtil.asyncForEach = function (elements) {
113
- return function (closure) { return __awaiter(_this, void 0, void 0, function () {
114
- return __generator(this, function (_a) {
115
- switch (_a.label) {
116
- case 0: return [4 /*yield*/, ArrayUtil.asyncRepeat(elements.length)(function (index) {
117
- return closure(elements[index], index, elements);
118
- })];
119
- case 1:
120
- _a.sent();
121
- return [2 /*return*/];
122
- }
123
- });
124
- }); };
125
- };
126
- ArrayUtil.asyncMap = function (elements) {
127
- return function (closure) { return __awaiter(_this, void 0, void 0, function () {
128
- var ret;
129
- var _this = this;
130
- return __generator(this, function (_a) {
131
- switch (_a.label) {
132
- case 0:
133
- ret = [];
134
- return [4 /*yield*/, ArrayUtil.asyncForEach(elements)(function (elem, index, array) { return __awaiter(_this, void 0, void 0, function () {
135
- var output;
136
- return __generator(this, function (_a) {
137
- switch (_a.label) {
138
- case 0: return [4 /*yield*/, closure(elem, index, array)];
139
- case 1:
140
- output = _a.sent();
141
- ret.push(output);
142
- return [2 /*return*/];
143
- }
144
- });
145
- }); })];
146
- case 1:
147
- _a.sent();
148
- return [2 /*return*/, ret];
149
- }
150
- });
151
- }); };
152
- };
153
- ArrayUtil.asyncRepeat = function (count) {
154
- return function (closure) { return __awaiter(_this, void 0, void 0, function () {
155
- var indexes, output, indexes_1, indexes_1_1, index, _a, _b, e_1_1;
156
- var e_1, _c;
157
- return __generator(this, function (_d) {
158
- switch (_d.label) {
159
- case 0:
160
- indexes = new Array(count)
161
- .fill(1)
162
- .map(function (_, index) { return index; });
163
- output = [];
164
- _d.label = 1;
165
- case 1:
166
- _d.trys.push([1, 6, 7, 8]);
167
- indexes_1 = __values(indexes), indexes_1_1 = indexes_1.next();
168
- _d.label = 2;
169
- case 2:
170
- if (!!indexes_1_1.done) return [3 /*break*/, 5];
171
- index = indexes_1_1.value;
172
- _b = (_a = output).push;
173
- return [4 /*yield*/, closure(index)];
174
- case 3:
175
- _b.apply(_a, [_d.sent()]);
176
- _d.label = 4;
177
- case 4:
178
- indexes_1_1 = indexes_1.next();
179
- return [3 /*break*/, 2];
180
- case 5: return [3 /*break*/, 8];
181
- case 6:
182
- e_1_1 = _d.sent();
183
- e_1 = { error: e_1_1 };
184
- return [3 /*break*/, 8];
185
- case 7:
186
- try {
187
- if (indexes_1_1 && !indexes_1_1.done && (_c = indexes_1.return)) _c.call(indexes_1);
188
- }
189
- finally { if (e_1) throw e_1.error; }
190
- return [7 /*endfinally*/];
191
- case 8: return [2 /*return*/, output];
192
- }
193
- });
194
- }); };
195
- };
196
- ArrayUtil.has = function (elements) {
197
- return function (pred) {
198
- return elements.find(pred) !== undefined;
199
- };
200
- };
201
- ArrayUtil.repeat = function (count) {
202
- return function (closure) {
203
- return new Array(count).fill("").map(function (_, index) { return closure(index); });
204
- };
205
- };
206
- ArrayUtil.flat = function (matrix) {
207
- var _a;
208
- return (_a = []).concat.apply(_a, __spreadArray([], __read(matrix), false));
209
- };
210
- ArrayUtil.subsets = function (array) {
211
- var check = new Array(array.length).fill(false);
212
- var output = [];
213
- var dfs = function (depth) {
214
- if (depth === check.length)
215
- output.push(array.filter(function (_v, idx) { return check[idx]; }));
216
- else {
217
- check[depth] = true;
218
- dfs(depth + 1);
219
- check[depth] = false;
220
- dfs(depth + 1);
221
- }
222
- };
223
- dfs(0);
224
- return output;
225
- };
226
- })(ArrayUtil = exports.ArrayUtil || (exports.ArrayUtil = {}));
1
+ "use strict";
2
+ var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
3
+ function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
4
+ return new (P || (P = Promise))(function (resolve, reject) {
5
+ function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
6
+ function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
7
+ function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
8
+ step((generator = generator.apply(thisArg, _arguments || [])).next());
9
+ });
10
+ };
11
+ var __generator = (this && this.__generator) || function (thisArg, body) {
12
+ var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
13
+ return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
14
+ function verb(n) { return function (v) { return step([n, v]); }; }
15
+ function step(op) {
16
+ if (f) throw new TypeError("Generator is already executing.");
17
+ while (g && (g = 0, op[0] && (_ = 0)), _) try {
18
+ if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
19
+ if (y = 0, t) op = [op[0] & 2, t.value];
20
+ switch (op[0]) {
21
+ case 0: case 1: t = op; break;
22
+ case 4: _.label++; return { value: op[1], done: false };
23
+ case 5: _.label++; y = op[1]; op = [0]; continue;
24
+ case 7: op = _.ops.pop(); _.trys.pop(); continue;
25
+ default:
26
+ if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
27
+ if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
28
+ if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
29
+ if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
30
+ if (t[2]) _.ops.pop();
31
+ _.trys.pop(); continue;
32
+ }
33
+ op = body.call(thisArg, _);
34
+ } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
35
+ if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
36
+ }
37
+ };
38
+ var __values = (this && this.__values) || function(o) {
39
+ var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
40
+ if (m) return m.call(o);
41
+ if (o && typeof o.length === "number") return {
42
+ next: function () {
43
+ if (o && i >= o.length) o = void 0;
44
+ return { value: o && o[i++], done: !o };
45
+ }
46
+ };
47
+ throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
48
+ };
49
+ var __read = (this && this.__read) || function (o, n) {
50
+ var m = typeof Symbol === "function" && o[Symbol.iterator];
51
+ if (!m) return o;
52
+ var i = m.call(o), r, ar = [], e;
53
+ try {
54
+ while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
55
+ }
56
+ catch (error) { e = { error: error }; }
57
+ finally {
58
+ try {
59
+ if (r && !r.done && (m = i["return"])) m.call(i);
60
+ }
61
+ finally { if (e) throw e.error; }
62
+ }
63
+ return ar;
64
+ };
65
+ var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
66
+ if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
67
+ if (ar || !(i in from)) {
68
+ if (!ar) ar = Array.prototype.slice.call(from, 0, i);
69
+ ar[i] = from[i];
70
+ }
71
+ }
72
+ return to.concat(ar || Array.prototype.slice.call(from));
73
+ };
74
+ Object.defineProperty(exports, "__esModule", { value: true });
75
+ exports.ArrayUtil = void 0;
76
+ /**
77
+ * Utility functions for arrays.
78
+ *
79
+ * @author Jeongho Nam - https://github.com/samchon
80
+ */
81
+ var ArrayUtil;
82
+ (function (ArrayUtil) {
83
+ var _this = this;
84
+ ArrayUtil.asyncFilter = function (elements) {
85
+ return function (pred) { return __awaiter(_this, void 0, void 0, function () {
86
+ var ret;
87
+ var _this = this;
88
+ return __generator(this, function (_a) {
89
+ switch (_a.label) {
90
+ case 0:
91
+ ret = [];
92
+ return [4 /*yield*/, ArrayUtil.asyncForEach(elements)(function (elem, index, array) { return __awaiter(_this, void 0, void 0, function () {
93
+ var flag;
94
+ return __generator(this, function (_a) {
95
+ switch (_a.label) {
96
+ case 0: return [4 /*yield*/, pred(elem, index, array)];
97
+ case 1:
98
+ flag = _a.sent();
99
+ if (flag === true)
100
+ ret.push(elem);
101
+ return [2 /*return*/];
102
+ }
103
+ });
104
+ }); })];
105
+ case 1:
106
+ _a.sent();
107
+ return [2 /*return*/, ret];
108
+ }
109
+ });
110
+ }); };
111
+ };
112
+ ArrayUtil.asyncForEach = function (elements) {
113
+ return function (closure) { return __awaiter(_this, void 0, void 0, function () {
114
+ return __generator(this, function (_a) {
115
+ switch (_a.label) {
116
+ case 0: return [4 /*yield*/, ArrayUtil.asyncRepeat(elements.length)(function (index) {
117
+ return closure(elements[index], index, elements);
118
+ })];
119
+ case 1:
120
+ _a.sent();
121
+ return [2 /*return*/];
122
+ }
123
+ });
124
+ }); };
125
+ };
126
+ ArrayUtil.asyncMap = function (elements) {
127
+ return function (closure) { return __awaiter(_this, void 0, void 0, function () {
128
+ var ret;
129
+ var _this = this;
130
+ return __generator(this, function (_a) {
131
+ switch (_a.label) {
132
+ case 0:
133
+ ret = [];
134
+ return [4 /*yield*/, ArrayUtil.asyncForEach(elements)(function (elem, index, array) { return __awaiter(_this, void 0, void 0, function () {
135
+ var output;
136
+ return __generator(this, function (_a) {
137
+ switch (_a.label) {
138
+ case 0: return [4 /*yield*/, closure(elem, index, array)];
139
+ case 1:
140
+ output = _a.sent();
141
+ ret.push(output);
142
+ return [2 /*return*/];
143
+ }
144
+ });
145
+ }); })];
146
+ case 1:
147
+ _a.sent();
148
+ return [2 /*return*/, ret];
149
+ }
150
+ });
151
+ }); };
152
+ };
153
+ ArrayUtil.asyncRepeat = function (count) {
154
+ return function (closure) { return __awaiter(_this, void 0, void 0, function () {
155
+ var indexes, output, indexes_1, indexes_1_1, index, _a, _b, e_1_1;
156
+ var e_1, _c;
157
+ return __generator(this, function (_d) {
158
+ switch (_d.label) {
159
+ case 0:
160
+ indexes = new Array(count)
161
+ .fill(1)
162
+ .map(function (_, index) { return index; });
163
+ output = [];
164
+ _d.label = 1;
165
+ case 1:
166
+ _d.trys.push([1, 6, 7, 8]);
167
+ indexes_1 = __values(indexes), indexes_1_1 = indexes_1.next();
168
+ _d.label = 2;
169
+ case 2:
170
+ if (!!indexes_1_1.done) return [3 /*break*/, 5];
171
+ index = indexes_1_1.value;
172
+ _b = (_a = output).push;
173
+ return [4 /*yield*/, closure(index)];
174
+ case 3:
175
+ _b.apply(_a, [_d.sent()]);
176
+ _d.label = 4;
177
+ case 4:
178
+ indexes_1_1 = indexes_1.next();
179
+ return [3 /*break*/, 2];
180
+ case 5: return [3 /*break*/, 8];
181
+ case 6:
182
+ e_1_1 = _d.sent();
183
+ e_1 = { error: e_1_1 };
184
+ return [3 /*break*/, 8];
185
+ case 7:
186
+ try {
187
+ if (indexes_1_1 && !indexes_1_1.done && (_c = indexes_1.return)) _c.call(indexes_1);
188
+ }
189
+ finally { if (e_1) throw e_1.error; }
190
+ return [7 /*endfinally*/];
191
+ case 8: return [2 /*return*/, output];
192
+ }
193
+ });
194
+ }); };
195
+ };
196
+ ArrayUtil.has = function (elements) {
197
+ return function (pred) {
198
+ return elements.find(pred) !== undefined;
199
+ };
200
+ };
201
+ ArrayUtil.repeat = function (count) {
202
+ return function (closure) {
203
+ return new Array(count).fill("").map(function (_, index) { return closure(index); });
204
+ };
205
+ };
206
+ ArrayUtil.flat = function (matrix) {
207
+ var _a;
208
+ return (_a = []).concat.apply(_a, __spreadArray([], __read(matrix), false));
209
+ };
210
+ ArrayUtil.subsets = function (array) {
211
+ var check = new Array(array.length).fill(false);
212
+ var output = [];
213
+ var dfs = function (depth) {
214
+ if (depth === check.length)
215
+ output.push(array.filter(function (_v, idx) { return check[idx]; }));
216
+ else {
217
+ check[depth] = true;
218
+ dfs(depth + 1);
219
+ check[depth] = false;
220
+ dfs(depth + 1);
221
+ }
222
+ };
223
+ dfs(0);
224
+ return output;
225
+ };
226
+ })(ArrayUtil || (exports.ArrayUtil = ArrayUtil = {}));
227
227
  //# sourceMappingURL=ArrayUtil.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"ArrayUtil.js","sourceRoot":"","sources":["../src/ArrayUtil.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;;;;GAIG;AACH,IAAiB,SAAS,CA6FzB;AA7FD,WAAiB,SAAS;;IACT,qBAAW,GACpB,UAAQ,QAA0B;QAClC,OAAA,UACI,IAIqB;;;;;;wBAEf,GAAG,GAAY,EAAE,CAAC;wBACxB,qBAAM,UAAA,YAAY,CAAC,QAAQ,CAAC,CAAC,UAAO,IAAI,EAAE,KAAK,EAAE,KAAK;;;;gDAC5B,qBAAM,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,EAAA;;4CAA9C,IAAI,GAAY,SAA8B;4CACpD,IAAI,IAAI,KAAK,IAAI;gDAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;;;iCACrC,CAAC,EAAA;;wBAHF,SAGE,CAAC;wBACH,sBAAO,GAAG,EAAC;;;aACd;IAbD,CAaC,CAAC;IAEO,sBAAY,GACrB,UAAQ,QAA0B;QAClC,OAAA,UACI,OAIiB;;;4BAEjB,qBAAM,UAAA,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,UAAC,KAAK;4BACrC,OAAA,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC;wBAAzC,CAAyC,CAC5C,EAAA;;wBAFD,SAEC,CAAC;;;;aACL;IAVD,CAUC,CAAC;IAEO,kBAAQ,GACjB,UAAQ,QAA0B;QAClC,OAAA,UACI,OAIoB;;;;;;wBAEd,GAAG,GAAa,EAAE,CAAC;wBACzB,qBAAM,UAAA,YAAY,CAAC,QAAQ,CAAC,CAAC,UAAO,IAAI,EAAE,KAAK,EAAE,KAAK;;;;gDAC3B,qBAAM,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,EAAA;;4CAAlD,MAAM,GAAW,SAAiC;4CACxD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;;;;iCACpB,CAAC,EAAA;;wBAHF,SAGE,CAAC;wBACH,sBAAO,GAAG,EAAC;;;aACd;IAbD,CAaC,CAAC;IAEO,qBAAW,GACpB,UAAC,KAAa;QACd,OAAA,UAAU,OAAsC;;;;;;wBACtC,OAAO,GAAa,IAAI,KAAK,CAAC,KAAK,CAAC;6BACrC,IAAI,CAAC,CAAC,CAAC;6BACP,GAAG,CAAC,UAAC,CAAC,EAAE,KAAK,IAAK,OAAA,KAAK,EAAL,CAAK,CAAC,CAAC;wBAExB,MAAM,GAAQ,EAAE,CAAC;;;;wBACH,YAAA,SAAA,OAAO,CAAA;;;;wBAAhB,KAAK;wBAAa,KAAA,CAAA,KAAA,MAAM,CAAA,CAAC,IAAI,CAAA;wBAAC,qBAAM,OAAO,CAAC,KAAK,CAAC,EAAA;;wBAAhC,cAAY,SAAoB,EAAC,CAAC;;;;;;;;;;;;;;;;4BAE/D,sBAAO,MAAM,EAAC;;;aACjB;IATD,CASC,CAAC;IAEO,aAAG,GACZ,UAAI,QAAsB;QAC1B,OAAA,UAAC,IAA0B;YACvB,OAAA,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS;QAAjC,CAAiC;IADrC,CACqC,CAAC;IAE7B,gBAAM,GACf,UAAC,KAAa;QACd,OAAA,UAAI,OAA6B;YAC7B,OAAA,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,UAAC,CAAC,EAAE,KAAK,IAAK,OAAA,OAAO,CAAC,KAAK,CAAC,EAAd,CAAc,CAAC;QAA3D,CAA2D;IAD/D,CAC+D,CAAC;IAEvD,cAAI,GAAG,UAAI,MAAa;;QACjC,OAAA,CAAA,KAAC,EAAU,CAAA,CAAC,MAAM,oCAAI,MAAM;IAA5B,CAA6B,CAAC;IAErB,iBAAO,GAAG,UAAI,KAAU;QACjC,IAAM,KAAK,GAAc,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7D,IAAM,MAAM,GAAU,EAAE,CAAC;QAEzB,IAAM,GAAG,GAAG,UAAC,KAAa;YACtB,IAAI,KAAK,KAAK,KAAK,CAAC,MAAM;gBACtB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAC,EAAE,EAAE,GAAG,IAAK,OAAA,KAAK,CAAC,GAAG,CAAC,EAAV,CAAU,CAAC,CAAC,CAAC;iBAClD;gBACD,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;gBACpB,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAEf,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;gBACrB,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;aAClB;QACL,CAAC,CAAC;QACF,GAAG,CAAC,CAAC,CAAC,CAAC;QACP,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC;AACN,CAAC,EA7FgB,SAAS,GAAT,iBAAS,KAAT,iBAAS,QA6FzB"}
1
+ {"version":3,"file":"ArrayUtil.js","sourceRoot":"","sources":["../src/ArrayUtil.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;;;;GAIG;AACH,IAAiB,SAAS,CA6FzB;AA7FD,WAAiB,SAAS;;IACT,qBAAW,GACpB,UAAQ,QAA0B;QAClC,OAAA,UACI,IAIqB;;;;;;wBAEf,GAAG,GAAY,EAAE,CAAC;wBACxB,qBAAM,UAAA,YAAY,CAAC,QAAQ,CAAC,CAAC,UAAO,IAAI,EAAE,KAAK,EAAE,KAAK;;;;gDAC5B,qBAAM,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,EAAA;;4CAA9C,IAAI,GAAY,SAA8B;4CACpD,IAAI,IAAI,KAAK,IAAI;gDAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;;;iCACrC,CAAC,EAAA;;wBAHF,SAGE,CAAC;wBACH,sBAAO,GAAG,EAAC;;;aACd;IAbD,CAaC,CAAC;IAEO,sBAAY,GACrB,UAAQ,QAA0B;QAClC,OAAA,UACI,OAIiB;;;4BAEjB,qBAAM,UAAA,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,UAAC,KAAK;4BACrC,OAAA,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC;wBAAzC,CAAyC,CAC5C,EAAA;;wBAFD,SAEC,CAAC;;;;aACL;IAVD,CAUC,CAAC;IAEO,kBAAQ,GACjB,UAAQ,QAA0B;QAClC,OAAA,UACI,OAIoB;;;;;;wBAEd,GAAG,GAAa,EAAE,CAAC;wBACzB,qBAAM,UAAA,YAAY,CAAC,QAAQ,CAAC,CAAC,UAAO,IAAI,EAAE,KAAK,EAAE,KAAK;;;;gDAC3B,qBAAM,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,EAAA;;4CAAlD,MAAM,GAAW,SAAiC;4CACxD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;;;;iCACpB,CAAC,EAAA;;wBAHF,SAGE,CAAC;wBACH,sBAAO,GAAG,EAAC;;;aACd;IAbD,CAaC,CAAC;IAEO,qBAAW,GACpB,UAAC,KAAa;QACd,OAAA,UAAU,OAAsC;;;;;;wBACtC,OAAO,GAAa,IAAI,KAAK,CAAC,KAAK,CAAC;6BACrC,IAAI,CAAC,CAAC,CAAC;6BACP,GAAG,CAAC,UAAC,CAAC,EAAE,KAAK,IAAK,OAAA,KAAK,EAAL,CAAK,CAAC,CAAC;wBAExB,MAAM,GAAQ,EAAE,CAAC;;;;wBACH,YAAA,SAAA,OAAO,CAAA;;;;wBAAhB,KAAK;wBAAa,KAAA,CAAA,KAAA,MAAM,CAAA,CAAC,IAAI,CAAA;wBAAC,qBAAM,OAAO,CAAC,KAAK,CAAC,EAAA;;wBAAhC,cAAY,SAAoB,EAAC,CAAC;;;;;;;;;;;;;;;;4BAE/D,sBAAO,MAAM,EAAC;;;aACjB;IATD,CASC,CAAC;IAEO,aAAG,GACZ,UAAI,QAAsB;QAC1B,OAAA,UAAC,IAA0B;YACvB,OAAA,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS;QAAjC,CAAiC;IADrC,CACqC,CAAC;IAE7B,gBAAM,GACf,UAAC,KAAa;QACd,OAAA,UAAI,OAA6B;YAC7B,OAAA,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,UAAC,CAAC,EAAE,KAAK,IAAK,OAAA,OAAO,CAAC,KAAK,CAAC,EAAd,CAAc,CAAC;QAA3D,CAA2D;IAD/D,CAC+D,CAAC;IAEvD,cAAI,GAAG,UAAI,MAAa;;QACjC,OAAA,CAAA,KAAC,EAAU,CAAA,CAAC,MAAM,oCAAI,MAAM;IAA5B,CAA6B,CAAC;IAErB,iBAAO,GAAG,UAAI,KAAU;QACjC,IAAM,KAAK,GAAc,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7D,IAAM,MAAM,GAAU,EAAE,CAAC;QAEzB,IAAM,GAAG,GAAG,UAAC,KAAa;YACtB,IAAI,KAAK,KAAK,KAAK,CAAC,MAAM;gBACtB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAC,EAAE,EAAE,GAAG,IAAK,OAAA,KAAK,CAAC,GAAG,CAAC,EAAV,CAAU,CAAC,CAAC,CAAC;iBAClD;gBACD,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;gBACpB,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAEf,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;gBACrB,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;aAClB;QACL,CAAC,CAAC;QACF,GAAG,CAAC,CAAC,CAAC,CAAC;QACP,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC;AACN,CAAC,EA7FgB,SAAS,yBAAT,SAAS,QA6FzB"}