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
|
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 godeplock sync.RWMutex
type GoDepIterator struct {
sync.RWMutex
packs []*GoDep
index int
}
// NewGoDepGoDepIterator initializes a new iterator.
func NewGoDepIterator(packs []*GoDep) *GoDepIterator {
return &GoDepIterator{packs: packs}
}
// Scan moves to the next element and returns false if there are no more packs.
func (it *GoDepIterator) Scan() bool {
if it.index >= len(it.packs) {
return false
}
it.index++
return true
}
// GoDep returns the current repo.
func (it *GoDepIterator) GoDep() *GoDep {
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.GoDep()
// fmt.Println("GoDep UUID:", d.Uuid)
// }
func (r *GoDeps) All() *GoDepIterator {
repoPointers := r.selectAllGoDeps()
iterator := NewGoDepIterator(repoPointers)
return iterator
}
func (r *GoDeps) SortByName() *GoDepIterator {
packs := r.selectAllGoDeps()
sort.Sort(GoDepByPath(packs))
iterator := NewGoDepIterator(packs)
return iterator
}
// enforces no duplicate package names
func (r *GoDeps) Append(newP *GoDep) bool {
refslock.Lock()
defer refslock.Unlock()
for _, p := range r.GoDeps {
if p.GoPath == newP.GoPath {
return false
}
}
r.GoDeps = append(r.GoDeps, newP)
return true
}
// returns time.Duration since last Update()
func (r *GoDep) Age(newP *GoDep) time.Duration {
t := time.Since(r.Ctime.AsTime())
return t
}
// find a dependancy by the go path
func (r *GoDeps) FindByPath(gopath string) *GoDep {
refslock.RLock()
defer refslock.RUnlock()
for _, p := range r.GoDeps {
if p.GoPath == gopath {
return p
}
}
return nil
}
func (r *GoDeps) Len() int {
refslock.RLock()
defer refslock.RUnlock()
return len(r.GoDeps)
}
type GoDepByPath []*GoDep
func (a GoDepByPath) Len() int { return len(a) }
func (a GoDepByPath) Less(i, j int) bool { return a[i].GoPath < a[j].GoPath }
func (a GoDepByPath) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
// safely returns a slice of pointers to the GoDep protobufs
func (r *GoDeps) selectAllGoDeps() []*GoDep {
refslock.RLock()
defer refslock.RUnlock()
// Create a new slice to hold pointers to each GoDep
var allPacks []*GoDep
allPacks = make([]*GoDep, len(r.GoDeps))
for i, p := range r.GoDeps {
allPacks[i] = p // Copy pointers for safe iteration
}
return allPacks
}
func (all *GoDeps) DeleteByHash(hash string) *GoDep {
refslock.Lock()
defer refslock.Unlock()
for i, _ := range all.GoDeps {
if all.GoDeps[i].Hash == hash {
all.GoDeps[i] = all.GoDeps[len(all.GoDeps)-1]
all.GoDeps = all.GoDeps[:len(all.GoDeps)-1]
return nil
}
}
return nil
}
|
