@monstermann/set 0.1.0 → 0.1.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (72) hide show
  1. package/dist/Set/{compact.d.ts → compact.d.mts} +1 -1
  2. package/dist/Set/index.d.mts +39 -0
  3. package/dist/Set/index.mjs +69 -0
  4. package/dist/index.d.mts +2 -0
  5. package/dist/index.mjs +3 -0
  6. package/package.json +6 -6
  7. package/dist/Set/index.d.ts +0 -39
  8. package/dist/Set/index.js +0 -69
  9. package/dist/index.d.ts +0 -2
  10. package/dist/index.js +0 -3
  11. /package/dist/Set/{add.d.ts → add.d.mts} +0 -0
  12. /package/dist/Set/{add.js → add.mjs} +0 -0
  13. /package/dist/Set/{addAll.d.ts → addAll.d.mts} +0 -0
  14. /package/dist/Set/{addAll.js → addAll.mjs} +0 -0
  15. /package/dist/Set/{addOr.d.ts → addOr.d.mts} +0 -0
  16. /package/dist/Set/{addOr.js → addOr.mjs} +0 -0
  17. /package/dist/Set/{addOrElse.d.ts → addOrElse.d.mts} +0 -0
  18. /package/dist/Set/{addOrElse.js → addOrElse.mjs} +0 -0
  19. /package/dist/Set/{addOrThrow.d.ts → addOrThrow.d.mts} +0 -0
  20. /package/dist/Set/{addOrThrow.js → addOrThrow.mjs} +0 -0
  21. /package/dist/Set/{clone.d.ts → clone.d.mts} +0 -0
  22. /package/dist/Set/{clone.js → clone.mjs} +0 -0
  23. /package/dist/Set/{compact.js → compact.mjs} +0 -0
  24. /package/dist/Set/{create.d.ts → create.d.mts} +0 -0
  25. /package/dist/Set/{create.js → create.mjs} +0 -0
  26. /package/dist/Set/{difference.d.ts → difference.d.mts} +0 -0
  27. /package/dist/Set/{difference.js → difference.mjs} +0 -0
  28. /package/dist/Set/{forEach.d.ts → forEach.d.mts} +0 -0
  29. /package/dist/Set/{forEach.js → forEach.mjs} +0 -0
  30. /package/dist/Set/{has.d.ts → has.d.mts} +0 -0
  31. /package/dist/Set/{has.js → has.mjs} +0 -0
  32. /package/dist/Set/{hasAll.d.ts → hasAll.d.mts} +0 -0
  33. /package/dist/Set/{hasAll.js → hasAll.mjs} +0 -0
  34. /package/dist/Set/{hasAny.d.ts → hasAny.d.mts} +0 -0
  35. /package/dist/Set/{hasAny.js → hasAny.mjs} +0 -0
  36. /package/dist/Set/{hasNone.d.ts → hasNone.d.mts} +0 -0
  37. /package/dist/Set/{hasNone.js → hasNone.mjs} +0 -0
  38. /package/dist/Set/internals/{types.d.ts → types.d.mts} +0 -0
  39. /package/dist/Set/{intersection.d.ts → intersection.d.mts} +0 -0
  40. /package/dist/Set/{intersection.js → intersection.mjs} +0 -0
  41. /package/dist/Set/{is.d.ts → is.d.mts} +0 -0
  42. /package/dist/Set/{is.js → is.mjs} +0 -0
  43. /package/dist/Set/{isDisjointFrom.d.ts → isDisjointFrom.d.mts} +0 -0
  44. /package/dist/Set/{isDisjointFrom.js → isDisjointFrom.mjs} +0 -0
  45. /package/dist/Set/{isEmpty.d.ts → isEmpty.d.mts} +0 -0
  46. /package/dist/Set/{isEmpty.js → isEmpty.mjs} +0 -0
  47. /package/dist/Set/{isShallowEqual.d.ts → isShallowEqual.d.mts} +0 -0
  48. /package/dist/Set/{isShallowEqual.js → isShallowEqual.mjs} +0 -0
  49. /package/dist/Set/{isSubsetOf.d.ts → isSubsetOf.d.mts} +0 -0
  50. /package/dist/Set/{isSubsetOf.js → isSubsetOf.mjs} +0 -0
  51. /package/dist/Set/{isSupersetOf.d.ts → isSupersetOf.d.mts} +0 -0
  52. /package/dist/Set/{isSupersetOf.js → isSupersetOf.mjs} +0 -0
  53. /package/dist/Set/{mapEach.d.ts → mapEach.d.mts} +0 -0
  54. /package/dist/Set/{mapEach.js → mapEach.mjs} +0 -0
  55. /package/dist/Set/{remove.d.ts → remove.d.mts} +0 -0
  56. /package/dist/Set/{remove.js → remove.mjs} +0 -0
  57. /package/dist/Set/{removeAll.d.ts → removeAll.d.mts} +0 -0
  58. /package/dist/Set/{removeAll.js → removeAll.mjs} +0 -0
  59. /package/dist/Set/{removeOr.d.ts → removeOr.d.mts} +0 -0
  60. /package/dist/Set/{removeOr.js → removeOr.mjs} +0 -0
  61. /package/dist/Set/{removeOrElse.d.ts → removeOrElse.d.mts} +0 -0
  62. /package/dist/Set/{removeOrElse.js → removeOrElse.mjs} +0 -0
  63. /package/dist/Set/{removeOrThrow.d.ts → removeOrThrow.d.mts} +0 -0
  64. /package/dist/Set/{removeOrThrow.js → removeOrThrow.mjs} +0 -0
  65. /package/dist/Set/{size.d.ts → size.d.mts} +0 -0
  66. /package/dist/Set/{size.js → size.mjs} +0 -0
  67. /package/dist/Set/{symmetricDifference.d.ts → symmetricDifference.d.mts} +0 -0
  68. /package/dist/Set/{symmetricDifference.js → symmetricDifference.mjs} +0 -0
  69. /package/dist/Set/{toArray.d.ts → toArray.d.mts} +0 -0
  70. /package/dist/Set/{toArray.js → toArray.mjs} +0 -0
  71. /package/dist/Set/{union.d.ts → union.d.mts} +0 -0
  72. /package/dist/Set/{union.js → union.mjs} +0 -0
