forked from wundergraph/graphql-go-tools
-
Notifications
You must be signed in to change notification settings - Fork 4
/
ast.go
271 lines (250 loc) · 9.71 KB
/
ast.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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
//go:generate stringer -type=OperationType,ValueKind,TypeKind,SelectionKind,NodeKind,PathKind -output ast_string.go
// Package ast defines the GraphQL AST and offers helper methods to interact with the AST, mostly to get the necessary information from the ast.
//
// The document struct is designed in a way to enable performant parsing while keeping the ast easy to use with helper methods.
package ast
const InvalidRef = -1
type Document struct {
Input Input
RootNodes []Node
SchemaDefinitions []SchemaDefinition
SchemaExtensions []SchemaExtension
RootOperationTypeDefinitions []RootOperationTypeDefinition
Directives []Directive
Arguments []Argument
ObjectTypeDefinitions []ObjectTypeDefinition
ObjectTypeExtensions []ObjectTypeExtension
FieldDefinitions []FieldDefinition
Types []Type
InputValueDefinitions []InputValueDefinition
InputObjectTypeDefinitions []InputObjectTypeDefinition
InputObjectTypeExtensions []InputObjectTypeExtension
ScalarTypeDefinitions []ScalarTypeDefinition
ScalarTypeExtensions []ScalarTypeExtension
InterfaceTypeDefinitions []InterfaceTypeDefinition
InterfaceTypeExtensions []InterfaceTypeExtension
UnionTypeDefinitions []UnionTypeDefinition
UnionTypeExtensions []UnionTypeExtension
EnumTypeDefinitions []EnumTypeDefinition
EnumTypeExtensions []EnumTypeExtension
EnumValueDefinitions []EnumValueDefinition
DirectiveDefinitions []DirectiveDefinition
Values []Value
ListValues []ListValue
VariableValues []VariableValue
StringValues []StringValue
IntValues []IntValue
FloatValues []FloatValue
EnumValues []EnumValue
ObjectFields []ObjectField
ObjectValues []ObjectValue
Selections []Selection
SelectionSets []SelectionSet
Fields []Field
InlineFragments []InlineFragment
FragmentSpreads []FragmentSpread
OperationDefinitions []OperationDefinition
VariableDefinitions []VariableDefinition
FragmentDefinitions []FragmentDefinition
BooleanValues [2]BooleanValue
Refs [][8]int
RefIndex int
Index Index
}
func NewDocument() *Document {
return &Document{
RootNodes: make([]Node, 0, 48),
RootOperationTypeDefinitions: make([]RootOperationTypeDefinition, 0, 3),
SchemaDefinitions: make([]SchemaDefinition, 0, 2),
SchemaExtensions: make([]SchemaExtension, 0, 2),
Directives: make([]Directive, 0, 16),
Arguments: make([]Argument, 0, 48),
ObjectTypeDefinitions: make([]ObjectTypeDefinition, 0, 48),
ObjectTypeExtensions: make([]ObjectTypeExtension, 0, 4),
Types: make([]Type, 0, 48),
FieldDefinitions: make([]FieldDefinition, 0, 128),
InputValueDefinitions: make([]InputValueDefinition, 0, 128),
InputObjectTypeDefinitions: make([]InputObjectTypeDefinition, 0, 16),
InputObjectTypeExtensions: make([]InputObjectTypeExtension, 0, 4),
ScalarTypeDefinitions: make([]ScalarTypeDefinition, 0, 16),
ScalarTypeExtensions: make([]ScalarTypeExtension, 0, 4),
InterfaceTypeDefinitions: make([]InterfaceTypeDefinition, 0, 16),
InterfaceTypeExtensions: make([]InterfaceTypeExtension, 0, 4),
UnionTypeDefinitions: make([]UnionTypeDefinition, 0, 8),
UnionTypeExtensions: make([]UnionTypeExtension, 0, 4),
EnumTypeDefinitions: make([]EnumTypeDefinition, 0, 8),
EnumTypeExtensions: make([]EnumTypeExtension, 0, 4),
EnumValueDefinitions: make([]EnumValueDefinition, 0, 48),
DirectiveDefinitions: make([]DirectiveDefinition, 0, 8),
VariableValues: make([]VariableValue, 0, 8),
StringValues: make([]StringValue, 0, 24),
EnumValues: make([]EnumValue, 0, 24),
IntValues: make([]IntValue, 0, 128),
FloatValues: make([]FloatValue, 0, 128),
Values: make([]Value, 0, 64),
ListValues: make([]ListValue, 0, 4),
ObjectFields: make([]ObjectField, 0, 64),
ObjectValues: make([]ObjectValue, 0, 16),
Selections: make([]Selection, 0, 128),
SelectionSets: make([]SelectionSet, 0, 48),
Fields: make([]Field, 0, 128),
InlineFragments: make([]InlineFragment, 0, 16),
FragmentSpreads: make([]FragmentSpread, 0, 16),
OperationDefinitions: make([]OperationDefinition, 0, 8),
VariableDefinitions: make([]VariableDefinition, 0, 8),
FragmentDefinitions: make([]FragmentDefinition, 0, 8),
BooleanValues: [2]BooleanValue{false, true},
Refs: make([][8]int, 48),
RefIndex: -1,
Index: Index{
nodes: make(map[uint64][]Node, 48),
},
}
}
func NewSmallDocument() *Document {
return &Document{
BooleanValues: [2]BooleanValue{false, true},
Refs: make([][8]int, 48),
RefIndex: -1,
Index: Index{
nodes: make(map[uint64][]Node, 4),
},
}
}
func (d *Document) Reset() {
d.RootNodes = d.RootNodes[:0]
d.SchemaDefinitions = d.SchemaDefinitions[:0]
d.SchemaExtensions = d.SchemaExtensions[:0]
d.RootOperationTypeDefinitions = d.RootOperationTypeDefinitions[:0]
d.Directives = d.Directives[:0]
d.Arguments = d.Arguments[:0]
d.ObjectTypeDefinitions = d.ObjectTypeDefinitions[:0]
d.ObjectTypeExtensions = d.ObjectTypeExtensions[:0]
d.Types = d.Types[:0]
d.FieldDefinitions = d.FieldDefinitions[:0]
d.InputValueDefinitions = d.InputValueDefinitions[:0]
d.InputObjectTypeDefinitions = d.InputObjectTypeDefinitions[:0]
d.InputObjectTypeExtensions = d.InputObjectTypeExtensions[:0]
d.ScalarTypeDefinitions = d.ScalarTypeDefinitions[:0]
d.ScalarTypeExtensions = d.ScalarTypeExtensions[:0]
d.InterfaceTypeDefinitions = d.InterfaceTypeDefinitions[:0]
d.InterfaceTypeExtensions = d.InterfaceTypeExtensions[:0]
d.UnionTypeDefinitions = d.UnionTypeDefinitions[:0]
d.UnionTypeExtensions = d.UnionTypeExtensions[:0]
d.EnumTypeDefinitions = d.EnumTypeDefinitions[:0]
d.EnumTypeExtensions = d.EnumTypeExtensions[:0]
d.EnumValueDefinitions = d.EnumValueDefinitions[:0]
d.DirectiveDefinitions = d.DirectiveDefinitions[:0]
d.VariableValues = d.VariableValues[:0]
d.StringValues = d.StringValues[:0]
d.EnumValues = d.EnumValues[:0]
d.IntValues = d.IntValues[:0]
d.FloatValues = d.FloatValues[:0]
d.Values = d.Values[:0]
d.ListValues = d.ListValues[:0]
d.ObjectFields = d.ObjectFields[:0]
d.ObjectValues = d.ObjectValues[:0]
d.Selections = d.Selections[:0]
d.SelectionSets = d.SelectionSets[:0]
d.Fields = d.Fields[:0]
d.InlineFragments = d.InlineFragments[:0]
d.FragmentSpreads = d.FragmentSpreads[:0]
d.OperationDefinitions = d.OperationDefinitions[:0]
d.VariableDefinitions = d.VariableDefinitions[:0]
d.FragmentDefinitions = d.FragmentDefinitions[:0]
d.RefIndex = -1
d.Index.Reset()
d.Input.Reset()
}
func (d *Document) NextRefIndex() int {
d.RefIndex++
if d.RefIndex == len(d.Refs) {
d.Refs = append(d.Refs, [8]int{})
}
return d.RefIndex
}
func (d *Document) NewEmptyRefs() []int {
return d.Refs[d.NextRefIndex()][:0]
}
func (d *Document) copyByteSliceReference(ref ByteSliceReference) ByteSliceReference {
if ref.Length() == 0 {
return ByteSliceReference{}
}
src := d.Input.ByteSlice(ref)
dst := make([]byte, len(src))
copy(dst, src)
return d.Input.AppendInputBytes(dst)
}
func (d *Document) AddRootNode(node Node) {
d.RootNodes = append(d.RootNodes, node)
d.Index.AddNodeStr(d.NodeNameUnsafeString(node), node)
}
func (d *Document) ImportRootNode(ref int, kind NodeKind) {
d.AddRootNode(Node{
Kind: kind,
Ref: ref,
})
}
func (d *Document) DeleteRootNodes(nodes []Node) {
for i := range nodes {
d.DeleteRootNode(nodes[i])
}
}
func (d *Document) DeleteRootNode(node Node) {
for i := range d.RootNodes {
if d.RootNodes[i].Kind == node.Kind && d.RootNodes[i].Ref == node.Ref {
d.RootNodes = append(d.RootNodes[:i], d.RootNodes[i+1:]...)
return
}
}
}
func (d *Document) RemoveMergedTypeExtensions() {
for _, node := range d.Index.MergedTypeExtensions {
d.RemoveRootNode(node)
}
}
func (d *Document) RemoveRootNode(node Node) {
for i := range d.RootNodes {
if d.RootNodes[i] == node {
d.RootNodes = append(d.RootNodes[:i], d.RootNodes[i+1:]...)
return
}
}
}
func (d *Document) NodeByName(name ByteSlice) (Node, bool) {
return d.Index.FirstNodeByNameBytes(name)
}
func (d *Document) NodeByNameStr(name string) (Node, bool) {
return d.Index.FirstNodeByNameStr(name)
}
func (d *Document) TypeDefinitionContainsImplementsInterface(typeName, interfaceName ByteSlice) bool {
typeDefinition, exists := d.Index.FirstNodeByNameBytes(typeName)
if !exists {
return false
}
if typeDefinition.Kind != NodeKindObjectTypeDefinition {
return false
}
return d.ObjectTypeDefinitionImplementsInterface(typeDefinition.Ref, interfaceName)
}
func FilterIntSliceByWhitelist(intSlice []int, whitelist []int) []int {
if len(intSlice) == 0 || len(whitelist) == 0 {
return []int{}
}
n := 0
for i := 0; i < len(intSlice); i++ {
if isWhitelisted(intSlice[i], whitelist) {
intSlice[n] = intSlice[i]
n++
}
}
return intSlice[:n]
}
func isWhitelisted(value int, whitelisted []int) bool {
for i := 0; i < len(whitelisted); i++ {
if whitelisted[i] == value {
return true
}
}
return false
}