-
Notifications
You must be signed in to change notification settings - Fork 2
/
must.go
65 lines (51 loc) · 1.25 KB
/
must.go
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
package kittehs
import (
"fmt"
)
func Must0(err error) {
if err != nil {
Panic(err)
}
}
func Must1[A any](a A, err error) A {
if err != nil {
Panic(err)
}
return a
}
func Must2[A, B any](a A, b B, err error) (A, B) {
if err != nil {
Panic(err)
}
return a, b
}
// Lazy Must1 with 1 input argument.
func Must11[A, X any](f func(A) (X, error)) func(A) X {
return func(a A) X { return Must1(f(a)) }
}
// Lazy Must2 with 1 input argument.
func Must12[A, X, Y any](f func(A) (X, Y, error)) func(A) (X, Y) {
return func(a A) (X, Y) { return Must2(f(a)) }
}
func MustEqual[T comparable](a, b T, msg ...any) {
if a != b {
Panic(fmt.Sprint(msg...))
}
}
// If err is nil, return t. Else return alt.
func Should1[T any](alt T) func(t T, err error) T { return ShouldFunc1(func(error) T { return alt }) }
func ShouldFunc1[T any](alt func(error) T) func(t T, err error) T {
return func(t T, err error) T {
if err != nil {
return alt(err)
}
return t
}
}
func Should11[X, Y any](alt Y, f func(X) (Y, error)) func(X) Y {
return ShouldFunc11(func(error) Y { return alt }, f)
}
// Same as Should1s, but alt is lazy.
func ShouldFunc11[X, Y any](alt func(error) Y, f func(X) (Y, error)) func(X) Y {
return func(x X) Y { return ShouldFunc1(alt)(f(x)) }
}