/
set.go
328 lines (287 loc) · 5.85 KB
/
set.go
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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
package pkgset
import (
"sort"
"strings"
"github.com/kralicky/goda/pkg/stat"
"golang.org/x/tools/go/packages"
)
// Set is a p.ID -> *packages.Package
type Set map[string]*packages.Package
// New makes a set from roots recursively
func New(roots ...*packages.Package) Set {
set := make(Set)
for _, p := range roots {
set.IncludeRecursive(p)
}
return set
}
// NewRoot makes a set from roots recursively
func NewRoot(roots ...*packages.Package) Set {
set := make(Set)
for _, p := range roots {
set[p.ID] = p
}
return set
}
// NewAll includes all the dependencies from the graph.
func NewAll(src Set) Set {
set := make(Set)
for _, p := range src {
set.IncludeRecursive(p)
}
return set
}
// List returns packages in unsorted order.
func (set Set) List() []*packages.Package {
dst := make([]*packages.Package, 0, len(set))
for _, p := range set {
dst = append(dst, p)
}
return dst
}
// IDs returns package ID-s in sorted order.
func (set Set) IDs() []string {
rs := []string{}
for id := range set {
rs = append(rs, id)
}
sort.Strings(rs)
return rs
}
// Sorted returns packages in sorted order
func (set Set) Sorted() []*packages.Package {
var list []*packages.Package
for _, pkg := range set {
list = append(list, pkg)
}
sort.Slice(list, func(i, k int) bool {
return list[i].ID < list[k].ID
})
return list
}
func (set Set) Walk(fn func(*packages.Package)) {
for _, p := range set {
fn(p)
}
}
func (set Set) WalkDependencies(fn func(*packages.Package)) {
seen := map[string]bool{}
var walk func(*packages.Package)
walk = func(p *packages.Package) {
if seen[p.ID] {
return
}
seen[p.ID] = true
fn(p)
for _, child := range p.Imports {
walk(child)
}
}
for _, p := range set {
walk(p)
}
}
// IncludeRecursive adds p recursively
func (set Set) IncludeRecursive(p *packages.Package) {
if _, added := set[p.ID]; added {
return
}
set[p.ID] = p
for _, imp := range p.Imports {
set.IncludeRecursive(imp)
}
}
// Clone makes a copy of the set
func (set Set) Clone() Set {
r := make(Set, len(set))
for pid, p := range set {
r[pid] = p // TODO: make a deep clone
}
return r
}
// Union includes packages from both sets
func Union(a, b Set) Set {
if len(a) == 0 {
return b.Clone()
}
r := a.Clone()
for pid, p := range b {
if _, exists := r[pid]; !exists {
r[pid] = p
}
}
return r
}
// Subtract returns packages that exist in a, but not in b
func Subtract(a, b Set) Set {
r := a.Clone()
for pid := range b {
delete(r, pid)
}
return r
}
// Intersect returns packages that exist in both
func Intersect(a, b Set) Set {
r := make(Set, len(a))
for pid := range b {
if p, ok := a[pid]; ok {
r[pid] = p
}
}
return r
}
// SymmetricDifference returns packages that are different
func SymmetricDifference(a, b Set) Set {
r := make(Set, len(a))
for pid, p := range a {
if _, ok := b[pid]; !ok {
r[pid] = p
}
}
for pid, p := range b {
if _, ok := a[pid]; !ok {
r[pid] = p
}
}
return r
}
// Reach returns packages in a that terminate in b
func Reach(a, b Set) Set {
result := New()
reaches := b.Clone()
cannotReach := New()
var checkReachability func(p *packages.Package) bool
checkReachability = func(p *packages.Package) bool {
if _, ok := reaches[p.ID]; ok {
return true
}
if _, ok := cannotReach[p.ID]; ok {
return false
}
for _, dep := range p.Imports {
if checkReachability(dep) {
if _, ina := a[p.ID]; ina {
result[p.ID] = p
}
reaches[p.ID] = p
return true
}
}
cannotReach[p.ID] = p
return false
}
for _, p := range a {
if _, reaches := b[p.ID]; reaches {
result[p.ID] = p
continue
}
checkReachability(p)
}
return result
}
// Incoming returns packages from a that directly import packages in b.
func Incoming(a, b Set) Set {
result := b.Clone()
next:
for _, x := range a {
for _, imp := range x.Imports {
if _, ok := b[imp.ID]; ok {
result[x.ID] = x
continue next
}
}
}
return result
}
// Transitive returns transitive reduction.
func Transitive(a Set) Set {
result := a.Clone()
var includeDeps func(p *packages.Package, r map[string]struct{})
includeDeps = func(p *packages.Package, r map[string]struct{}) {
for _, c := range p.Imports {
if _, visited := r[c.ID]; visited {
continue
}
r[c.ID] = struct{}{}
includeDeps(c, r)
}
}
for _, p := range result {
indirectDeps := make(map[string]struct{})
for _, c := range p.Imports {
includeDeps(c, indirectDeps)
}
for dep := range indirectDeps {
delete(p.Imports, dep)
}
}
return result
}
// Sources returns packages that don't have incoming edges
func Sources(a Set) Set {
incoming := map[string]int{}
a.WalkDependencies(func(p *packages.Package) {
for _, dep := range p.Imports {
incoming[dep.ID]++
}
})
result := New()
for _, p := range a {
if incoming[p.ID] == 0 {
result[p.ID] = p
}
}
return result
}
// DirectDependencies returns packages that are direct dependencies of a, `a` not included.
func DirectDependencies(a Set) Set {
rs := map[string]*packages.Package{}
for _, p := range a {
for _, dep := range p.Imports {
if _, ok := a[dep.ID]; ok {
continue
}
rs[dep.ID] = dep
}
}
return rs
}
func Large(a Set) Set {
rs := map[string]*packages.Package{}
for _, p := range a {
s, errs := stat.Package(p)
if len(errs) > 0 {
continue
}
// > 1MB
if s.Go.Size >= 1024*1024 {
rs[p.ID] = p
}
}
return rs
}
// Main returns main pacakges.
func Main(a Set) Set {
rs := Set{}
for pid, pkg := range a {
if pkg.Name == "main" {
rs[pid] = pkg
}
}
return rs
}
// Test returns test packages from set.
func Test(a Set) Set {
rs := Set{}
for pid, pkg := range a {
if IsTestPkg(pkg) {
rs[pid] = pkg
}
}
return rs
}
func IsTestPkg(pkg *packages.Package) bool {
return strings.HasSuffix(pkg.ID, ".test") ||
strings.HasSuffix(pkg.ID, "_test") ||
strings.HasSuffix(pkg.ID, ".test]")
}