-
Notifications
You must be signed in to change notification settings - Fork 1
/
while.go
144 lines (123 loc) · 2.33 KB
/
while.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
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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
package seq
import "github.com/kamstrup/fn/opt"
var _ Seq[int] = whileSeq[int]{}
type whileSeq[T any] struct {
seq Seq[T]
pred Predicate[T]
}
func WhileOf[T any](seq Seq[T], pred Predicate[T]) Seq[T] {
return whileSeq[T]{
seq: seq,
pred: pred,
}
}
func (w whileSeq[T]) ForEach(f Func1[T]) opt.Opt[T] {
var (
fst opt.Opt[T]
tail Seq[T]
)
for fst, tail = w.First(); fst.Ok(); fst, tail = tail.First() {
f(fst.Must())
}
return zeroIfEmpty(fst)
}
func (w whileSeq[T]) ForEachIndex(f Func2[int, T]) opt.Opt[T] {
var (
fst opt.Opt[T]
tail Seq[T]
i int
)
for fst, tail = w.First(); fst.Ok(); fst, tail = tail.First() {
f(i, fst.Must())
i++
}
return zeroIfEmpty(fst)
}
func (w whileSeq[T]) Len() (int, bool) {
return LenUnknown, false
}
func (w whileSeq[T]) ToSlice() Slice[T] {
head, _ := w.seq.TakeWhile(w.pred)
return head
}
func (w whileSeq[T]) Limit(n int) Seq[T] {
return LimitOf[T](w, n)
}
func (w whileSeq[T]) Take(n int) (Slice[T], Seq[T]) {
if n == 0 {
return []T{}, w
}
var (
arr []T
fst opt.Opt[T]
tail Seq[T] = w
)
for i := 0; i < n; i++ {
fst, tail = tail.First()
val, err := fst.Return()
if err != nil {
return arr, ErrorOf[T](err)
}
arr = append(arr, val)
}
return arr, tail
}
func (w whileSeq[T]) TakeWhile(pred Predicate[T]) (Slice[T], Seq[T]) {
var (
arr []T
fst opt.Opt[T]
tail Seq[T]
)
for fst, tail = w.First(); fst.Ok(); fst, tail = tail.First() {
val := fst.Must()
if pred(val) {
arr = append(arr, val)
} else {
return arr, PrependOf(val, tail)
}
}
return arr, tail
}
func (w whileSeq[T]) Skip(n int) Seq[T] {
var (
i int
fst opt.Opt[T]
tail Seq[T]
)
for fst, tail = w.First(); !fst.Empty() && i < n; fst, tail = tail.First() {
i++
}
return tail
}
func (w whileSeq[T]) Where(pred Predicate[T]) Seq[T] {
return whereSeq[T]{
seq: w,
pred: pred,
}
}
func (w whileSeq[T]) While(pred Predicate[T]) Seq[T] {
return whileSeq[T]{
seq: w,
pred: pred,
}
}
func (w whileSeq[T]) First() (opt.Opt[T], Seq[T]) {
fst, tail := w.seq.First()
val, err := fst.Return()
if err != nil {
return fst, tail
}
if !w.pred(val) {
return opt.Empty[T](), Empty[T]()
}
return fst, whileSeq[T]{
seq: tail,
pred: w.pred,
}
}
func (w whileSeq[K]) Map(shaper FuncMap[K, K]) Seq[K] {
return mappedSeq[K, K]{
f: shaper,
seq: w,
}
}