forked from authzed/authzed-go
/
flatten_test.go
134 lines (125 loc) · 2.96 KB
/
flatten_test.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
package authzed
import (
"testing"
v0 "github.com/authzed/authzed-go/proto/authzed/api/v0"
)
func user(namespace, object, relation string) *v0.User {
return &v0.User{UserOneof: &v0.User_Userset{Userset: onr(namespace, object, relation)}}
}
func onr(namespace, object, relation string) *v0.ObjectAndRelation {
return &v0.ObjectAndRelation{
Namespace: namespace,
ObjectId: object,
Relation: relation,
}
}
func TestFlatten(t *testing.T) {
testCases := []struct {
name string
tree *v0.RelationTupleTreeNode
expected []*v0.ObjectAndRelation
}{
{
"simple leaf",
leaf(nil, user("user", "user1", "...")),
[]*v0.ObjectAndRelation{onr("user", "user1", "...")},
},
{
"simple union",
union(nil,
leaf(nil, user("user", "user1", "...")),
leaf(nil, user("user", "user2", "...")),
leaf(nil, user("user", "user3", "...")),
),
[]*v0.ObjectAndRelation{
onr("user", "user1", "..."),
onr("user", "user2", "..."),
onr("user", "user3", "..."),
},
},
{
"simple intersection",
intersection(nil,
leaf(nil,
user("user", "user1", "..."),
user("user", "user2", "..."),
),
leaf(nil,
user("user", "user2", "..."),
user("user", "user3", "..."),
),
leaf(nil,
user("user", "user2", "..."),
user("user", "user4", "..."),
),
),
[]*v0.ObjectAndRelation{onr("user", "user2", "...")},
},
{
"empty intersection",
intersection(nil,
leaf(nil,
user("user", "user1", "..."),
user("user", "user2", "..."),
),
leaf(nil,
user("user", "user3", "..."),
user("user", "user4", "..."),
),
),
[]*v0.ObjectAndRelation{},
},
{
"simple exclusion",
exclusion(nil,
leaf(nil,
user("user", "user1", "..."),
user("user", "user2", "..."),
),
leaf(nil, user("user", "user2", "...")),
leaf(nil, user("user", "user3", "...")),
),
[]*v0.ObjectAndRelation{onr("user", "user1", "...")},
},
{
"empty exclusion",
exclusion(nil,
leaf(nil,
user("user", "user1", "..."),
user("user", "user2", "..."),
),
leaf(nil, user("user", "user1", "...")),
leaf(nil, user("user", "user2", "...")),
),
[]*v0.ObjectAndRelation{},
},
{
"nested union",
union(nil,
leaf(nil, user("user", "user1", "...")),
union(nil, leaf(nil, user("user", "user2", "..."))),
),
[]*v0.ObjectAndRelation{
onr("user", "user1", "..."),
onr("user", "user2", "..."),
},
},
}
for _, tc := range testCases {
t.Run(tc.name, func(t *testing.T) {
t.Parallel()
var flattened userSet = make(map[string]struct{})
flattened.add(flatten(tc.tree)...)
for _, onr := range tc.expected {
usr := user(onr.Namespace, onr.ObjectId, onr.Relation)
if !flattened.contains(usr) {
t.Fatalf("flattened tree failed to contain expected user: %s", usr)
}
flattened.remove(usr)
}
if len(flattened) != 0 {
t.Fatalf("additional users found in flattened tree: %s", flattened)
}
})
}
}