-
Notifications
You must be signed in to change notification settings - Fork 38
/
dependencies.go
106 lines (91 loc) · 2.22 KB
/
dependencies.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
package core
import (
"fmt"
"go.uber.org/zap"
)
type (
Dependency struct {
Source ResourceKey
Target ResourceKey
}
Dependencies ConcurrentMap[Dependency, struct{}]
)
func (d *Dependencies) _m() *ConcurrentMap[Dependency, struct{}] {
return (*ConcurrentMap[Dependency, struct{}])(d)
}
func (d *Dependencies) Add(source ResourceKey, target ResourceKey) {
m := d._m()
m.Set(Dependency{Source: source, Target: target}, struct{}{})
zap.S().Debugf("deps += [%s -> %s]", source, target)
}
func (d *Dependencies) Remove(source ResourceKey, target ResourceKey) bool {
m := d._m()
_, changed := m.Delete(Dependency{Source: source, Target: target})
return changed
}
func (d *Dependencies) RemoveSource(source ResourceKey) (changed bool) {
m := d._m()
for _, dep := range m.Keys() {
if dep.Source == source {
m.Delete(dep)
changed = true
}
}
return
}
func (d *Dependencies) RemoveTarget(target ResourceKey) (changed bool) {
m := d._m()
for _, dep := range m.Keys() {
if dep.Target == target {
m.Delete(dep)
changed = true
}
}
return
}
func (d *Dependencies) Contains(dep Dependency) bool {
m := d._m()
_, contains := m.Get(dep)
return contains
}
func (d *Dependencies) Downstream(source ResourceKey) (targets []ResourceKey) {
m := d._m()
for _, dep := range m.Keys() {
if dep.Source == source {
targets = append(targets, dep.Target)
}
}
return
}
func (d *Dependencies) Upstream(target ResourceKey) (sources []ResourceKey) {
m := d._m()
for _, dep := range m.Keys() {
if dep.Target == target {
sources = append(sources, dep.Source)
}
}
return
}
func (d *Dependencies) Clone() *Dependencies {
m := d._m()
var n ConcurrentMap[Dependency, struct{}]
for _, dep := range m.Keys() {
n.Set(dep, struct{}{})
}
return (*Dependencies)(&n)
}
func (d *Dependencies) ToArray() []Dependency {
return d._m().Keys()
}
func (d *Dependencies) String() string {
m := d._m()
depsBySource := make(map[ResourceKey][]ResourceKey)
for _, dep := range m.Keys() {
depsBySource[dep.Source] = append(depsBySource[dep.Source], dep.Target)
}
s := make([]string, 0, len(depsBySource))
for src, targets := range depsBySource {
s = append(s, fmt.Sprintf("%s -> %v", src, targets))
}
return fmt.Sprintf("%v", s)
}