@monstermann/map 0.1.1 → 0.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.
Files changed (118) hide show
  1. package/README.md +2496 -0
  2. package/dist/Map/{clone.d.ts → clone.d.mts} +10 -5
  3. package/dist/Map/{clone.js → clone.mjs} +10 -5
  4. package/dist/Map/compact.d.mts +48 -0
  5. package/dist/Map/{compact.js → compact.mjs} +13 -6
  6. package/dist/Map/{create.d.ts → create.d.mts} +9 -2
  7. package/dist/Map/{create.js → create.mjs} +9 -2
  8. package/dist/Map/every.d.mts +58 -0
  9. package/dist/Map/every.mjs +55 -0
  10. package/dist/Map/filter.d.mts +58 -0
  11. package/dist/Map/{filter.js → filter.mjs} +17 -5
  12. package/dist/Map/find.d.mts +54 -0
  13. package/dist/Map/find.mjs +54 -0
  14. package/dist/Map/findMap.d.mts +67 -0
  15. package/dist/Map/findMap.mjs +71 -0
  16. package/dist/Map/findMapAll.d.mts +67 -0
  17. package/dist/Map/findMapAll.mjs +72 -0
  18. package/dist/Map/findMapOr.d.mts +70 -0
  19. package/dist/Map/findMapOr.mjs +74 -0
  20. package/dist/Map/findMapOrElse.d.mts +70 -0
  21. package/dist/Map/findMapOrElse.mjs +74 -0
  22. package/dist/Map/findMapOrThrow.d.mts +67 -0
  23. package/dist/Map/findMapOrThrow.mjs +71 -0
  24. package/dist/Map/findOr.d.mts +56 -0
  25. package/dist/Map/findOr.mjs +57 -0
  26. package/dist/Map/findOrElse.d.mts +59 -0
  27. package/dist/Map/findOrElse.mjs +60 -0
  28. package/dist/Map/findOrThrow.d.mts +54 -0
  29. package/dist/Map/findOrThrow.mjs +55 -0
  30. package/dist/Map/findRemove.d.mts +54 -0
  31. package/dist/Map/findRemove.mjs +60 -0
  32. package/dist/Map/findRemoveOr.d.mts +56 -0
  33. package/dist/Map/findRemoveOr.mjs +62 -0
  34. package/dist/Map/findRemoveOrElse.d.mts +59 -0
  35. package/dist/Map/findRemoveOrElse.mjs +65 -0
  36. package/dist/Map/findRemoveOrThrow.d.mts +54 -0
  37. package/dist/Map/findRemoveOrThrow.mjs +60 -0
  38. package/dist/Map/findReplace.d.mts +56 -0
  39. package/dist/Map/findReplace.mjs +63 -0
  40. package/dist/Map/findReplaceOr.d.mts +58 -0
  41. package/dist/Map/findReplaceOr.mjs +65 -0
  42. package/dist/Map/findReplaceOrElse.d.mts +62 -0
  43. package/dist/Map/findReplaceOrElse.mjs +69 -0
  44. package/dist/Map/findReplaceOrThrow.d.mts +56 -0
  45. package/dist/Map/findReplaceOrThrow.mjs +63 -0
  46. package/dist/Map/forEach.d.mts +52 -0
  47. package/dist/Map/{forEach.js → forEach.mjs} +17 -5
  48. package/dist/Map/{get.d.ts → get.d.mts} +15 -7
  49. package/dist/Map/{get.js → get.mjs} +15 -7
  50. package/dist/Map/{getOr.d.ts → getOr.d.mts} +20 -14
  51. package/dist/Map/{getOr.js → getOr.mjs} +18 -9
  52. package/dist/Map/{getOrElse.d.ts → getOrElse.d.mts} +20 -14
  53. package/dist/Map/{getOrElse.js → getOrElse.mjs} +18 -9
  54. package/dist/Map/{getOrThrow.d.ts → getOrThrow.d.mts} +19 -14
  55. package/dist/Map/{getOrThrow.js → getOrThrow.mjs} +17 -9
  56. package/dist/Map/{has.d.ts → has.d.mts} +15 -7
  57. package/dist/Map/{has.js → has.mjs} +15 -7
  58. package/dist/Map/{hasAll.d.ts → hasAll.d.mts} +15 -7
  59. package/dist/Map/{hasAll.js → hasAll.mjs} +15 -7
  60. package/dist/Map/{hasAny.d.ts → hasAny.d.mts} +15 -7
  61. package/dist/Map/{hasAny.js → hasAny.mjs} +15 -7
  62. package/dist/Map/{hasNone.d.ts → hasNone.d.mts} +15 -7
  63. package/dist/Map/{hasNone.js → hasNone.mjs} +15 -7
  64. package/dist/Map/index.d.mts +56 -0
  65. package/dist/Map/index.mjs +103 -0
  66. package/dist/Map/{is.d.ts → is.d.mts} +12 -5
  67. package/dist/Map/{is.js → is.mjs} +12 -5
  68. package/dist/Map/isEmpty.d.mts +33 -0
  69. package/dist/Map/isEmpty.mjs +35 -0
  70. package/dist/Map/{isShallowEqual.d.ts → isShallowEqual.d.mts} +19 -11
  71. package/dist/Map/{isShallowEqual.js → isShallowEqual.mjs} +19 -11
  72. package/dist/Map/map.d.mts +71 -0
  73. package/dist/Map/{map.js → map.mjs} +21 -7
  74. package/dist/Map/mapEach.d.mts +52 -0
  75. package/dist/Map/{mapEach.js → mapEach.mjs} +17 -5
  76. package/dist/Map/mapOr.d.mts +74 -0
  77. package/dist/Map/{mapOr.js → mapOr.mjs} +21 -7
  78. package/dist/Map/mapOrElse.d.mts +82 -0
  79. package/dist/Map/{mapOrElse.js → mapOrElse.mjs} +21 -7
  80. package/dist/Map/mapOrThrow.d.mts +71 -0
  81. package/dist/Map/{mapOrThrow.js → mapOrThrow.mjs} +20 -7
  82. package/dist/Map/none.d.mts +58 -0
  83. package/dist/Map/none.mjs +55 -0
  84. package/dist/Map/reject.d.mts +58 -0
  85. package/dist/Map/{reject.js → reject.mjs} +17 -5
  86. package/dist/Map/{remove.d.ts → remove.d.mts} +15 -7
  87. package/dist/Map/{remove.js → remove.mjs} +15 -7
  88. package/dist/Map/{removeAll.d.ts → removeAll.d.mts} +15 -7
  89. package/dist/Map/{removeAll.js → removeAll.mjs} +15 -7
  90. package/dist/Map/{removeOr.d.ts → removeOr.d.mts} +16 -7
  91. package/dist/Map/{removeOr.js → removeOr.mjs} +16 -7
  92. package/dist/Map/{removeOrElse.d.ts → removeOrElse.d.mts} +18 -12
  93. package/dist/Map/{removeOrElse.js → removeOrElse.mjs} +16 -7
  94. package/dist/Map/{removeOrThrow.d.ts → removeOrThrow.d.mts} +15 -7
  95. package/dist/Map/{removeOrThrow.js → removeOrThrow.mjs} +15 -7
  96. package/dist/Map/{set.d.ts → set.d.mts} +16 -7
  97. package/dist/Map/{set.js → set.mjs} +16 -7
  98. package/dist/Map/some.d.mts +52 -0
  99. package/dist/Map/some.mjs +55 -0
  100. package/dist/index.d.mts +2 -0
  101. package/dist/index.mjs +3 -0
  102. package/package.json +2 -2
  103. package/dist/Map/compact.d.ts +0 -44
  104. package/dist/Map/filter.d.ts +0 -49
  105. package/dist/Map/forEach.d.ts +0 -43
  106. package/dist/Map/index.d.ts +0 -36
  107. package/dist/Map/index.js +0 -63
  108. package/dist/Map/internals/types.d.ts +0 -14
  109. package/dist/Map/isEmpty.d.ts +0 -28
  110. package/dist/Map/isEmpty.js +0 -30
  111. package/dist/Map/map.d.ts +0 -60
  112. package/dist/Map/mapEach.d.ts +0 -43
  113. package/dist/Map/mapOr.d.ts +0 -63
  114. package/dist/Map/mapOrElse.d.ts +0 -71
  115. package/dist/Map/mapOrThrow.d.ts +0 -61
  116. package/dist/Map/reject.d.ts +0 -49
  117. package/dist/index.d.ts +0 -2
  118. package/dist/index.js +0 -3
