9 references to TryIterativeSort
Microsoft.CodeAnalysis.CSharp (3)
Binder\DecisionDagBuilder.cs (1)
1605
return TopologicalSort.
TryIterativeSort
<DagState>(SpecializedCollections.SingletonEnumerable<DagState>(this.RootNode), Successor, out result);
Binder\SwitchExpressionBinder.cs (1)
87
bool wasAcyclic = TopologicalSort.
TryIterativeSort
<BoundDecisionDagNode>(SpecializedCollections.SingletonEnumerable(decisionDag.RootNode), nonNullSuccessors, out var nodes);
BoundTree\BoundDecisionDag.cs (1)
72
bool wasAcyclic = TopologicalSort.
TryIterativeSort
<BoundDecisionDagNode>(SpecializedCollections.SingletonEnumerable(this.RootNode), Successors, out _topologicallySortedNodes);
Microsoft.CodeAnalysis.UnitTests (6)
Collections\TopologicalSortTests.cs (6)
33
var wasAcyclic = TopologicalSort.
TryIterativeSort
<int>(new[] { 4, 5 }, i => succF(i).ToImmutableArray(), out var sorted);
54
var wasAcyclic = TopologicalSort.
TryIterativeSort
<string>(new[] { "4", "5" }, i => succF(i).ToImmutableArray(), out var sorted);
77
var wasAcyclic = TopologicalSort.
TryIterativeSort
<int>(new[] { 1, 6 }, i => succF(i).ToImmutableArray(), out var sorted);
100
var wasAcyclic = TopologicalSort.
TryIterativeSort
<int>(new[] { 1 }, x => successors[x].ToImmutableArray(), out var sorted);
144
var wasAcyclic = TopologicalSort.
TryIterativeSort
<int>(Enumerable.Range(0, numberOfNodes).ToArray(), i => succF(i).ToImmutableArray(), out var sorted);
158
wasAcyclic = TopologicalSort.
TryIterativeSort
<int>(Enumerable.Range(0, numberOfNodes).ToArray(), i => succF(i).ToImmutableArray(), out sorted);