-
-
Notifications
You must be signed in to change notification settings - Fork 26
/
array.ts
389 lines (318 loc) · 8.66 KB
/
array.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
import SchemaType from '../schematype';
import ValidationError from '../error/validation';
const { isArray } = Array;
/**
* Array schema type.
*/
class SchemaTypeArray<I, T extends SchemaType<I>> extends SchemaType<I[]> {
options: SchemaType<I[]>['options'] & { child?: T; };
child: T;
/**
*
* @param {String} name
* @param {Object} [options]
* @param {Boolean} [options.required=false]
* @param {Array|Function} [options.default=[]]
* @param {SchemaType} [options.child]
*/
constructor(name: string, options?: Partial<SchemaType<I[]>['options']> & { child?: T; }) {
super(name, Object.assign({
default: []
}, options));
this.child = this.options.child || new SchemaType<any>(name) as T;
}
/**
* Casts an array and its child elements.
*
* @param {*} value_
* @param {Object} data
* @return {Array}
*/
cast(value_: Exclude<unknown, null | undefined>, data?: unknown): I[];
cast(value_?: unknown, data?: unknown): I[] | undefined;
cast(value_?: unknown, data?: unknown): I[] | undefined {
value_ = super.cast(value_, data);
if (value_ == null) return value_ as undefined;
const value = isArray(value_) ? value_ : value_ = [value_];
if (!value.length) return value;
const child = this.child;
for (let i = 0, len = value.length; i < len; i++) {
value[i] = child.cast(value[i], data);
}
return value;
}
/**
* Validates an array and its child elements.
*
* @param {*} value_
* @param {Object} data
* @return {Array|Error}
*/
validate(value_?: unknown, data?: unknown): I[] {
const value = super.validate(value_, data);
if (!isArray(value)) {
throw new ValidationError(`\`${value}\` is not an array!`);
}
if (!value.length) return value;
const child = this.child;
for (let i = 0, len = value.length; i < len; i++) {
value[i] = child.validate(value[i], data) as I;
}
return value;
}
/**
* Compares an array by its child elements and the size of the array.
*
* @param {Array} a
* @param {Array} b
* @return {Number}
*/
compare(a?: I[], b?: I[]): number {
if (a) {
if (!b) return 1;
} else {
return b ? -1 : 0;
}
const lenA = a.length;
const lenB = b.length;
const child = this.child;
for (let i = 0, len = Math.min(lenA, lenB); i < len; i++) {
const result = child.compare(a[i], b[i]);
if (result !== 0) return result;
}
// Compare by length
return lenA - lenB;
}
/**
* Parses data.
*
* @param {Array} value
* @return {Array}
*/
parse(value: unknown[]): I[];
parse(): undefined;
parse(value?: unknown[]): I[] | undefined {
if (!value) return value as undefined;
const len = value.length;
if (!len) return [];
const result = new Array(len);
const child = this.child;
for (let i = 0; i < len; i++) {
result[i] = child.parse(value[i]) as I;
}
return result;
}
/**
* Transforms data.
*
* @param {Array} value
* @param {Object} data
* @return {Array}
*/
value(value: unknown[], data?: unknown): any[]
value(): undefined;
value(value?: unknown[], data?: unknown): any[] | undefined {
if (!value) return value as undefined;
const len = value.length;
if (!len) return [];
const result = new Array(len);
const child = this.child;
for (let i = 0; i < len; i++) {
result[i] = child.value(value[i], data);
}
return result;
}
/**
* Checks the equality of an array.
*
* @param {Array} value
* @param {Array} query
* @param {Object} data
* @return {Boolean}
*/
match(value?: I[], query?: unknown[], data?: unknown): boolean {
if (!value || !query) {
return value === query;
}
const lenA = value.length;
const lenB = query.length;
if (lenA !== lenB) return false;
const child = this.child;
for (let i = 0; i < lenA; i++) {
if (!child.match(value[i], query[i], data)) return false;
}
return true;
}
/**
* Checks whether the number of elements in an array is equal to `query`.
*
* @param {Array} value
* @param {Number} query
* @param {Object} data
* @return {Boolean}
*/
q$size(value?: unknown[], query?: unknown, data?: unknown): boolean {
return (value ? value.length : 0) === query;
}
/**
* Checks whether an array contains one of elements in `query`.
*
* @param {Array} value
* @param {Array} query
* @param {Object} data
* @return {Boolean}
*/
q$in(value?: unknown[], query?: unknown[], data?: unknown): boolean {
if (!value) return false;
for (let i = 0, len = query.length; i < len; i++) {
if (value.includes(query[i])) return true;
}
return false;
}
/**
* Checks whether an array does not contain in any elements in `query`.
*
* @param {Array} value
* @param {Array} query
* @param {Object} data
* @return {Boolean}
*/
q$nin<T>(value?: T[], query?: T[], data?: unknown): boolean {
if (!value) return true;
for (let i = 0, len = query.length; i < len; i++) {
if (value.includes(query[i])) return false;
}
return true;
}
/**
* Checks whether an array contains all elements in `query`.
*
* @param {Array} value
* @param {Array} query
* @param {Object} data
* @return {Boolean}
*/
q$all<T>(value?: T[], query?: T[], data?: unknown): boolean {
if (!value) return false;
for (let i = 0, len = query.length; i < len; i++) {
if (!value.includes(query[i])) return false;
}
return true;
}
/**
* Add elements to an array.
*
* @param {Array} value
* @param {*} update
* @param {Object} data
* @return {Array}
*/
u$push<T>(value?: T[], update?: T | T[], data?: unknown): T[] {
if (isArray(update)) {
return value ? value.concat(update) : update;
}
if (value) {
value.push(update);
return value;
}
return [update];
}
/**
* Add elements in front of an array.
*
* @param {Array} value
* @param {*} update
* @param {Object} data
* @return {Array}
*/
u$unshift<T>(value?: T[], update?: T | T[], data?: unknown): T[] {
if (isArray(update)) {
return value ? update.concat(value) : update;
}
if (value) {
value.unshift(update);
return value;
}
return [update];
}
/**
* Removes elements from an array.
*
* @param {Array} value
* @param {*} update
* @param {Object} data
* @return {Array}
*/
u$pull<T>(value?: T[], update?: T | T[], data?: unknown): T[] {
if (!value) return value;
if (isArray(update)) {
return value.filter(item => !update.includes(item));
}
return value.filter(item => item !== update);
}
/**
* Removes the first element from an array.
*
* @param {Array} value
* @param {Number|Boolean} update
* @param {Object} data
* @return {Array}
*/
u$shift<T>(value?: T[], update?: number | boolean, data?: unknown): T[] {
if (!value || !update) return value;
if (update === true) {
return value.slice(1);
} else if (update > 0) {
return value.slice(update);
}
return value.slice(0, value.length + update);
}
/**
* Removes the last element from an array.
*
* @param {Array} value
* @param {Number|Boolean} update
* @param {Object} data
* @return {Array}
*/
u$pop<T>(value?: T[], update?: number | boolean, data?: unknown): T[] {
if (!value || !update) return value;
const length = value.length;
if (update === true) {
return value.slice(0, length - 1);
} else if (update > 0) {
return value.slice(0, length - update);
}
return value.slice(-update, length);
}
/**
* Add elements to an array only if the value is not already in the array.
*
* @param {Array} value
* @param {*} update
* @param {Object} data
* @return {Array}
*/
u$addToSet<T>(value?: T[], update?: T | T[], data?: unknown): T[] {
if (isArray(update)) {
if (!value) return update;
for (let i = 0, len = update.length; i < len; i++) {
const item = update[i];
if (!value.includes(item)) value.push(item);
}
return value;
}
if (!value) return [update];
if (!value.includes(update)) {
value.push(update);
}
return value;
}
q$length: SchemaTypeArray<I, T>['q$size'];
u$append: SchemaTypeArray<I, T>['u$push'];
u$prepend: SchemaTypeArray<I, T>['u$unshift'];
}
SchemaTypeArray.prototype.q$length = SchemaTypeArray.prototype.q$size;
SchemaTypeArray.prototype.u$append = SchemaTypeArray.prototype.u$push;
SchemaTypeArray.prototype.u$prepend = SchemaTypeArray.prototype.u$unshift;
export default SchemaTypeArray;