@@ -2,17 +2,24 @@ import { dfdlT } from "@monstermann/dfdl";
2
2
 
3
3
  //#region src/Map/getOrThrow.ts
4
4
  /**
5
+ * # getOrThrow
6
+ *
5
7
  * ```ts
6
- * function Map.getOrThrow(map, key)
8
+ * function Map.getOrThrow<K, V>(
9
+ * target: ReadonlyMap<K, V>,
10
+ * key: NoInfer<K>,
11
+ * ): Exclude<V, null | undefined>
7
12
  * ```
8
13
  *
14
+ * Gets the value associated with the specified key, or throws an error if the value is `null` or `undefined`.
15
+ *
9
16
  * ## Example
10
17
  *
11
- * ```ts
18
+ * ```ts [data-first]
12
19
  * import { Map } from "@monstermann/map";
13
20
  *
14
21
  * Map.getOrThrow(
15
- * Map.create([
22
+ * new Map([
16
23
  * ["a", 1],
17
24
  * ["b", 2],
18
25
  * ]),
@@ -20,7 +27,7 @@ import { dfdlT } from "@monstermann/dfdl";
20
27
  * ); // 1
21
28
  *
22
29
  * Map.getOrThrow(
23
- * Map.create([
30
+ * new Map([
24
31
  * ["a", 1],
25
32
  * ["b", null],
26
33
  * ]),
@@ -28,7 +35,7 @@ import { dfdlT } from "@monstermann/dfdl";
28
35
  * ); // throws FnError
29
36
  *
30
37
  * Map.getOrThrow(
31
- * Map.create([
38
+ * new Map([
32
39
  * ["a", 1],
33
40
  * ["b", 2],
34
41
  * ]),
@@ -36,11 +43,11 @@ import { dfdlT } from "@monstermann/dfdl";
36
43
  * ); // throws FnError
37
44
  * ```
38
45
  *
39
- * ```ts
46
+ * ```ts [data-last]
40
47
  * import { Map } from "@monstermann/map";
41
48
  *
42
49
  * pipe(
43
- * Map.create([
50
+ * new Map([
44
51
  * ["a", 1],
45
52
  * ["b", 2],
46
53
  * ]),
@@ -48,7 +55,7 @@ import { dfdlT } from "@monstermann/dfdl";
48
55
  * ); // 1
49
56
  *
50
57
  * pipe(
51
- * Map.create([
58
+ * new Map([
52
59
  * ["a", 1],
53
60
  * ["b", null],
54
61
  * ]),
@@ -56,13 +63,14 @@ import { dfdlT } from "@monstermann/dfdl";
56
63
  * ); // throws FnError
57
64
  *
58
65
  * pipe(
59
- * Map.create([
66
+ * new Map([
60
67
  * ["a", 1],
61
68
  * ["b", 2],
62
69
  * ]),
63
70
  * Map.getOrThrow("c"),
64
71
  * ); // throws FnError
65
72
  * ```
73
+ *
66
74
  */
