-
Notifications
You must be signed in to change notification settings - Fork 246
/
node.go
180 lines (145 loc) · 4.26 KB
/
node.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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
package compiler
import (
"container/list"
"fmt"
"github.com/authzed/spicedb/pkg/schemadsl/dslshape"
"github.com/authzed/spicedb/pkg/schemadsl/input"
"github.com/authzed/spicedb/pkg/schemadsl/parser"
)
type dslNode struct {
nodeType dslshape.NodeType
properties map[string]interface{}
children map[string]*list.List
}
func createAstNode(_ input.Source, kind dslshape.NodeType) parser.AstNode {
return &dslNode{
nodeType: kind,
properties: make(map[string]interface{}),
children: make(map[string]*list.List),
}
}
func (tn *dslNode) GetType() dslshape.NodeType {
return tn.nodeType
}
func (tn *dslNode) Connect(predicate string, other parser.AstNode) {
if tn.children[predicate] == nil {
tn.children[predicate] = list.New()
}
tn.children[predicate].PushBack(other)
}
func (tn *dslNode) MustDecorate(property string, value string) parser.AstNode {
if _, ok := tn.properties[property]; ok {
panic(fmt.Sprintf("Existing key for property %s\n\tNode: %v", property, tn.properties))
}
tn.properties[property] = value
return tn
}
func (tn *dslNode) MustDecorateWithInt(property string, value int) parser.AstNode {
if _, ok := tn.properties[property]; ok {
panic(fmt.Sprintf("Existing key for property %s\n\tNode: %v", property, tn.properties))
}
tn.properties[property] = value
return tn
}
func (tn *dslNode) Range(mapper input.PositionMapper) (input.SourceRange, error) {
sourceStr, err := tn.GetString(dslshape.NodePredicateSource)
if err != nil {
return nil, err
}
source := input.Source(sourceStr)
startRune, err := tn.GetInt(dslshape.NodePredicateStartRune)
if err != nil {
return nil, err
}
endRune, err := tn.GetInt(dslshape.NodePredicateEndRune)
if err != nil {
return nil, err
}
return source.RangeForRunePositions(startRune, endRune, mapper), nil
}
func (tn *dslNode) Has(predicateName string) bool {
_, ok := tn.properties[predicateName]
return ok
}
func (tn *dslNode) GetInt(predicateName string) (int, error) {
predicate, ok := tn.properties[predicateName]
if !ok {
return 0, fmt.Errorf("unknown predicate %s", predicateName)
}
value, ok := predicate.(int)
if !ok {
return 0, fmt.Errorf("predicate %s is not an int", predicateName)
}
return value, nil
}
func (tn *dslNode) GetString(predicateName string) (string, error) {
predicate, ok := tn.properties[predicateName]
if !ok {
return "", fmt.Errorf("unknown predicate %s", predicateName)
}
value, ok := predicate.(string)
if !ok {
return "", fmt.Errorf("predicate %s is not a string", predicateName)
}
return value, nil
}
func (tn *dslNode) AllSubNodes() []*dslNode {
nodes := []*dslNode{}
for _, childList := range tn.children {
for e := childList.Front(); e != nil; e = e.Next() {
nodes = append(nodes, e.Value.(*dslNode))
}
}
return nodes
}
func (tn *dslNode) GetChildren() []*dslNode {
return tn.List(dslshape.NodePredicateChild)
}
func (tn *dslNode) FindAll(nodeType dslshape.NodeType) []*dslNode {
found := []*dslNode{}
if tn.nodeType == dslshape.NodeTypeError {
found = append(found, tn)
}
for _, childList := range tn.children {
for e := childList.Front(); e != nil; e = e.Next() {
childFound := e.Value.(*dslNode).FindAll(nodeType)
found = append(found, childFound...)
}
}
return found
}
func (tn *dslNode) List(predicateName string) []*dslNode {
children := []*dslNode{}
childList, ok := tn.children[predicateName]
if !ok {
return children
}
for e := childList.Front(); e != nil; e = e.Next() {
children = append(children, e.Value.(*dslNode))
}
return children
}
func (tn *dslNode) Lookup(predicateName string) (*dslNode, error) {
childList, ok := tn.children[predicateName]
if !ok {
return nil, fmt.Errorf("unknown predicate %s", predicateName)
}
for e := childList.Front(); e != nil; e = e.Next() {
return e.Value.(*dslNode), nil
}
return nil, fmt.Errorf("nothing in predicate %s", predicateName)
}
func (tn *dslNode) Errorf(message string, args ...interface{}) error {
return errorWithNode{
error: fmt.Errorf(message, args...),
errorSourceCode: "",
node: tn,
}
}
func (tn *dslNode) ErrorWithSourcef(sourceCode string, message string, args ...interface{}) error {
return errorWithNode{
error: fmt.Errorf(message, args...),
errorSourceCode: sourceCode,
node: tn,
}
}