@dereekb/util 0.0.1 → 1.2.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +32 -0
- package/README.md +4 -5
- package/package.json +2 -1
- package/src/lib/array/array.d.ts +21 -1
- package/src/lib/array/array.filter.d.ts +20 -0
- package/src/lib/array/array.filter.js +39 -1
- package/src/lib/array/array.filter.js.map +1 -1
- package/src/lib/array/array.index.d.ts +36 -0
- package/src/lib/array/array.index.js +65 -0
- package/src/lib/array/array.index.js.map +1 -0
- package/src/lib/array/array.js +32 -2
- package/src/lib/array/array.js.map +1 -1
- package/src/lib/array/array.make.d.ts +22 -0
- package/src/lib/array/array.make.js +30 -0
- package/src/lib/array/array.make.js.map +1 -0
- package/src/lib/array/array.number.d.ts +1 -1
- package/src/lib/array/array.number.js +12 -1
- package/src/lib/array/array.number.js.map +1 -1
- package/src/lib/array/array.set.d.ts +3 -2
- package/src/lib/array/array.set.js +8 -4
- package/src/lib/array/array.set.js.map +1 -1
- package/src/lib/array/index.d.ts +2 -0
- package/src/lib/array/index.js +2 -0
- package/src/lib/array/index.js.map +1 -1
- package/src/lib/assertion/assertion.js +1 -1
- package/src/lib/assertion/assertion.js.map +1 -1
- package/src/lib/date/date.d.ts +1 -0
- package/src/lib/date/date.js.map +1 -1
- package/src/lib/filter/filter.d.ts +8 -0
- package/src/lib/filter/filter.js +20 -0
- package/src/lib/filter/filter.js.map +1 -1
- package/src/lib/getter.d.ts +10 -0
- package/src/lib/getter.js +2 -8
- package/src/lib/getter.js.map +1 -1
- package/src/lib/index.d.ts +1 -0
- package/src/lib/index.js +1 -0
- package/src/lib/index.js.map +1 -1
- package/src/lib/number.d.ts +13 -0
- package/src/lib/number.js +19 -1
- package/src/lib/number.js.map +1 -1
- package/src/lib/object/object.d.ts +53 -3
- package/src/lib/object/object.js +119 -7
- package/src/lib/object/object.js.map +1 -1
- package/src/lib/page/page.filter.d.ts +1 -1
- package/src/lib/promise/index.d.ts +2 -0
- package/src/lib/promise/index.js +2 -0
- package/src/lib/promise/index.js.map +1 -1
- package/src/lib/promise/poll.d.ts +18 -0
- package/src/lib/promise/poll.js +16 -0
- package/src/lib/promise/poll.js.map +1 -0
- package/src/lib/promise/promise.d.ts +0 -1
- package/src/lib/promise/promise.js +2 -6
- package/src/lib/promise/promise.js.map +1 -1
- package/src/lib/promise/promise.loop.d.ts +1 -0
- package/src/lib/promise/promise.loop.js.map +1 -1
- package/src/lib/promise/wait.d.ts +6 -0
- package/src/lib/promise/wait.js +11 -0
- package/src/lib/promise/wait.js.map +1 -0
- package/src/lib/string.d.ts +1 -0
- package/src/lib/string.js +5 -1
- package/src/lib/string.js.map +1 -1
- package/src/lib/tree/index.d.ts +4 -0
- package/src/lib/tree/index.js +8 -0
- package/src/lib/tree/index.js.map +1 -0
- package/src/lib/tree/tree.array.d.ts +15 -0
- package/src/lib/tree/tree.array.js +19 -0
- package/src/lib/tree/tree.array.js.map +1 -0
- package/src/lib/tree/tree.d.ts +13 -0
- package/src/lib/tree/tree.expand.d.ts +40 -0
- package/src/lib/tree/tree.expand.js +34 -0
- package/src/lib/tree/tree.expand.js.map +1 -0
- package/src/lib/tree/tree.flatten.d.ts +27 -0
- package/src/lib/tree/tree.flatten.js +47 -0
- package/src/lib/tree/tree.flatten.js.map +1 -0
- package/src/lib/tree/tree.js +3 -0
- package/src/lib/tree/tree.js.map +1 -0
- package/src/lib/type.d.ts +1 -0
- package/src/lib/value.js.map +1 -1
package/CHANGELOG.md
ADDED
|
@@ -0,0 +1,32 @@
|
|
|
1
|
+
# Changelog
|
|
2
|
+
|
|
3
|
+
This file was generated using [@jscutlery/semver](https://github.com/jscutlery/semver).
|
|
4
|
+
|
|
5
|
+
# [1.2.0](https://github.com/dereekb/dbcomponents/compare/v1.1.0...v1.2.0) (2022-03-04)
|
|
6
|
+
|
|
7
|
+
|
|
8
|
+
### Features
|
|
9
|
+
|
|
10
|
+
* added setContainsAnyValue() ([ea0ee9a](https://github.com/dereekb/dbcomponents/commit/ea0ee9a76fc6b093b2608356179e9f633fc896be))
|
|
11
|
+
|
|
12
|
+
|
|
13
|
+
|
|
14
|
+
# [1.1.0](https://github.com/dereekb/dbcomponents/compare/v1.0.0...v1.1.0) (2022-03-02)
|
|
15
|
+
|
|
16
|
+
|
|
17
|
+
|
|
18
|
+
# 1.0.0 (2022-02-23)
|
|
19
|
+
|
|
20
|
+
|
|
21
|
+
### Features
|
|
22
|
+
|
|
23
|
+
* added dbxList ([83ddb00](https://github.com/dereekb/dbcomponents/commit/83ddb006548602640ec312594b9bb9f26f3417de))
|
|
24
|
+
* added dbxSearchableTextFieldComponent ([42ae14c](https://github.com/dereekb/dbcomponents/commit/42ae14c7709f6603db676c94f1df2017fdad59ca))
|
|
25
|
+
* added dbxStyleBody ([5b624ae](https://github.com/dereekb/dbcomponents/commit/5b624ae0c77ea935fe874dcb977eb22dd17cd60c))
|
|
26
|
+
* added makeBestFit() ([b0cf900](https://github.com/dereekb/dbcomponents/commit/b0cf900247ab0490fcb35f845cefecc82e45332b))
|
|
27
|
+
* added treeNode ([1aa120f](https://github.com/dereekb/dbcomponents/commit/1aa120f7f8c83ccc46d440b77fbd234dec564aea))
|
|
28
|
+
* segment analytics ([b81d5a6](https://github.com/dereekb/dbcomponents/commit/b81d5a6a70ecf3bc35852d441cfd79e91e5dcb51))
|
|
29
|
+
|
|
30
|
+
|
|
31
|
+
|
|
32
|
+
# 0.1.0 (2022-01-29)
|
package/README.md
CHANGED
|
@@ -1,7 +1,6 @@
|
|
|
1
|
-
|
|
1
|
+
@dereekb/util
|
|
2
|
+
=======
|
|
2
3
|
|
|
3
|
-
|
|
4
|
+
The sources for this package are in the main [@dereekb/dbcomponents](https://github.com/dereekb/dbcomponents) repo. Please file issues and pull requests against that repo.
|
|
4
5
|
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
Run `nx test util` to execute the unit tests via [Jest](https://jestjs.io).
|
|
6
|
+
License: MIT
|
package/package.json
CHANGED
package/src/lib/array/array.d.ts
CHANGED
|
@@ -30,7 +30,21 @@ export declare function concatArrays<T>(...arrays: (Maybe<T[]>)[]): T[];
|
|
|
30
30
|
export declare function flattenArray<T>(array: T[][]): T[];
|
|
31
31
|
export declare function copyArray<T>(input: Maybe<T[]>): T[];
|
|
32
32
|
export declare function pushElementOntoArray<T>(target: T[], element: T, times: number): T[];
|
|
33
|
-
|
|
33
|
+
/**
|
|
34
|
+
* Merges all input arrays into a single array.
|
|
35
|
+
*
|
|
36
|
+
* @param arrays
|
|
37
|
+
* @returns
|
|
38
|
+
*/
|
|
39
|
+
export declare function mergeArrays<T>(arrays: Maybe<T[]>[]): T[];
|
|
40
|
+
/**
|
|
41
|
+
* Merges the input arrays into the target.
|
|
42
|
+
*
|
|
43
|
+
* @param target
|
|
44
|
+
* @param arrays
|
|
45
|
+
* @returns
|
|
46
|
+
*/
|
|
47
|
+
export declare function mergeIntoArray<T>(target: Maybe<T[]>, ...arrays: Maybe<T[]>[]): T[];
|
|
34
48
|
export declare function mergeArrayOrValueIntoArray<T>(target: T[], value: ArrayOrValue<T>): T[];
|
|
35
49
|
/**
|
|
36
50
|
* Merges all the values from the second array into the first using push.
|
|
@@ -58,3 +72,9 @@ export declare function takeFront<T>(values: T[], maxToTake: number): T[];
|
|
|
58
72
|
* @returns New array with the subset of taken values.
|
|
59
73
|
*/
|
|
60
74
|
export declare function takeLast<T>(values: T[], maxToTake: number, keepFromFront?: number): T[];
|
|
75
|
+
/**
|
|
76
|
+
* Picks an item randomly from the input array. If the array is empty, returns undefined.
|
|
77
|
+
*
|
|
78
|
+
* @param values
|
|
79
|
+
*/
|
|
80
|
+
export declare function pickOneRandomly<T>(values: T[]): T;
|
|
@@ -11,3 +11,23 @@ export declare function filterValuesByDistance<T>(input: T[], minDistance: numbe
|
|
|
11
11
|
* we are only interested in seeing one of those items.
|
|
12
12
|
*/
|
|
13
13
|
export declare function filterValuesByDistanceNoOrder<T>(input: T[], minDistance: number, getValue: (value: T) => number | null): T[];
|
|
14
|
+
/**
|
|
15
|
+
* Same as applyBestFit, but returns a new array, rather than modifying the existing array.
|
|
16
|
+
*
|
|
17
|
+
* @param input
|
|
18
|
+
* @param filter
|
|
19
|
+
* @param updateNonBestFit
|
|
20
|
+
*/
|
|
21
|
+
export declare function makeBestFit<T>(input: T[], filter: (value: T) => boolean, compare: (a: T, b: T) => number, updateNonBestFit: (value: T) => T): T[];
|
|
22
|
+
/**
|
|
23
|
+
* Used for updating an array so that a single element becomes the "best fit" in whatever context is provided.
|
|
24
|
+
*
|
|
25
|
+
* For instance, if two items are selected but only one can be selected by design, this function can be used to
|
|
26
|
+
* pick the best fit, and update the input array.
|
|
27
|
+
*
|
|
28
|
+
* @param input
|
|
29
|
+
* @param filter
|
|
30
|
+
* @param updateNonBestFit
|
|
31
|
+
* @returns
|
|
32
|
+
*/
|
|
33
|
+
export declare function applyBestFit<T>(input: T[], filter: (value: T) => boolean, compare: (a: T, b: T) => number, updateNonBestFit: (value: T) => T): T[];
|
|
@@ -1,6 +1,8 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.filterValuesByDistanceNoOrder = exports.filterValuesByDistance = void 0;
|
|
3
|
+
exports.applyBestFit = exports.makeBestFit = exports.filterValuesByDistanceNoOrder = exports.filterValuesByDistance = void 0;
|
|
4
|
+
const array_1 = require("./array");
|
|
5
|
+
const array_index_1 = require("./array.index");
|
|
4
6
|
/**
|
|
5
7
|
* Filters the input values by distance. The original order is retained.
|
|
6
8
|
*
|
|
@@ -45,4 +47,40 @@ function _filterValuesByDistance(values, minDistance, toOutputValue) {
|
|
|
45
47
|
}
|
|
46
48
|
return filtered;
|
|
47
49
|
}
|
|
50
|
+
/**
|
|
51
|
+
* Same as applyBestFit, but returns a new array, rather than modifying the existing array.
|
|
52
|
+
*
|
|
53
|
+
* @param input
|
|
54
|
+
* @param filter
|
|
55
|
+
* @param updateNonBestFit
|
|
56
|
+
*/
|
|
57
|
+
function makeBestFit(input, filter, compare, updateNonBestFit) {
|
|
58
|
+
return applyBestFit((0, array_1.copyArray)(input), filter, compare, updateNonBestFit);
|
|
59
|
+
}
|
|
60
|
+
exports.makeBestFit = makeBestFit;
|
|
61
|
+
/**
|
|
62
|
+
* Used for updating an array so that a single element becomes the "best fit" in whatever context is provided.
|
|
63
|
+
*
|
|
64
|
+
* For instance, if two items are selected but only one can be selected by design, this function can be used to
|
|
65
|
+
* pick the best fit, and update the input array.
|
|
66
|
+
*
|
|
67
|
+
* @param input
|
|
68
|
+
* @param filter
|
|
69
|
+
* @param updateNonBestFit
|
|
70
|
+
* @returns
|
|
71
|
+
*/
|
|
72
|
+
function applyBestFit(input, filter, compare, updateNonBestFit) {
|
|
73
|
+
const matchIndexSet = (0, array_index_1.findToIndexSet)(input, filter);
|
|
74
|
+
if (matchIndexSet.length > 1) {
|
|
75
|
+
const expansion = (0, array_index_1.expandIndexSet)(input, matchIndexSet);
|
|
76
|
+
const bestPair = (0, array_index_1.findBestIndexSetPair)(expansion, compare);
|
|
77
|
+
expansion.forEach(({ i, item }) => {
|
|
78
|
+
if (i !== bestPair.i) {
|
|
79
|
+
input[i] = updateNonBestFit(item); // Update value on input.
|
|
80
|
+
}
|
|
81
|
+
});
|
|
82
|
+
}
|
|
83
|
+
return input;
|
|
84
|
+
}
|
|
85
|
+
exports.applyBestFit = applyBestFit;
|
|
48
86
|
//# sourceMappingURL=array.filter.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"array.filter.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.filter.ts"],"names":[],"mappings":";;;
|
|
1
|
+
{"version":3,"file":"array.filter.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.filter.ts"],"names":[],"mappings":";;;AAAA,mCAAoC;AACpC,+CAAqF;AAErF;;;;GAIG;AACH,SAAgB,sBAAsB,CAAI,KAAU,EAAE,WAAmB,EAAE,QAAqC;IAE9G,6BAA6B;IAE7B,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;AAChD,CAAC;AALD,wDAKC;AAED;;;;;GAKG;AACH,SAAgB,6BAA6B,CAAI,KAAU,EAAE,WAAmB,EAAE,QAAqC;IACrH,MAAM,MAAM,GAAkB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAgB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;IACxG,OAAO,uBAAuB,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAHD,sEAGC;AAED,oGAAoG;AAEpG,SAAS,uBAAuB,CAAO,MAAqB,EAAE,WAAmB,EAAE,aAAwC;IAEzH,yBAAyB;IACzB,QAAQ,MAAM,CAAC,MAAM,EAAE;QACrB,KAAK,CAAC;YACJ,OAAO,EAAE,CAAC;QACZ,KAAK,CAAC;YACJ,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACrC;IAED,cAAc;IACd,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnC,IAAI,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAErB,MAAM,QAAQ,GAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;IAE5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;QAChD,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhD,IAAI,QAAQ,GAAG,WAAW,EAAE;YAC1B,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;YACtC,IAAI,GAAG,OAAO,CAAC;SAChB;KACF;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAGD;;;;;;GAMG;AACH,SAAgB,WAAW,CAAI,KAAU,EAAE,MAA6B,EAAE,OAA+B,EAAE,gBAAiC;IAC1I,OAAO,YAAY,CAAI,IAAA,iBAAS,EAAC,KAAK,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC;AAC9E,CAAC;AAFD,kCAEC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,YAAY,CAAI,KAAU,EAAE,MAA6B,EAAE,OAA+B,EAAE,gBAAiC;IAC3I,MAAM,aAAa,GAAG,IAAA,4BAAc,EAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAEpD,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE;QAC5B,MAAM,SAAS,GAAG,IAAA,4BAAc,EAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAA,kCAAoB,EAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAE1D,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE;YAChC,IAAI,CAAC,KAAK,QAAQ,CAAC,CAAC,EAAE;gBACpB,KAAK,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,IAAK,CAAC,CAAC,CAAC,yBAAyB;aAC9D;QACH,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAfD,oCAeC"}
|
|
@@ -0,0 +1,36 @@
|
|
|
1
|
+
import { Maybe } from "../value";
|
|
2
|
+
/**
|
|
3
|
+
* A set of number corresponding to items in an array.
|
|
4
|
+
*
|
|
5
|
+
* This is useful for cases where you need the items in their index in the array.
|
|
6
|
+
*/
|
|
7
|
+
export declare type IndexSet = number[];
|
|
8
|
+
export declare type IndexSetPairSet<T> = IndexSetPair<T>[];
|
|
9
|
+
export interface IndexSetPair<T> {
|
|
10
|
+
i: number;
|
|
11
|
+
item: Maybe<T>;
|
|
12
|
+
}
|
|
13
|
+
/**
|
|
14
|
+
* Runs a filter on an array and returns an IndexSet for values that match.
|
|
15
|
+
*
|
|
16
|
+
* @param input
|
|
17
|
+
* @param filter
|
|
18
|
+
* @returns
|
|
19
|
+
*/
|
|
20
|
+
export declare function findToIndexSet<T>(input: T[], filter: (value: T) => boolean): IndexSet;
|
|
21
|
+
export declare function expandIndexSet<T>(input: T[], indexSet: IndexSet): IndexSetPairSet<T>;
|
|
22
|
+
/**
|
|
23
|
+
* Finds the best item in the input array using the compare function, and returns an IndexSetPair value.
|
|
24
|
+
*
|
|
25
|
+
* @param input
|
|
26
|
+
* @param compare
|
|
27
|
+
*/
|
|
28
|
+
export declare function findBest<T>(input: T[], compare: (a: T, b: T) => number): IndexSetPair<T>;
|
|
29
|
+
/**
|
|
30
|
+
* Finds the best item in the input IndexSetPairSet, and returns it.
|
|
31
|
+
*
|
|
32
|
+
* @param input
|
|
33
|
+
* @param compare
|
|
34
|
+
* @returns
|
|
35
|
+
*/
|
|
36
|
+
export declare function findBestIndexSetPair<T>(input: IndexSetPairSet<T>, compare: (a: T, b: T) => number): IndexSetPair<T>;
|
|
@@ -0,0 +1,65 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.findBestIndexSetPair = exports.findBest = exports.expandIndexSet = exports.findToIndexSet = void 0;
|
|
4
|
+
/**
|
|
5
|
+
* Runs a filter on an array and returns an IndexSet for values that match.
|
|
6
|
+
*
|
|
7
|
+
* @param input
|
|
8
|
+
* @param filter
|
|
9
|
+
* @returns
|
|
10
|
+
*/
|
|
11
|
+
function findToIndexSet(input, filter) {
|
|
12
|
+
let filterIndexes = [];
|
|
13
|
+
input.forEach((x, i) => {
|
|
14
|
+
if (filter(x)) {
|
|
15
|
+
filterIndexes.push(i);
|
|
16
|
+
}
|
|
17
|
+
});
|
|
18
|
+
return filterIndexes;
|
|
19
|
+
}
|
|
20
|
+
exports.findToIndexSet = findToIndexSet;
|
|
21
|
+
function expandIndexSet(input, indexSet) {
|
|
22
|
+
return indexSet.map(i => ({ i, item: input[i] }));
|
|
23
|
+
}
|
|
24
|
+
exports.expandIndexSet = expandIndexSet;
|
|
25
|
+
/**
|
|
26
|
+
* Finds the best item in the input array using the compare function, and returns an IndexSetPair value.
|
|
27
|
+
*
|
|
28
|
+
* @param input
|
|
29
|
+
* @param compare
|
|
30
|
+
*/
|
|
31
|
+
function findBest(input, compare) {
|
|
32
|
+
let bestIndex = 0;
|
|
33
|
+
let best = input[0];
|
|
34
|
+
for (let i = 1; i < input.length; i += 1) {
|
|
35
|
+
const next = input[i];
|
|
36
|
+
if (next != null && compare(best, next) < 0) {
|
|
37
|
+
bestIndex = i;
|
|
38
|
+
best = next;
|
|
39
|
+
}
|
|
40
|
+
}
|
|
41
|
+
return {
|
|
42
|
+
i: bestIndex,
|
|
43
|
+
item: best
|
|
44
|
+
};
|
|
45
|
+
}
|
|
46
|
+
exports.findBest = findBest;
|
|
47
|
+
/**
|
|
48
|
+
* Finds the best item in the input IndexSetPairSet, and returns it.
|
|
49
|
+
*
|
|
50
|
+
* @param input
|
|
51
|
+
* @param compare
|
|
52
|
+
* @returns
|
|
53
|
+
*/
|
|
54
|
+
function findBestIndexSetPair(input, compare) {
|
|
55
|
+
let best = input[0];
|
|
56
|
+
for (let i = 1; i < input.length; i += 1) {
|
|
57
|
+
const next = input[i];
|
|
58
|
+
if (best.item == null || (next.item != null && compare(best.item, next.item) < 0)) {
|
|
59
|
+
best = next;
|
|
60
|
+
}
|
|
61
|
+
}
|
|
62
|
+
return best;
|
|
63
|
+
}
|
|
64
|
+
exports.findBestIndexSetPair = findBestIndexSetPair;
|
|
65
|
+
//# sourceMappingURL=array.index.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"array.index.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.index.ts"],"names":[],"mappings":";;;AAgBA;;;;;;GAMG;AACH,SAAgB,cAAc,CAAI,KAAU,EAAE,MAA6B;IACzE,IAAI,aAAa,GAAa,EAAE,CAAC;IAEjC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrB,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE;YACb,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACvB;IACH,CAAC,CAAC,CAAA;IAEF,OAAO,aAAa,CAAC;AACvB,CAAC;AAVD,wCAUC;AAGD,SAAgB,cAAc,CAAI,KAAU,EAAE,QAAkB;IAC9D,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpD,CAAC;AAFD,wCAEC;AAED;;;;;GAKG;AACH,SAAgB,QAAQ,CAAI,KAAU,EAAE,OAA+B;IACrE,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACxC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEtB,IAAI,IAAI,IAAI,IAAI,IAAI,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE;YAC3C,SAAS,GAAG,CAAC,CAAC;YACd,IAAI,GAAG,IAAI,CAAC;SACb;KACF;IAED,OAAO;QACL,CAAC,EAAE,SAAS;QACZ,IAAI,EAAE,IAAI;KACX,CAAC;AACJ,CAAC;AAjBD,4BAiBC;AAED;;;;;;GAMG;AACH,SAAgB,oBAAoB,CAAI,KAAyB,EAAE,OAA+B;IAChG,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACxC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEtB,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;YACjF,IAAI,GAAG,IAAI,CAAC;SACb;KACF;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAZD,oDAYC"}
|
package/src/lib/array/array.js
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.takeLast = exports.takeFront = exports.mergeArrayIntoArray = exports.mergeArrayOrValueIntoArray = exports.mergeIntoArray = exports.pushElementOntoArray = exports.copyArray = exports.flattenArray = exports.concatArrays = exports.valueAtIndex = exports.lastValue = exports.firstValue = exports.convertToArray = exports.convertMaybeToArray = void 0;
|
|
3
|
+
exports.pickOneRandomly = exports.takeLast = exports.takeFront = exports.mergeArrayIntoArray = exports.mergeArrayOrValueIntoArray = exports.mergeIntoArray = exports.mergeArrays = exports.pushElementOntoArray = exports.copyArray = exports.flattenArray = exports.concatArrays = exports.valueAtIndex = exports.lastValue = exports.firstValue = exports.convertToArray = exports.convertMaybeToArray = void 0;
|
|
4
4
|
// MARK: Functions
|
|
5
5
|
/**
|
|
6
6
|
* Converts the input value to an array containing itself, or returns itself if it is an array.
|
|
@@ -77,12 +77,31 @@ function pushElementOntoArray(target, element, times) {
|
|
|
77
77
|
return target;
|
|
78
78
|
}
|
|
79
79
|
exports.pushElementOntoArray = pushElementOntoArray;
|
|
80
|
+
/**
|
|
81
|
+
* Merges all input arrays into a single array.
|
|
82
|
+
*
|
|
83
|
+
* @param arrays
|
|
84
|
+
* @returns
|
|
85
|
+
*/
|
|
86
|
+
function mergeArrays(arrays) {
|
|
87
|
+
return mergeIntoArray([], ...arrays);
|
|
88
|
+
}
|
|
89
|
+
exports.mergeArrays = mergeArrays;
|
|
90
|
+
/**
|
|
91
|
+
* Merges the input arrays into the target.
|
|
92
|
+
*
|
|
93
|
+
* @param target
|
|
94
|
+
* @param arrays
|
|
95
|
+
* @returns
|
|
96
|
+
*/
|
|
80
97
|
function mergeIntoArray(target, ...arrays) {
|
|
81
98
|
if (target == null) {
|
|
82
99
|
target = [];
|
|
83
100
|
}
|
|
84
101
|
arrays.forEach((array) => {
|
|
85
|
-
|
|
102
|
+
if (array != null) {
|
|
103
|
+
mergeArrayIntoArray(target, array);
|
|
104
|
+
}
|
|
86
105
|
});
|
|
87
106
|
return target;
|
|
88
107
|
}
|
|
@@ -146,4 +165,15 @@ function takeLast(values, maxToTake, keepFromFront = 0) {
|
|
|
146
165
|
return results;
|
|
147
166
|
}
|
|
148
167
|
exports.takeLast = takeLast;
|
|
168
|
+
/**
|
|
169
|
+
* Picks an item randomly from the input array. If the array is empty, returns undefined.
|
|
170
|
+
*
|
|
171
|
+
* @param values
|
|
172
|
+
*/
|
|
173
|
+
function pickOneRandomly(values) {
|
|
174
|
+
const random = Math.random();
|
|
175
|
+
const index = Math.round(random * (values.length - 1));
|
|
176
|
+
return values[index];
|
|
177
|
+
}
|
|
178
|
+
exports.pickOneRandomly = pickOneRandomly;
|
|
149
179
|
//# sourceMappingURL=array.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"array.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.ts"],"names":[],"mappings":";;;AAKA,kBAAkB;AAClB;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAI,YAAoC;IACzE,IAAI,YAAY,IAAI,IAAI,EAAE;QACxB,OAAO,cAAc,CAAC,YAAY,CAAC,CAAC;KACrC;SAAM;QACL,OAAO,EAAE,CAAC;KACX;AACH,CAAC;AAND,kDAMC;AAED;;;;;GAKG;AACH,SAAgB,cAAc,CAAI,YAA6B;IAC7D,OAAO,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;AACrE,CAAC;AAFD,wCAEC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAI,KAAsB;IAClD,OAAO,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAChC,CAAC;AAFD,gCAEC;AAED;;GAEG;AACH,SAAgB,SAAS,CAAI,KAAsB;IACjD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACxB,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;KAChC;SAAM;QACL,OAAO,KAAK,CAAC;KACd;AACH,CAAC;AAND,8BAMC;AAED,SAAgB,YAAY,CAAI,KAAsB,EAAE,KAAa;IACnE,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACxB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;KACrB;SAAM;QACL,OAAO,KAAK,CAAC;KACd;AACH,CAAC;AAND,oCAMC;AAED;;GAEG;AACH,SAAgB,YAAY,CAAI,GAAG,MAAsB;IACvD,OAAO,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAU,CAAC,CAAC;AAC/D,CAAC;AAFD,oCAEC;AAED,SAAgB,YAAY,CAAI,KAAY;IAC1C,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC5G,CAAC;AAFD,oCAEC;AAED,SAAgB,SAAS,CAAI,KAAiB;IAC5C,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAS,CAAC;AACzD,CAAC;AAFD,8BAEC;AAED,SAAgB,oBAAoB,CAAI,MAAW,EAAE,OAAU,EAAE,KAAa;IAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE;QACjC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACtB;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAND,oDAMC;AAED,SAAgB,cAAc,CAAI,MAAkB,EAAE,GAAG,
|
|
1
|
+
{"version":3,"file":"array.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.ts"],"names":[],"mappings":";;;AAKA,kBAAkB;AAClB;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAI,YAAoC;IACzE,IAAI,YAAY,IAAI,IAAI,EAAE;QACxB,OAAO,cAAc,CAAC,YAAY,CAAC,CAAC;KACrC;SAAM;QACL,OAAO,EAAE,CAAC;KACX;AACH,CAAC;AAND,kDAMC;AAED;;;;;GAKG;AACH,SAAgB,cAAc,CAAI,YAA6B;IAC7D,OAAO,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;AACrE,CAAC;AAFD,wCAEC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAI,KAAsB;IAClD,OAAO,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAChC,CAAC;AAFD,gCAEC;AAED;;GAEG;AACH,SAAgB,SAAS,CAAI,KAAsB;IACjD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACxB,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;KAChC;SAAM;QACL,OAAO,KAAK,CAAC;KACd;AACH,CAAC;AAND,8BAMC;AAED,SAAgB,YAAY,CAAI,KAAsB,EAAE,KAAa;IACnE,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACxB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;KACrB;SAAM;QACL,OAAO,KAAK,CAAC;KACd;AACH,CAAC;AAND,oCAMC;AAED;;GAEG;AACH,SAAgB,YAAY,CAAI,GAAG,MAAsB;IACvD,OAAO,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAU,CAAC,CAAC;AAC/D,CAAC;AAFD,oCAEC;AAED,SAAgB,YAAY,CAAI,KAAY;IAC1C,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC5G,CAAC;AAFD,oCAEC;AAED,SAAgB,SAAS,CAAI,KAAiB;IAC5C,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAS,CAAC;AACzD,CAAC;AAFD,8BAEC;AAED,SAAgB,oBAAoB,CAAI,MAAW,EAAE,OAAU,EAAE,KAAa;IAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE;QACjC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACtB;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAND,oDAMC;AAED;;;;;GAKG;AACH,SAAgB,WAAW,CAAI,MAAoB;IACjD,OAAO,cAAc,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,CAAC;AACvC,CAAC;AAFD,kCAEC;AAED;;;;;;GAMG;AACH,SAAgB,cAAc,CAAI,MAAkB,EAAE,GAAG,MAAoB;IAC3E,IAAI,MAAM,IAAI,IAAI,EAAE;QAClB,MAAM,GAAG,EAAE,CAAC;KACb;IAED,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QACvB,IAAI,KAAK,IAAI,IAAI,EAAE;YACjB,mBAAmB,CAAC,MAAO,EAAE,KAAK,CAAC,CAAC;SACrC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC;AAZD,wCAYC;AAED,SAAgB,0BAA0B,CAAI,MAAW,EAAE,KAAsB;IAC/E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACxB,OAAO,mBAAmB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;KAC3C;SAAM;QACL,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,OAAO,MAAM,CAAC;KACf;AACH,CAAC;AAPD,gEAOC;AAED;;;;;;;GAOG;AACH,SAAgB,mBAAmB,CAAI,MAAW,EAAE,KAAU;IAC5D,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC;AAChB,CAAC;AAHD,kDAGC;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CAAI,MAAW,EAAE,SAAiB;IACzD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;AACpC,CAAC;AAFD,8BAEC;AAED;;;;;;;GAOG;AACH,SAAgB,QAAQ,CAAI,MAAW,EAAE,SAAiB,EAAE,gBAAwB,CAAC;IACnF,IAAI,OAAY,CAAC;IAEjB,IAAI,SAAS,GAAG,aAAa,EAAE;QAC7B,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;KAC9D;SAAM,IAAI,aAAa,KAAK,SAAS,EAAE;QACtC,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;KAC1C;SAAM;QACL,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAE7B,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,MAAM,GAAG,CAAC,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC;QAC3F,MAAM,kBAAkB,GAAG,MAAM,CAAC;QAElC,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,oBAAoB,EAAE,kBAAkB,CAAC,CAAC,CAAC;KAC1G;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAjBD,4BAiBC;AAED;;;;GAIG;AACH,SAAgB,eAAe,CAAI,MAAW;IAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACvD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAJD,0CAIC"}
|
|
@@ -0,0 +1,22 @@
|
|
|
1
|
+
import { MakeRandomFunctionInput, RandomNumberFunction } from "../number";
|
|
2
|
+
export interface MakeArray<T> {
|
|
3
|
+
count: number;
|
|
4
|
+
make: (i: number) => T;
|
|
5
|
+
}
|
|
6
|
+
/**
|
|
7
|
+
* Makes an array of values of a certain length using a generator function.
|
|
8
|
+
*
|
|
9
|
+
* @param param0
|
|
10
|
+
* @returns
|
|
11
|
+
*/
|
|
12
|
+
export declare function makeArray<T>({ count, make }: MakeArray<T>): T[];
|
|
13
|
+
export interface MakeArrayRandom<T> extends Omit<MakeArray<T>, 'count'> {
|
|
14
|
+
random: RandomNumberFunction | MakeRandomFunctionInput;
|
|
15
|
+
}
|
|
16
|
+
/**
|
|
17
|
+
* Makes a function that generates arrays of a random length of a specific type.
|
|
18
|
+
*
|
|
19
|
+
* @param config
|
|
20
|
+
* @returns
|
|
21
|
+
*/
|
|
22
|
+
export declare function makeRandomArrayFn<T>(config: MakeArrayRandom<T>): () => T[];
|
|
@@ -0,0 +1,30 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.makeRandomArrayFn = exports.makeArray = void 0;
|
|
4
|
+
const number_1 = require("../number");
|
|
5
|
+
/**
|
|
6
|
+
* Makes an array of values of a certain length using a generator function.
|
|
7
|
+
*
|
|
8
|
+
* @param param0
|
|
9
|
+
* @returns
|
|
10
|
+
*/
|
|
11
|
+
function makeArray({ count, make }) {
|
|
12
|
+
let array = [];
|
|
13
|
+
for (let i = 0; i < count; i += 1) {
|
|
14
|
+
array.push(make(i));
|
|
15
|
+
}
|
|
16
|
+
return array;
|
|
17
|
+
}
|
|
18
|
+
exports.makeArray = makeArray;
|
|
19
|
+
/**
|
|
20
|
+
* Makes a function that generates arrays of a random length of a specific type.
|
|
21
|
+
*
|
|
22
|
+
* @param config
|
|
23
|
+
* @returns
|
|
24
|
+
*/
|
|
25
|
+
function makeRandomArrayFn(config) {
|
|
26
|
+
const randomFn = (typeof config.random === 'function') ? config.random : (0, number_1.makeRandomFunction)(config.random);
|
|
27
|
+
return () => makeArray({ count: Math.abs(randomFn()), make: config.make });
|
|
28
|
+
}
|
|
29
|
+
exports.makeRandomArrayFn = makeRandomArrayFn;
|
|
30
|
+
//# sourceMappingURL=array.make.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"array.make.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.make.ts"],"names":[],"mappings":";;;AAAA,sCAA8F;AAO9F;;;;;GAKG;AACH,SAAgB,SAAS,CAAI,EAAE,KAAK,EAAE,IAAI,EAAgB;IACxD,IAAI,KAAK,GAAQ,EAAE,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE;QACjC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;KACrB;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AARD,8BAQC;AAMD;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAI,MAA0B;IAC7D,MAAM,QAAQ,GAAG,CAAC,OAAO,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,IAAA,2BAAkB,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC3G,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;AAC7E,CAAC;AAHD,8CAGC"}
|
|
@@ -15,7 +15,7 @@ export declare function reduceNumbersFn<D extends number>(reduceFn: ((a: number,
|
|
|
15
15
|
* @param param0
|
|
16
16
|
* @returns
|
|
17
17
|
*/
|
|
18
|
-
export declare function range(
|
|
18
|
+
export declare function range(input: number | {
|
|
19
19
|
start?: number;
|
|
20
20
|
end: number;
|
|
21
21
|
}): number[];
|
|
@@ -47,8 +47,19 @@ exports.reduceNumbersFn = reduceNumbersFn;
|
|
|
47
47
|
* @param param0
|
|
48
48
|
* @returns
|
|
49
49
|
*/
|
|
50
|
-
function range(
|
|
50
|
+
function range(input) {
|
|
51
|
+
var _a;
|
|
51
52
|
const range = [];
|
|
53
|
+
let start;
|
|
54
|
+
let end;
|
|
55
|
+
if (typeof input === 'number') {
|
|
56
|
+
start = 0;
|
|
57
|
+
end = input;
|
|
58
|
+
}
|
|
59
|
+
else {
|
|
60
|
+
start = (_a = input.start) !== null && _a !== void 0 ? _a : 0;
|
|
61
|
+
end = input.end;
|
|
62
|
+
}
|
|
52
63
|
for (let i = start; i < end; i += 1) {
|
|
53
64
|
range.push(i);
|
|
54
65
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"array.number.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.number.ts"],"names":[],"mappings":";;;AACA,SAAgB,oBAAoB,CAAC,KAAe,EAAE,eAAwB;IAC5E,OAAO,sBAAsB,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAFD,oDAEC;AAED,SAAgB,sBAAsB,CAAC,eAAwB;IAC7D,OAAO,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;AACpE,CAAC;AAFD,wDAEC;AAED,SAAgB,oBAAoB,CAAC,KAAe,EAAE,eAAwB;IAC5E,OAAO,sBAAsB,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAFD,oDAEC;AAED,SAAgB,sBAAsB,CAAC,eAAwB;IAC7D,OAAO,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;AACpE,CAAC;AAFD,wDAEC;AAED,SAAgB,oBAAoB,CAAC,KAAe,EAAE,eAAe,GAAG,CAAC;IACvE,OAAO,sBAAsB,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAFD,oDAEC;AAED,SAAgB,sBAAsB,CAAC,eAAe,GAAG,CAAC;IACxD,OAAO,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,CAAC;AAC3D,CAAC;AAFD,wDAEC;AAED,SAAgB,aAAa,CAAC,QAA4C,EAAE,KAAe,EAAE,eAAwB;IACnH,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;QACtB,OAAO,eAAe,CAAC;KACxB;SAAM;QACL,OAAO,eAAe,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;KAC1D;AACH,CAAC;AAND,sCAMC;AAID,SAAgB,eAAe,CAAmB,QAA4C,EAAE,eAAmB;IACjH,MAAM,GAAG,GAAG,CAAC,KAAe,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACxD,OAAO,CAAC,KAAe,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC;AAC5E,CAAC;AAHD,0CAGC;AAED;;;;;;;GAOG;AACH,SAAgB,KAAK,CAAC,
|
|
1
|
+
{"version":3,"file":"array.number.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.number.ts"],"names":[],"mappings":";;;AACA,SAAgB,oBAAoB,CAAC,KAAe,EAAE,eAAwB;IAC5E,OAAO,sBAAsB,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAFD,oDAEC;AAED,SAAgB,sBAAsB,CAAC,eAAwB;IAC7D,OAAO,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;AACpE,CAAC;AAFD,wDAEC;AAED,SAAgB,oBAAoB,CAAC,KAAe,EAAE,eAAwB;IAC5E,OAAO,sBAAsB,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAFD,oDAEC;AAED,SAAgB,sBAAsB,CAAC,eAAwB;IAC7D,OAAO,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;AACpE,CAAC;AAFD,wDAEC;AAED,SAAgB,oBAAoB,CAAC,KAAe,EAAE,eAAe,GAAG,CAAC;IACvE,OAAO,sBAAsB,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAFD,oDAEC;AAED,SAAgB,sBAAsB,CAAC,eAAe,GAAG,CAAC;IACxD,OAAO,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,CAAC;AAC3D,CAAC;AAFD,wDAEC;AAED,SAAgB,aAAa,CAAC,QAA4C,EAAE,KAAe,EAAE,eAAwB;IACnH,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;QACtB,OAAO,eAAe,CAAC;KACxB;SAAM;QACL,OAAO,eAAe,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;KAC1D;AACH,CAAC;AAND,sCAMC;AAID,SAAgB,eAAe,CAAmB,QAA4C,EAAE,eAAmB;IACjH,MAAM,GAAG,GAAG,CAAC,KAAe,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACxD,OAAO,CAAC,KAAe,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC;AAC5E,CAAC;AAHD,0CAGC;AAED;;;;;;;GAOG;AACH,SAAgB,KAAK,CAAC,KAA+C;;IACnE,MAAM,KAAK,GAAG,EAAE,CAAC;IAEjB,IAAI,KAAa,CAAC;IAClB,IAAI,GAAW,CAAC;IAEhB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QAC7B,KAAK,GAAG,CAAC,CAAC;QACV,GAAG,GAAG,KAAK,CAAC;KACb;SAAM;QACL,KAAK,GAAG,MAAA,KAAK,CAAC,KAAK,mCAAI,CAAC,CAAC;QACzB,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC;KACjB;IAED,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;QACnC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACf;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAnBD,sBAmBC"}
|
|
@@ -16,5 +16,6 @@ export declare function filterValuesFromSet<T>(values: T[], set: Set<T>, exclude
|
|
|
16
16
|
/**
|
|
17
17
|
* Returns true if the input array contains any value from the second array.
|
|
18
18
|
*/
|
|
19
|
-
export declare function containsAnyValue<T>(values: T
|
|
20
|
-
export declare function
|
|
19
|
+
export declare function containsAnyValue<T>(values: Iterable<T>, valuesToFind: Iterable<T>): boolean;
|
|
20
|
+
export declare function containsAnyValueFromSet<T>(values: Iterable<T>, valuesToFind: Set<T>): boolean;
|
|
21
|
+
export declare function setContainsAnyValue<T>(valuesSet: Set<T>, valuesToFind: Iterable<T>): boolean;
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.setContainsAnyValue = exports.containsAnyValue = exports.filterValuesFromSet = exports.excludeValuesFromSet = exports.excludeValuesFromArray = exports.keepValuesFromSet = exports.keepValuesFromArray = exports.symmetricDifferenceKeysSet = exports.symmetricDifferenceKeys = exports.hasDifferentStringsNoCase = exports.hasDifferentValues = exports.flattenArrayToSet = void 0;
|
|
3
|
+
exports.setContainsAnyValue = exports.containsAnyValueFromSet = exports.containsAnyValue = exports.filterValuesFromSet = exports.excludeValuesFromSet = exports.excludeValuesFromArray = exports.keepValuesFromSet = exports.keepValuesFromArray = exports.symmetricDifferenceKeysSet = exports.symmetricDifferenceKeys = exports.hasDifferentStringsNoCase = exports.hasDifferentValues = exports.flattenArrayToSet = void 0;
|
|
4
4
|
const extra_set_1 = require("extra-set");
|
|
5
5
|
const array_1 = require("./array");
|
|
6
6
|
const string_1 = require("../string");
|
|
@@ -54,11 +54,15 @@ exports.filterValuesFromSet = filterValuesFromSet;
|
|
|
54
54
|
*/
|
|
55
55
|
function containsAnyValue(values, valuesToFind) {
|
|
56
56
|
const set = new Set(valuesToFind);
|
|
57
|
-
return
|
|
57
|
+
return containsAnyValueFromSet(values, set);
|
|
58
58
|
}
|
|
59
59
|
exports.containsAnyValue = containsAnyValue;
|
|
60
|
-
function
|
|
61
|
-
return (
|
|
60
|
+
function containsAnyValueFromSet(values, valuesToFind) {
|
|
61
|
+
return setContainsAnyValue(valuesToFind, values);
|
|
62
|
+
}
|
|
63
|
+
exports.containsAnyValueFromSet = containsAnyValueFromSet;
|
|
64
|
+
function setContainsAnyValue(valuesSet, valuesToFind) {
|
|
65
|
+
return (valuesSet) ? Array.from(valuesToFind).findIndex((x) => valuesSet.has(x)) !== -1 : false;
|
|
62
66
|
}
|
|
63
67
|
exports.setContainsAnyValue = setContainsAnyValue;
|
|
64
68
|
//# sourceMappingURL=array.set.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"array.set.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.set.ts"],"names":[],"mappings":";;;AACA,yCAAgD;AAChD,mCAAuC;AACvC,sCAAkD;AAGlD,kBAAkB;AAClB,SAAgB,iBAAiB,CAAI,KAAY;IAC/C,OAAO,IAAI,GAAG,CAAC,IAAA,oBAAY,EAAC,KAAK,CAAC,CAAC,CAAC;AACtC,CAAC;AAFD,8CAEC;AAED,SAAgB,kBAAkB,CAAI,CAAM,EAAE,CAAM;IAClD,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,IAAA,+BAAmB,EAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;AACvF,CAAC;AAFD,gDAEC;AAED,SAAgB,yBAAyB,CAAC,CAAW,EAAE,CAAW;IAChE,OAAO,kBAAkB,CAAC,CAAC,CAAC,GAAG,CAAC,8BAAqB,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,8BAAqB,CAAC,CAAC,CAAC;AACxF,CAAC;AAFD,8DAEC;AAED,SAAgB,uBAAuB,CAAwC,CAAa,EAAE,CAAa;IACzG,OAAO,0BAA0B,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC;AAFD,0DAEC;AAED,SAAgB,0BAA0B,CAAI,CAAgB,EAAE,CAAgB;IAC9E,OAAO,KAAK,CAAC,IAAI,CAAC,IAAA,+BAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAFD,gEAEC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAAI,MAAW,EAAE,WAAgB;IAClE,OAAO,iBAAiB,CAAC,MAAM,EAAE,IAAI,GAAG,CAAI,WAAW,CAAC,CAAC,CAAC;AAC5D,CAAC;AAFD,kDAEC;AAED,SAAgB,iBAAiB,CAAI,MAAW,EAAE,GAAW;IAC3D,OAAO,mBAAmB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AACjD,CAAC;AAFD,8CAEC;AAED,SAAgB,sBAAsB,CAAI,MAAW,EAAE,WAAgB;IACrE,OAAO,oBAAoB,CAAC,MAAM,EAAE,IAAI,GAAG,CAAI,WAAW,CAAC,CAAC,CAAC;AAC/D,CAAC;AAFD,wDAEC;AAED,SAAgB,oBAAoB,CAAI,MAAW,EAAE,GAAW;IAC9D,OAAO,mBAAmB,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;AAChD,CAAC;AAFD,oDAEC;AAED,SAAgB,mBAAmB,CAAI,MAAW,EAAE,GAAW,EAAE,OAAO,GAAG,KAAK;IAC9E,MAAM,QAAQ,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAI,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AACjC,CAAC;AAHD,kDAGC;AAED;;GAEG;AACH,SAAgB,gBAAgB,CAAI,
|
|
1
|
+
{"version":3,"file":"array.set.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.set.ts"],"names":[],"mappings":";;;AACA,yCAAgD;AAChD,mCAAuC;AACvC,sCAAkD;AAGlD,kBAAkB;AAClB,SAAgB,iBAAiB,CAAI,KAAY;IAC/C,OAAO,IAAI,GAAG,CAAC,IAAA,oBAAY,EAAC,KAAK,CAAC,CAAC,CAAC;AACtC,CAAC;AAFD,8CAEC;AAED,SAAgB,kBAAkB,CAAI,CAAM,EAAE,CAAM;IAClD,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,IAAA,+BAAmB,EAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;AACvF,CAAC;AAFD,gDAEC;AAED,SAAgB,yBAAyB,CAAC,CAAW,EAAE,CAAW;IAChE,OAAO,kBAAkB,CAAC,CAAC,CAAC,GAAG,CAAC,8BAAqB,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,8BAAqB,CAAC,CAAC,CAAC;AACxF,CAAC;AAFD,8DAEC;AAED,SAAgB,uBAAuB,CAAwC,CAAa,EAAE,CAAa;IACzG,OAAO,0BAA0B,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC;AAFD,0DAEC;AAED,SAAgB,0BAA0B,CAAI,CAAgB,EAAE,CAAgB;IAC9E,OAAO,KAAK,CAAC,IAAI,CAAC,IAAA,+BAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAFD,gEAEC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAAI,MAAW,EAAE,WAAgB;IAClE,OAAO,iBAAiB,CAAC,MAAM,EAAE,IAAI,GAAG,CAAI,WAAW,CAAC,CAAC,CAAC;AAC5D,CAAC;AAFD,kDAEC;AAED,SAAgB,iBAAiB,CAAI,MAAW,EAAE,GAAW;IAC3D,OAAO,mBAAmB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AACjD,CAAC;AAFD,8CAEC;AAED,SAAgB,sBAAsB,CAAI,MAAW,EAAE,WAAgB;IACrE,OAAO,oBAAoB,CAAC,MAAM,EAAE,IAAI,GAAG,CAAI,WAAW,CAAC,CAAC,CAAC;AAC/D,CAAC;AAFD,wDAEC;AAED,SAAgB,oBAAoB,CAAI,MAAW,EAAE,GAAW;IAC9D,OAAO,mBAAmB,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;AAChD,CAAC;AAFD,oDAEC;AAED,SAAgB,mBAAmB,CAAI,MAAW,EAAE,GAAW,EAAE,OAAO,GAAG,KAAK;IAC9E,MAAM,QAAQ,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAI,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AACjC,CAAC;AAHD,kDAGC;AAED;;GAEG;AACH,SAAgB,gBAAgB,CAAI,MAAmB,EAAE,YAAyB;IAChF,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;IAClC,OAAO,uBAAuB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC9C,CAAC;AAHD,4CAGC;AAED,SAAgB,uBAAuB,CAAI,MAAmB,EAAE,YAAoB;IAClF,OAAO,mBAAmB,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;AACnD,CAAC;AAFD,0DAEC;AAED,SAAgB,mBAAmB,CAAI,SAAiB,EAAE,YAAyB;IACjF,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAClG,CAAC;AAFD,kDAEC"}
|
package/src/lib/array/index.d.ts
CHANGED
package/src/lib/array/index.js
CHANGED
|
@@ -3,7 +3,9 @@ Object.defineProperty(exports, "__esModule", { value: true });
|
|
|
3
3
|
const tslib_1 = require("tslib");
|
|
4
4
|
(0, tslib_1.__exportStar)(require("./array.boolean"), exports);
|
|
5
5
|
(0, tslib_1.__exportStar)(require("./array.filter"), exports);
|
|
6
|
+
(0, tslib_1.__exportStar)(require("./array.index"), exports);
|
|
6
7
|
(0, tslib_1.__exportStar)(require("./array.limit"), exports);
|
|
8
|
+
(0, tslib_1.__exportStar)(require("./array.make"), exports);
|
|
7
9
|
(0, tslib_1.__exportStar)(require("./array.map"), exports);
|
|
8
10
|
(0, tslib_1.__exportStar)(require("./array.number"), exports);
|
|
9
11
|
(0, tslib_1.__exportStar)(require("./array.set"), exports);
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/index.ts"],"names":[],"mappings":";;;AAAA,+DAAgC;AAChC,8DAA+B;AAC/B,6DAA8B;AAC9B,2DAA4B;AAC5B,8DAA+B;AAC/B,2DAA4B;AAC5B,8DAA+B;AAC/B,uDAAwB;AACxB,8DAA+B;AAC/B,6DAA8B"}
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/index.ts"],"names":[],"mappings":";;;AAAA,+DAAgC;AAChC,8DAA+B;AAC/B,6DAA8B;AAC9B,6DAA8B;AAC9B,4DAA6B;AAC7B,2DAA4B;AAC5B,8DAA+B;AAC/B,2DAA4B;AAC5B,8DAA+B;AAC/B,uDAAwB;AACxB,8DAA+B;AAC/B,6DAA8B"}
|
|
@@ -11,7 +11,7 @@ class PropertyDescriptorUtility {
|
|
|
11
11
|
return function (value) {
|
|
12
12
|
if (assertValueFn(value)) {
|
|
13
13
|
const mappedValue = map(value);
|
|
14
|
-
setValue.call(this, mappedValue);
|
|
14
|
+
setValue.call(this, mappedValue);
|
|
15
15
|
}
|
|
16
16
|
else {
|
|
17
17
|
const error = { target, propertyKey, options };
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"assertion.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/assertion/assertion.ts"],"names":[],"mappings":";;;AACA,iDAAmE;AAqBnE,MAAa,yBAAyB;IAEpC,MAAM,CAAC,+BAA+B,CAAI,aAAwC,EAAE,OAA0C,EAAE,cAAiD;QAE/K,gBAAgB;QAChB,OAAO,mCACF,cAAc,GACd,OAAO,CACX,CAAC;QAEF,OAAO,IAAI,CAAC,oCAAoC,CAAI,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,EAAE,EAAE;YACxF,MAAM,GAAG,GAAG,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,GAAG,KAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAEvC,OAAO,UAAqB,KAAQ;gBAClC,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE;oBACxB,MAAM,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC/B,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC
|
|
1
|
+
{"version":3,"file":"assertion.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/assertion/assertion.ts"],"names":[],"mappings":";;;AACA,iDAAmE;AAqBnE,MAAa,yBAAyB;IAEpC,MAAM,CAAC,+BAA+B,CAAI,aAAwC,EAAE,OAA0C,EAAE,cAAiD;QAE/K,gBAAgB;QAChB,OAAO,mCACF,cAAc,GACd,OAAO,CACX,CAAC;QAEF,OAAO,IAAI,CAAC,oCAAoC,CAAI,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,EAAE,EAAE;YACxF,MAAM,GAAG,GAAG,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,GAAG,KAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAEvC,OAAO,UAAqB,KAAQ;gBAClC,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE;oBACxB,MAAM,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC/B,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;iBAClC;qBAAM;oBACL,MAAM,KAAK,GAAmB,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;oBAC/D,gCAAiB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;iBACjC;YACH,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,oCAAoC,CAAI,yBAAgE;QAC7G,MAAM,WAAW,GAAG,CAAC,MAAc,EAAE,WAAmB,EAAE,UAAsC,EAAE,EAAE;YAClG,IAAI,UAAU,CAAC,GAAG,EAAE;gBAClB,MAAM,QAAQ,GAA2B,UAAU,CAAC,GAAG,CAAC;gBAExD,wCAAwC;gBACxC,UAAU,CAAC,GAAG,GAAG,yBAAyB,CAAC;oBACzC,MAAM;oBACN,WAAW;oBACX,UAAU;oBACV,QAAQ;iBACT,CAAC,CAAC;aACJ;QACH,CAAC,CAAC;QACF,OAAO,WAAW,CAAC;IACrB,CAAC;CAEF;AA1CD,8DA0CC"}
|
package/src/lib/date/date.d.ts
CHANGED
|
@@ -43,6 +43,7 @@ export declare type UnixDateTimeNumber = number;
|
|
|
43
43
|
* A date or a unix timestamp
|
|
44
44
|
*/
|
|
45
45
|
export declare type DateOrUnixDateTimeNumber = Date | UnixDateTimeNumber;
|
|
46
|
+
export declare type Milliseconds = number;
|
|
46
47
|
export declare type Seconds = number;
|
|
47
48
|
export declare type Minutes = number;
|
|
48
49
|
export declare type Hours = number;
|
package/src/lib/date/date.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"date.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/date/date.ts"],"names":[],"mappings":";;;AAmBa,QAAA,mBAAmB,GAAG,KAAK,CAAC;AAazC,SAAgB,6BAA6B,CAAC,QAA+B;IAC3E,OAAO,CAAC,QAAQ,IAAI,IAAI,IAAI,QAAQ,KAAK,2BAAmB,CAAC,CAAC;AAChE,CAAC;AAFD,sEAEC;
|
|
1
|
+
{"version":3,"file":"date.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/date/date.ts"],"names":[],"mappings":";;;AAmBa,QAAA,mBAAmB,GAAG,KAAK,CAAC;AAazC,SAAgB,6BAA6B,CAAC,QAA+B;IAC3E,OAAO,CAAC,QAAQ,IAAI,IAAI,IAAI,QAAQ,KAAK,2BAAmB,CAAC,CAAC;AAChE,CAAC;AAFD,sEAEC;AA8BY,QAAA,cAAc,GAAG,IAAI,CAAC;AACtB,QAAA,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;AACzB,QAAA,UAAU,GAAG,oBAAY,GAAG,EAAE,CAAC"}
|
|
@@ -3,3 +3,11 @@ export interface Filter<F> {
|
|
|
3
3
|
}
|
|
4
4
|
export interface OptionalFilter<F> extends Partial<Filter<F>> {
|
|
5
5
|
}
|
|
6
|
+
/**
|
|
7
|
+
* Used to invert a filter function by returning the opposite of what it returns.
|
|
8
|
+
*
|
|
9
|
+
* @param filterFn
|
|
10
|
+
* @param invert whether or not to apply the inversion.
|
|
11
|
+
* @returns
|
|
12
|
+
*/
|
|
13
|
+
export declare function invertFilter<F extends (((value: any, index: number) => boolean) | ((value: any) => boolean) | (() => boolean)) = () => boolean>(filterFn: F, invert?: boolean): F;
|
package/src/lib/filter/filter.js
CHANGED
|
@@ -1,3 +1,23 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.invertFilter = void 0;
|
|
4
|
+
/**
|
|
5
|
+
* Used to invert a filter function by returning the opposite of what it returns.
|
|
6
|
+
*
|
|
7
|
+
* @param filterFn
|
|
8
|
+
* @param invert whether or not to apply the inversion.
|
|
9
|
+
* @returns
|
|
10
|
+
*/
|
|
11
|
+
function invertFilter(filterFn, invert = true) {
|
|
12
|
+
if (invert) {
|
|
13
|
+
return function () {
|
|
14
|
+
const result = filterFn.apply(undefined, arguments);
|
|
15
|
+
return !result;
|
|
16
|
+
};
|
|
17
|
+
}
|
|
18
|
+
else {
|
|
19
|
+
return filterFn;
|
|
20
|
+
}
|
|
21
|
+
}
|
|
22
|
+
exports.invertFilter = invertFilter;
|
|
3
23
|
//# sourceMappingURL=filter.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"filter.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/filter/filter.ts"],"names":[],"mappings":""}
|
|
1
|
+
{"version":3,"file":"filter.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/filter/filter.ts"],"names":[],"mappings":";;;AAOA;;;;;;GAMG;AACH,SAAgB,YAAY,CAAqH,QAAW,EAAE,MAAM,GAAG,IAAI;IACzK,IAAI,MAAM,EAAE;QACV,OAAO;YACL,MAAM,MAAM,GAAa,QAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACtE,OAAO,CAAC,MAAM,CAAC;QACjB,CAAM,CAAC;KACR;SAAM;QACL,OAAO,QAAQ,CAAC;KACjB;AACH,CAAC;AATD,oCASC"}
|