-
Notifications
You must be signed in to change notification settings - Fork 2
/
lister.go
64 lines (56 loc) · 1.54 KB
/
lister.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
package ocimem
import (
"context"
"sort"
"github.com/rogpeppe/ociregistry"
)
func (r *Registry) Repositories(ctx context.Context) ociregistry.Iter[string] {
r.mu.Lock()
defer r.mu.Unlock()
return mapKeysIter(r.repos, stringLess)
}
func (r *Registry) Tags(ctx context.Context, repoName string) ociregistry.Iter[string] {
r.mu.Lock()
defer r.mu.Unlock()
repo, err := r.repo(repoName)
if err != nil {
return ociregistry.ErrorIter[string](err)
}
return mapKeysIter(repo.tags, stringLess)
}
func (r *Registry) Referrers(ctx context.Context, repoName string, digest ociregistry.Digest, artifactType string) ociregistry.Iter[ociregistry.Descriptor] {
r.mu.Lock()
defer r.mu.Unlock()
repo, err := r.repo(repoName)
if err != nil {
return ociregistry.ErrorIter[ociregistry.Descriptor](err)
}
var referrers []ociregistry.Descriptor
for _, b := range repo.manifests {
if b.subject != digest {
continue
}
// TODO filter by artifact type
referrers = append(referrers, b.descriptor())
}
sort.Slice(referrers, func(i, j int) bool {
return descriptorLess(referrers[i], referrers[j])
})
return ociregistry.SliceIter(referrers)
}
func mapKeysIter[K comparable, V any](m map[K]V, less func(K, K) bool) ociregistry.Iter[K] {
ks := make([]K, 0, len(m))
for k := range m {
ks = append(ks, k)
}
sort.Slice(ks, func(i, j int) bool {
return less(ks[i], ks[j])
})
return ociregistry.SliceIter(ks)
}
func stringLess(s1, s2 string) bool {
return s1 < s2
}
func descriptorLess(d1, d2 ociregistry.Descriptor) bool {
return d1.Digest < d2.Digest
}