@monstermann/map 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.
Files changed (62) hide show
  1. package/LICENSE +21 -0
  2. package/README.md +9 -0
  3. package/dist/Map/clone.d.ts +32 -0
  4. package/dist/Map/clone.js +33 -0
  5. package/dist/Map/compact.d.ts +40 -0
  6. package/dist/Map/compact.js +38 -0
  7. package/dist/Map/filter.d.ts +45 -0
  8. package/dist/Map/filter.js +44 -0
  9. package/dist/Map/forEach.d.ts +39 -0
  10. package/dist/Map/forEach.js +37 -0
  11. package/dist/Map/get.d.ts +50 -0
  12. package/dist/Map/get.js +52 -0
  13. package/dist/Map/getOr.d.ts +72 -0
  14. package/dist/Map/getOr.js +71 -0
  15. package/dist/Map/getOrElse.d.ts +72 -0
  16. package/dist/Map/getOrElse.js +71 -0
  17. package/dist/Map/getOrThrow.d.ts +69 -0
  18. package/dist/Map/getOrThrow.js +70 -0
  19. package/dist/Map/has.d.ts +50 -0
  20. package/dist/Map/has.js +52 -0
  21. package/dist/Map/hasAll.d.ts +54 -0
  22. package/dist/Map/hasAll.js +57 -0
  23. package/dist/Map/hasAny.d.ts +50 -0
  24. package/dist/Map/hasAny.js +53 -0
  25. package/dist/Map/hasNone.d.ts +50 -0
  26. package/dist/Map/hasNone.js +53 -0
  27. package/dist/Map/index.d.ts +35 -0
  28. package/dist/Map/index.js +61 -0
  29. package/dist/Map/internals/types.d.ts +14 -0
  30. package/dist/Map/isEmpty.d.ts +24 -0
  31. package/dist/Map/isEmpty.js +26 -0
  32. package/dist/Map/isMap.d.ts +26 -0
  33. package/dist/Map/isMap.js +28 -0
  34. package/dist/Map/isShallowEqual.d.ts +66 -0
  35. package/dist/Map/isShallowEqual.js +80 -0
  36. package/dist/Map/map.d.ts +55 -0
  37. package/dist/Map/map.js +59 -0
  38. package/dist/Map/mapEach.d.ts +39 -0
  39. package/dist/Map/mapEach.js +44 -0
  40. package/dist/Map/mapOr.d.ts +59 -0
  41. package/dist/Map/mapOr.js +63 -0
  42. package/dist/Map/mapOrElse.d.ts +67 -0
  43. package/dist/Map/mapOrElse.js +71 -0
  44. package/dist/Map/mapOrThrow.d.ts +57 -0
  45. package/dist/Map/mapOrThrow.js +61 -0
  46. package/dist/Map/reject.d.ts +45 -0
  47. package/dist/Map/reject.js +44 -0
  48. package/dist/Map/remove.d.ts +52 -0
  49. package/dist/Map/remove.js +56 -0
  50. package/dist/Map/removeAll.d.ts +56 -0
  51. package/dist/Map/removeAll.js +63 -0
  52. package/dist/Map/removeOr.d.ts +52 -0
  53. package/dist/Map/removeOr.js +58 -0
  54. package/dist/Map/removeOrElse.d.ts +55 -0
  55. package/dist/Map/removeOrElse.js +58 -0
  56. package/dist/Map/removeOrThrow.d.ts +50 -0
  57. package/dist/Map/removeOrThrow.js +56 -0
  58. package/dist/Map/set.d.ts +54 -0
  59. package/dist/Map/set.js +58 -0
  60. package/dist/index.d.ts +2 -0
  61. package/dist/index.js +3 -0
  62. package/package.json +39 -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,9 @@
