4 writes to root
Microsoft.CodeAnalysis.CodeStyle (4)
IntervalTree`1.cs (1)
42
result.
root
= Insert(result.root, new Node(value), in introspector);
SimpleIntervalTree`2.cs (3)
23
root
= Insert(root, new Node(value), introspector);
37
this.
root
= Insert(root, newNode, in Introspector);
44
=> this.
root
= null;
11 references to root
Microsoft.CodeAnalysis.CodeStyle (11)
ContextIntervalTree.cs (3)
66
if (
root
== null || MaxEndValue(
root
) < start)
87
spineNodes.Push(
root
);
IntervalTree`1.cs (6)
42
result.root = Insert(result.
root
, new Node(value), in introspector);
162
if (
root
== null)
189
candidates.Push((
root
, firstTime: true));
248
public bool IsEmpty() => this.
root
== null;
320
if (
root
== null)
326
candidates.Push((
root
, firstTime: true));
SimpleIntervalTree`2.cs (2)
23
root = Insert(
root
, new Node(value), introspector);
37
this.root = Insert(
root
, newNode, in Introspector);