@monstermann/set 0.0.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/LICENSE +21 -0
- package/README.md +9 -0
- package/dist/Set/add.d.ts +28 -0
- package/dist/Set/add.js +32 -0
- package/dist/Set/addAll.d.ts +28 -0
- package/dist/Set/addAll.js +35 -0
- package/dist/Set/addOr.d.ts +26 -0
- package/dist/Set/addOr.js +32 -0
- package/dist/Set/addOrElse.d.ts +33 -0
- package/dist/Set/addOrElse.js +39 -0
- package/dist/Set/addOrThrow.d.ts +26 -0
- package/dist/Set/addOrThrow.js +32 -0
- package/dist/Set/clone.d.ts +26 -0
- package/dist/Set/clone.js +27 -0
- package/dist/Set/compact.d.ts +31 -0
- package/dist/Set/compact.js +33 -0
- package/dist/Set/difference.d.ts +26 -0
- package/dist/Set/difference.js +37 -0
- package/dist/Set/forEach.d.ts +29 -0
- package/dist/Set/forEach.js +30 -0
- package/dist/Set/has.d.ts +26 -0
- package/dist/Set/has.js +28 -0
- package/dist/Set/hasAll.d.ts +26 -0
- package/dist/Set/hasAll.js +29 -0
- package/dist/Set/hasAny.d.ts +26 -0
- package/dist/Set/hasAny.js +29 -0
- package/dist/Set/hasNone.d.ts +26 -0
- package/dist/Set/hasNone.js +29 -0
- package/dist/Set/index.d.ts +38 -0
- package/dist/Set/index.js +67 -0
- package/dist/Set/internals/types.d.ts +4 -0
- package/dist/Set/intersection.d.ts +26 -0
- package/dist/Set/intersection.js +38 -0
- package/dist/Set/isDisjointFrom.d.ts +26 -0
- package/dist/Set/isDisjointFrom.js +29 -0
- package/dist/Set/isEmpty.d.ts +26 -0
- package/dist/Set/isEmpty.js +28 -0
- package/dist/Set/isSet.d.ts +28 -0
- package/dist/Set/isSet.js +30 -0
- package/dist/Set/isShallowEqual.d.ts +26 -0
- package/dist/Set/isShallowEqual.js +31 -0
- package/dist/Set/isSubsetOf.d.ts +26 -0
- package/dist/Set/isSubsetOf.js +30 -0
- package/dist/Set/isSupersetOf.d.ts +26 -0
- package/dist/Set/isSupersetOf.js +30 -0
- package/dist/Set/mapEach.d.ts +35 -0
- package/dist/Set/mapEach.js +42 -0
- package/dist/Set/remove.d.ts +28 -0
- package/dist/Set/remove.js +32 -0
- package/dist/Set/removeAll.d.ts +28 -0
- package/dist/Set/removeAll.js +35 -0
- package/dist/Set/removeOr.d.ts +26 -0
- package/dist/Set/removeOr.js +32 -0
- package/dist/Set/removeOrElse.d.ts +33 -0
- package/dist/Set/removeOrElse.js +39 -0
- package/dist/Set/removeOrThrow.d.ts +26 -0
- package/dist/Set/removeOrThrow.js +32 -0
- package/dist/Set/size.d.ts +26 -0
- package/dist/Set/size.js +28 -0
- package/dist/Set/symmetricDifference.d.ts +26 -0
- package/dist/Set/symmetricDifference.js +45 -0
- package/dist/Set/toArray.d.ts +26 -0
- package/dist/Set/toArray.js +28 -0
- package/dist/Set/union.d.ts +26 -0
- package/dist/Set/union.js +36 -0
- package/dist/index.d.ts +2 -0
- package/dist/index.js +3 -0
- package/package.json +38 -0
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
The MIT License (MIT)
|
|
2
|
+
|
|
3
|
+
Copyright (c) Michael Ostermann
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
package/README.md
ADDED
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
//#region src/Set/add.d.ts
|
|
2
|
+
/**
|
|
3
|
+
* ```ts
|
|
4
|
+
* function Set.add(target, value)
|
|
5
|
+
* ```
|
|
6
|
+
*
|
|
7
|
+
* ```ts
|
|
8
|
+
* import { Set } from "@monstermann/set";
|
|
9
|
+
*
|
|
10
|
+
* Set.add(Set.create([1, 2]), 3); // Set([1, 2, 3])
|
|
11
|
+
* Set.add(Set.create([1, 2]), 2); // Set([1, 2])
|
|
12
|
+
* ```
|
|
13
|
+
*
|
|
14
|
+
* ```ts
|
|
15
|
+
* import { Set } from "@monstermann/set";
|
|
16
|
+
*
|
|
17
|
+
* pipe(Set.create([1, 2]), Set.add(3)); // Set([1, 2, 3])
|
|
18
|
+
* pipe(Set.create([1, 2]), Set.add(2)); // Set([1, 2])
|
|
19
|
+
* ```
|
|
20
|
+
*/
|
|
21
|
+
declare const add: {
|
|
22
|
+
<T>(value: NoInfer<T>): (target: Set<T>) => Set<T>;
|
|
23
|
+
<T>(value: NoInfer<T>): (target: ReadonlySet<T>) => ReadonlySet<T>;
|
|
24
|
+
<T>(target: Set<T>, value: NoInfer<T>): Set<T>;
|
|
25
|
+
<T>(target: ReadonlySet<T>, value: NoInfer<T>): ReadonlySet<T>;
|
|
26
|
+
};
|
|
27
|
+
//#endregion
|
|
28
|
+
export { add };
|
package/dist/Set/add.js
ADDED
|
@@ -0,0 +1,32 @@
|
|
|
1
|
+
import { dfdlT } from "@monstermann/dfdl";
|
|
2
|
+
import { cloneSet } from "@monstermann/remmi";
|
|
3
|
+
|
|
4
|
+
//#region src/Set/add.ts
|
|
5
|
+
/**
|
|
6
|
+
* ```ts
|
|
7
|
+
* function Set.add(target, value)
|
|
8
|
+
* ```
|
|
9
|
+
*
|
|
10
|
+
* ```ts
|
|
11
|
+
* import { Set } from "@monstermann/set";
|
|
12
|
+
*
|
|
13
|
+
* Set.add(Set.create([1, 2]), 3); // Set([1, 2, 3])
|
|
14
|
+
* Set.add(Set.create([1, 2]), 2); // Set([1, 2])
|
|
15
|
+
* ```
|
|
16
|
+
*
|
|
17
|
+
* ```ts
|
|
18
|
+
* import { Set } from "@monstermann/set";
|
|
19
|
+
*
|
|
20
|
+
* pipe(Set.create([1, 2]), Set.add(3)); // Set([1, 2, 3])
|
|
21
|
+
* pipe(Set.create([1, 2]), Set.add(2)); // Set([1, 2])
|
|
22
|
+
* ```
|
|
23
|
+
*/
|
|
24
|
+
const add = dfdlT((target, value) => {
|
|
25
|
+
if (target.has(value)) return target;
|
|
26
|
+
target = cloneSet(target);
|
|
27
|
+
target.add(value);
|
|
28
|
+
return target;
|
|
29
|
+
}, 2);
|
|
30
|
+
|
|
31
|
+
//#endregion
|
|
32
|
+
export { add };
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
//#region src/Set/addAll.d.ts
|
|
2
|
+
/**
|
|
3
|
+
* ```ts
|
|
4
|
+
* function Set.addAll(target, values)
|
|
5
|
+
* ```
|
|
6
|
+
*
|
|
7
|
+
* ```ts
|
|
8
|
+
* import { Set } from "@monstermann/set";
|
|
9
|
+
*
|
|
10
|
+
* Set.addAll(Set.create([1, 2]), [3, 4]); // Set([1, 2, 3, 4])
|
|
11
|
+
* Set.addAll(Set.create([1, 2]), [2, 3]); // Set([1, 2, 3])
|
|
12
|
+
* ```
|
|
13
|
+
*
|
|
14
|
+
* ```ts
|
|
15
|
+
* import { Set } from "@monstermann/set";
|
|
16
|
+
*
|
|
17
|
+
* pipe(Set.create([1, 2]), Set.addAll([3, 4])); // Set([1, 2, 3, 4])
|
|
18
|
+
* pipe(Set.create([1, 2]), Set.addAll([2, 3])); // Set([1, 2, 3])
|
|
19
|
+
* ```
|
|
20
|
+
*/
|
|
21
|
+
declare const addAll: {
|
|
22
|
+
<T>(values: Iterable<NoInfer<T>>): (target: Set<T>) => Set<T>;
|
|
23
|
+
<T>(values: Iterable<NoInfer<T>>): (target: ReadonlySet<T>) => ReadonlySet<T>;
|
|
24
|
+
<T>(target: Set<T>, values: Iterable<NoInfer<T>>): Set<T>;
|
|
25
|
+
<T>(target: ReadonlySet<T>, values: Iterable<NoInfer<T>>): ReadonlySet<T>;
|
|
26
|
+
};
|
|
27
|
+
//#endregion
|
|
28
|
+
export { addAll };
|
|
@@ -0,0 +1,35 @@
|
|
|
1
|
+
import { dfdlT } from "@monstermann/dfdl";
|
|
2
|
+
import { cloneSet } from "@monstermann/remmi";
|
|
3
|
+
|
|
4
|
+
//#region src/Set/addAll.ts
|
|
5
|
+
/**
|
|
6
|
+
* ```ts
|
|
7
|
+
* function Set.addAll(target, values)
|
|
8
|
+
* ```
|
|
9
|
+
*
|
|
10
|
+
* ```ts
|
|
11
|
+
* import { Set } from "@monstermann/set";
|
|
12
|
+
*
|
|
13
|
+
* Set.addAll(Set.create([1, 2]), [3, 4]); // Set([1, 2, 3, 4])
|
|
14
|
+
* Set.addAll(Set.create([1, 2]), [2, 3]); // Set([1, 2, 3])
|
|
15
|
+
* ```
|
|
16
|
+
*
|
|
17
|
+
* ```ts
|
|
18
|
+
* import { Set } from "@monstermann/set";
|
|
19
|
+
*
|
|
20
|
+
* pipe(Set.create([1, 2]), Set.addAll([3, 4])); // Set([1, 2, 3, 4])
|
|
21
|
+
* pipe(Set.create([1, 2]), Set.addAll([2, 3])); // Set([1, 2, 3])
|
|
22
|
+
* ```
|
|
23
|
+
*/
|
|
24
|
+
const addAll = dfdlT((target, values) => {
|
|
25
|
+
let result;
|
|
26
|
+
for (const value of values) {
|
|
27
|
+
if (target.has(value)) continue;
|
|
28
|
+
result ??= cloneSet(target);
|
|
29
|
+
result.add(value);
|
|
30
|
+
}
|
|
31
|
+
return result ?? target;
|
|
32
|
+
}, 2);
|
|
33
|
+
|
|
34
|
+
//#endregion
|
|
35
|
+
export { addAll };
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
//#region src/Set/addOr.d.ts
|
|
2
|
+
/**
|
|
3
|
+
* ```ts
|
|
4
|
+
* function Set.addOr(target, value, or)
|
|
5
|
+
* ```
|
|
6
|
+
*
|
|
7
|
+
* ```ts
|
|
8
|
+
* import { Set } from "@monstermann/set";
|
|
9
|
+
*
|
|
10
|
+
* Set.addOr(Set.create([1, 2]), 3, null); // Set([1, 2, 3])
|
|
11
|
+
* Set.addOr(Set.create([1, 2]), 2, null); // null
|
|
12
|
+
* ```
|
|
13
|
+
*
|
|
14
|
+
* ```ts
|
|
15
|
+
* import { Set } from "@monstermann/set";
|
|
16
|
+
*
|
|
17
|
+
* pipe(Set.create([1, 2]), Set.addOr(3, null)); // Set([1, 2, 3])
|
|
18
|
+
* pipe(Set.create([1, 2]), Set.addOr(2, null)); // null
|
|
19
|
+
* ```
|
|
20
|
+
*/
|
|
21
|
+
declare const addOr: {
|
|
22
|
+
<T, U>(value: NoInfer<T>, or: U): (target: ReadonlySet<T>) => Set<T> | U;
|
|
23
|
+
<T, U>(target: ReadonlySet<T>, value: NoInfer<T>, or: U): Set<T> | U;
|
|
24
|
+
};
|
|
25
|
+
//#endregion
|
|
26
|
+
export { addOr };
|
|
@@ -0,0 +1,32 @@
|
|
|
1
|
+
import { dfdlT } from "@monstermann/dfdl";
|
|
2
|
+
import { cloneSet } from "@monstermann/remmi";
|
|
3
|
+
|
|
4
|
+
//#region src/Set/addOr.ts
|
|
5
|
+
/**
|
|
6
|
+
* ```ts
|
|
7
|
+
* function Set.addOr(target, value, or)
|
|
8
|
+
* ```
|
|
9
|
+
*
|
|
10
|
+
* ```ts
|
|
11
|
+
* import { Set } from "@monstermann/set";
|
|
12
|
+
*
|
|
13
|
+
* Set.addOr(Set.create([1, 2]), 3, null); // Set([1, 2, 3])
|
|
14
|
+
* Set.addOr(Set.create([1, 2]), 2, null); // null
|
|
15
|
+
* ```
|
|
16
|
+
*
|
|
17
|
+
* ```ts
|
|
18
|
+
* import { Set } from "@monstermann/set";
|
|
19
|
+
*
|
|
20
|
+
* pipe(Set.create([1, 2]), Set.addOr(3, null)); // Set([1, 2, 3])
|
|
21
|
+
* pipe(Set.create([1, 2]), Set.addOr(2, null)); // null
|
|
22
|
+
* ```
|
|
23
|
+
*/
|
|
24
|
+
const addOr = dfdlT((target, value, or) => {
|
|
25
|
+
if (target.has(value)) return or;
|
|
26
|
+
const result = cloneSet(target);
|
|
27
|
+
result.add(value);
|
|
28
|
+
return result;
|
|
29
|
+
}, 3);
|
|
30
|
+
|
|
31
|
+
//#endregion
|
|
32
|
+
export { addOr };
|
|
@@ -0,0 +1,33 @@
|
|
|
1
|
+
//#region src/Set/addOrElse.d.ts
|
|
2
|
+
/**
|
|
3
|
+
* ```ts
|
|
4
|
+
* function Set.addOrElse(target, value, orElse)
|
|
5
|
+
* ```
|
|
6
|
+
*
|
|
7
|
+
* ```ts
|
|
8
|
+
* import { Set } from "@monstermann/set";
|
|
9
|
+
*
|
|
10
|
+
* Set.addOrElse(Set.create([1, 2]), 3, (set) => set.size); // Set([1, 2, 3])
|
|
11
|
+
* Set.addOrElse(Set.create([1, 2]), 2, (set) => set.size); // 2
|
|
12
|
+
* ```
|
|
13
|
+
*
|
|
14
|
+
* ```ts
|
|
15
|
+
* import { Set } from "@monstermann/set";
|
|
16
|
+
*
|
|
17
|
+
* pipe(
|
|
18
|
+
* Set.create([1, 2]),
|
|
19
|
+
* Set.addOrElse(3, (set) => set.size),
|
|
20
|
+
* ); // Set([1, 2, 3])
|
|
21
|
+
*
|
|
22
|
+
* pipe(
|
|
23
|
+
* Set.create([1, 2]),
|
|
24
|
+
* Set.addOrElse(2, (set) => set.size),
|
|
25
|
+
* ); // 2
|
|
26
|
+
* ```
|
|
27
|
+
*/
|
|
28
|
+
declare const addOrElse: {
|
|
29
|
+
<T, U>(value: NoInfer<T>, orElse: (target: ReadonlySet<NoInfer<T>>) => U): (target: ReadonlySet<T>) => Set<T> | U;
|
|
30
|
+
<T, U>(target: ReadonlySet<T>, value: NoInfer<T>, orElse: (target: ReadonlySet<NoInfer<T>>) => U): Set<T> | U;
|
|
31
|
+
};
|
|
32
|
+
//#endregion
|
|
33
|
+
export { addOrElse };
|
|
@@ -0,0 +1,39 @@
|
|
|
1
|
+
import { dfdlT } from "@monstermann/dfdl";
|
|
2
|
+
import { cloneSet } from "@monstermann/remmi";
|
|
3
|
+
|
|
4
|
+
//#region src/Set/addOrElse.ts
|
|
5
|
+
/**
|
|
6
|
+
* ```ts
|
|
7
|
+
* function Set.addOrElse(target, value, orElse)
|
|
8
|
+
* ```
|
|
9
|
+
*
|
|
10
|
+
* ```ts
|
|
11
|
+
* import { Set } from "@monstermann/set";
|
|
12
|
+
*
|
|
13
|
+
* Set.addOrElse(Set.create([1, 2]), 3, (set) => set.size); // Set([1, 2, 3])
|
|
14
|
+
* Set.addOrElse(Set.create([1, 2]), 2, (set) => set.size); // 2
|
|
15
|
+
* ```
|
|
16
|
+
*
|
|
17
|
+
* ```ts
|
|
18
|
+
* import { Set } from "@monstermann/set";
|
|
19
|
+
*
|
|
20
|
+
* pipe(
|
|
21
|
+
* Set.create([1, 2]),
|
|
22
|
+
* Set.addOrElse(3, (set) => set.size),
|
|
23
|
+
* ); // Set([1, 2, 3])
|
|
24
|
+
*
|
|
25
|
+
* pipe(
|
|
26
|
+
* Set.create([1, 2]),
|
|
27
|
+
* Set.addOrElse(2, (set) => set.size),
|
|
28
|
+
* ); // 2
|
|
29
|
+
* ```
|
|
30
|
+
*/
|
|
31
|
+
const addOrElse = dfdlT((target, value, orElse) => {
|
|
32
|
+
if (target.has(value)) return orElse(target);
|
|
33
|
+
const result = cloneSet(target);
|
|
34
|
+
result.add(value);
|
|
35
|
+
return result;
|
|
36
|
+
}, 3);
|
|
37
|
+
|
|
38
|
+
//#endregion
|
|
39
|
+
export { addOrElse };
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
//#region src/Set/addOrThrow.d.ts
|
|
2
|
+
/**
|
|
3
|
+
* ```ts
|
|
4
|
+
* function Set.addOrThrow(target, value)
|
|
5
|
+
* ```
|
|
6
|
+
*
|
|
7
|
+
* ```ts
|
|
8
|
+
* import { Set } from "@monstermann/set";
|
|
9
|
+
*
|
|
10
|
+
* Set.addOrThrow(Set.create([1, 2]), 3); // Set([1, 2, 3])
|
|
11
|
+
* Set.addOrThrow(Set.create([1, 2]), 2); // throws FnError
|
|
12
|
+
* ```
|
|
13
|
+
*
|
|
14
|
+
* ```ts
|
|
15
|
+
* import { Set } from "@monstermann/set";
|
|
16
|
+
*
|
|
17
|
+
* pipe(Set.create([1, 2]), Set.addOrThrow(3)); // Set([1, 2, 3])
|
|
18
|
+
* pipe(Set.create([1, 2]), Set.addOrThrow(2)); // throws FnError
|
|
19
|
+
* ```
|
|
20
|
+
*/
|
|
21
|
+
declare const addOrThrow: {
|
|
22
|
+
<T>(value: NoInfer<T>): (target: ReadonlySet<T>) => Set<T>;
|
|
23
|
+
<T>(target: ReadonlySet<T>, value: NoInfer<T>): Set<T>;
|
|
24
|
+
};
|
|
25
|
+
//#endregion
|
|
26
|
+
export { addOrThrow };
|
|
@@ -0,0 +1,32 @@
|
|
|
1
|
+
import { dfdlT } from "@monstermann/dfdl";
|
|
2
|
+
import { cloneSet } from "@monstermann/remmi";
|
|
3
|
+
|
|
4
|
+
//#region src/Set/addOrThrow.ts
|
|
5
|
+
/**
|
|
6
|
+
* ```ts
|
|
7
|
+
* function Set.addOrThrow(target, value)
|
|
8
|
+
* ```
|
|
9
|
+
*
|
|
10
|
+
* ```ts
|
|
11
|
+
* import { Set } from "@monstermann/set";
|
|
12
|
+
*
|
|
13
|
+
* Set.addOrThrow(Set.create([1, 2]), 3); // Set([1, 2, 3])
|
|
14
|
+
* Set.addOrThrow(Set.create([1, 2]), 2); // throws FnError
|
|
15
|
+
* ```
|
|
16
|
+
*
|
|
17
|
+
* ```ts
|
|
18
|
+
* import { Set } from "@monstermann/set";
|
|
19
|
+
*
|
|
20
|
+
* pipe(Set.create([1, 2]), Set.addOrThrow(3)); // Set([1, 2, 3])
|
|
21
|
+
* pipe(Set.create([1, 2]), Set.addOrThrow(2)); // throws FnError
|
|
22
|
+
* ```
|
|
23
|
+
*/
|
|
24
|
+
const addOrThrow = dfdlT((target, value) => {
|
|
25
|
+
if (target.has(value)) throw new Error("Set.addOrThrow: Value already exists.");
|
|
26
|
+
const result = cloneSet(target);
|
|
27
|
+
result.add(value);
|
|
28
|
+
return result;
|
|
29
|
+
}, 2);
|
|
30
|
+
|
|
31
|
+
//#endregion
|
|
32
|
+
export { addOrThrow };
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
//#region src/Set/clone.d.ts
|
|
2
|
+
/**
|
|
3
|
+
* ```ts
|
|
4
|
+
* function Set.clone(target)
|
|
5
|
+
* ```
|
|
6
|
+
*
|
|
7
|
+
* ```ts
|
|
8
|
+
* import { Set } from "@monstermann/set";
|
|
9
|
+
*
|
|
10
|
+
* const original = Set.create([1, 2, 3]);
|
|
11
|
+
* const copy = Set.clone(original); // Set { 1, 2, 3 }
|
|
12
|
+
* ```
|
|
13
|
+
*
|
|
14
|
+
* ```ts
|
|
15
|
+
* import { Set } from "@monstermann/set";
|
|
16
|
+
*
|
|
17
|
+
* const original = Set.create([1, 2, 3]);
|
|
18
|
+
* const copy = pipe(original, Set.clone()); // Set { 1, 2, 3 }
|
|
19
|
+
* ```
|
|
20
|
+
*/
|
|
21
|
+
declare const clone: {
|
|
22
|
+
(): <T>(target: ReadonlySet<T>) => Set<T>;
|
|
23
|
+
<T>(target: ReadonlySet<T>): Set<T>;
|
|
24
|
+
};
|
|
25
|
+
//#endregion
|
|
26
|
+
export { clone };
|
|
@@ -0,0 +1,27 @@
|
|
|
1
|
+
import { dfdlT } from "@monstermann/dfdl";
|
|
2
|
+
import { cloneSet } from "@monstermann/remmi";
|
|
3
|
+
|
|
4
|
+
//#region src/Set/clone.ts
|
|
5
|
+
/**
|
|
6
|
+
* ```ts
|
|
7
|
+
* function Set.clone(target)
|
|
8
|
+
* ```
|
|
9
|
+
*
|
|
10
|
+
* ```ts
|
|
11
|
+
* import { Set } from "@monstermann/set";
|
|
12
|
+
*
|
|
13
|
+
* const original = Set.create([1, 2, 3]);
|
|
14
|
+
* const copy = Set.clone(original); // Set { 1, 2, 3 }
|
|
15
|
+
* ```
|
|
16
|
+
*
|
|
17
|
+
* ```ts
|
|
18
|
+
* import { Set } from "@monstermann/set";
|
|
19
|
+
*
|
|
20
|
+
* const original = Set.create([1, 2, 3]);
|
|
21
|
+
* const copy = pipe(original, Set.clone()); // Set { 1, 2, 3 }
|
|
22
|
+
* ```
|
|
23
|
+
*/
|
|
24
|
+
const clone = dfdlT(cloneSet, 1);
|
|
25
|
+
|
|
26
|
+
//#endregion
|
|
27
|
+
export { clone };
|
|
@@ -0,0 +1,31 @@
|
|
|
1
|
+
import { NonNil } from "./internals/types.js";
|
|
2
|
+
|
|
3
|
+
//#region src/Set/compact.d.ts
|
|
4
|
+
|
|
5
|
+
/**
|
|
6
|
+
* ```ts
|
|
7
|
+
* function Set.compact(target)
|
|
8
|
+
* ```
|
|
9
|
+
*
|
|
10
|
+
* ```ts
|
|
11
|
+
* import { Set } from "@monstermann/set";
|
|
12
|
+
*
|
|
13
|
+
* Set.compact(Set.create([1, null, 2, undefined])); // Set([1, 2])
|
|
14
|
+
* Set.compact(Set.create([1, 2, 3])); // Set([1, 2, 3])
|
|
15
|
+
* ```
|
|
16
|
+
*
|
|
17
|
+
* ```ts
|
|
18
|
+
* import { Set } from "@monstermann/set";
|
|
19
|
+
*
|
|
20
|
+
* pipe(Set.create([1, null, 2, undefined]), Set.compact()); // Set([1, 2])
|
|
21
|
+
* pipe(Set.create([1, 2, 3]), Set.compact()); // Set([1, 2, 3])
|
|
22
|
+
* ```
|
|
23
|
+
*/
|
|
24
|
+
declare const compact: {
|
|
25
|
+
<T>(): (target: Set<T>) => Set<NonNil<T>>;
|
|
26
|
+
<T>(): (target: ReadonlySet<T>) => ReadonlySet<NonNil<T>>;
|
|
27
|
+
<T>(target: Set<T>): Set<NonNil<T>>;
|
|
28
|
+
<T>(target: ReadonlySet<T>): ReadonlySet<NonNil<T>>;
|
|
29
|
+
};
|
|
30
|
+
//#endregion
|
|
31
|
+
export { compact };
|
|
@@ -0,0 +1,33 @@
|
|
|
1
|
+
import { dfdlT } from "@monstermann/dfdl";
|
|
2
|
+
import { cloneSet } from "@monstermann/remmi";
|
|
3
|
+
|
|
4
|
+
//#region src/Set/compact.ts
|
|
5
|
+
/**
|
|
6
|
+
* ```ts
|
|
7
|
+
* function Set.compact(target)
|
|
8
|
+
* ```
|
|
9
|
+
*
|
|
10
|
+
* ```ts
|
|
11
|
+
* import { Set } from "@monstermann/set";
|
|
12
|
+
*
|
|
13
|
+
* Set.compact(Set.create([1, null, 2, undefined])); // Set([1, 2])
|
|
14
|
+
* Set.compact(Set.create([1, 2, 3])); // Set([1, 2, 3])
|
|
15
|
+
* ```
|
|
16
|
+
*
|
|
17
|
+
* ```ts
|
|
18
|
+
* import { Set } from "@monstermann/set";
|
|
19
|
+
*
|
|
20
|
+
* pipe(Set.create([1, null, 2, undefined]), Set.compact()); // Set([1, 2])
|
|
21
|
+
* pipe(Set.create([1, 2, 3]), Set.compact()); // Set([1, 2, 3])
|
|
22
|
+
* ```
|
|
23
|
+
*/
|
|
24
|
+
const compact = dfdlT((target) => {
|
|
25
|
+
if (!target.has(null) && !target.has(void 0)) return target;
|
|
26
|
+
target = cloneSet(target);
|
|
27
|
+
target.delete(null);
|
|
28
|
+
target.delete(void 0);
|
|
29
|
+
return target;
|
|
30
|
+
}, 1);
|
|
31
|
+
|
|
32
|
+
//#endregion
|
|
33
|
+
export { compact };
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
//#region src/Set/difference.d.ts
|
|
2
|
+
/**
|
|
3
|
+
* ```ts
|
|
4
|
+
* function Set.difference(target, source)
|
|
5
|
+
* ```
|
|
6
|
+
*
|
|
7
|
+
* ```ts
|
|
8
|
+
* import { Set } from "@monstermann/set";
|
|
9
|
+
*
|
|
10
|
+
* Set.difference(Set.create([1, 2, 3]), Set.create([2, 3, 4])); // Set([1])
|
|
11
|
+
* Set.difference(Set.create([1, 2]), Set.create([3, 4])); // Set([1, 2])
|
|
12
|
+
* ```
|
|
13
|
+
*
|
|
14
|
+
* ```ts
|
|
15
|
+
* import { Set } from "@monstermann/set";
|
|
16
|
+
*
|
|
17
|
+
* pipe(Set.create([1, 2, 3]), Set.difference(Set.create([2, 3, 4]))); // Set([1])
|
|
18
|
+
* pipe(Set.create([1, 2]), Set.difference(Set.create([3, 4]))); // Set([1, 2])
|
|
19
|
+
* ```
|
|
20
|
+
*/
|
|
21
|
+
declare const difference: {
|
|
22
|
+
<T, U>(source: Set<U>): (target: Set<T>) => Set<T>;
|
|
23
|
+
<T, U>(target: Set<T>, source: Set<U>): Set<T>;
|
|
24
|
+
};
|
|
25
|
+
//#endregion
|
|
26
|
+
export { difference };
|
|
@@ -0,0 +1,37 @@
|
|
|
1
|
+
import { dfdlT } from "@monstermann/dfdl";
|
|
2
|
+
|
|
3
|
+
//#region src/Set/difference.ts
|
|
4
|
+
/**
|
|
5
|
+
* ```ts
|
|
6
|
+
* function Set.difference(target, source)
|
|
7
|
+
* ```
|
|
8
|
+
*
|
|
9
|
+
* ```ts
|
|
10
|
+
* import { Set } from "@monstermann/set";
|
|
11
|
+
*
|
|
12
|
+
* Set.difference(Set.create([1, 2, 3]), Set.create([2, 3, 4])); // Set([1])
|
|
13
|
+
* Set.difference(Set.create([1, 2]), Set.create([3, 4])); // Set([1, 2])
|
|
14
|
+
* ```
|
|
15
|
+
*
|
|
16
|
+
* ```ts
|
|
17
|
+
* import { Set } from "@monstermann/set";
|
|
18
|
+
*
|
|
19
|
+
* pipe(Set.create([1, 2, 3]), Set.difference(Set.create([2, 3, 4]))); // Set([1])
|
|
20
|
+
* pipe(Set.create([1, 2]), Set.difference(Set.create([3, 4]))); // Set([1, 2])
|
|
21
|
+
* ```
|
|
22
|
+
*/
|
|
23
|
+
const difference = dfdlT((target, source) => {
|
|
24
|
+
if (source.size === 0) return target;
|
|
25
|
+
for (const value of target) if (source.has(value)) {
|
|
26
|
+
const result = /* @__PURE__ */ new Set();
|
|
27
|
+
for (const value$1 of target) {
|
|
28
|
+
if (source.has(value$1)) continue;
|
|
29
|
+
result.add(value$1);
|
|
30
|
+
}
|
|
31
|
+
return result;
|
|
32
|
+
}
|
|
33
|
+
return target;
|
|
34
|
+
}, 2);
|
|
35
|
+
|
|
36
|
+
//#endregion
|
|
37
|
+
export { difference };
|
|
@@ -0,0 +1,29 @@
|
|
|
1
|
+
//#region src/Set/forEach.d.ts
|
|
2
|
+
/**
|
|
3
|
+
* ```ts
|
|
4
|
+
* function Set.forEach(target, fn)
|
|
5
|
+
* ```
|
|
6
|
+
*
|
|
7
|
+
* ```ts
|
|
8
|
+
* import { Set } from "@monstermann/set";
|
|
9
|
+
*
|
|
10
|
+
* Set.forEach(Set.create([1, 2, 3]), (value) => console.log(value)); // Set([1, 2, 3])
|
|
11
|
+
* ```
|
|
12
|
+
*
|
|
13
|
+
* ```ts
|
|
14
|
+
* import { Set } from "@monstermann/set";
|
|
15
|
+
*
|
|
16
|
+
* pipe(
|
|
17
|
+
* Set.create([1, 2, 3]),
|
|
18
|
+
* Set.forEach((value) => console.log(value)),
|
|
19
|
+
* ); // Set([1, 2, 3])
|
|
20
|
+
* ```
|
|
21
|
+
*/
|
|
22
|
+
declare const forEach: {
|
|
23
|
+
<T>(fn: (value: NoInfer<T>, target: ReadonlySet<NoInfer<T>>) => unknown): (target: Set<T>) => Set<T>;
|
|
24
|
+
<T>(fn: (value: NoInfer<T>, target: ReadonlySet<NoInfer<T>>) => unknown): (target: ReadonlySet<T>) => ReadonlySet<T>;
|
|
25
|
+
<T>(target: Set<T>, fn: (value: NoInfer<T>, target: ReadonlySet<NoInfer<T>>) => unknown): Set<T>;
|
|
26
|
+
<T>(target: ReadonlySet<T>, fn: (value: NoInfer<T>, target: ReadonlySet<NoInfer<T>>) => unknown): ReadonlySet<T>;
|
|
27
|
+
};
|
|
28
|
+
//#endregion
|
|
29
|
+
export { forEach };
|
|
@@ -0,0 +1,30 @@
|
|
|
1
|
+
import { dfdlT } from "@monstermann/dfdl";
|
|
2
|
+
|
|
3
|
+
//#region src/Set/forEach.ts
|
|
4
|
+
/**
|
|
5
|
+
* ```ts
|
|
6
|
+
* function Set.forEach(target, fn)
|
|
7
|
+
* ```
|
|
8
|
+
*
|
|
9
|
+
* ```ts
|
|
10
|
+
* import { Set } from "@monstermann/set";
|
|
11
|
+
*
|
|
12
|
+
* Set.forEach(Set.create([1, 2, 3]), (value) => console.log(value)); // Set([1, 2, 3])
|
|
13
|
+
* ```
|
|
14
|
+
*
|
|
15
|
+
* ```ts
|
|
16
|
+
* import { Set } from "@monstermann/set";
|
|
17
|
+
*
|
|
18
|
+
* pipe(
|
|
19
|
+
* Set.create([1, 2, 3]),
|
|
20
|
+
* Set.forEach((value) => console.log(value)),
|
|
21
|
+
* ); // Set([1, 2, 3])
|
|
22
|
+
* ```
|
|
23
|
+
*/
|
|
24
|
+
const forEach = dfdlT((target, fn) => {
|
|
25
|
+
for (const value of target) fn(value, target);
|
|
26
|
+
return target;
|
|
27
|
+
}, 2);
|
|
28
|
+
|
|
29
|
+
//#endregion
|
|
30
|
+
export { forEach };
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
//#region src/Set/has.d.ts
|
|
2
|
+
/**
|
|
3
|
+
* ```ts
|
|
4
|
+
* function Set.has(target, value)
|
|
5
|
+
* ```
|
|
6
|
+
*
|
|
7
|
+
* ```ts
|
|
8
|
+
* import { Set } from "@monstermann/set";
|
|
9
|
+
*
|
|
10
|
+
* Set.has(Set.create([1, 2, 3]), 2); // true
|
|
11
|
+
* Set.has(Set.create([1, 2, 3]), 4); // false
|
|
12
|
+
* ```
|
|
13
|
+
*
|
|
14
|
+
* ```ts
|
|
15
|
+
* import { Set } from "@monstermann/set";
|
|
16
|
+
*
|
|
17
|
+
* pipe(Set.create([1, 2, 3]), Set.has(2)); // true
|
|
18
|
+
* pipe(Set.create([1, 2, 3]), Set.has(4)); // false
|
|
19
|
+
* ```
|
|
20
|
+
*/
|
|
21
|
+
declare const has: {
|
|
22
|
+
<T>(value: NoInfer<T>): (target: ReadonlySet<T>) => boolean;
|
|
23
|
+
<T>(target: ReadonlySet<T>, value: NoInfer<T>): boolean;
|
|
24
|
+
};
|
|
25
|
+
//#endregion
|
|
26
|
+
export { has };
|
package/dist/Set/has.js
ADDED
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
import { dfdlT } from "@monstermann/dfdl";
|
|
2
|
+
|
|
3
|
+
//#region src/Set/has.ts
|
|
4
|
+
/**
|
|
5
|
+
* ```ts
|
|
6
|
+
* function Set.has(target, value)
|
|
7
|
+
* ```
|
|
8
|
+
*
|
|
9
|
+
* ```ts
|
|
10
|
+
* import { Set } from "@monstermann/set";
|
|
11
|
+
*
|
|
12
|
+
* Set.has(Set.create([1, 2, 3]), 2); // true
|
|
13
|
+
* Set.has(Set.create([1, 2, 3]), 4); // false
|
|
14
|
+
* ```
|
|
15
|
+
*
|
|
16
|
+
* ```ts
|
|
17
|
+
* import { Set } from "@monstermann/set";
|
|
18
|
+
*
|
|
19
|
+
* pipe(Set.create([1, 2, 3]), Set.has(2)); // true
|
|
20
|
+
* pipe(Set.create([1, 2, 3]), Set.has(4)); // false
|
|
21
|
+
* ```
|
|
22
|
+
*/
|
|
23
|
+
const has = dfdlT((target, value) => {
|
|
24
|
+
return target.has(value);
|
|
25
|
+
}, 2);
|
|
26
|
+
|
|
27
|
+
//#endregion
|
|
28
|
+
export { has };
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
//#region src/Set/hasAll.d.ts
|
|
2
|
+
/**
|
|
3
|
+
* ```ts
|
|
4
|
+
* function Set.hasAll(target, values)
|
|
5
|
+
* ```
|
|
6
|
+
*
|
|
7
|
+
* ```ts
|
|
8
|
+
* import { Set } from "@monstermann/set";
|
|
9
|
+
*
|
|
10
|
+
* Set.hasAll(Set.create([1, 2, 3]), [1, 2]); // true
|
|
11
|
+
* Set.hasAll(Set.create([1, 2, 3]), [1, 4]); // false
|
|
12
|
+
* ```
|
|
13
|
+
*
|
|
14
|
+
* ```ts
|
|
15
|
+
* import { Set } from "@monstermann/set";
|
|
16
|
+
*
|
|
17
|
+
* pipe(Set.create([1, 2, 3]), Set.hasAll([1, 2])); // true
|
|
18
|
+
* pipe(Set.create([1, 2, 3]), Set.hasAll([1, 4])); // false
|
|
19
|
+
* ```
|
|
20
|
+
*/
|
|
21
|
+
declare const hasAll: {
|
|
22
|
+
<T>(values: Iterable<NoInfer<T>>): (target: ReadonlySet<T>) => boolean;
|
|
23
|
+
<T>(target: ReadonlySet<T>, values: Iterable<NoInfer<T>>): boolean;
|
|
24
|
+
};
|
|
25
|
+
//#endregion
|
|
26
|
+
export { hasAll };
|