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
extern crate crypto;
extern crate graphql_parser;
extern crate itertools;
pub mod error;
pub mod traverse;
pub mod visitor;
mod wrappers;
use crypto::digest::Digest;
use crypto::sha2::Sha256;
use error::*;
use graphql_parser::query::*;
use itertools::FoldWhile::{Continue, Done};
use itertools::Itertools;
use std::collections::BTreeSet;
use std::result::Result::*;
use traverse::*;
use visitor::Visitor;
use wrappers::FragmentDefinitionContainer;
struct FragmentSpreadVisitor<'a> {
document: &'a Document,
used_fragments: Vec<&'a FragmentDefinition>,
visited_fragments: Vec<&'a FragmentDefinition>,
}
impl<'a> Visitor for FragmentSpreadVisitor<'a> {
fn visit_fragment_spread_enter(
&mut self,
fragment_spread: &FragmentSpread,
) -> Result<(), GraphQLError> {
let fragment = self
.document
.definitions
.iter()
.filter_map(|definition| filter_fragment_defintion(definition))
.find(|fragment_definition| fragment_definition.name == fragment_spread.fragment_name)
.ok_or(GraphQLError::FragmentNotFound)?;
let found = &self
.visited_fragments
.iter()
.find(|visited| &visited.name == &fragment.name);
if let Some(fragment) = found {
return Err(GraphQLError::InfiniteFragmentRecursionError(
fragment.name.clone(),
));
}
let mut used_fragments: BTreeSet<_> = self
.used_fragments
.iter()
.map(|fragment| FragmentDefinitionContainer(fragment))
.collect();
used_fragments.insert(FragmentDefinitionContainer(fragment));
let used_fragments = used_fragments
.iter()
.map(|container| container.0)
.collect::<Vec<_>>();
let mut sub_visitor = FragmentSpreadVisitor {
document: &self.document,
visited_fragments: [&self.visited_fragments[..], &[fragment]].concat(),
used_fragments: used_fragments.clone(),
};
self.used_fragments = used_fragments;
let mut traversal = Traversal {
visitor: &mut sub_visitor,
};
traversal.handle_fragment_definition(&fragment)?;
Ok(())
}
}
pub fn generate_operation_id(query: &str, operation_name: &str) -> Result<String, GraphQLError> {
let mut hasher = Sha256::new();
let operation = select_operation(query, operation_name)?;
hasher.input_str(operation.as_str());
Ok(hasher.result_str())
}
pub fn generate_default_operation_id(query: &str) -> Result<String, GraphQLError> {
let operation_name = get_default_operation_name(query)?;
generate_operation_id(query, operation_name.as_str())
}
pub fn get_default_operation_name(query: &str) -> Result<String, GraphQLError> {
let document = parse_query(query)?;
document
.definitions
.iter()
.filter_map(|definition| filter_operation_definition(definition))
.fold_while(
Err(GraphQLError::OperationNotFound),
|result, operation_definition| match operation_definition {
OperationDefinition::Query(query) => {
if result.is_ok() {
Done(Err(GraphQLError::MultipleOperation))
} else {
Continue(query.clone().name.ok_or(GraphQLError::AnonymousOperation))
}
}
OperationDefinition::Mutation(mutation) => {
if result.is_ok() {
Done(Err(GraphQLError::MultipleOperation))
} else {
Continue(
mutation
.clone()
.name
.ok_or(GraphQLError::AnonymousOperation),
)
}
}
OperationDefinition::SelectionSet(_) => Done(Err(GraphQLError::AnonymousOperation)),
OperationDefinition::Subscription(_) => Done(Err(GraphQLError::AnonymousOperation)),
},
)
.into_inner()
}
pub fn select_operation(query: &str, operation_name: &str) -> Result<String, GraphQLError> {
let document = parse_query(query)?;
let operation = select_operation_definition(&document, &operation_name)
.ok_or(GraphQLError::OperationNotFound)?;
let mut visitor = FragmentSpreadVisitor {
document: &document,
used_fragments: vec![],
visited_fragments: vec![],
};
{
let mut traversal = Traversal {
visitor: &mut visitor,
};
traversal.handle_operation_definition(&operation)?;
}
let fragments = visitor
.used_fragments
.iter()
.map(|fragment| format!("{}", fragment))
.collect::<Vec<String>>()
.join("\n");
Ok(format!("{}{}", operation, fragments))
}
fn select_operation_definition<'a>(
document: &'a Document,
operation_name: &'a str,
) -> Option<&'a OperationDefinition> {
document
.definitions
.iter()
.filter_map(|definition| filter_operation_definition(definition))
.find(|operation_definition| match operation_definition {
OperationDefinition::Query(query) => is_operation_name(&query.name, &operation_name),
OperationDefinition::Mutation(mutation) => {
is_operation_name(&mutation.name, &operation_name)
}
_ => false,
})
}
fn filter_operation_definition(definition: &Definition) -> Option<&OperationDefinition> {
match definition {
Definition::Operation(operation_definition) => Some(&operation_definition),
_ => None,
}
}
fn filter_fragment_defintion(definition: &Definition) -> Option<&FragmentDefinition> {
match definition {
Definition::Fragment(fragment_definition) => Some(&fragment_definition),
_ => None,
}
}
fn is_operation_name(name: &Option<String>, operation_name: &str) -> bool {
name.as_ref().map_or(false, |name| name == operation_name)
}