forked from rust-lang/rust-analyzer
-
Notifications
You must be signed in to change notification settings - Fork 0
/
generated.rs
4798 lines (4114 loc) · 121 KB
/
generated.rs
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
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// This file is automatically generated based on the file `./generated.rs.tera` when `cargo gen-syntax` is run
// Do not edit manually
//! This module contains auto-generated Rust AST. Like `SyntaxNode`s, AST nodes
//! are generic over ownership: `X<'a>` things are `Copy` references, `XNode`
//! are Arc-based. You can switch between the two variants using `.owned` and
//! `.borrowed` functions. Most of the code works with borowed mode, and only
//! this mode has all AST accessors.
#![cfg_attr(rustfmt, rustfmt_skip)]
use rowan::TransparentNewType;
use crate::{
SyntaxNode, SyntaxKind::*,
syntax_node::{RaTypes, TreeArc},
ast::{self, AstNode},
};
// Alias
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct Alias {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for Alias {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for Alias {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
ALIAS => Some(Alias::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for Alias {
type Owned = TreeArc<Alias>;
fn to_owned(&self) -> TreeArc<Alias> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::NameOwner for Alias {}
impl Alias {}
// ArgList
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct ArgList {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for ArgList {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for ArgList {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
ARG_LIST => Some(ArgList::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for ArgList {
type Owned = TreeArc<ArgList>;
fn to_owned(&self) -> TreeArc<ArgList> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ArgList {
pub fn args(&self) -> impl Iterator<Item = &Expr> {
super::children(self)
}
}
// ArrayExpr
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct ArrayExpr {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for ArrayExpr {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for ArrayExpr {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
ARRAY_EXPR => Some(ArrayExpr::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for ArrayExpr {
type Owned = TreeArc<ArrayExpr>;
fn to_owned(&self) -> TreeArc<ArrayExpr> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ArrayExpr {
pub fn exprs(&self) -> impl Iterator<Item = &Expr> {
super::children(self)
}
}
// ArrayType
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct ArrayType {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for ArrayType {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for ArrayType {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
ARRAY_TYPE => Some(ArrayType::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for ArrayType {
type Owned = TreeArc<ArrayType>;
fn to_owned(&self) -> TreeArc<ArrayType> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ArrayType {
pub fn type_ref(&self) -> Option<&TypeRef> {
super::child_opt(self)
}
pub fn expr(&self) -> Option<&Expr> {
super::child_opt(self)
}
}
// AssocTypeArg
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct AssocTypeArg {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for AssocTypeArg {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for AssocTypeArg {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
ASSOC_TYPE_ARG => Some(AssocTypeArg::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for AssocTypeArg {
type Owned = TreeArc<AssocTypeArg>;
fn to_owned(&self) -> TreeArc<AssocTypeArg> { TreeArc::cast(self.syntax.to_owned()) }
}
impl AssocTypeArg {
pub fn name_ref(&self) -> Option<&NameRef> {
super::child_opt(self)
}
pub fn type_ref(&self) -> Option<&TypeRef> {
super::child_opt(self)
}
}
// Attr
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct Attr {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for Attr {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for Attr {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
ATTR => Some(Attr::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for Attr {
type Owned = TreeArc<Attr>;
fn to_owned(&self) -> TreeArc<Attr> { TreeArc::cast(self.syntax.to_owned()) }
}
impl Attr {
pub fn value(&self) -> Option<&TokenTree> {
super::child_opt(self)
}
}
// BinExpr
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct BinExpr {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for BinExpr {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for BinExpr {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
BIN_EXPR => Some(BinExpr::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for BinExpr {
type Owned = TreeArc<BinExpr>;
fn to_owned(&self) -> TreeArc<BinExpr> { TreeArc::cast(self.syntax.to_owned()) }
}
impl BinExpr {}
// BindPat
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct BindPat {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for BindPat {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for BindPat {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
BIND_PAT => Some(BindPat::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for BindPat {
type Owned = TreeArc<BindPat>;
fn to_owned(&self) -> TreeArc<BindPat> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::NameOwner for BindPat {}
impl BindPat {
pub fn pat(&self) -> Option<&Pat> {
super::child_opt(self)
}
}
// Block
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct Block {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for Block {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for Block {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
BLOCK => Some(Block::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for Block {
type Owned = TreeArc<Block>;
fn to_owned(&self) -> TreeArc<Block> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::AttrsOwner for Block {}
impl Block {
pub fn statements(&self) -> impl Iterator<Item = &Stmt> {
super::children(self)
}
pub fn expr(&self) -> Option<&Expr> {
super::child_opt(self)
}
}
// BlockExpr
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct BlockExpr {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for BlockExpr {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for BlockExpr {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
BLOCK_EXPR => Some(BlockExpr::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for BlockExpr {
type Owned = TreeArc<BlockExpr>;
fn to_owned(&self) -> TreeArc<BlockExpr> { TreeArc::cast(self.syntax.to_owned()) }
}
impl BlockExpr {
pub fn block(&self) -> Option<&Block> {
super::child_opt(self)
}
}
// BreakExpr
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct BreakExpr {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for BreakExpr {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for BreakExpr {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
BREAK_EXPR => Some(BreakExpr::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for BreakExpr {
type Owned = TreeArc<BreakExpr>;
fn to_owned(&self) -> TreeArc<BreakExpr> { TreeArc::cast(self.syntax.to_owned()) }
}
impl BreakExpr {
pub fn expr(&self) -> Option<&Expr> {
super::child_opt(self)
}
}
// Byte
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct Byte {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for Byte {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for Byte {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
BYTE => Some(Byte::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for Byte {
type Owned = TreeArc<Byte>;
fn to_owned(&self) -> TreeArc<Byte> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::AstToken for Byte {}
impl Byte {}
// ByteString
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct ByteString {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for ByteString {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for ByteString {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
BYTE_STRING => Some(ByteString::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for ByteString {
type Owned = TreeArc<ByteString>;
fn to_owned(&self) -> TreeArc<ByteString> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::AstToken for ByteString {}
impl ByteString {}
// CallExpr
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct CallExpr {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for CallExpr {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for CallExpr {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
CALL_EXPR => Some(CallExpr::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for CallExpr {
type Owned = TreeArc<CallExpr>;
fn to_owned(&self) -> TreeArc<CallExpr> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::ArgListOwner for CallExpr {}
impl CallExpr {
pub fn expr(&self) -> Option<&Expr> {
super::child_opt(self)
}
}
// CastExpr
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct CastExpr {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for CastExpr {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for CastExpr {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
CAST_EXPR => Some(CastExpr::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for CastExpr {
type Owned = TreeArc<CastExpr>;
fn to_owned(&self) -> TreeArc<CastExpr> { TreeArc::cast(self.syntax.to_owned()) }
}
impl CastExpr {
pub fn expr(&self) -> Option<&Expr> {
super::child_opt(self)
}
pub fn type_ref(&self) -> Option<&TypeRef> {
super::child_opt(self)
}
}
// Char
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct Char {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for Char {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for Char {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
CHAR => Some(Char::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for Char {
type Owned = TreeArc<Char>;
fn to_owned(&self) -> TreeArc<Char> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::AstToken for Char {}
impl Char {}
// Comment
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct Comment {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for Comment {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for Comment {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
COMMENT => Some(Comment::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for Comment {
type Owned = TreeArc<Comment>;
fn to_owned(&self) -> TreeArc<Comment> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::AstToken for Comment {}
impl Comment {}
// Condition
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct Condition {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for Condition {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for Condition {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
CONDITION => Some(Condition::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for Condition {
type Owned = TreeArc<Condition>;
fn to_owned(&self) -> TreeArc<Condition> { TreeArc::cast(self.syntax.to_owned()) }
}
impl Condition {
pub fn pat(&self) -> Option<&Pat> {
super::child_opt(self)
}
pub fn expr(&self) -> Option<&Expr> {
super::child_opt(self)
}
}
// ConstDef
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct ConstDef {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for ConstDef {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for ConstDef {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
CONST_DEF => Some(ConstDef::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for ConstDef {
type Owned = TreeArc<ConstDef>;
fn to_owned(&self) -> TreeArc<ConstDef> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::VisibilityOwner for ConstDef {}
impl ast::NameOwner for ConstDef {}
impl ast::TypeParamsOwner for ConstDef {}
impl ast::AttrsOwner for ConstDef {}
impl ast::DocCommentsOwner for ConstDef {}
impl ast::TypeAscriptionOwner for ConstDef {}
impl ConstDef {}
// ContinueExpr
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct ContinueExpr {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for ContinueExpr {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for ContinueExpr {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
CONTINUE_EXPR => Some(ContinueExpr::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for ContinueExpr {
type Owned = TreeArc<ContinueExpr>;
fn to_owned(&self) -> TreeArc<ContinueExpr> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ContinueExpr {}
// DynTraitType
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct DynTraitType {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for DynTraitType {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for DynTraitType {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
DYN_TRAIT_TYPE => Some(DynTraitType::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for DynTraitType {
type Owned = TreeArc<DynTraitType>;
fn to_owned(&self) -> TreeArc<DynTraitType> { TreeArc::cast(self.syntax.to_owned()) }
}
impl DynTraitType {}
// EnumDef
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct EnumDef {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for EnumDef {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for EnumDef {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
ENUM_DEF => Some(EnumDef::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for EnumDef {
type Owned = TreeArc<EnumDef>;
fn to_owned(&self) -> TreeArc<EnumDef> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::VisibilityOwner for EnumDef {}
impl ast::NameOwner for EnumDef {}
impl ast::TypeParamsOwner for EnumDef {}
impl ast::AttrsOwner for EnumDef {}
impl ast::DocCommentsOwner for EnumDef {}
impl EnumDef {
pub fn variant_list(&self) -> Option<&EnumVariantList> {
super::child_opt(self)
}
}
// EnumVariant
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct EnumVariant {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for EnumVariant {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for EnumVariant {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
ENUM_VARIANT => Some(EnumVariant::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for EnumVariant {
type Owned = TreeArc<EnumVariant>;
fn to_owned(&self) -> TreeArc<EnumVariant> { TreeArc::cast(self.syntax.to_owned()) }
}
impl ast::NameOwner for EnumVariant {}
impl ast::DocCommentsOwner for EnumVariant {}
impl ast::AttrsOwner for EnumVariant {}
impl EnumVariant {
pub fn expr(&self) -> Option<&Expr> {
super::child_opt(self)
}
}
// EnumVariantList
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct EnumVariantList {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for EnumVariantList {
type Repr = rowan::SyntaxNode<RaTypes>;
}
impl AstNode for EnumVariantList {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
ENUM_VARIANT_LIST => Some(EnumVariantList::from_repr(syntax.into_repr())),
_ => None,
}
}
fn syntax(&self) -> &SyntaxNode { &self.syntax }
}
impl ToOwned for EnumVariantList {
type Owned = TreeArc<EnumVariantList>;
fn to_owned(&self) -> TreeArc<EnumVariantList> { TreeArc::cast(self.syntax.to_owned()) }
}
impl EnumVariantList {
pub fn variants(&self) -> impl Iterator<Item = &EnumVariant> {
super::children(self)
}
}
// Expr
#[derive(Debug, PartialEq, Eq, Hash)]
#[repr(transparent)]
pub struct Expr {
pub(crate) syntax: SyntaxNode,
}
unsafe impl TransparentNewType for Expr {
type Repr = rowan::SyntaxNode<RaTypes>;
}
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum ExprKind<'a> {
TupleExpr(&'a TupleExpr),
ArrayExpr(&'a ArrayExpr),
ParenExpr(&'a ParenExpr),
PathExpr(&'a PathExpr),
LambdaExpr(&'a LambdaExpr),
IfExpr(&'a IfExpr),
LoopExpr(&'a LoopExpr),
ForExpr(&'a ForExpr),
WhileExpr(&'a WhileExpr),
ContinueExpr(&'a ContinueExpr),
BreakExpr(&'a BreakExpr),
Label(&'a Label),
BlockExpr(&'a BlockExpr),
ReturnExpr(&'a ReturnExpr),
MatchExpr(&'a MatchExpr),
StructLit(&'a StructLit),
CallExpr(&'a CallExpr),
IndexExpr(&'a IndexExpr),
MethodCallExpr(&'a MethodCallExpr),
FieldExpr(&'a FieldExpr),
TryExpr(&'a TryExpr),
CastExpr(&'a CastExpr),
RefExpr(&'a RefExpr),
PrefixExpr(&'a PrefixExpr),
RangeExpr(&'a RangeExpr),
BinExpr(&'a BinExpr),
Literal(&'a Literal),
}
impl<'a> From<&'a TupleExpr> for &'a Expr {
fn from(n: &'a TupleExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a ArrayExpr> for &'a Expr {
fn from(n: &'a ArrayExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a ParenExpr> for &'a Expr {
fn from(n: &'a ParenExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a PathExpr> for &'a Expr {
fn from(n: &'a PathExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a LambdaExpr> for &'a Expr {
fn from(n: &'a LambdaExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a IfExpr> for &'a Expr {
fn from(n: &'a IfExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a LoopExpr> for &'a Expr {
fn from(n: &'a LoopExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a ForExpr> for &'a Expr {
fn from(n: &'a ForExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a WhileExpr> for &'a Expr {
fn from(n: &'a WhileExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a ContinueExpr> for &'a Expr {
fn from(n: &'a ContinueExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a BreakExpr> for &'a Expr {
fn from(n: &'a BreakExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a Label> for &'a Expr {
fn from(n: &'a Label) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a BlockExpr> for &'a Expr {
fn from(n: &'a BlockExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a ReturnExpr> for &'a Expr {
fn from(n: &'a ReturnExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a MatchExpr> for &'a Expr {
fn from(n: &'a MatchExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a StructLit> for &'a Expr {
fn from(n: &'a StructLit) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a CallExpr> for &'a Expr {
fn from(n: &'a CallExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a IndexExpr> for &'a Expr {
fn from(n: &'a IndexExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a MethodCallExpr> for &'a Expr {
fn from(n: &'a MethodCallExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a FieldExpr> for &'a Expr {
fn from(n: &'a FieldExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a TryExpr> for &'a Expr {
fn from(n: &'a TryExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a CastExpr> for &'a Expr {
fn from(n: &'a CastExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a RefExpr> for &'a Expr {
fn from(n: &'a RefExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a PrefixExpr> for &'a Expr {
fn from(n: &'a PrefixExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a RangeExpr> for &'a Expr {
fn from(n: &'a RangeExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a BinExpr> for &'a Expr {
fn from(n: &'a BinExpr) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl<'a> From<&'a Literal> for &'a Expr {
fn from(n: &'a Literal) -> &'a Expr {
Expr::cast(&n.syntax).unwrap()
}
}
impl AstNode for Expr {
fn cast(syntax: &SyntaxNode) -> Option<&Self> {
match syntax.kind() {
| TUPLE_EXPR
| ARRAY_EXPR
| PAREN_EXPR
| PATH_EXPR
| LAMBDA_EXPR
| IF_EXPR
| LOOP_EXPR
| FOR_EXPR
| WHILE_EXPR
| CONTINUE_EXPR
| BREAK_EXPR
| LABEL
| BLOCK_EXPR
| RETURN_EXPR
| MATCH_EXPR
| STRUCT_LIT
| CALL_EXPR
| INDEX_EXPR
| METHOD_CALL_EXPR
| FIELD_EXPR
| TRY_EXPR
| CAST_EXPR
| REF_EXPR
| PREFIX_EXPR
| RANGE_EXPR
| BIN_EXPR
| LITERAL => Some(Expr::from_repr(syntax.into_repr())),