2 instantiations of ImmutableIntervalTree
Microsoft.CodeAnalysis.CodeStyle (2)
src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Collections\ImmutableIntervalTree`1.cs (2)
25public static readonly ImmutableIntervalTree<T> Empty = new(new SegmentedArray<Node>(0)); 94return new ImmutableIntervalTree<T>(array);
15 references to ImmutableIntervalTree
Microsoft.CodeAnalysis.CodeStyle (15)
src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Collections\ImmutableIntervalTree`1.cs (15)
25public static readonly ImmutableIntervalTree<T> Empty = new(new SegmentedArray<Node>(0)); 45public IntervalTreeAlgorithms<T, ImmutableIntervalTree<T>> Algorithms => new(this); 48/// Creates a <see cref="ImmutableIntervalTree{T}"/> from an unsorted list of <paramref name="values"/>. This will 55public static ImmutableIntervalTree<T> CreateFromUnsorted<TIntrospector>(in TIntrospector introspector, SegmentedList<T> values) 74public static ImmutableIntervalTree<T> CreateFromSorted<TIntrospector>(in TIntrospector introspector, SegmentedList<T> values) 265=> IntervalTreeHelpers<T, ImmutableIntervalTree<T>, /*TNode*/ int, FlatArrayIntervalTreeWitness>.Any(this, start, length, introspector, intervalTester); 272return IntervalTreeHelpers<T, ImmutableIntervalTree<T>, /*TNode*/ int, FlatArrayIntervalTreeWitness>.FillWithIntervalsThatMatch( 282public IntervalTreeHelpers<T, ImmutableIntervalTree<T>, /*TNode*/ int, FlatArrayIntervalTreeWitness>.Enumerator GetEnumerator() 283=> IntervalTreeHelpers<T, ImmutableIntervalTree<T>, /*TNode*/ int, FlatArrayIntervalTreeWitness>.GetEnumerator(this); 288internal readonly struct FlatArrayIntervalTreeWitness : IIntervalTreeWitness<T, ImmutableIntervalTree<T>, int> 290public T GetValue(ImmutableIntervalTree<T> tree, int node) 293public int GetMaxEndNode(ImmutableIntervalTree<T> tree, int node) 296public bool TryGetRoot(ImmutableIntervalTree<T> tree, out int root) 302public bool TryGetLeftNode(ImmutableIntervalTree<T> tree, int node, out int leftNode) 308public bool TryGetRightNode(ImmutableIntervalTree<T> tree, int node, out int rightNode)