@@ -93,17 +93,17 @@ pub struct LookAheadList<'a, S> {
93
93
}
94
94
95
95
// Implemented manually to omit redundant `S: Clone` trait bound, imposed by `#[derive(Clone)]`.
96
- impl < ' a , S > Clone for LookAheadList < ' a , S > {
96
+ impl < S > Clone for LookAheadList < ' _ , S > {
97
97
fn clone ( & self ) -> Self {
98
98
* self
99
99
}
100
100
}
101
101
102
102
// Implemented manually to omit redundant `S: Copy` trait bound, imposed by `#[derive(Copy)]`.
103
- impl < ' a , S > Copy for LookAheadList < ' a , S > { }
103
+ impl < S > Copy for LookAheadList < ' _ , S > { }
104
104
105
105
// Implemented manually to omit redundant `S: Default` trait bound, imposed by `#[derive(Default)]`.
106
- impl < ' a , S > Default for LookAheadList < ' a , S > {
106
+ impl < S > Default for LookAheadList < ' _ , S > {
107
107
fn default ( ) -> Self {
108
108
Self {
109
109
input_list : & [ ] ,
@@ -114,13 +114,13 @@ impl<'a, S> Default for LookAheadList<'a, S> {
114
114
115
115
// Implemented manually to omit redundant `S: PartialEq` trait bound, imposed by
116
116
// `#[derive(PartialEq)]`.
117
- impl < ' a , S : ScalarValue > PartialEq for LookAheadList < ' a , S > {
117
+ impl < S : ScalarValue > PartialEq for LookAheadList < ' _ , S > {
118
118
fn eq ( & self , other : & Self ) -> bool {
119
119
self . iter ( ) . eq ( other. iter ( ) )
120
120
}
121
121
}
122
122
123
- impl < ' a , S : ScalarValue > LookAheadList < ' a , S > {
123
+ impl < S : ScalarValue > LookAheadList < ' _ , S > {
124
124
/// Returns an [`Iterator`] over the items of this [list].
125
125
///
126
126
/// [list]: https://spec.graphql.org/October2021#sec-List
@@ -179,7 +179,7 @@ pub mod look_ahead_list {
179
179
}
180
180
}
181
181
182
- impl < ' a , S : ScalarValue > DoubleEndedIterator for Iter < ' a , S > {
182
+ impl < S : ScalarValue > DoubleEndedIterator for Iter < ' _ , S > {
183
183
fn next_back ( & mut self ) -> Option < Self :: Item > {
184
184
let vars = self . vars ;
185
185
self . slice_iter
@@ -203,16 +203,16 @@ pub struct LookAheadObject<'a, S> {
203
203
}
204
204
205
205
// Implemented manually to omit redundant `S: Clone` trait bound, imposed by `#[derive(Clone)]`.
206
- impl < ' a , S > Clone for LookAheadObject < ' a , S > {
206
+ impl < S > Clone for LookAheadObject < ' _ , S > {
207
207
fn clone ( & self ) -> Self {
208
208
* self
209
209
}
210
210
}
211
211
212
212
// Implemented manually to omit redundant `S: Copy` trait bound, imposed by `#[derive(Copy)]`.
213
- impl < ' a , S > Copy for LookAheadObject < ' a , S > { }
213
+ impl < S > Copy for LookAheadObject < ' _ , S > { }
214
214
215
- impl < ' a , S > Default for LookAheadObject < ' a , S > {
215
+ impl < S > Default for LookAheadObject < ' _ , S > {
216
216
fn default ( ) -> Self {
217
217
Self {
218
218
input_object : & [ ] ,
@@ -221,13 +221,13 @@ impl<'a, S> Default for LookAheadObject<'a, S> {
221
221
}
222
222
}
223
223
224
- impl < ' a , S : ScalarValue > PartialEq for LookAheadObject < ' a , S > {
224
+ impl < S : ScalarValue > PartialEq for LookAheadObject < ' _ , S > {
225
225
fn eq ( & self , other : & Self ) -> bool {
226
226
self . iter ( ) . eq ( other. iter ( ) )
227
227
}
228
228
}
229
229
230
- impl < ' a , S : ScalarValue > LookAheadObject < ' a , S > {
230
+ impl < S : ScalarValue > LookAheadObject < ' _ , S > {
231
231
/// Returns an [`Iterator`] over this [input object]'s fields.
232
232
///
233
233
/// [input object]: https://spec.graphql.org/October2021#sec-Input-Objects
@@ -301,7 +301,7 @@ pub mod look_ahead_object {
301
301
}
302
302
}
303
303
304
- impl < ' a , S : ScalarValue > DoubleEndedIterator for Iter < ' a , S > {
304
+ impl < S : ScalarValue > DoubleEndedIterator for Iter < ' _ , S > {
305
305
fn next_back ( & mut self ) -> Option < Self :: Item > {
306
306
let vars = self . vars ;
307
307
self . slice_iter . next_back ( ) . map ( move |( key, val) | {
@@ -331,14 +331,14 @@ pub struct LookAheadArgument<'a, S> {
331
331
}
332
332
333
333
// Implemented manually to omit redundant `S: Clone` trait bound, imposed by `#[derive(Clone)]`.
334
- impl < ' a , S > Clone for LookAheadArgument < ' a , S > {
334
+ impl < S > Clone for LookAheadArgument < ' _ , S > {
335
335
fn clone ( & self ) -> Self {
336
336
* self
337
337
}
338
338
}
339
339
340
340
// Implemented manually to omit redundant `S: Copy` trait bound, imposed by `#[derive(Copy)]`.
341
- impl < ' a , S > Copy for LookAheadArgument < ' a , S > { }
341
+ impl < S > Copy for LookAheadArgument < ' _ , S > { }
342
342
343
343
impl < ' a , S > LookAheadArgument < ' a , S > {
344
344
/// Returns the name of this [argument].
@@ -386,7 +386,7 @@ pub struct LookAheadChildren<'a, S> {
386
386
}
387
387
388
388
// Implemented manually to omit redundant `S: Clone` trait bound, imposed by `#[derive(Clone)]`.
389
- impl < ' a , S > Clone for LookAheadChildren < ' a , S > {
389
+ impl < S > Clone for LookAheadChildren < ' _ , S > {
390
390
fn clone ( & self ) -> Self {
391
391
Self {
392
392
children : self . children . clone ( ) ,
@@ -395,7 +395,7 @@ impl<'a, S> Clone for LookAheadChildren<'a, S> {
395
395
}
396
396
397
397
// Implemented manually to omit redundant `S: Default` trait bound, imposed by `#[derive(Default)]`.
398
- impl < ' a , S > Default for LookAheadChildren < ' a , S > {
398
+ impl < S > Default for LookAheadChildren < ' _ , S > {
399
399
fn default ( ) -> Self {
400
400
Self { children : vec ! [ ] }
401
401
}
@@ -472,14 +472,14 @@ pub(super) enum SelectionSource<'a, S> {
472
472
}
473
473
474
474
// Implemented manually to omit redundant `S: Clone` trait bound, imposed by `#[derive(Clone)]`.
475
- impl < ' a , S > Clone for SelectionSource < ' a , S > {
475
+ impl < S > Clone for SelectionSource < ' _ , S > {
476
476
fn clone ( & self ) -> Self {
477
477
* self
478
478
}
479
479
}
480
480
481
481
// Implemented manually to omit redundant `S: Copy` trait bound, imposed by `#[derive(Copy)]`.
482
- impl < ' a , S > Copy for SelectionSource < ' a , S > { }
482
+ impl < S > Copy for SelectionSource < ' _ , S > { }
483
483
484
484
/// [Selection] of an executed GraphQL query, used in [look-ahead][0] operations.
485
485
///
@@ -496,14 +496,14 @@ pub struct LookAheadSelection<'a, S> {
496
496
}
497
497
498
498
// Implemented manually to omit redundant `S: Clone` trait bound, imposed by `#[derive(Clone)]`.
499
- impl < ' a , S > Clone for LookAheadSelection < ' a , S > {
499
+ impl < S > Clone for LookAheadSelection < ' _ , S > {
500
500
fn clone ( & self ) -> Self {
501
501
* self
502
502
}
503
503
}
504
504
505
505
// Implemented manually to omit redundant `S: Copy` trait bound, imposed by `#[derive(Copy)]`.
506
- impl < ' a , S > Copy for LookAheadSelection < ' a , S > { }
506
+ impl < S > Copy for LookAheadSelection < ' _ , S > { }
507
507
508
508
impl < ' a , S > LookAheadSelection < ' a , S > {
509
509
/// Constructs a new [`LookAheadSelection`] out of the provided params.
@@ -670,7 +670,7 @@ struct ChildrenBuilder<'a, 'f, S> {
670
670
output : Vec < LookAheadSelection < ' a , S > > ,
671
671
}
672
672
673
- impl < ' a , ' f , S : ScalarValue > ChildrenBuilder < ' a , ' f , S > {
673
+ impl < ' a , S : ScalarValue > ChildrenBuilder < ' a , ' _ , S > {
674
674
fn visit_parent_selection (
675
675
& mut self ,
676
676
selection : & ' a Selection < ' a , S > ,
0 commit comments