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
|
package forgepb
// TODO: autogen this? (probably not feasible. need go-arglike tricks in proto)
import (
"fmt"
"os"
"sort"
sync "sync"
"time"
)
// bad global lock until I figure out some other plan
var reposLock sync.RWMutex
type RepoIterator struct {
sync.RWMutex
packs []*Repo
index int
}
// NewRepoIterator initializes a new iterator.
func NewRepoIterator(packs []*Repo) *RepoIterator {
return &RepoIterator{packs: packs}
}
// Scan moves to the next element and returns false if there are no more packs.
func (it *RepoIterator) Scan() bool {
if it.index >= len(it.packs) {
return false
}
it.index++
return true
}
// Repo returns the current repo.
func (it *RepoIterator) Repo() *Repo {
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.Repo()
// fmt.Println("Repo UUID:", d.Uuid)
// }
func (r *Repos) All() *RepoIterator {
repoPointers := r.selectAllRepos()
iterator := NewRepoIterator(repoPointers)
return iterator
}
func (r *Repos) SortByName() *RepoIterator {
packs := r.selectAllRepos()
sort.Sort(ByRepoName(packs))
iterator := NewRepoIterator(packs)
return iterator
}
// enforces no duplicate repo names
func (r *Repos) Append(newP *Repo) bool {
reposLock.Lock()
defer reposLock.Unlock()
for _, p := range r.Repos {
if p.Name == newP.Name {
return false
}
}
r.Repos = append(r.Repos, newP)
return true
}
// returns time.Duration since last Update()
func (r *Repo) Age(newP *Repo) time.Duration {
t := time.Since(r.Verstamp.AsTime())
return t
}
// find a repo by name
func (r *Repos) FindByName(name string) *Repo {
reposLock.RLock()
defer reposLock.RUnlock()
for _, p := range r.Repos {
if p.Name == name {
return p
}
}
return nil
}
func (r *Repos) Len() int {
reposLock.RLock()
defer reposLock.RUnlock()
return len(r.Repos)
}
type ByRepoName []*Repo
func (a ByRepoName) Len() int { return len(a) }
func (a ByRepoName) Less(i, j int) bool { return a[i].Name < a[j].Name }
func (a ByRepoName) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
func (all *Repos) DeleteByName(name string) *Repo {
reposLock.Lock()
defer reposLock.Unlock()
var newr Repo
for i, _ := range all.Repos {
if all.Repos[i].Name == name {
newr = *all.Repos[i]
all.Repos[i] = all.Repos[len(all.Repos)-1]
all.Repos = all.Repos[:len(all.Repos)-1]
return &newr
}
}
return nil
}
// safely returns a slice of pointers to the Repo protobufs
func (r *Repos) selectAllRepos() []*Repo {
reposLock.RLock()
defer reposLock.RUnlock()
// Create a new slice to hold pointers to each Repo
var allPacks []*Repo
allPacks = make([]*Repo, len(r.Repos))
for i, p := range r.Repos {
allPacks[i] = p // Copy pointers for safe iteration
}
return allPacks
}
|
