-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmerge_ordered.go
More file actions
65 lines (58 loc) · 1.38 KB
/
Copy pathmerge_ordered.go
File metadata and controls
65 lines (58 loc) · 1.38 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
package iter_lib
import (
"cmp"
"iter"
)
// MergeOrdered returns an iterator that yields values from both input sequences in ascending or descending order based on desc flag.
func MergeOrdered[V cmp.Ordered](s1, s2 iter.Seq[V], desc bool) iter.Seq[V] {
return func(yield func(V) bool) {
next1, stop1 := iter.Pull(s1)
defer stop1()
next2, stop2 := iter.Pull(s2)
defer stop2()
// Get initial values
v1, ok1 := next1()
v2, ok2 := next2()
// Main merge loop
for ok1 || ok2 {
if !ok2 || (ok1 && ((v1 <= v2) != desc)) {
if !yield(v1) {
return
}
v1, ok1 = next1()
} else {
if !yield(v2) {
return
}
v2, ok2 = next2()
}
}
}
}
// MergeOrdered2 returns an iterator that yields key-value pairs from both input sequences
// in ascending or descending order based on desc flag and the value component.
func MergeOrdered2[K any, V cmp.Ordered](s1, s2 iter.Seq2[K, V], desc bool) iter.Seq2[K, V] {
return func(yield func(K, V) bool) {
next1, stop1 := iter.Pull2(s1)
defer stop1()
next2, stop2 := iter.Pull2(s2)
defer stop2()
// Get initial values
k1, v1, ok1 := next1()
k2, v2, ok2 := next2()
// Main merge loop
for ok1 || ok2 {
if !ok2 || (ok1 && ((v1 <= v2) != desc)) {
if !yield(k1, v1) {
return
}
k1, v1, ok1 = next1()
} else {
if !yield(k2, v2) {
return
}
k2, v2, ok2 = next2()
}
}
}
}