-
Notifications
You must be signed in to change notification settings - Fork 118
/
ast_root_operation_type_definition.go
149 lines (128 loc) · 4.85 KB
/
ast_root_operation_type_definition.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
package ast
import (
"bytes"
"github.com/wundergraph/graphql-go-tools/v2/pkg/lexer/position"
)
var DefaultQueryTypeName = []byte("Query")
var DefaultMutationTypeName = []byte("Mutation")
var DefaultSubscriptionTypeName = []byte("Subscription")
type RootOperationTypeDefinitionList struct {
LBrace position.Position // {
Refs []int // RootOperationTypeDefinition
RBrace position.Position // }
}
type RootOperationTypeDefinition struct {
OperationType OperationType // one of query, mutation, subscription
Colon position.Position // :
NamedType Type // e.g. Query
}
func (d *Document) RootOperationTypeDefinitionNameString(ref int) string {
return d.RootOperationTypeDefinitions[ref].OperationType.String()
}
func (d *Document) RootOperationTypeDefinitionIsFirstInSchemaDefinition(ref int, ancestor Node) bool {
switch ancestor.Kind {
case NodeKindSchemaDefinition:
if len(d.SchemaDefinitions[ancestor.Ref].RootOperationTypeDefinitions.Refs) == 0 {
return false
}
return ref == d.SchemaDefinitions[ancestor.Ref].RootOperationTypeDefinitions.Refs[0]
case NodeKindSchemaExtension:
if len(d.SchemaExtensions[ancestor.Ref].RootOperationTypeDefinitions.Refs) == 0 {
return false
}
return ref == d.SchemaExtensions[ancestor.Ref].RootOperationTypeDefinitions.Refs[0]
default:
return false
}
}
func (d *Document) RootOperationTypeDefinitionIsLastInSchemaDefinition(ref int, ancestor Node) bool {
switch ancestor.Kind {
case NodeKindSchemaDefinition:
return d.SchemaDefinitions[ancestor.Ref].RootOperationTypeDefinitions.Refs[len(d.SchemaDefinitions[ancestor.Ref].RootOperationTypeDefinitions.Refs)-1] == ref
case NodeKindSchemaExtension:
return d.SchemaExtensions[ancestor.Ref].RootOperationTypeDefinitions.Refs[len(d.SchemaExtensions[ancestor.Ref].RootOperationTypeDefinitions.Refs)-1] == ref
default:
return false
}
}
func (d *Document) CreateRootOperationTypeDefinition(operationType OperationType, rootNodeRef int) (ref int) {
switch operationType {
case OperationTypeQuery:
d.Index.QueryTypeName = DefaultQueryTypeName
case OperationTypeMutation:
d.Index.MutationTypeName = DefaultMutationTypeName
case OperationTypeSubscription:
d.Index.SubscriptionTypeName = DefaultSubscriptionTypeName
default:
return
}
nameRef := d.ObjectTypeDefinitionNameRef(d.RootNodes[rootNodeRef].Ref)
return d.AddRootOperationTypeDefinition(RootOperationTypeDefinition{
OperationType: operationType,
NamedType: Type{
TypeKind: TypeKindNamed,
Name: nameRef,
OfType: -1,
},
})
}
func (d *Document) AddRootOperationTypeDefinition(rootOperationTypeDefinition RootOperationTypeDefinition) (ref int) {
d.RootOperationTypeDefinitions = append(d.RootOperationTypeDefinitions, rootOperationTypeDefinition)
return len(d.RootOperationTypeDefinitions) - 1
}
func (d *Document) ImportRootOperationTypeDefinition(name string, operationType OperationType) (ref int) {
nameBytes := []byte(name)
switch operationType {
case OperationTypeQuery:
d.Index.QueryTypeName = nameBytes
case OperationTypeMutation:
d.Index.MutationTypeName = nameBytes
case OperationTypeSubscription:
d.Index.SubscriptionTypeName = nameBytes
default:
return -1
}
operationTypeDefinition := RootOperationTypeDefinition{
OperationType: operationType,
NamedType: Type{
Name: d.Input.AppendInputBytes(nameBytes),
TypeKind: TypeKindNamed,
OfType: -1,
},
}
return d.AddRootOperationTypeDefinition(operationTypeDefinition)
}
func (d *Document) ImportRootOperationTypeDefinitions(queryTypeName, mutationTypeName, subscriptionTypeName string) (refs []int) {
if queryTypeName != "" {
refs = append(refs, d.ImportRootOperationTypeDefinition(queryTypeName, OperationTypeQuery))
}
if mutationTypeName != "" {
refs = append(refs, d.ImportRootOperationTypeDefinition(mutationTypeName, OperationTypeMutation))
}
if subscriptionTypeName != "" {
refs = append(refs, d.ImportRootOperationTypeDefinition(subscriptionTypeName, OperationTypeSubscription))
}
return refs
}
func (d *Document) ReplaceRootOperationTypeDefinition(name string, operationType OperationType) (ref int, ok bool) {
node, exists := d.NodeByNameStr(name)
if !exists || node.Kind != NodeKindObjectTypeDefinition {
return -1, false
}
var rootOperationFound bool
for i := range d.RootOperationTypeDefinitions {
if d.RootOperationTypeDefinitions[i].OperationType == operationType {
d.RootOperationTypeDefinitions = append(d.RootOperationTypeDefinitions[:i], d.RootOperationTypeDefinitions[i+1:]...)
rootOperationFound = true
break
}
}
if !rootOperationFound {
return -1, false
}
ref = d.ImportRootOperationTypeDefinition(name, operationType)
return ref, true
}
func IsRootType(nameBytes []byte) bool {
return bytes.Equal(DefaultQueryTypeName, nameBytes) || bytes.Equal(DefaultMutationTypeName, nameBytes) || bytes.Equal(DefaultSubscriptionTypeName, nameBytes)
}