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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
package gitpb
// this is becoming a standard format
// todo: autogenerate this from the .proto file?
import (
"fmt"
"os"
"sort"
sync "sync"
"time"
)
// bad global lock until I figure out some other plan
var lock sync.RWMutex
type RefIterator struct {
sync.RWMutex
packs []*Ref
index int
}
// NewRefIterator initializes a new iterator.
func NewRefIterator(packs []*Ref) *RefIterator {
return &RefIterator{packs: packs}
}
// Scan moves to the next element and returns false if there are no more packs.
func (it *RefIterator) Scan() bool {
if it.index >= len(it.packs) {
return false
}
it.index++
return true
}
// Ref returns the current repo.
func (it *RefIterator) Ref() *Ref {
if it.packs[it.index-1] == nil {
for i, d := range it.packs {
fmt.Println("i =", i, d)
}
fmt.Println("len =", len(it.packs))
fmt.Println("repo == nil", it.index, it.index-1)
os.Exit(-1)
}
return it.packs[it.index-1]
}
// Use Scan() in a loop, similar to a while loop
//
// for iterator.Scan() {
// d := iterator.Ref()
// fmt.Println("Ref UUID:", d.Uuid)
// }
func (r *Refs) All() *RefIterator {
repoPointers := r.selectAllRefs()
iterator := NewRefIterator(repoPointers)
return iterator
}
func (r *Refs) SortByName() *RefIterator {
packs := r.selectAllRefs()
sort.Sort(ByName(packs))
iterator := NewRefIterator(packs)
return iterator
}
// enforces no duplicate package names
func (r *Refs) Append(newP *Ref) bool {
lock.Lock()
defer lock.Unlock()
for _, p := range r.Refs {
if p.RefName == newP.RefName {
return false
}
}
r.Refs = append(r.Refs, newP)
return true
}
// returns time.Duration since last Update()
func (r *Ref) Age(newP *Ref) time.Duration {
t := time.Since(r.Ctime.AsTime())
return t
}
// find a package by name
func (r *Refs) FindByName(name string) *Ref {
lock.RLock()
defer lock.RUnlock()
for _, p := range r.Refs {
if p.RefName == name {
return p
}
}
return nil
}
func (r *Refs) Len() int {
lock.RLock()
defer lock.RUnlock()
return len(r.Refs)
}
type ByName []*Ref
func (a ByName) Len() int { return len(a) }
func (a ByName) Less(i, j int) bool { return a[i].RefName < a[j].RefName }
func (a ByName) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
// safely returns a slice of pointers to the Ref protobufs
func (r *Refs) selectAllRefs() []*Ref {
lock.RLock()
defer lock.RUnlock()
// Create a new slice to hold pointers to each Ref
var allPacks []*Ref
allPacks = make([]*Ref, len(r.Refs))
for i, p := range r.Refs {
allPacks[i] = p // Copy pointers for safe iteration
}
return allPacks
}
/*
func (r *Refs) UnmergedRefRepos() *RefRepoIterator {
repoPointers := r.selectUnmergedRefRepos()
sort.Sort(ByName(repoPointers))
iterator := NewRefRepoIterator(repoPointers)
return iterator
}
*/
/*
// this sort doesn't really work. I think it forgets to sort the last two
// todo: sort this out. literally
// SelectRefPointers safely returns a slice of pointers to Ref records.
func (r *Refs) selectUnmergedRefs() []*RefRow {
r.RLock()
defer r.RUnlock()
// Create a new slice to hold pointers to each Ref
// repoPointers := make([]*Ref, len(c.E.Refs))
var repoPointers []*RefRow
for _, repo := range me.allrepos {
repoPointers = append(repoPointers, repo) // Copy pointers for safe iteration
}
return repoPointers
}
*/
|
