1 write to HasSlice
Microsoft.CodeAnalysis.CSharp (1)
Generated\BoundNodes.xml.Generated.cs (1)
8207
this.
HasSlice
= hasSlice;
9 references to HasSlice
Microsoft.CodeAnalysis.CSharp (9)
Binder\DecisionDagBuilder_CheckOrReachability.cs (1)
1295
bool hasSlice = listPattern.
HasSlice
;
Binder\DecisionDagBuilder_ListPatterns.cs (3)
19
list.Subpatterns.Count(p => p.Kind == BoundKind.SlicePattern) == (list.
HasSlice
? 1 : 0) &&
31
else if (list.
HasSlice
&&
45
tests.Add(new Tests.One(list.
HasSlice
BoundTree\BoundListPattern.cs (1)
15
return Update(subpatterns, this.
HasSlice
, this.LengthAccess, this.IndexerAccess, this.ReceiverPlaceholder, this.ArgumentPlaceholder, this.Variable, this.VariableAccess, this.InputType, this.NarrowedType);
Generated\BoundNodes.xml.Generated.cs (4)
8230
if (subpatterns != this.Subpatterns || hasSlice != this.
HasSlice
|| lengthAccess != this.LengthAccess || indexerAccess != this.IndexerAccess || receiverPlaceholder != this.ReceiverPlaceholder || argumentPlaceholder != this.ArgumentPlaceholder || !Symbols.SymbolEqualityComparer.ConsiderEverything.Equals(variable, this.Variable) || variableAccess != this.VariableAccess || !TypeSymbol.Equals(inputType, this.InputType, TypeCompareKind.ConsiderEverything) || !TypeSymbol.Equals(narrowedType, this.NarrowedType, TypeCompareKind.ConsiderEverything))
12282
return node.Update(subpatterns, node.
HasSlice
, lengthAccess, indexerAccess, receiverPlaceholder, argumentPlaceholder, variable, variableAccess, inputType, narrowedType);
14941
return node.Update(subpatterns, node.
HasSlice
, lengthAccess, indexerAccess, receiverPlaceholder, argumentPlaceholder, variable, variableAccess, inputType, narrowedType);
17126
new TreeDumperNode("hasSlice", node.
HasSlice
, null),