-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathArray.go
75 lines (64 loc) · 1.64 KB
/
Array.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
66
67
68
69
70
71
72
73
74
75
package blume
type Array[A any] struct{ Value []A }
type Length int
func (l Length) Is(i int) bool { return int(l) == i }
func (l Length) Gt(i int) bool { return int(l) > i }
func (l Length) Lt(i int) bool { return int(l) < i }
func (l Length) Ge(i int) bool { return int(l) >= i }
func (l Length) Le(i int) bool { return int(l) <= i }
func (l Length) Eq(i int) bool { return int(l) == i }
func (l Length) Ne(i int) bool { return int(l) != i }
func (arr Array[A]) Len() Length { return Length(len(arr.Value)) }
func (arr Array[A]) Get(i int) (res Option[A]) {
if i < 0 {
i = len(arr.Value) + i
}
if i < 0 {
return res.Fail()
}
if i >= len(arr.Value) {
return res.Fail()
}
return res.Pass(arr.Value[i])
}
func Arr[A any](args ...A) Array[A] { return Array[A]{Value: args} }
func ToArray[A any](a []A) Array[A] { return Array[A]{a} }
func (arr Array[A]) Filter(fn Pred[A]) Array[A] {
res := []A{}
for _, val := range arr.Value {
if fn(val) {
res = append(res, val)
}
}
return Array[A]{Value: res}
}
func (arr Array[A]) Filter_map(fn func(A) Option[A]) Array[A] {
res := []A{}
for _, val := range arr.Value {
if ret := fn(val); ret.Other {
res = append(res, ret.Value)
}
}
return Array[A]{Value: res}
}
func (arr Array[A]) First(fn Pred[A]) (res Option[A]) {
for _, val := range arr.Value {
if fn(val) {
return res.Pass(val)
}
}
return res.Fail()
}
func (arr Array[A]) Map(fn func(A) A) Array[A] {
res := make([]A, len(arr.Value))
for i, val := range arr.Value {
res[i] = fn(val)
}
return Array[A]{Value: res}
}
func (arr Array[A]) Each(fn func(A)) Array[A] {
for _, value := range arr.Value {
fn(value)
}
return arr
}