-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathtakeWhile.go
79 lines (71 loc) · 1.55 KB
/
takeWhile.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
package glinq
import (
"io"
"sync/atomic"
)
type (
TakeWhileIterator[T any] struct {
iterator[T]
source IEnumerable[T]
pred func(T) bool
ended bool
enumerator IEnumerator[T]
}
)
func NewTakeWhileIterator[T any](source IEnumerable[T], pred func(T) bool) *TakeWhileIterator[T] {
result := &TakeWhileIterator[T]{
source: source,
pred: pred,
}
result.child = result
return result
}
func TakeWhile[T any](source IEnumerable[T], pred func(T) bool) IEnumerable[T] {
return NewTakeWhileIterator(source, pred)
}
func (me *TakeWhileIterator[T]) Clone() IEnumerator[T] {
result := NewTakeWhileIterator(me.source, me.pred)
result.state = 1
return result
}
func (me *TakeWhileIterator[T]) MoveNext() error {
switch me.state {
case 1:
enumerator := me.source.GetEnumerator()
me.enumerator = enumerator
me.state = 2
fallthrough
case 2:
err := me.enumerator.MoveNext()
me.current = me.enumerator.Current()
if !me.pred(me.current) {
me.ended = true
me.state = 100
return io.EOF
}
return err
case 100:
return io.EOF
}
return ErrInvalidState
}
func (me *TakeWhileIterator[T]) Any() bool {
return me.Clone().MoveNext() == nil
}
func (me *TakeWhileIterator[T]) Count() int {
if atomic.CompareAndSwapInt32(&me.state, 0, 1) {
enum := me.source.GetEnumerator()
count := 0
for err := enum.MoveNext(); err == nil; err = enum.MoveNext() {
if me.pred(enum.Current()) {
count++
} else {
break
}
}
return count
} else {
result := NewTakeWhileIterator(me.source, me.pred)
return result.Count()
}
}