-
Notifications
You must be signed in to change notification settings - Fork 6
/
failable.ts
109 lines (102 loc) · 3.13 KB
/
failable.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
/**
* Failable is a compound structure. It represents the idea of failure. As such
* it includes methods for creating a `failed` data, providing alternative
* data, and recovering from a failed state (effectively flatMapping from the
* failed value).
*
* @module Failable
* @since 2.0.0
*/
import type { $, Hold, Kind } from "./kind.ts";
import type { Flatmappable } from "./flatmappable.ts";
import type { NonEmptyArray } from "./array.ts";
import { flow } from "./fn.ts";
/**
* A Failable structure is a Flatmappable that allows for alternative instances,
* failures, and recovery.
*
* @since 2.0.0
*/
export interface Failable<U extends Kind> extends Flatmappable<U>, Hold<U> {
readonly alt: <A, B = never, C = never, D = unknown, E = unknown>(
second: $<U, [A, B, C], [D], [E]>,
) => (first: $<U, [A, B, C], [D], [E]>) => $<U, [A, B, C], [D], [E]>;
readonly fail: <A = never, B = never, C = never, D = unknown, E = unknown>(
value: B,
) => $<U, [A, B, C], [D], [E]>;
readonly recover: <B, I, J = never, K = never, L = unknown, M = unknown>(
fbti: (b: B) => $<U, [I, J, K], [L], [M]>,
) => <A = never, C = never>(
ua: $<U, [A, B, C], [L], [M]>,
) => $<U, [A | I, J, C | K], [L], [M]>;
}
/**
* The return type of createTryAll for Failable. Useful for reducing type
* inference in the docs.
*
* @since 2.0.0
*/
export type TryAll<U extends Kind> = <A, B, C, D, E>(
...uas: NonEmptyArray<$<U, [A, B, C], [D], [E]>>
) => $<U, [A, B, C], [D], [E]>;
/**
* Create a tryAll function from an instance of Failable. The tryAll function
* allows the trying any number of Failable structures in order until a
* non-failed one is found.
*
* @since 2.0.0
*/
export function createTryAll<U extends Kind>(
{ recover }: Failable<U>,
): <A, B, C, D, E>(
...uas: NonEmptyArray<$<U, [A, B, C], [D], [E]>>
) => $<U, [A, B, C], [D], [E]> {
return (...uas) => {
const [head, ...tail] = uas;
let out = head;
for (const ua of tail) {
out = recover(() => ua)(out);
}
return out;
};
}
/**
* The return type of createTap for Failable. Useful for reducing type
* inference in the docs.
*
* @since 2.0.0
*/
export type Tap<U extends Kind> = <A, B>(
onSuccess: (value: A) => void,
onFailure: (value: B) => void,
) => <C = never, D = unknown, E = unknown>(
ua: $<U, [A, B, C], [D], [E]>,
) => $<U, [A, B, C], [D], [E]>;
/**
* Create a tap function for a structure with instances of Wrappable and
* Flatmappable. A tap function allows one to break out of the functional
* codeflow. It is generally not advised to use tap for code flow but to
* consider an escape hatch to do things like tracing or logging.
*
* @since 2.0.0
*/
export function createTap<U extends Kind>(
{ wrap, fail, flatmap, recover }: Failable<U>,
): <A, B>(
onSuccess: (value: A) => void,
onFailure: (value: B) => void,
) => <C = never, D = unknown, E = unknown>(
ua: $<U, [A, B, C], [D], [E]>,
) => $<U, [A, B, C], [D], [E]> {
return (onSuccess, onFailure) =>
flow(
flatmap((a) => {
onSuccess(a);
return wrap(a);
}),
recover((b) => {
onFailure(b);
return fail(b);
}),
);
}