/
engine.go
104 lines (90 loc) · 2.3 KB
/
engine.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
package expand
import (
"context"
"github.com/ory/keto/ketoapi"
"github.com/ory/keto/internal/driver/config"
"github.com/ory/keto/internal/x"
"github.com/ory/keto/internal/x/graph"
"github.com/ory/keto/internal/relationtuple"
)
type (
EngineDependencies interface {
relationtuple.ManagerProvider
config.Provider
x.LoggerProvider
}
Engine struct {
d EngineDependencies
}
EngineProvider interface {
ExpandEngine() *Engine
}
)
func NewEngine(d EngineDependencies) *Engine {
return &Engine{
d: d,
}
}
func (e *Engine) BuildTree(ctx context.Context, subject relationtuple.Subject, restDepth int) (*relationtuple.Tree, error) {
// global max-depth takes precedence when it is the lesser or if the request max-depth is less than or equal to 0
if globalMaxDepth := e.d.Config(ctx).MaxReadDepth(); restDepth <= 0 || globalMaxDepth < restDepth {
restDepth = globalMaxDepth
}
if subSet, isSubjectSet := subject.(*relationtuple.SubjectSet); isSubjectSet {
ctx, wasAlreadyVisited := graph.CheckAndAddVisited(ctx, subject)
if wasAlreadyVisited {
return nil, nil
}
subTree := &relationtuple.Tree{
Type: ketoapi.TreeNodeUnion,
Subject: subject,
}
var (
rels []*relationtuple.RelationTuple
nextPage string
)
// do ... while nextPage != ""
for ok := true; ok; ok = nextPage != "" {
var err error
rels, nextPage, err = e.d.RelationTupleManager().GetRelationTuples(
ctx,
&relationtuple.RelationQuery{
Relation: &subSet.Relation,
Object: &subSet.Object,
Namespace: &subSet.Namespace,
},
x.WithToken(nextPage),
)
if err != nil {
return nil, err
} else if len(rels) == 0 {
return nil, nil
}
if restDepth <= 1 {
subTree.Type = ketoapi.TreeNodeLeaf
return subTree, nil
}
children := make([]*relationtuple.Tree, len(rels))
for ri, r := range rels {
child, err := e.BuildTree(ctx, r.Subject, restDepth-1)
if err != nil {
return nil, err
}
if child == nil {
child = &relationtuple.Tree{
Type: ketoapi.TreeNodeLeaf,
Subject: r.Subject,
}
}
children[ri] = child
}
subTree.Children = append(subTree.Children, children...)
}
return subTree, nil
}
// is SubjectID
return &relationtuple.Tree{
Type: ketoapi.TreeNodeLeaf,
Subject: subject,
}, nil
}