@@ -1,4 +1,4 @@
1
- import { NonNil } from "./internals/types.js";
1
+ import { NonNil } from "./internals/types.mjs";
2
2
 
3
3
  //#region src/Set/compact.d.ts
4
4
 
@@ -0,0 +1,39 @@
1
+ import { add } from "./add.mjs";
2
+ import { addAll } from "./addAll.mjs";
3
+ import { addOr } from "./addOr.mjs";
4
+ import { addOrElse } from "./addOrElse.mjs";
5
+ import { addOrThrow } from "./addOrThrow.mjs";
6
+ import { clone } from "./clone.mjs";
7
+ import { compact } from "./compact.mjs";
8
+ import { create } from "./create.mjs";
9
+ import { difference } from "./difference.mjs";
10
+ import { forEach } from "./forEach.mjs";
11
+ import { has } from "./has.mjs";
12
+ import { hasAll } from "./hasAll.mjs";
13
+ import { hasAny } from "./hasAny.mjs";
14
+ import { hasNone } from "./hasNone.mjs";
15
+ import { intersection } from "./intersection.mjs";
16
+ import { is } from "./is.mjs";
17
+ import { isDisjointFrom } from "./isDisjointFrom.mjs";
18
+ import { isEmpty } from "./isEmpty.mjs";
19
+ import { isShallowEqual } from "./isShallowEqual.mjs";
20
+ import { isSubsetOf } from "./isSubsetOf.mjs";
21
+ import { isSupersetOf } from "./isSupersetOf.mjs";
22
+ import { mapEach } from "./mapEach.mjs";
23
+ import { remove } from "./remove.mjs";
24
+ import { removeAll } from "./removeAll.mjs";
25
+ import { removeOr } from "./removeOr.mjs";
26
+ import { removeOrElse } from "./removeOrElse.mjs";
27
+ import { removeOrThrow } from "./removeOrThrow.mjs";
28
+ import { size } from "./size.mjs";
29
+ import { symmetricDifference } from "./symmetricDifference.mjs";
30
+ import { toArray } from "./toArray.mjs";
31
+ import { union } from "./union.mjs";
32
+
33
+ //#region src/Set/index.d.ts
34
+
35
+ declare namespace Set {
36
+ export { add, addAll, addOr, addOrElse, addOrThrow, clone, compact, create, difference, forEach, has, hasAll, hasAny, hasNone, intersection, is, isDisjointFrom, isEmpty, isShallowEqual, isSubsetOf, isSupersetOf, mapEach, remove, removeAll, removeOr, removeOrElse, removeOrThrow, size, symmetricDifference, toArray, union };
37
+ }
38
+ //#endregion
39
+ export { Set };
@@ -0,0 +1,69 @@
1
+ import { add } from "./add.mjs";
2
+ import { addAll } from "./addAll.mjs";
3
+ import { addOr } from "./addOr.mjs";
4
+ import { addOrElse } from "./addOrElse.mjs";
5
+ import { addOrThrow } from "./addOrThrow.mjs";
6
+ import { clone } from "./clone.mjs";
7
+ import { compact } from "./compact.mjs";
8
+ import { create } from "./create.mjs";
9
+ import { difference } from "./difference.mjs";
10
+ import { forEach } from "./forEach.mjs";
11
+ import { has } from "./has.mjs";
12
+ import { hasAll } from "./hasAll.mjs";
13
+ import { hasAny } from "./hasAny.mjs";
14
+ import { hasNone } from "./hasNone.mjs";
15
+ import { intersection } from "./intersection.mjs";
16
+ import { is } from "./is.mjs";
17
+ import { isDisjointFrom } from "./isDisjointFrom.mjs";
18
+ import { isEmpty } from "./isEmpty.mjs";
19
+ import { isShallowEqual } from "./isShallowEqual.mjs";
20
+ import { isSubsetOf } from "./isSubsetOf.mjs";
21
+ import { isSupersetOf } from "./isSupersetOf.mjs";
22
+ import { mapEach } from "./mapEach.mjs";
23
+ import { remove } from "./remove.mjs";
24
+ import { removeAll } from "./removeAll.mjs";
25
+ import { removeOr } from "./removeOr.mjs";
26
+ import { removeOrElse } from "./removeOrElse.mjs";
27
+ import { removeOrThrow } from "./removeOrThrow.mjs";
28
+ import { size } from "./size.mjs";
29
+ import { symmetricDifference } from "./symmetricDifference.mjs";
30
+ import { toArray } from "./toArray.mjs";
31
+ import { union } from "./union.mjs";
32
+
33
+ //#region src/Set/index.js
34
+ const Set = {
35
+ add,
36
+ addAll,
37
+ addOr,
38
+ addOrElse,
39
+ addOrThrow,
40
+ clone,
41
+ compact,
42
+ create,
43
+ difference,
44
+ forEach,
45
+ has,
46
+ hasAll,
47
+ hasAny,
48
+ hasNone,
49
+ intersection,
50
+ is,
51
+ isDisjointFrom,
52
+ isEmpty,
53
+ isShallowEqual,
54
+ isSubsetOf,
55
+ isSupersetOf,
56
+ mapEach,
57
+ remove,
58
+ removeAll,
59
+ removeOr,
60
+ removeOrElse,
61
+ removeOrThrow,
62
+ size,
63
+ symmetricDifference,
64
+ toArray,
65
+ union
66
+ };
67
+
68
+ //#endregion
69
+ export { Set };
@@ -0,0 +1,2 @@
1
+ import { Set } from "./Set/index.mjs";
2
+ export { Set };
package/dist/index.mjs ADDED
@@ -0,0 +1,3 @@
1
+ import { Set } from "./Set/index.mjs";
2
+
3
+ export { Set };
package/package.json CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "name": "@monstermann/set",
3
3
  "type": "module",
