Repository navigation
Expand file tree
/
Copy pathpartition.go
More file actions
92 lines (88 loc) · 2.24 KB
/
Copy pathpartition.go
File metadata and controls
92 lines (88 loc) · 2.24 KB
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
package fp
import (
"reflect"
)
func (q *stream) Partition(size int) Stream {
if size < 1 {
panic("batch size should be greater than 0")
}
return newStream(newCtx(q.ctx), reflect.SliceOf(q.expectElemTyp), q.iter, func(next iterator) iterator {
typ := reflect.SliceOf(q.expectElemTyp)
return func() (reflect.Value, bool) {
var slice reflect.Value
for i := 0; i < size; i++ {
if val, ok := next(); !ok {
break
} else {
if !slice.IsValid() {
slice = reflect.Zero(typ)
}
slice = reflect.Append(slice, val)
}
}
return slice, slice.IsValid() && slice.Len() > 0
}
})
}
func (q *stream) PartitionBy(fn interface{}, includeSplittor bool) Stream {
fnval := reflect.ValueOf(fn)
return newStream(newCtx(q.ctx), reflect.SliceOf(q.expectElemTyp), q.iter, func(next iterator) iterator {
typ := reflect.SliceOf(q.expectElemTyp)
return func() (reflect.Value, bool) {
var slice reflect.Value
for {
if val, ok := next(); !ok {
break
} else {
if !slice.IsValid() {
slice = reflect.Zero(typ)
}
if fnval.Call([]reflect.Value{val})[0].Bool() {
if includeSplittor {
slice = reflect.Append(slice, val)
}
if slice.Len() == 0 {
continue
}
break
}
slice = reflect.Append(slice, val)
}
}
return slice, slice.IsValid() && slice.Len() > 0
}
})
}
func (q *stream) LPartitionBy(fn interface{}, includeSplittor bool) Stream {
if !includeSplittor {
return q.PartitionBy(fn, includeSplittor)
}
fnval := reflect.ValueOf(fn)
return newStream(newCtx(q.ctx), reflect.SliceOf(q.expectElemTyp), q.iter, func(next iterator) iterator {
typ := reflect.SliceOf(q.expectElemTyp)
var lastHead reflect.Value
return func() (reflect.Value, bool) {
slice := reflect.Zero(typ)
if lastHead.IsValid() {
slice = reflect.Append(slice, lastHead)
lastHead = reflect.Value{}
}
for {
if val, ok := next(); !ok {
break
} else {
if fnval.Call([]reflect.Value{val})[0].Bool() {
if slice.Len() == 0 {
slice = reflect.Append(slice, val)
continue
}
lastHead = val
break
}
slice = reflect.Append(slice, val)
}
}
return slice, slice.IsValid() && slice.Len() > 0
}
})
}