67
75
  const getOrThrow = dfdlT((target, key) => {
68
76
  const value = target.get(key);
@@ -1,16 +1,23 @@
1
1
  //#region src/Map/has.d.ts
2
2
  /**
3
+ * # has
4
+ *
3
5
  * ```ts
4
- * function Map.has(map, key)
6
+ * function Map.has<K, V>(
7
+ * target: ReadonlyMap<K, V>,
8
+ * key: NoInfer<K>,
9
+ * ): boolean
5
10
  * ```
6
11
  *
12
+ * Checks whether the map contains the specified key.
13
+ *
7
14
  * ## Example
8
15
  *
9
- * ```ts
16
+ * ```ts [data-first]
10
17
  * import { Map } from "@monstermann/map";
11
18
  *
12
19
  * Map.has(
13
- * Map.create([
20
+ * new Map([
14
21
  * ["a", 1],
15
22
  * ["b", 2],
16
23
  * ]),
@@ -18,7 +25,7 @@
18
25
  * ); // true
19
26
  *
20
27
  * Map.has(
21
- * Map.create([
28
+ * new Map([
22
29
  * ["a", 1],
23
30
  * ["b", 2],
24
31
  * ]),
@@ -26,11 +33,11 @@
26
33
  * ); // false
27
34
  * ```
28
35
  *
29
- * ```ts
36
+ * ```ts [data-last]
30
37
  * import { Map } from "@monstermann/map";
31
38
  *
32
39
  * pipe(
33
- * Map.create([
40
+ * new Map([
34
41
  * ["a", 1],
35
42
  * ["b", 2],
36
43
  * ]),
@@ -38,13 +45,14 @@
38
45
  * ); // true
39
46
  *
40
47
  * pipe(
41
- * Map.create([
48
+ * new Map([
42
49
  * ["a", 1],
43
50
  * ["b", 2],
44
51
  * ]),
45
52
  * Map.has("c"),
46
53
  * ); // false
47
54
  * ```
55
+ *
48
56
  */
49
57
  declare const has: {
50
58
  <K, V>(key: NoInfer<K>): (target: ReadonlyMap<K, V>) => boolean;
@@ -2,17 +2,24 @@ import { dfdlT } from "@monstermann/dfdl";
2
2
 
3
3
  //#region src/Map/has.ts
4
4
  /**
5
+ * # has
6
+ *
5
7
  * ```ts
6
- * function Map.has(map, key)
8
+ * function Map.has<K, V>(
9
+ * target: ReadonlyMap<K, V>,
10
+ * key: NoInfer<K>,
11
+ * ): boolean
7
12
  * ```
8
13
  *
14
+ * Checks whether the map contains the specified key.
15
+ *
9
16
  * ## Example
10
17
  *
11
- * ```ts
18
+ * ```ts [data-first]
12
19
  * import { Map } from "@monstermann/map";
13
20
  *
14
21
  * Map.has(
15
- * Map.create([
22
+ * new Map([
16
23
  * ["a", 1],
17
24
  * ["b", 2],
18
25
  * ]),
@@ -20,7 +27,7 @@ import { dfdlT } from "@monstermann/dfdl";
20
27
  * ); // true
21
28
  *
22
29
  * Map.has(
23
- * Map.create([
30
+ * new Map([
24
31
  * ["a", 1],
25
32
  * ["b", 2],
26
33
  * ]),
@@ -28,11 +35,11 @@ import { dfdlT } from "@monstermann/dfdl";
28
35
  * ); // false
29
36
  * ```
30
37
  *
31
- * ```ts
38
+ * ```ts [data-last]
32
39
  * import { Map } from "@monstermann/map";
33
40
  *
34
41
  * pipe(
35
- * Map.create([
42
+ * new Map([
36
43
  * ["a", 1],
37
44
  * ["b", 2],
38
45
  * ]),
@@ -40,13 +47,14 @@ import { dfdlT } from "@monstermann/dfdl";
40
47
  * ); // true
41
48
  *
42
49
  * pipe(
43
- * Map.create([
50
+ * new Map([
44
51
  * ["a", 1],
45
52
  * ["b", 2],
46
53
  * ]),
47
54
  * Map.has("c"),
48
55
  * ); // false
49
56
  * ```
57
+ *
50
58
  */
51
59
  const has = dfdlT((target, key) => {
52
60
  return target.has(key);
@@ -1,16 +1,23 @@
1
1
  //#region src/Map/hasAll.d.ts
2
2
  /**
3
+ * # hasAll
4
+ *
3
5
  * ```ts
4
- * function Map.hasAll(map, keys)
6
+ * function Map.hasAll<K, V>(
7
+ * target: ReadonlyMap<K, V>,
8
+ * keys: Iterable<NoInfer<K>>,
9
+ * ): boolean
5
10
  * ```
6
11
  *
12
+ * Checks whether the map contains all of the specified keys.
13
+ *
7
14
  * ## Example
8
15
  *
9
- * ```ts
16
+ * ```ts [data-first]
10
17
  * import { Map } from "@monstermann/map";
11
18
  *
12
19
  * Map.hasAll(
13
- * Map.create([
20
+ * new Map([
14
21
  * ["a", 1],
15
22
  * ["b", 2],
16
23
  * ["c", 3],
@@ -19,7 +26,7 @@
19
26
  * ); // true
20
27
  *
21
28
  * Map.hasAll(
22
- * Map.create([
29
+ * new Map([
23
30
  * ["a", 1],
24
31
  * ["b", 2],
25
32
  * ["c", 3],
@@ -28,11 +35,11 @@
28
35
  * ); // false
29
36
  * ```
30
37
  *
31
- * ```ts
38
+ * ```ts [data-last]
32
39
  * import { Map } from "@monstermann/map";
33
40
  *
34
41
  * pipe(
35
- * Map.create([
42
+ * new Map([
36
43
  * ["a", 1],
37
44
  * ["b", 2],
38
45
  * ["c", 3],
@@ -41,7 +48,7 @@
41
48
  * ); // true
42
49
  *
43
50
  * pipe(
44
- * Map.create([
51
+ * new Map([
45
52
  * ["a", 1],
46
53
  * ["b", 2],
47
54
  * ["c", 3],
@@ -49,6 +56,7 @@
49
56
  * Map.hasAll(["a", "d"]),
50
57
  * ); // false
51
58
  * ```
59
+ *
52
60
  */
53
61
  declare const hasAll: {
54
62
  <K, V>(keys: Iterable<NoInfer<K>>): (target: ReadonlyMap<K, V>) => boolean;
@@ -2,17 +2,24 @@ import { dfdlT } from "@monstermann/dfdl";
2
2
 
3
3
  //#region src/Map/hasAll.ts
4
4
  /**
5
+ * # hasAll
6
+ *
5
7
  * ```ts
6
- * function Map.hasAll(map, keys)
8
+ * function Map.hasAll<K, V>(
9
+ * target: ReadonlyMap<K, V>,
10
+ * keys: Iterable<NoInfer<K>>,
11
+ * ): boolean
7
12
  * ```
8
13
  *
14
+ * Checks whether the map contains all of the specified keys.
15
+ *
9
16
  * ## Example
10
17
  *
11
- * ```ts
18
+ * ```ts [data-first]
12
19
  * import { Map } from "@monstermann/map";
13
20
  *
14
21
  * Map.hasAll(
15
- * Map.create([
22
+ * new Map([
16
23
  * ["a", 1],
17
24
  * ["b", 2],
18
25
  * ["c", 3],
@@ -21,7 +28,7 @@ import { dfdlT } from "@monstermann/dfdl";
21
28
  * ); // true
22
29
  *
23
30
  * Map.hasAll(
24
- * Map.create([
31
+ * new Map([
25
32
  * ["a", 1],
26
33
  * ["b", 2],
27
34
  * ["c", 3],
@@ -30,11 +37,11 @@ import { dfdlT } from "@monstermann/dfdl";
30
37
  * ); // false
31
38
  * ```
32
39
  *
33
- * ```ts
40
+ * ```ts [data-last]
34
41
  * import { Map } from "@monstermann/map";
35
42
  *
36
43
  * pipe(
37
- * Map.create([
44
+ * new Map([
38
45
  * ["a", 1],
39
46
  * ["b", 2],
40
47
  * ["c", 3],
@@ -43,7 +50,7 @@ import { dfdlT } from "@monstermann/dfdl";
43
50
  * ); // true
44
51
  *
45
52
  * pipe(
46
- * Map.create([
53
+ * new Map([
47
54
  * ["a", 1],
48
55
  * ["b", 2],
49
56
  * ["c", 3],
@@ -51,6 +58,7 @@ import { dfdlT } from "@monstermann/dfdl";
51
58
  * Map.hasAll(["a", "d"]),
52
59
  * ); // false
53
60
  * ```
61
+ *
54
62
  */
55
63
  const hasAll = dfdlT((target, keys) => {
56
64
  for (const key of keys) if (!target.has(key)) return false;
@@ -1,16 +1,23 @@
1
1
  //#region src/Map/hasAny.d.ts
2
2
  /**
3
+ * # hasAny
4
+ *
3
5
  * ```ts
4
- * function Map.hasAny(map, keys)
6
+ * function Map.hasAny<K, V>(
7
+ * target: ReadonlyMap<K, V>,
8
+ * keys: Iterable<NoInfer<K>>,
9
+ * ): boolean
5
10
  * ```
6
11
  *
12
+ * Checks whether the map contains any of the specified keys.
13
+ *
7
14
  * ## Example
8
15
  *
9
- * ```ts
16
+ * ```ts [data-first]
10
17
  * import { Map } from "@monstermann/map";
11
18
  *
12
19
  * Map.hasAny(
13
- * Map.create([
20
+ * new Map([
14
21
  * ["a", 1],
15
22
  * ["b", 2],
16
23
  * ]),
@@ -18,7 +25,7 @@
18
25
  * ); // true
19
26
  *
20
27
  * Map.hasAny(
21
- * Map.create([
28
+ * new Map([
22
29
  * ["a", 1],
23
30
  * ["b", 2],
24
31
  * ]),
@@ -26,11 +33,11 @@
26
33
  * ); // false
27
34
  * ```
28
35
  *
29
- * ```ts
36
+ * ```ts [data-last]
30
37
  * import { Map } from "@monstermann/map";
31
38
  *
32
39
  * pipe(
33
- * Map.create([
40
+ * new Map([
34
41
  * ["a", 1],
35
42
  * ["b", 2],
36
43
  * ]),
@@ -38,13 +45,14 @@
38
45
  * ); // true
39
46
  *
40
47
  * pipe(
41
- * Map.create([
48
+ * new Map([
42
49
  * ["a", 1],
43
50
  * ["b", 2],
44
51
  * ]),
45
52
  * Map.hasAny(["c", "d"]),
46
53
  * ); // false
47
54
  * ```
55
+ *
48
56
  */
49
57
  declare const hasAny: {
50
58
  <K, V>(keys: Iterable<NoInfer<K>>): (target: ReadonlyMap<K, V>) => boolean;
@@ -2,17 +2,24 @@ import { dfdlT } from "@monstermann/dfdl";
2
2
 
3
3
  //#region src/Map/hasAny.ts
4
4
  /**
5
+ * # hasAny
6
+ *
5
7
  * ```ts
6
- * function Map.hasAny(map, keys)
8
+ * function Map.hasAny<K, V>(
9
+ * target: ReadonlyMap<K, V>,
10
+ * keys: Iterable<NoInfer<K>>,
11
+ * ): boolean
7
12
  * ```
8
13
  *
14
+ * Checks whether the map contains any of the specified keys.
15
+ *
9
16
  * ## Example
10
17
  *
11
- * ```ts
18
+ * ```ts [data-first]
12
19
  * import { Map } from "@monstermann/map";
13
20
  *
14
21
  * Map.hasAny(
15
- * Map.create([
22
+ * new Map([
16
23
  * ["a", 1],
17
24
  * ["b", 2],
18
25
  * ]),
@@ -20,7 +27,7 @@ import { dfdlT } from "@monstermann/dfdl";
20
27
  * ); // true
21
28
  *
22
29
  * Map.hasAny(
23
- * Map.create([
30
+ * new Map([
24
31
  * ["a", 1],
25
32
  * ["b", 2],
26
33
  * ]),
@@ -28,11 +35,11 @@ import { dfdlT } from "@monstermann/dfdl";
28
35
  * ); // false
29
36
  * ```
30
37
  *
31
- * ```ts
38
+ * ```ts [data-last]
32
39
  * import { Map } from "@monstermann/map";
33
40
  *
34
41
  * pipe(
35
- * Map.create([
42
+ * new Map([
36
43
  * ["a", 1],
37
44
  * ["b", 2],
38
45
  * ]),
@@ -40,13 +47,14 @@ import { dfdlT } from "@monstermann/dfdl";
40
47
  * ); // true
41
48
  *
42
49
  * pipe(
43
- * Map.create([
50
+ * new Map([
44
51
  * ["a", 1],
45
52
  * ["b", 2],
46
53
  * ]),
47
54
  * Map.hasAny(["c", "d"]),
48
55
  * ); // false
49
56
  * ```
57
+ *
50
58
  */
51
59
  const hasAny = dfdlT((target, keys) => {
52
60
  for (const key of keys) if (target.has(key)) return true;
@@ -1,16 +1,23 @@
1
1
  //#region src/Map/hasNone.d.ts
2
2
  /**
3
+ * # hasNone
4
+ *
3
5
  * ```ts
4
- * function Map.hasNone(map, keys)
6
+ * function Map.hasNone<K, V>(
7
+ * target: ReadonlyMap<K, V>,
8
+ * keys: Iterable<NoInfer<K>>,
9
+ * ): boolean
5
10
  * ```
6
11
  *
12
+ * Checks whether the map contains none of the specified keys.
13
+ *
7
14
  * ## Example
8
15
  *
9
- * ```ts
16
+ * ```ts [data-first]
10
17
  * import { Map } from "@monstermann/map";
11
18
  *
12
19
  * Map.hasNone(
13
- * Map.create([
20
+ * new Map([
14
21
  * ["a", 1],
15
22
  * ["b", 2],
16
23
  * ]),
@@ -18,7 +25,7 @@
18
25
  * ); // true
19
26
  *
20
27
  * Map.hasNone(
21
- * Map.create([
28
+ * new Map([
22
29
  * ["a", 1],
23
30
  * ["b", 2],
24
31
  * ]),
@@ -26,11 +33,11 @@
26
33
  * ); // false
27
34
  * ```
28
35
  *
29
- * ```ts
36
+ * ```ts [data-last]
30
37
  * import { Map } from "@monstermann/map";
31
38
  *
32
39
  * pipe(
33
- * Map.create([
40
+ * new Map([
34
41
  * ["a", 1],
35
42
  * ["b", 2],
36
43
  * ]),
@@ -38,13 +45,14 @@
38
45
  * ); // true
39
46
  *
40
47
  * pipe(
41
- * Map.create([
48
+ * new Map([
42
49
  * ["a", 1],
43
50
  * ["b", 2],
44
51
  * ]),
45
52
  * Map.hasNone(["a", "c"]),
46
53
  * ); // false
47
54
  * ```
55
+ *
48
56
  */
49
57
  declare const hasNone: {
50
58
  <K, V>(keys: Iterable<NoInfer<K>>): (target: ReadonlyMap<K, V>) => boolean;
@@ -2,17 +2,24 @@ import { dfdlT } from "@monstermann/dfdl";
2
2
 
3
3
  //#region src/Map/hasNone.ts
4
4
  /**
5
+ * # hasNone
6
+ *
5
7
  * ```ts
6
- * function Map.hasNone(map, keys)
8
+ * function Map.hasNone<K, V>(
9
+ * target: ReadonlyMap<K, V>,
10
+ * keys: Iterable<NoInfer<K>>,
11
+ * ): boolean
7
12
  * ```
8
13
  *
14
+ * Checks whether the map contains none of the specified keys.
15
+ *
9
16
  * ## Example
10
17
  *
11
- * ```ts
18
+ * ```ts [data-first]
12
19
  * import { Map } from "@monstermann/map";
13
20
  *
14
21
  * Map.hasNone(
15
- * Map.create([
22
+ * new Map([
16
23
  * ["a", 1],
17
24
  * ["b", 2],
18
25
  * ]),
@@ -20,7 +27,7 @@ import { dfdlT } from "@monstermann/dfdl";
20
27
  * ); // true
21
28
  *
22
29
  * Map.hasNone(
23
- * Map.create([
30
+ * new Map([
24
31
  * ["a", 1],
25
32
  * ["b", 2],
26
33
  * ]),
@@ -28,11 +35,11 @@ import { dfdlT } from "@monstermann/dfdl";
28
35
  * ); // false
29
36
  * ```
30
37
  *
31
- * ```ts
38
+ * ```ts [data-last]
32
39
  * import { Map } from "@monstermann/map";
33
40
  *
34
41
  * pipe(
35
- * Map.create([
42
+ * new Map([
36
43
  * ["a", 1],
37
44
  * ["b", 2],
38
45
  * ]),
@@ -40,13 +47,14 @@ import { dfdlT } from "@monstermann/dfdl";
40
47
  * ); // true
41
48
  *
42
49
  * pipe(
43
- * Map.create([
50
+ * new Map([
44
51
  * ["a", 1],
45
52
  * ["b", 2],
46
53
  * ]),
47
54
  * Map.hasNone(["a", "c"]),
48
55
  * ); // false
49
56
  * ```
57
+ *
50
58
  */
51
59
  const hasNone = dfdlT((target, keys) => {
52
60
  for (const key of keys) if (target.has(key)) return false;
@@ -0,0 +1,56 @@
1
+ import { clone } from "./clone.mjs";
2
+ import { compact } from "./compact.mjs";
3
+ import { create } from "./create.mjs";
4
+ import { every } from "./every.mjs";
5
+ import { filter } from "./filter.mjs";
6
+ import { find } from "./find.mjs";
7
+ import { findMap } from "./findMap.mjs";
8
+ import { findMapAll } from "./findMapAll.mjs";
9
+ import { findMapOr } from "./findMapOr.mjs";
10
+ import { findMapOrElse } from "./findMapOrElse.mjs";
11
+ import { findMapOrThrow } from "./findMapOrThrow.mjs";
12
+ import { findOr } from "./findOr.mjs";
13
+ import { findOrElse } from "./findOrElse.mjs";
14
+ import { findOrThrow } from "./findOrThrow.mjs";
15
+ import { findRemove } from "./findRemove.mjs";
16
+ import { findRemoveOr } from "./findRemoveOr.mjs";
17
+ import { findRemoveOrElse } from "./findRemoveOrElse.mjs";
18
+ import { findRemoveOrThrow } from "./findRemoveOrThrow.mjs";
19
+ import { findReplace } from "./findReplace.mjs";
20
+ import { findReplaceOr } from "./findReplaceOr.mjs";
21
+ import { findReplaceOrElse } from "./findReplaceOrElse.mjs";
22
+ import { findReplaceOrThrow } from "./findReplaceOrThrow.mjs";
23
+ import { forEach } from "./forEach.mjs";
24
+ import { get } from "./get.mjs";
25
+ import { getOr } from "./getOr.mjs";
26
+ import { getOrElse } from "./getOrElse.mjs";
27
+ import { getOrThrow } from "./getOrThrow.mjs";
28
+ import { has } from "./has.mjs";
29
+ import { hasAll } from "./hasAll.mjs";
30
+ import { hasAny } from "./hasAny.mjs";
31
+ import { hasNone } from "./hasNone.mjs";
32
+ import { is } from "./is.mjs";
33
+ import { isEmpty } from "./isEmpty.mjs";
34
+ import { isShallowEqual } from "./isShallowEqual.mjs";
35
+ import { map } from "./map.mjs";
36
+ import { mapEach } from "./mapEach.mjs";
37
+ import { mapOr } from "./mapOr.mjs";
38
+ import { mapOrElse } from "./mapOrElse.mjs";
39
+ import { mapOrThrow } from "./mapOrThrow.mjs";
40
+ import { none } from "./none.mjs";
41
+ import { reject } from "./reject.mjs";
42
+ import { remove } from "./remove.mjs";
43
+ import { removeAll } from "./removeAll.mjs";
44
+ import { removeOr } from "./removeOr.mjs";
45
+ import { removeOrElse } from "./removeOrElse.mjs";
46
+ import { removeOrThrow } from "./removeOrThrow.mjs";
47
+ import { set } from "./set.mjs";
48
+ import { some } from "./some.mjs";
49
+
50
+ //#region src/Map/index.d.ts
51
+
52
+ declare namespace Map {
53
+ export { clone, compact, create, every, filter, find, findMap, findMapAll, findMapOr, findMapOrElse, findMapOrThrow, findOr, findOrElse, findOrThrow, findRemove, findRemoveOr, findRemoveOrElse, findRemoveOrThrow, findReplace, findReplaceOr, findReplaceOrElse, findReplaceOrThrow, forEach, get, getOr, getOrElse, getOrThrow, has, hasAll, hasAny, hasNone, is, isEmpty, isShallowEqual, map, mapEach, mapOr, mapOrElse, mapOrThrow, none, reject, remove, removeAll, removeOr, removeOrElse, removeOrThrow, set, some };
54
+ }
55
+ //#endregion
56
+ export { Map };