-
Notifications
You must be signed in to change notification settings - Fork 4k
/
SyntaxNodeOrToken.cs
1006 lines (855 loc) · 31.7 KB
/
SyntaxNodeOrToken.cs
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
// Copyright (c) Microsoft. All Rights Reserved. Licensed under the Apache License, Version 2.0. See License.txt in the project root for license information.
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Runtime.InteropServices;
using Microsoft.CodeAnalysis.Text;
using Roslyn.Utilities;
namespace Microsoft.CodeAnalysis
{
/// <summary>
/// A wrapper for either a syntax node (<see cref="SyntaxNode"/>) or a syntax token (<see
/// cref="SyntaxToken"/>).
/// </summary>
/// <remarks>
/// Note that we do not store the token directly, we just store enough information to reconstruct it.
/// This allows us to reuse nodeOrToken as a token's parent.
/// </remarks>
[StructLayout(LayoutKind.Auto)]
[DebuggerDisplay("{GetDebuggerDisplay(), nq}")]
public readonly struct SyntaxNodeOrToken : IEquatable<SyntaxNodeOrToken>
{
// In a case if we are wrapping a SyntaxNode this is the SyntaxNode itself.
// In a case where we are wrapping a token, this is the token's parent.
private readonly SyntaxNode _nodeOrParent;
// Green node for the token.
private readonly GreenNode _token;
// Used in both node and token cases.
// When we have a node, _position == _nodeOrParent.Position.
private readonly int _position;
// Index of the token among parent's children.
// This field only makes sense if this is a token.
// For regular nodes it is set to -1 to distinguish from default(SyntaxToken)
private readonly int _tokenIndex;
internal SyntaxNodeOrToken(SyntaxNode node)
: this()
{
if (node != null)
{
Debug.Assert(!node.Green.IsList, "node cannot be a list");
_position = node.Position;
_nodeOrParent = node;
}
_tokenIndex = -1;
}
internal SyntaxNodeOrToken(SyntaxNode parent, GreenNode token, int position, int index)
{
Debug.Assert(parent == null || !parent.Green.IsList, "parent cannot be a list");
Debug.Assert(token != null || (parent == null && position == 0 && index == 0), "parts must form a token");
Debug.Assert(token == null || token.IsToken, "token must be a token");
Debug.Assert(index >= 0, "index must not be negative");
Debug.Assert(parent == null || token != null, "null token cannot have parent");
_position = position;
_tokenIndex = index;
_nodeOrParent = parent;
_token = token;
}
internal string GetDebuggerDisplay()
{
return GetType().Name + " " + KindText + " " + ToString();
}
private string KindText
{
get
{
if (_token != null)
{
return _token.KindText;
}
if (_nodeOrParent != null)
{
return _nodeOrParent.Green.KindText;
}
return "None";
}
}
/// <summary>
/// An integer representing the language specific kind of the underlying node or token.
/// </summary>
public int RawKind => _token?.RawKind ?? _nodeOrParent?.RawKind ?? 0;
/// <summary>
/// The language name that this node or token is syntax of.
/// </summary>
public string Language
{
get
{
if (_token != null)
{
return _token.Language;
}
if (_nodeOrParent != null)
{
return _nodeOrParent.Language;
}
return string.Empty;
}
}
/// <summary>
/// Determines whether the underlying node or token represents a language construct that was actually parsed
/// from source code. Missing nodes and tokens are typically generated by the parser in error scenarios to
/// represent constructs that should have been present in the source code for the source code to compile
/// successfully but were actually missing.
/// </summary>
public bool IsMissing => _token?.IsMissing ?? _nodeOrParent?.IsMissing ?? false;
/// <summary>
/// The node that contains the underlying node or token in its Children collection.
/// </summary>
public SyntaxNode Parent => _token != null ? _nodeOrParent : _nodeOrParent?.Parent;
internal GreenNode UnderlyingNode => _token ?? _nodeOrParent?.Green;
internal int Position => _position;
/// <summary>
/// Determines whether this <see cref="SyntaxNodeOrToken"/> is wrapping a token.
/// </summary>
public bool IsToken => !IsNode;
/// <summary>
/// Determines whether this <see cref="SyntaxNodeOrToken"/> is wrapping a node.
/// </summary>
public bool IsNode => _tokenIndex < 0;
/// <summary>
/// Returns the underlying token if this <see cref="SyntaxNodeOrToken"/> is wrapping a
/// token.
/// </summary>
/// <returns>
/// The underlying token if this <see cref="SyntaxNodeOrToken"/> is wrapping a token.
/// </returns>
public SyntaxToken AsToken()
{
if (_token != null)
{
return new SyntaxToken(_nodeOrParent, _token, this.Position, _tokenIndex);
}
return default(SyntaxToken);
}
/// <summary>
/// Returns the underlying node if this <see cref="SyntaxNodeOrToken"/> is wrapping a
/// node.
/// </summary>
/// <returns>
/// The underlying node if this <see cref="SyntaxNodeOrToken"/> is wrapping a node.
/// </returns>
public SyntaxNode AsNode()
{
if (_token != null)
{
return null;
}
return _nodeOrParent;
}
/// <summary>
/// The list of child nodes and tokens of the underlying node or token.
/// </summary>
public ChildSyntaxList ChildNodesAndTokens()
{
return this.IsToken
? default(ChildSyntaxList)
: _nodeOrParent.ChildNodesAndTokens();
}
/// <summary>
/// The absolute span of the underlying node or token in characters, not including its leading and trailing
/// trivia.
/// </summary>
public TextSpan Span
{
get
{
if (_token != null)
{
return this.AsToken().Span;
}
if (_nodeOrParent != null)
{
return _nodeOrParent.Span;
}
return default(TextSpan);
}
}
/// <summary>
/// Same as accessing <see cref="TextSpan.Start"/> on <see cref="Span"/>.
/// </summary>
/// <remarks>
/// Slight performance improvement.
/// </remarks>
public int SpanStart
{
get
{
if (_token != null)
{
// PERF: Inlined "this.AsToken().SpanStart"
return _position + _token.GetLeadingTriviaWidth();
}
if (_nodeOrParent != null)
{
return _nodeOrParent.SpanStart;
}
return 0; //default(TextSpan).Start
}
}
/// <summary>
/// The absolute span of the underlying node or token in characters, including its leading and trailing trivia.
/// </summary>
public TextSpan FullSpan
{
get
{
if (_token != null)
{
return new TextSpan(Position, _token.FullWidth);
}
if (_nodeOrParent != null)
{
return _nodeOrParent.FullSpan;
}
return default(TextSpan);
}
}
/// <summary>
/// Returns the string representation of this node or token, not including its leading and trailing
/// trivia.
/// </summary>
/// <returns>
/// The string representation of this node or token, not including its leading and trailing trivia.
/// </returns>
/// <remarks>The length of the returned string is always the same as Span.Length</remarks>
public override string ToString()
{
if (_token != null)
{
return _token.ToString();
}
if (_nodeOrParent != null)
{
return _nodeOrParent.ToString();
}
return string.Empty;
}
/// <summary>
/// Returns the full string representation of this node or token including its leading and trailing trivia.
/// </summary>
/// <returns>The full string representation of this node or token including its leading and trailing
/// trivia.</returns>
/// <remarks>The length of the returned string is always the same as FullSpan.Length</remarks>
public string ToFullString()
{
if (_token != null)
{
return _token.ToFullString();
}
if (_nodeOrParent != null)
{
return _nodeOrParent.ToFullString();
}
return string.Empty;
}
/// <summary>
/// Writes the full text of this node or token to the specified TextWriter.
/// </summary>
public void WriteTo(System.IO.TextWriter writer)
{
if (_token != null)
{
_token.WriteTo(writer);
}
else
{
_nodeOrParent?.WriteTo(writer);
}
}
/// <summary>
/// Determines whether the underlying node or token has any leading trivia.
/// </summary>
public bool HasLeadingTrivia => this.GetLeadingTrivia().Count > 0;
/// <summary>
/// The list of trivia that appear before the underlying node or token in the source code and are attached to a
/// token that is a descendant of the underlying node or token.
/// </summary>
public SyntaxTriviaList GetLeadingTrivia()
{
if (_token != null)
{
return this.AsToken().LeadingTrivia;
}
if (_nodeOrParent != null)
{
return _nodeOrParent.GetLeadingTrivia();
}
return default(SyntaxTriviaList);
}
/// <summary>
/// Determines whether the underlying node or token has any trailing trivia.
/// </summary>
public bool HasTrailingTrivia => this.GetTrailingTrivia().Count > 0;
/// <summary>
/// The list of trivia that appear after the underlying node or token in the source code and are attached to a
/// token that is a descendant of the underlying node or token.
/// </summary>
public SyntaxTriviaList GetTrailingTrivia()
{
if (_token != null)
{
return this.AsToken().TrailingTrivia;
}
if (_nodeOrParent != null)
{
return _nodeOrParent.GetTrailingTrivia();
}
return default(SyntaxTriviaList);
}
public SyntaxNodeOrToken WithLeadingTrivia(IEnumerable<SyntaxTrivia> trivia)
{
if (_token != null)
{
return AsToken().WithLeadingTrivia(trivia);
}
if (_nodeOrParent != null)
{
return _nodeOrParent.WithLeadingTrivia(trivia);
}
return this;
}
public SyntaxNodeOrToken WithLeadingTrivia(params SyntaxTrivia[] trivia)
{
return WithLeadingTrivia((IEnumerable<SyntaxTrivia>)trivia);
}
public SyntaxNodeOrToken WithTrailingTrivia(IEnumerable<SyntaxTrivia> trivia)
{
if (_token != null)
{
return AsToken().WithTrailingTrivia(trivia);
}
if (_nodeOrParent != null)
{
return _nodeOrParent.WithTrailingTrivia(trivia);
}
return this;
}
public SyntaxNodeOrToken WithTrailingTrivia(params SyntaxTrivia[] trivia)
{
return WithTrailingTrivia((IEnumerable<SyntaxTrivia>)trivia);
}
/// <summary>
/// Determines whether the underlying node or token or any of its descendant nodes, tokens or trivia have any
/// diagnostics on them.
/// </summary>
public bool ContainsDiagnostics
{
get
{
if (_token != null)
{
return _token.ContainsDiagnostics;
}
if (_nodeOrParent != null)
{
return _nodeOrParent.ContainsDiagnostics;
}
return false;
}
}
/// <summary>
/// Gets a list of all the diagnostics in either the sub tree that has this node as its root or
/// associated with this token and its related trivia.
/// This method does not filter diagnostics based on #pragmas and compiler options
/// like nowarn, warnaserror etc.
/// </summary>
public IEnumerable<Diagnostic> GetDiagnostics()
{
if (_token != null)
{
return this.AsToken().GetDiagnostics();
}
if (_nodeOrParent != null)
{
return _nodeOrParent.GetDiagnostics();
}
return SpecializedCollections.EmptyEnumerable<Diagnostic>();
}
/// <summary>
/// Determines whether the underlying node or token has any descendant preprocessor directives.
/// </summary>
public bool ContainsDirectives
{
get
{
if (_token != null)
{
return _token.ContainsDirectives;
}
if (_nodeOrParent != null)
{
return _nodeOrParent.ContainsDirectives;
}
return false;
}
}
#region Annotations
/// <summary>
/// Determines whether this node or token (or any sub node, token or trivia) as annotations.
/// </summary>
public bool ContainsAnnotations
{
get
{
if (_token != null)
{
return _token.ContainsAnnotations;
}
if (_nodeOrParent != null)
{
return _nodeOrParent.ContainsAnnotations;
}
return false;
}
}
/// <summary>
/// Determines whether this node or token has annotations of the specified kind.
/// </summary>
public bool HasAnnotations(string annotationKind)
{
if (_token != null)
{
return _token.HasAnnotations(annotationKind);
}
if (_nodeOrParent != null)
{
return _nodeOrParent.HasAnnotations(annotationKind);
}
return false;
}
/// <summary>
/// Determines whether this node or token has annotations of the specified kind.
/// </summary>
public bool HasAnnotations(IEnumerable<string> annotationKinds)
{
if (_token != null)
{
return _token.HasAnnotations(annotationKinds);
}
if (_nodeOrParent != null)
{
return _nodeOrParent.HasAnnotations(annotationKinds);
}
return false;
}
/// <summary>
/// Determines if this node or token has the specific annotation.
/// </summary>
public bool HasAnnotation(SyntaxAnnotation annotation)
{
if (_token != null)
{
return _token.HasAnnotation(annotation);
}
if (_nodeOrParent != null)
{
return _nodeOrParent.HasAnnotation(annotation);
}
return false;
}
/// <summary>
/// Gets all annotations of the specified annotation kind.
/// </summary>
public IEnumerable<SyntaxAnnotation> GetAnnotations(string annotationKind)
{
if (_token != null)
{
return _token.GetAnnotations(annotationKind);
}
if (_nodeOrParent != null)
{
return _nodeOrParent.GetAnnotations(annotationKind);
}
return SpecializedCollections.EmptyEnumerable<SyntaxAnnotation>();
}
/// <summary>
/// Gets all annotations of the specified annotation kind.
/// </summary>
public IEnumerable<SyntaxAnnotation> GetAnnotations(IEnumerable<string> annotationKinds)
{
if (_token != null)
{
return _token.GetAnnotations(annotationKinds);
}
if (_nodeOrParent != null)
{
return _nodeOrParent.GetAnnotations(annotationKinds);
}
return SpecializedCollections.EmptyEnumerable<SyntaxAnnotation>();
}
/// <summary>
/// Creates a new node or token identical to this one with the specified annotations.
/// </summary>
public SyntaxNodeOrToken WithAdditionalAnnotations(params SyntaxAnnotation[] annotations)
{
return WithAdditionalAnnotations((IEnumerable<SyntaxAnnotation>)annotations);
}
/// <summary>
/// Creates a new node or token identical to this one with the specified annotations.
/// </summary>
public SyntaxNodeOrToken WithAdditionalAnnotations(IEnumerable<SyntaxAnnotation> annotations)
{
if (annotations == null)
{
throw new ArgumentNullException(nameof(annotations));
}
if (_token != null)
{
return this.AsToken().WithAdditionalAnnotations(annotations);
}
if (_nodeOrParent != null)
{
return _nodeOrParent.WithAdditionalAnnotations(annotations);
}
return this;
}
/// <summary>
/// Creates a new node or token identical to this one without the specified annotations.
/// </summary>
public SyntaxNodeOrToken WithoutAnnotations(params SyntaxAnnotation[] annotations)
{
return WithoutAnnotations((IEnumerable<SyntaxAnnotation>)annotations);
}
/// <summary>
/// Creates a new node or token identical to this one without the specified annotations.
/// </summary>
public SyntaxNodeOrToken WithoutAnnotations(IEnumerable<SyntaxAnnotation> annotations)
{
if (annotations == null)
{
throw new ArgumentNullException(nameof(annotations));
}
if (_token != null)
{
return this.AsToken().WithoutAnnotations(annotations);
}
if (_nodeOrParent != null)
{
return _nodeOrParent.WithoutAnnotations(annotations);
}
return this;
}
/// <summary>
/// Creates a new node or token identical to this one without annotations of the specified kind.
/// </summary>
public SyntaxNodeOrToken WithoutAnnotations(string annotationKind)
{
if (annotationKind == null)
{
throw new ArgumentNullException(nameof(annotationKind));
}
if (this.HasAnnotations(annotationKind))
{
return this.WithoutAnnotations(this.GetAnnotations(annotationKind));
}
return this;
}
#endregion
/// <summary>
/// Determines whether the supplied <see cref="SyntaxNodeOrToken"/> is equal to this
/// <see cref="SyntaxNodeOrToken"/>.
/// </summary>
public bool Equals(SyntaxNodeOrToken other)
{
// index replaces position to ensure equality. Assert if offset affects equality.
Debug.Assert(
(_nodeOrParent == other._nodeOrParent && _token == other._token && _position == other._position && _tokenIndex == other._tokenIndex) ==
(_nodeOrParent == other._nodeOrParent && _token == other._token && _tokenIndex == other._tokenIndex));
return _nodeOrParent == other._nodeOrParent &&
_token == other._token &&
_tokenIndex == other._tokenIndex;
}
/// <summary>
/// Determines whether two <see cref="SyntaxNodeOrToken"/>s are equal.
/// </summary>
public static bool operator ==(SyntaxNodeOrToken left, SyntaxNodeOrToken right)
{
return left.Equals(right);
}
/// <summary>
/// Determines whether two <see cref="SyntaxNodeOrToken"/>s are unequal.
/// </summary>
public static bool operator !=(SyntaxNodeOrToken left, SyntaxNodeOrToken right)
{
return !left.Equals(right);
}
/// <summary>
/// Determines whether the supplied <see cref="SyntaxNodeOrToken"/> is equal to this
/// <see cref="SyntaxNodeOrToken"/>.
/// </summary>
public override bool Equals(object obj)
{
return obj is SyntaxNodeOrToken && Equals((SyntaxNodeOrToken)obj);
}
/// <summary>
/// Serves as hash function for <see cref="SyntaxNodeOrToken"/>.
/// </summary>
public override int GetHashCode()
{
return Hash.Combine(_nodeOrParent, Hash.Combine(_token, _tokenIndex));
}
/// <summary>
/// Determines if the two nodes or tokens are equivalent.
/// </summary>
public bool IsEquivalentTo(SyntaxNodeOrToken other)
{
if (this.IsNode != other.IsNode)
{
return false;
}
var thisUnderlying = this.UnderlyingNode;
var otherUnderlying = other.UnderlyingNode;
return (thisUnderlying == otherUnderlying) || (thisUnderlying != null && thisUnderlying.IsEquivalentTo(otherUnderlying));
}
/// <summary>
/// Returns a new <see cref="SyntaxNodeOrToken"/> that wraps the supplied token.
/// </summary>
/// <param name="token">The input token.</param>
/// <returns>
/// A <see cref="SyntaxNodeOrToken"/> that wraps the supplied token.
/// </returns>
public static implicit operator SyntaxNodeOrToken(SyntaxToken token)
{
return new SyntaxNodeOrToken(token.Parent, token.Node, token.Position, token.Index);
}
/// <summary>
/// Returns the underlying token wrapped by the supplied <see cref="SyntaxNodeOrToken"/>.
/// </summary>
/// <param name="nodeOrToken">
/// The input <see cref="SyntaxNodeOrToken"/>.
/// </param>
/// <returns>
/// The underlying token wrapped by the supplied <see cref="SyntaxNodeOrToken"/>.
/// </returns>
public static explicit operator SyntaxToken(SyntaxNodeOrToken nodeOrToken)
{
return nodeOrToken.AsToken();
}
/// <summary>
/// Returns a new <see cref="SyntaxNodeOrToken"/> that wraps the supplied node.
/// </summary>
/// <param name="node">The input node.</param>
/// <returns>
/// A <see cref="SyntaxNodeOrToken"/> that wraps the supplied node.
/// </returns>
public static implicit operator SyntaxNodeOrToken(SyntaxNode node)
{
return new SyntaxNodeOrToken(node);
}
/// <summary>
/// Returns the underlying node wrapped by the supplied <see cref="SyntaxNodeOrToken"/>.
/// </summary>
/// <param name="nodeOrToken">
/// The input <see cref="SyntaxNodeOrToken"/>.
/// </param>
/// <returns>
/// The underlying node wrapped by the supplied <see cref="SyntaxNodeOrToken"/>.
/// </returns>
public static explicit operator SyntaxNode(SyntaxNodeOrToken nodeOrToken)
{
return nodeOrToken.AsNode();
}
/// <summary>
/// SyntaxTree which contains current SyntaxNodeOrToken.
/// </summary>
public SyntaxTree SyntaxTree => _nodeOrParent?.SyntaxTree;
/// <summary>
/// Get the location of this node or token.
/// </summary>
public Location GetLocation()
{
return _token != null
? this.AsToken().GetLocation()
: _nodeOrParent?.GetLocation();
}
#region Directive Lookup
// Get all directives under the node and its children in source code order.
internal IList<TDirective> GetDirectives<TDirective>(Func<TDirective, bool> filter = null)
where TDirective : SyntaxNode
{
List<TDirective> directives = null;
GetDirectives(this, filter, ref directives);
return directives ?? SpecializedCollections.EmptyList<TDirective>();
}
private static void GetDirectives<TDirective>(in SyntaxNodeOrToken node, Func<TDirective, bool> filter, ref List<TDirective> directives)
where TDirective : SyntaxNode
{
if (node._token != null)
{
GetDirectives(node.AsToken(), filter, ref directives);
}
else if (node._nodeOrParent != null)
{
GetDirectives(node._nodeOrParent, filter, ref directives);
}
}
private static void GetDirectives<TDirective>(SyntaxNode node, Func<TDirective, bool> filter, ref List<TDirective> directives)
where TDirective : SyntaxNode
{
if (node.ContainsDirectives)
{
foreach (var child in node.ChildNodesAndTokens())
{
GetDirectives(child, filter, ref directives);
}
}
}
private static void GetDirectives<TDirective>(SyntaxToken token, Func<TDirective, bool> filter, ref List<TDirective> directives)
where TDirective : SyntaxNode
{
if (token.ContainsDirectives)
{
GetDirectives(token.LeadingTrivia, filter, ref directives);
GetDirectives(token.TrailingTrivia, filter, ref directives);
}
}
private static void GetDirectives<TDirective>(in SyntaxTriviaList trivia, Func<TDirective, bool> filter, ref List<TDirective> directives)
where TDirective : SyntaxNode
{
foreach (var tr in trivia)
{
if (tr.IsDirective)
{
var directive = tr.GetStructure() as TDirective;
if (directive == null ||
(filter != null && !filter(directive)))
{
continue;
}
if (directives == null)
{
directives = new List<TDirective>();
}
directives.Add(directive);
}
else if (tr.HasStructure)
{
GetDirectives(tr.GetStructure(), filter, ref directives);
}
}
}
#endregion
internal int Width => _token?.Width ?? _nodeOrParent?.Width ?? 0;
internal int FullWidth => _token?.FullWidth ?? _nodeOrParent?.FullWidth ?? 0;
internal int EndPosition => _position + this.FullWidth;
public static int GetFirstChildIndexSpanningPosition(SyntaxNode node, int position)
{
if (!node.FullSpan.IntersectsWith(position))
{
throw new ArgumentException("Must be within node's FullSpan", nameof(position));
}
return GetFirstChildIndexSpanningPosition(node.ChildNodesAndTokens(), position);
}
internal static int GetFirstChildIndexSpanningPosition(ChildSyntaxList list, int position)
{
int lo = 0;
int hi = list.Count - 1;
while (lo <= hi)
{
int r = lo + ((hi - lo) >> 1);
var m = list[r];
if (position < m.Position)
{
hi = r - 1;
}
else
{
if (position == m.Position)
{
// If we hit a zero width node, move left to the first such node (or the
// first one in the list)
for (; r > 0 && list[r - 1].FullWidth == 0; r--)
{
;
}
return r;
}
if (position >= m.EndPosition)
{
lo = r + 1;
continue;
}
return r;
}
}
throw ExceptionUtilities.Unreachable;
}
public SyntaxNodeOrToken GetNextSibling()
{
var parent = this.Parent;
if (parent == null)
{
return default(SyntaxNodeOrToken);
}
var siblings = parent.ChildNodesAndTokens();
return siblings.Count < 8
? GetNextSiblingFromStart(siblings)
: GetNextSiblingWithSearch(siblings);
}
public SyntaxNodeOrToken GetPreviousSibling()
{
if (this.Parent != null)
{
// walk reverse in parent's child list until we find ourself
// and then return the next child
var returnNext = false;
foreach (var child in this.Parent.ChildNodesAndTokens().Reverse())
{
if (returnNext)
{
return child;
}
if (child == this)
{
returnNext = true;
}
}
}
return default(SyntaxNodeOrToken);
}
private SyntaxNodeOrToken GetNextSiblingFromStart(ChildSyntaxList siblings)
{
var returnNext = false;
foreach (var sibling in siblings)
{
if (returnNext)
{
return sibling;
}
if (sibling == this)
{
returnNext = true;
}
}
return default(SyntaxNodeOrToken);
}
private SyntaxNodeOrToken GetNextSiblingWithSearch(ChildSyntaxList siblings)
{
var firstIndex = GetFirstChildIndexSpanningPosition(siblings, _position);
var count = siblings.Count;
var returnNext = false;
for (int i = firstIndex; i < count; i++)
{
if (returnNext)
{
return siblings[i];
}
if (siblings[i] == this)
{
returnNext = true;
}