1 write to Left
Microsoft.CodeAnalysis.CSharp (1)
Generated\BoundNodes.xml.Generated.cs (1)
8463
this.
Left
= left;
50 references to Left
Microsoft.CodeAnalysis.CSharp (50)
Binder\Binder_Patterns.cs (1)
1879
collectCandidates(p.
Left
, candidates);
Binder\DecisionDagBuilder.cs (2)
656
currentNode = currentNode.
Left
as BoundBinaryPattern;
660
Tests result = MakeTestsAndBindings(input, currentNode.
Left
, out output, bindings);
Binder\DecisionDagBuilder_CheckOrReachability.cs (9)
467
current = current.
Left
as BoundBinaryPattern;
473
analyzePattern(currentCases, current.
Left
, wrapIntoParentAndPattern, in context);
480
var wrappedPattern = new BoundBinaryPattern(newPattern.Syntax, disjunction: false, current.
Left
, newPattern, current.InputType, newPattern.NarrowedType);
550
current = current.
Left
as BoundBinaryPattern;
556
Debug.Assert(current.
Left
is not BoundBinaryPattern { Disjunction: true });
557
builder.Add(current.
Left
);
833
current = current.
Left
as BoundBinaryPattern;
841
Debug.Assert(!(current.
Left
is BoundBinaryPattern binary && binary.Disjunction == node.Disjunction));
844
Visit(current.
Left
);
BoundTree\BoundBinaryPattern.cs (2)
13
Debug.Assert(
Left
.InputType.Equals(InputType, TypeCompareKind.AllIgnoreOptions));
23
Debug.Assert(Right.InputType.Equals(
Left
.NarrowedType, TypeCompareKind.AllIgnoreOptions));
BoundTree\BoundNode_Source.cs (1)
352
appendSource(binaryPattern.
Left
);
BoundTree\BoundTreeRewriter.cs (2)
342
BoundPattern child = node.
Left
;
357
child = binary.
Left
;
BoundTree\BoundTreeWalker.cs (3)
147
if (node.
Left
is not BoundBinaryPattern binary)
157
BoundPattern? current = binary.
Left
;
163
current = binary.
Left
;
BoundTree\NullabilityRewriter.cs (2)
147
currentBinary = currentBinary.
Left
as BoundBinaryPattern;
152
var leftChild = (BoundPattern)Visit(stack.Peek().
Left
);
Compilation\MemberSemanticModel.NodeMapBuilder.cs (2)
228
BoundPattern currentPattern = binaryPattern.
Left
;
239
currentPattern = binaryPattern.
Left
;
FlowAnalysis\AbstractFlowPass.cs (5)
998
Debug.Assert(binaryPatterns.Peek().
Left
is not BoundBinaryPattern);
999
bool currentPatternMatchesNull = patternMatchesNull(binaryPatterns.Peek().
Left
);
1039
Debug.Assert(binaryPatterns.Peek().
Left
is not BoundBinaryPattern);
1040
bool? currentBoolTest = isBoolTest(binaryPatterns.Peek().
Left
);
1088
if (binaryPattern.
Left
is BoundBinaryPattern leftBinaryPattern)
FlowAnalysis\DefiniteAssignment.cs (4)
2052
if (pat.
Left
is not BoundBinaryPattern)
2055
assignPatternVariablesAndMarkReadFields(pat.
Left
, def);
2067
pat = pat.
Left
as BoundBinaryPattern;
2071
assignPatternVariablesAndMarkReadFields(patAndDef.pattern.
Left
, patAndDef.def);
FlowAnalysis\NullableWalker.DebugVerifier.cs (2)
326
if (node.
Left
is not BoundBinaryPattern child)
328
Visit(node.
Left
);
FlowAnalysis\NullableWalker_Patterns.cs (5)
121
current = current.
Left
as BoundBinaryPattern;
129
Debug.Assert(current.
Left
is not BoundBinaryPattern);
130
Visit(current.
Left
);
231
if (current.
Left
is BoundBinaryPattern left)
238
LearnFromAnyNullPatterns(inputSlot, inputType, current.
Left
);
Generated\BoundNodes.xml.Generated.cs (4)
8480
if (disjunction != this.Disjunction || left != this.
Left
|| right != this.Right || !TypeSymbol.Equals(inputType, this.InputType, TypeCompareKind.ConsiderEverything) || !TypeSymbol.Equals(narrowedType, this.NarrowedType, TypeCompareKind.ConsiderEverything))
10779
this.Visit(node.
Left
);
12323
BoundPattern left = (BoundPattern)this.Visit(node.
Left
);
17186
new TreeDumperNode("left", null, new TreeDumperNode[] { Visit(node.
Left
, null) }),
Lowering\DiagnosticsPass_ExpressionTrees.cs (2)
731
if (current.
Left
is BoundBinaryPattern left)
737
Visit(current.
Left
);
Operations\CSharpOperationFactory.cs (4)
2645
if (boundBinaryPattern.
Left
is not BoundBinaryPattern)
2647
return createOperation(this, boundBinaryPattern, left: (IPatternOperation)Create(boundBinaryPattern.
Left
));
2657
current = current.
Left
as BoundBinaryPattern;
2661
var result = (IPatternOperation)Create(current.
Left
);