1
+ <div align="center">
2
+
3
+ <h1>map</h1>
4
+
5
+ **Functional utilities for maps.**
6
+
7
+ [Documentation](https://MichaelOstermann.github.io/map)
8
+
9
+ </div>
@@ -0,0 +1,32 @@
1
+ //#region src/Map/clone.d.ts
2
+ /**
3
+ * `Map.clone(target)`
4
+ *
5
+ * Creates a shallow copy of a `Map`, unless marked as mutable with `markAsMutable` inside a mutation context (see [@monstermann/remmi](https://michaelostermann.github.io/remmi/#clonearray-array)).
6
+ *
7
+ * ## Example
8
+ *
9
+ * ```ts
10
+ * const original = Map.create([
11
+ * ["a", 1],
12
+ * ["b", 2],
13
+ * ]);
14
+ *
15
+ * const copy = Map.clone(original); // Map { 'a' => 1, 'b' => 2 }
16
+ * ```
17
+ *
18
+ * ```ts
19
+ * const original = Map.create([
20
+ * ["a", 1],
21
+ * ["b", 2],
22
+ * ]);
23
+ *
24
+ * const copy = pipe(original, Map.clone()); // Map { 'a' => 1, 'b' => 2 }
25
+ * ```
26
+ */
27
+ declare const clone: {
28
+ (): <K, V>(target: ReadonlyMap<K, V>) => Map<K, V>;
29
+ <K, V>(target: ReadonlyMap<K, V>): Map<K, V>;
30
+ };
31
+ //#endregion
32
+ export { clone };
@@ -0,0 +1,33 @@
1
+ import { dfdlT } from "@monstermann/dfdl";
2
+ import { cloneMap } from "@monstermann/remmi";
3
+
4
+ //#region src/Map/clone.ts
5
+ /**
6
+ * `Map.clone(target)`
7
+ *
8
+ * Creates a shallow copy of a `Map`, unless marked as mutable with `markAsMutable` inside a mutation context (see [@monstermann/remmi](https://michaelostermann.github.io/remmi/#clonearray-array)).
9
+ *
10
+ * ## Example
11
+ *
12
+ * ```ts
13
+ * const original = Map.create([
14
+ * ["a", 1],
15
+ * ["b", 2],
16
+ * ]);
17
+ *
18
+ * const copy = Map.clone(original); // Map { 'a' => 1, 'b' => 2 }
19
+ * ```
20
+ *
21
+ * ```ts
22
+ * const original = Map.create([
23
+ * ["a", 1],
24
+ * ["b", 2],
25
+ * ]);
26
+ *
27
+ * const copy = pipe(original, Map.clone()); // Map { 'a' => 1, 'b' => 2 }
28
+ * ```
29
+ */
30
+ const clone = dfdlT(cloneMap, 1);
31
+
32
+ //#endregion
33
+ export { clone };
@@ -0,0 +1,40 @@
1
+ import { NonNil } from "./internals/types.js";
2
+
3
+ //#region src/Map/compact.d.ts
4
+
5
+ /**
6
+ * `Map.compact(map)`
7
+ *
8
+ * Removes all nullable values from `map`.
9
+ *
10
+ * ## Example
11
+ *
12
+ * ```ts
13
+ * Map.compact(
14
+ * Map.create([
15
+ * ["a", 1],
16
+ * ["b", null],
17
+ * ["c", undefined],
18
+ * ]),
19
+ * ); // Map(1) { "a" => 1 }
20
+ * ```
21
+ *
22
+ * ```ts
23
+ * pipe(
24
+ * Map.create([
25
+ * ["a", 1],
26
+ * ["b", null],
27
+ * ["c", undefined],
28
+ * ]),
29
+ * Map.compact(),
30
+ * ); // Map(1) { "a" => 1 }
31
+ * ```
32
+ */
33
+ declare const compact: {
34
+ (): <K, V>(target: Map<K, V>) => Map<K, NonNil<V>>;
35
+ (): <K, V>(target: ReadonlyMap<K, V>) => ReadonlyMap<K, NonNil<V>>;
36
+ <K, V>(target: Map<K, V>): Map<K, NonNil<V>>;
37
+ <K, V>(target: ReadonlyMap<K, V>): ReadonlyMap<K, NonNil<V>>;
38
+ };
39
+ //#endregion
40
+ export { compact };
@@ -0,0 +1,38 @@
1
+ import { filter } from "./filter.js";
2
+ import { dfdlT } from "@monstermann/dfdl";
3
+
4
+ //#region src/Map/compact.ts
5
+ /**
6
+ * `Map.compact(map)`
7
+ *
8
+ * Removes all nullable values from `map`.
9
+ *
10
+ * ## Example
11
+ *
12
+ * ```ts
13
+ * Map.compact(
14
+ * Map.create([
15
+ * ["a", 1],
16
+ * ["b", null],
17
+ * ["c", undefined],
18
+ * ]),
19
+ * ); // Map(1) { "a" => 1 }
20
+ * ```
21
+ *
22
+ * ```ts
23
+ * pipe(
24
+ * Map.create([
25
+ * ["a", 1],
26
+ * ["b", null],
27
+ * ["c", undefined],
28
+ * ]),
29
+ * Map.compact(),
30
+ * ); // Map(1) { "a" => 1 }
31
+ * ```
32
+ */
33
+ const compact = dfdlT((target) => {
34
+ return filter(target, (v) => v != null);
35
+ }, 1);
36
+
37
+ //#endregion
38
+ export { compact };
@@ -0,0 +1,45 @@
1
+ import { MapGuard, MapPredicate } from "./internals/types.js";
2
+
3
+ //#region src/Map/filter.d.ts
4
+
5
+ /**
6
+ * `Map.filter(map, predicate)`
7
+ *
8
+ * Filters `map` by keeping only the entries where `predicate` returns true for the value.
9
+ *
10
+ * ## Example
11
+ *
12
+ * ```ts
13
+ * Map.filter(
14
+ * Map.create([
15
+ * ["a", 1],
16
+ * ["b", 2],
17
+ * ["c", 3],
18
+ * ]),
19
+ * (value) => value > 1,
20
+ * ); // Map(2) { "b" => 2, "c" => 3 }
21
+ * ```
22
+ *
23
+ * ```ts
24
+ * pipe(
25
+ * Map.create([
26
+ * ["a", 1],
27
+ * ["b", 2],
28
+ * ["c", 3],
29
+ * ]),
30
+ * Map.filter((value) => value > 1),
31
+ * ); // Map(2) { "b" => 2, "c" => 3 }
32
+ * ```
33
+ */
34
+ declare const filter: {
35
+ <K, V, U extends V>(predicate: MapGuard<K, V, U>): (target: Map<K, V>) => Map<K, U>;
36
+ <K, V, U extends V>(predicate: MapGuard<K, V, U>): (target: ReadonlyMap<K, V>) => ReadonlyMap<K, U>;
37
+ <K, V>(predicate: MapPredicate<K, V>): (target: Map<K, V>) => Map<K, V>;
38
+ <K, V>(predicate: MapPredicate<K, V>): (target: ReadonlyMap<K, V>) => ReadonlyMap<K, V>;
39
+ <K, V, U extends V>(target: Map<K, V>, predicate: MapGuard<K, V, U>): Map<K, U>;
40
+ <K, V, U extends V>(target: ReadonlyMap<K, V>, predicate: MapGuard<K, V, U>): ReadonlyMap<K, U>;
41
+ <K, V>(target: Map<K, V>, predicate: MapPredicate<K, V>): Map<K, V>;
42
+ <K, V>(target: ReadonlyMap<K, V>, predicate: MapPredicate<K, V>): ReadonlyMap<K, V>;
43
+ };
44
+ //#endregion
45
+ export { filter };
@@ -0,0 +1,44 @@
1
+ import { dfdlT } from "@monstermann/dfdl";
2
+ import { cloneMap } from "@monstermann/remmi";
3
+
4
+ //#region src/Map/filter.ts
5
+ /**
6
+ * `Map.filter(map, predicate)`
7
+ *
8
+ * Filters `map` by keeping only the entries where `predicate` returns true for the value.
9
+ *
10
+ * ## Example
11
+ *
12
+ * ```ts
13
+ * Map.filter(
14
+ * Map.create([
15
+ * ["a", 1],
16
+ * ["b", 2],
17
+ * ["c", 3],
18
+ * ]),
19
+ * (value) => value > 1,
20
+ * ); // Map(2) { "b" => 2, "c" => 3 }
21
+ * ```
22
+ *
23
+ * ```ts
24
+ * pipe(
25
+ * Map.create([
26
+ * ["a", 1],
27
+ * ["b", 2],
28
+ * ["c", 3],
29
+ * ]),
30
+ * Map.filter((value) => value > 1),
31
+ * ); // Map(2) { "b" => 2, "c" => 3 }
32
+ * ```
33
+ */
34
+ const filter = dfdlT((target, predicate) => {
35
+ let result;
36
+ for (const [key, value] of target) if (!predicate(value, key, target)) {
37
+ result ??= cloneMap(target);
38
+ result.delete(key);
39
+ }
40
+ return result ?? target;
41
+ }, 2);
42
+
43
+ //#endregion
44
+ export { filter };
@@ -0,0 +1,39 @@
1
+ import { MapMap } from "./internals/types.js";
2
+
3
+ //#region src/Map/forEach.d.ts
4
+
5
+ /**
6
+ * `Map.forEach(map, fn)`
7
+ *
8
+ * Executes `fn` for each entry in `map` and returns the original map.
9
+ *
10
+ * ## Example
11
+ *
12
+ * ```ts
13
+ * Map.forEach(
14
+ * Map.create([
15
+ * ["a", 1],
16
+ * ["b", 2],
17
+ * ]),
18
+ * (value, key) => console.log(key, value),
19
+ * ); // Map(2) { "a" => 1, "b" => 2 }
20
+ * ```
21
+ *
22
+ * ```ts
23
+ * pipe(
24
+ * Map.create([
25
+ * ["a", 1],
26
+ * ["b", 2],
27
+ * ]),
28
+ * Map.forEach((value, key) => console.log(key, value)),
29
+ * ); // Map(2) { "a" => 1, "b" => 2 }
30
+ * ```
31
+ */
32
+ declare const forEach: {
33
+ <K, V>(fn: MapMap<K, V, any>): (target: Map<K, V>) => Map<K, V>;
34
+ <K, V>(fn: MapMap<K, V, any>): (target: ReadonlyMap<K, V>) => ReadonlyMap<K, V>;
35
+ <K, V>(target: Map<K, V>, fn: MapMap<K, V, any>): Map<K, V>;
36
+ <K, V>(target: ReadonlyMap<K, V>, fn: MapMap<K, V, any>): ReadonlyMap<K, V>;
37
+ };
38
+ //#endregion
39
+ export { forEach };
@@ -0,0 +1,37 @@
1
+ import { dfdlT } from "@monstermann/dfdl";
2
+
3
+ //#region src/Map/forEach.ts
4
+ /**
5
+ * `Map.forEach(map, fn)`
6
+ *
7
+ * Executes `fn` for each entry in `map` and returns the original map.
8
+ *
9
+ * ## Example
10
+ *
11
+ * ```ts
12
+ * Map.forEach(
13
+ * Map.create([
14
+ * ["a", 1],
15
+ * ["b", 2],
16
+ * ]),
17
+ * (value, key) => console.log(key, value),
18
+ * ); // Map(2) { "a" => 1, "b" => 2 }
19
+ * ```
20
+ *
21
+ * ```ts
22
+ * pipe(
23
+ * Map.create([
24
+ * ["a", 1],
25
+ * ["b", 2],
26
+ * ]),
27
+ * Map.forEach((value, key) => console.log(key, value)),
28
+ * ); // Map(2) { "a" => 1, "b" => 2 }
29
+ * ```
30
+ */
31
+ const forEach = dfdlT((target, fn) => {
32
+ target.forEach(fn);
33
+ return target;
34
+ }, 2);
35
+
36
+ //#endregion
37
+ export { forEach };
@@ -0,0 +1,50 @@
1
+ //#region src/Map/get.d.ts
2
+ /**
3
+ * `Map.get(map, key)`
4
+ *
5
+ * Gets the value associated with `key` from `map`, returning `undefined` if the key doesn't exist.
6
+ *
7
+ * ## Example
8
+ *
9
+ * ```ts
10
+ * Map.get(
11
+ * Map.create([
12
+ * ["a", 1],
13
+ * ["b", 2],
14
+ * ]),
15
+ * "a",
16
+ * ); // 1
17
+ *
18
+ * Map.get(
19
+ * Map.create([
20
+ * ["a", 1],
21
+ * ["b", 2],
22
+ * ]),
23
+ * "c",
24
+ * ); // undefined
25
+ * ```
26
+ *
27
+ * ```ts
28
+ * pipe(
29
+ * Map.create([
30
+ * ["a", 1],
31
+ * ["b", 2],
32
+ * ]),
33
+ * Map.get("a"),
34
+ * ); // 1
35
+ *
36
+ * pipe(
37
+ * Map.create([
38
+ * ["a", 1],
39
+ * ["b", 2],
40
+ * ]),
41
+ * Map.get("c"),
42
+ * ); // undefined
43
+ * ```
44
+ */
45
+ declare const get: {
46
+ <K, V>(key: NoInfer<K>): (target: ReadonlyMap<K, V>) => V | undefined;
47
+ <K, V>(target: ReadonlyMap<K, V>, key: NoInfer<K>): V | undefined;
48
+ };
49
+ //#endregion
50
+ export { get };
@@ -0,0 +1,52 @@
1
+ import { dfdlT } from "@monstermann/dfdl";
2
+
3
+ //#region src/Map/get.ts
4
+ /**
5
+ * `Map.get(map, key)`
6
+ *
7
+ * Gets the value associated with `key` from `map`, returning `undefined` if the key doesn't exist.
8
+ *
9
+ * ## Example
10
+ *
11
+ * ```ts
12
+ * Map.get(
13
+ * Map.create([
14
+ * ["a", 1],
15
+ * ["b", 2],
16
+ * ]),
17
+ * "a",
18
+ * ); // 1
19
+ *
20
+ * Map.get(
21
+ * Map.create([
22
+ * ["a", 1],
23
+ * ["b", 2],
24
+ * ]),
25
+ * "c",
26
+ * ); // undefined
27
+ * ```
28
+ *
29
+ * ```ts
30
+ * pipe(
31
+ * Map.create([
32
+ * ["a", 1],
33
+ * ["b", 2],
34
+ * ]),
35
+ * Map.get("a"),
36
+ * ); // 1
37
+ *
38
+ * pipe(
39
+ * Map.create([
40
+ * ["a", 1],
41
+ * ["b", 2],
42
+ * ]),
43
+ * Map.get("c"),
44
+ * ); // undefined
45
+ * ```
46
+ */
47
+ const get = dfdlT((target, key) => {
48
+ return target.get(key);
49
+ }, 2);
50
+
51
+ //#endregion
52
+ export { get };
@@ -0,0 +1,72 @@
1
+ import { NonNil } from "./internals/types.js";
2
+
3
+ //#region src/Map/getOr.d.ts
4
+
5
+ /**
6
+ * `Map.getOr(map, key, or)`
7
+ *
8
+ * Gets the value associated with `key` from `map`, returning `or` if the key doesn't exist or the value is nullable.
9
+ *
10
+ * ## Example
11
+ *
12
+ * ```ts
13
+ * Map.getOr(
14
+ * Map.create([
15
+ * ["a", 1],
16
+ * ["b", null],
17
+ * ]),
18
+ * "a",
19
+ * 0,
20
+ * ); // 1
21
+ *
22
+ * Map.getOr(
23
+ * Map.create([
24
+ * ["a", 1],
25
+ * ["b", null],
26
+ * ]),
27
+ * "b",
28
+ * 0,
29
+ * ); // 0
30
+ *
31
+ * Map.getOr(
32
+ * Map.create([
33
+ * ["a", 1],
34
+ * ["b", null],
35
+ * ]),
36
+ * "c",
37
+ * 0,
38
+ * ); // 0
39
+ * ```
40
+ *
41
+ * ```ts
42
+ * pipe(
43
+ * Map.create([
44
+ * ["a", 1],
45
+ * ["b", null],
46
+ * ]),
47
+ * Map.getOr("a", 0),
48
+ * ); // 1
49
+ *
50
+ * pipe(
51
+ * Map.create([
52
+ * ["a", 1],
53
+ * ["b", null],
54
+ * ]),
55
+ * Map.getOr("b", 0),
56
+ * ); // 0
57
+ *
58
+ * pipe(
59
+ * Map.create([
60
+ * ["a", 1],
61
+ * ["b", null],
62
+ * ]),
63
+ * Map.getOr("c", 0),
64
+ * ); // 0
65
+ * ```
66
+ */
67
+ declare const getOr: {
68
+ <K, V, U>(key: NoInfer<K>, or: U): (target: ReadonlyMap<K, V>) => NonNil<V> | U;
69
+ <K, V, U>(target: ReadonlyMap<K, V>, key: NoInfer<K>, or: U): NonNil<V> | U;
70
+ };
71
+ //#endregion
72
+ export { getOr };
@@ -0,0 +1,71 @@
1
+ import { dfdlT } from "@monstermann/dfdl";
2
+
3
+ //#region src/Map/getOr.ts
4
+ /**
5
+ * `Map.getOr(map, key, or)`
6
+ *
7
+ * Gets the value associated with `key` from `map`, returning `or` if the key doesn't exist or the value is nullable.
8
+ *
9
+ * ## Example
10
+ *
11
+ * ```ts
12
+ * Map.getOr(
13
+ * Map.create([
14
+ * ["a", 1],
15
+ * ["b", null],
16
+ * ]),
17
+ * "a",
18
+ * 0,
19
+ * ); // 1
20
+ *
21
+ * Map.getOr(
22
+ * Map.create([
23
+ * ["a", 1],
24
+ * ["b", null],
25
+ * ]),
26
+ * "b",
27
+ * 0,
28
+ * ); // 0
29
+ *
30
+ * Map.getOr(
31
+ * Map.create([
32
+ * ["a", 1],
33
+ * ["b", null],
34
+ * ]),
35
+ * "c",
36
+ * 0,
37
+ * ); // 0
38
+ * ```
39
+ *
40
+ * ```ts
41
+ * pipe(
42
+ * Map.create([
43
+ * ["a", 1],
44
+ * ["b", null],
45
+ * ]),
46
+ * Map.getOr("a", 0),
47
+ * ); // 1
48
+ *
49
+ * pipe(
50
+ * Map.create([
51
+ * ["a", 1],
52
+ * ["b", null],
53
+ * ]),
54
+ * Map.getOr("b", 0),
55
+ * ); // 0
56
+ *
57
+ * pipe(
58
+ * Map.create([
59
+ * ["a", 1],
60
+ * ["b", null],
61
+ * ]),
62
+ * Map.getOr("c", 0),
63
+ * ); // 0
64
+ * ```
65
+ */
66
+ const getOr = dfdlT((target, key, or) => {
67
+ return target.get(key) ?? or;
68
+ }, 3);
69
+
70
+ //#endregion
71
+ export { getOr };
@@ -0,0 +1,72 @@
1
+ import { NonNil, OrElse } from "./internals/types.js";
2
+
3
+ //#region src/Map/getOrElse.d.ts
4
+
5
+ /**
6
+ * `Map.getOrElse(map, key, orElse)`
7
+ *
8
+ * Gets the value associated with `key` from `map`, calling `orElse` with the map if the key doesn't exist or the value is nullable.
9
+ *
10
+ * ## Example
11
+ *
12
+ * ```ts
13
+ * Map.getOrElse(
14
+ * Map.create([
15
+ * ["a", 1],
16
+ * ["b", null],
17
+ * ]),
18
+ * "a",
19
+ * () => 0,
20
+ * ); // 1
21
+ *
22
+ * Map.getOrElse(
23
+ * Map.create([
24
+ * ["a", 1],
25
+ * ["b", null],
26
+ * ]),
27
+ * "b",
28
+ * () => 0,
29
+ * ); // 0
30
+ *
31
+ * Map.getOrElse(
32
+ * Map.create([
33
+ * ["a", 1],
34
+ * ["b", null],
35
+ * ]),
36
+ * "c",
37
+ * (map) => map.size,
38
+ * ); // 2
39
+ * ```
40
+ *
41
+ * ```ts
42
+ * pipe(
43
+ * Map.create([
44
+ * ["a", 1],
45
+ * ["b", null],
46
+ * ]),
47
+ * Map.getOrElse("a", () => 0),
48
+ * ); // 1
49
+ *
50
+ * pipe(
51
+ * Map.create([
52
+ * ["a", 1],
53
+ * ["b", null],
54
+ * ]),
55
+ * Map.getOrElse("b", () => 0),
56
+ * ); // 0
57
+ *
58
+ * pipe(
59
+ * Map.create([
60
+ * ["a", 1],
61
+ * ["b", null],
62
+ * ]),
63
+ * Map.getOrElse("c", (map) => map.size),
64
+ * ); // 2
65
+ * ```
66
+ */
67
+ declare const getOrElse: {
68
+ <K, V, U>(key: NoInfer<K>, orElse: OrElse<K, V, U>): (target: ReadonlyMap<K, V>) => NonNil<V> | U;
69
+ <K, V, U>(target: ReadonlyMap<K, V>, key: NoInfer<K>, orElse: OrElse<K, V, U>): NonNil<V> | U;
70
+ };
71
+ //#endregion
72
+ export { getOrElse };