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 fzf
var EmptyMerger *Merger = NewMerger([][]*Item{}, false)
type Merger struct {
lists [][]*Item
merged []*Item
cursors []int
done bool
}
func NewMerger(lists [][]*Item, sorted bool) *Merger {
mg := Merger{
lists: lists,
merged: []*Item{},
cursors: make([]int, len(lists)),
done: false}
if !sorted {
for _, list := range lists {
mg.merged = append(mg.merged, list...)
}
mg.done = true
}
return &mg
}
func (mg *Merger) Length() int {
cnt := 0
for _, list := range mg.lists {
cnt += len(list)
}
return cnt
}
func (mg *Merger) Get(idx int) *Item {
if mg.done {
return mg.merged[idx]
} else if len(mg.lists) == 1 {
return mg.lists[0][idx]
}
mg.buildUpto(idx)
return mg.merged[idx]
}
func (mg *Merger) buildUpto(upto int) {
numBuilt := len(mg.merged)
if numBuilt > upto {
return
}
for i := numBuilt; i <= upto; i++ {
minRank := Rank{0, 0, 0}
minIdx := -1
for listIdx, list := range mg.lists {
cursor := mg.cursors[listIdx]
if cursor < 0 || cursor == len(list) {
mg.cursors[listIdx] = -1
continue
}
if cursor >= 0 {
rank := list[cursor].Rank()
if minIdx < 0 || compareRanks(rank, minRank) {
minRank = rank
minIdx = listIdx
}
}
mg.cursors[listIdx] = cursor
}
if minIdx >= 0 {
chosen := mg.lists[minIdx]
mg.merged = append(mg.merged, chosen[mg.cursors[minIdx]])
mg.cursors[minIdx] += 1
} else {
mg.done = true
return
}
}
}
|
