-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathserver_feature_reset.go
More file actions
115 lines (101 loc) · 3 KB
/
server_feature_reset.go
File metadata and controls
115 lines (101 loc) · 3 KB
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
package caskin
import "encoding/json"
func (s *server) ResetFeature(domain Domain) error {
sourceG2 := getSourceFeatureG2(s.Enforcer, domain)
targetG2 := getTargetFeatureG2(s.Dictionary)
var source, target []string
for k, relation := range sourceG2 {
for _, v := range relation {
source = append(source, (&InheritanceEdge[string]{}).Encode(k, v))
}
}
for k, relation := range targetG2 {
for _, v := range relation {
target = append(target, (&InheritanceEdge[string]{}).Encode(k, v))
}
}
var toDelete []Object
for k := range sourceG2 {
if _, ok := targetG2[k]; !ok {
toDelete = append(toDelete, &NamedObject{Name: k})
}
}
for _, v := range toDelete {
if err := s.Enforcer.RemoveObjectInDomain(v, domain); err != nil {
return err
}
}
graph := MergeInheritanceGraph(sourceG2, targetG2)
index := graph.TopSort()
sorter := NewEdgeSorter(index)
add, remove := Diff(source, target)
if err := inheritanceAction(add, domain, sorter.RootFirstSort, s.Enforcer.AddParentForObjectInDomain); err != nil {
return err
}
if err := inheritanceAction(remove, domain, sorter.LeafFirstSort, s.Enforcer.RemoveParentForObjectInDomain); err != nil {
return err
}
return nil
}
func getSourceFeatureG2(e IEnforcer, domain Domain) map[string][]string {
queue := []string{DefaultFeatureRootName}
inQueue := map[string]bool{DefaultFeatureRootName: true}
m := map[string][]string{}
// BFS: queue grows as children are discovered
for i := 0; i < len(queue); i++ {
current := queue[i]
m[current] = []string{}
ll := e.GetChildrenForObjectInDomain(&NamedObject{Name: current}, domain)
for _, v := range ll {
if _, ok := inQueue[v.Encode()]; !ok {
queue = append(queue, v.Encode())
inQueue[v.Encode()] = true
}
m[current] = append(m[current], v.Encode())
}
}
return m
}
func getTargetFeatureG2(dictionary IDictionary) map[string][]string {
feature, _ := dictionary.GetFeature()
m := map[string][]string{}
for _, v := range feature {
m[DefaultFeatureRootName] = append(m[DefaultFeatureRootName], v.Key())
}
list, _ := dictionary.GetPackage()
for _, v := range list {
if ok, _ := dictionary.GetFeatureByKey(v.Key); ok == nil {
continue
}
for _, k := range v.Backend {
b, _ := json.Marshal(k)
key := string(b)
if u, _ := dictionary.GetBackendByKey(key); u != nil {
m[v.Key] = append(m[v.Key], u.Key())
}
}
for _, k := range v.Frontend {
b, _ := json.Marshal(k)
key := string(b)
if u, _ := dictionary.GetFrontendByKey(key); u != nil {
m[v.Key] = append(m[v.Key], u.Key())
}
}
}
return m
}
func inheritanceAction(in []string, domain Domain, sortFn func([]*InheritanceEdge[string]), action func(Object, Object, Domain) error) error {
var edges []*InheritanceEdge[string]
for _, v := range in {
edge := &InheritanceEdge[string]{}
_ = edge.Decode(v)
edges = append(edges, edge)
}
sortFn(edges)
for _, v := range edges {
if err := action(&NamedObject{Name: v.V}, &NamedObject{Name: v.U}, domain); err != nil {
return err
}
}
return nil
}