4
- "version": "0.1.0",
4
+ "version": "0.1.1",
5
5
  "description": "Functional utilities for sets.",
6
6
  "author": "Michael Ostermann <michaelostermann@me.com>",
7
7
  "license": "MIT",
@@ -17,14 +17,14 @@
17
17
  "sideEffects": false,
18
18
  "exports": {
19
19
  ".": {
20
- "types": "./dist/index.d.ts",
21
- "import": "./dist/index.js"
20
+ "types": "./dist/index.d.mts",
21
+ "import": "./dist/index.mjs"
22
22
  },
23
23
  "./*": "./dist/*"
24
24
  },
25
- "main": "./dist/index.js",
26
- "module": "./dist/index.js",
27
- "types": "./dist/index.d.ts",
25
+ "main": "./dist/index.mjs",
26
+ "module": "./dist/index.mjs",
27
+ "types": "./dist/index.d.mts",
28
28
  "files": [
29
29
  "dist"
30
30
  ],
@@ -1,39 +0,0 @@
1
- import { add } from "./add.js";
2
- import { addAll } from "./addAll.js";
3
- import { addOr } from "./addOr.js";
4
- import { addOrElse } from "./addOrElse.js";
5
- import { addOrThrow } from "./addOrThrow.js";
6
- import { clone } from "./clone.js";
7
- import { compact } from "./compact.js";
8
- import { create } from "./create.js";
9
- import { difference } from "./difference.js";
10
- import { forEach } from "./forEach.js";
11
- import { has } from "./has.js";
12
- import { hasAll } from "./hasAll.js";
13
- import { hasAny } from "./hasAny.js";
14
- import { hasNone } from "./hasNone.js";
15
- import { intersection } from "./intersection.js";
16
- import { is } from "./is.js";
17
- import { isDisjointFrom } from "./isDisjointFrom.js";
18
- import { isEmpty } from "./isEmpty.js";
19
- import { isShallowEqual } from "./isShallowEqual.js";
20
- import { isSubsetOf } from "./isSubsetOf.js";
21
- import { isSupersetOf } from "./isSupersetOf.js";
22
- import { mapEach } from "./mapEach.js";
23
- import { remove } from "./remove.js";
24
- import { removeAll } from "./removeAll.js";
25
- import { removeOr } from "./removeOr.js";
26
- import { removeOrElse } from "./removeOrElse.js";
27
- import { removeOrThrow } from "./removeOrThrow.js";
28
- import { size } from "./size.js";
29
- import { symmetricDifference } from "./symmetricDifference.js";
30
- import { toArray } from "./toArray.js";
31
- import { union } from "./union.js";
32
-
33
- //#region src/Set/index.d.ts
34
-
35
- declare namespace Set {
36
- export { add, addAll, addOr, addOrElse, addOrThrow, clone, compact, create, difference, forEach, has, hasAll, hasAny, hasNone, intersection, is, isDisjointFrom, isEmpty, isShallowEqual, isSubsetOf, isSupersetOf, mapEach, remove, removeAll, removeOr, removeOrElse, removeOrThrow, size, symmetricDifference, toArray, union };
37
- }
38
- //#endregion
39
- export { Set };
package/dist/Set/index.js DELETED
@@ -1,69 +0,0 @@
1
- import { add } from "./add.js";
2
- import { addAll } from "./addAll.js";
3
- import { addOr } from "./addOr.js";
4
- import { addOrElse } from "./addOrElse.js";
5
- import { addOrThrow } from "./addOrThrow.js";
6
- import { clone } from "./clone.js";
7
- import { compact } from "./compact.js";
8
- import { create } from "./create.js";
9
- import { difference } from "./difference.js";
10
- import { forEach } from "./forEach.js";
11
- import { has } from "./has.js";
12
- import { hasAll } from "./hasAll.js";
13
- import { hasAny } from "./hasAny.js";
14
- import { hasNone } from "./hasNone.js";
15
- import { intersection } from "./intersection.js";
16
- import { is } from "./is.js";
17
- import { isDisjointFrom } from "./isDisjointFrom.js";
18
- import { isEmpty } from "./isEmpty.js";
19
- import { isShallowEqual } from "./isShallowEqual.js";
20
- import { isSubsetOf } from "./isSubsetOf.js";
21
- import { isSupersetOf } from "./isSupersetOf.js";
22
- import { mapEach } from "./mapEach.js";
23
- import { remove } from "./remove.js";
24
- import { removeAll } from "./removeAll.js";
25
- import { removeOr } from "./removeOr.js";
26
- import { removeOrElse } from "./removeOrElse.js";
27
- import { removeOrThrow } from "./removeOrThrow.js";
28
- import { size } from "./size.js";
29
- import { symmetricDifference } from "./symmetricDifference.js";
30
- import { toArray } from "./toArray.js";
31
- import { union } from "./union.js";
32
-
33
- //#region src/Set/index.js
34
- const Set = {
35
- add,
36
- addAll,
37
- addOr,
38
- addOrElse,
39
- addOrThrow,
40
- clone,
41
- compact,
42
- create,
43
- difference,
44
- forEach,
45
- has,
46
- hasAll,
47
- hasAny,
48
- hasNone,
49
- intersection,
50
- is,
51
- isDisjointFrom,
52
- isEmpty,
53
- isShallowEqual,
54
- isSubsetOf,
55
- isSupersetOf,
56
- mapEach,
57
- remove,
58
- removeAll,
59
- removeOr,
60
- removeOrElse,
61
- removeOrThrow,
62
- size,
63
- symmetricDifference,
64
- toArray,
65
- union
66
- };
67
-
68
- //#endregion
69
- export { Set };
package/dist/index.d.ts DELETED
@@ -1,2 +0,0 @@
1
- import { Set } from "./Set/index.js";
2
- export { Set };
package/dist/index.js DELETED
@@ -1,3 +0,0 @@
1
- import { Set } from "./Set/index.js";
2
-
3
- export { Set };
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes