@@ -61,7 +61,7 @@ private static void InternalPerformanceTest(int nodeCount, int averageConnection
61
61
GC . GetTotalMemory ( true ) ;
62
62
using ( new Measurement ( "Sorting" , nodeCount + connectionCount ) ) {
63
63
List < Node < int , int > > removedEdges ;
64
- var result = TopologicalSorter . Sort ( nodes , out removedEdges ) ;
64
+ var result = TopologicalSorter . SortToList ( nodes , out removedEdges ) ;
65
65
if ( ! allowLoops )
66
66
Assert . AreEqual ( nodeCount , result . Count ) ;
67
67
}
@@ -75,8 +75,7 @@ public void SelfReferenceTest()
75
75
var connection = new NodeConnection < int , string > ( node , node , "ConnectionItem" ) ;
76
76
connection . BindToNodes ( ) ;
77
77
78
- List < NodeConnection < int , string > > removedEdges ;
79
- List < int > result = TopologicalSorter . Sort ( EnumerableUtils . One ( node ) , out removedEdges ) ;
78
+ var result = TopologicalSorter . SortToList ( EnumerableUtils . One ( node ) , out var removedEdges ) ;
80
79
Assert . AreEqual ( 1 , result . Count ) ;
81
80
Assert . AreEqual ( node . Item , result [ 0 ] ) ;
82
81
Assert . AreEqual ( 1 , removedEdges . Count ) ;
@@ -97,8 +96,7 @@ public void RemoveWholeNodeTest()
97
96
98
97
// Remove edge by edge.
99
98
100
- List < NodeConnection < int , string > > removedEdges ;
101
- List < int > result = TopologicalSorter . Sort ( new [ ] { node2 , node1 } , out removedEdges ) ;
99
+ var result = TopologicalSorter . SortToList ( new [ ] { node2 , node1 } , out List < NodeConnection < int , string > > removedEdges ) ;
102
100
Assert . AreEqual ( 2 , result . Count ) ;
103
101
Assert . AreEqual ( node1 . Item , result [ 0 ] ) ;
104
102
Assert . AreEqual ( node2 . Item , result [ 1 ] ) ;
@@ -111,7 +109,7 @@ public void RemoveWholeNodeTest()
111
109
connection12_2 . BindToNodes ( ) ;
112
110
connection21_1 . BindToNodes ( ) ;
113
111
114
- result = TopologicalSorter . Sort ( new [ ] { node2 , node1 } , out removedEdges , true ) ;
112
+ result = TopologicalSorter . SortToList ( new [ ] { node2 , node1 } , out removedEdges , true ) ;
115
113
Assert . AreEqual ( 2 , result . Count ) ;
116
114
Assert . AreEqual ( node1 . Item , result [ 1 ] ) ;
117
115
Assert . AreEqual ( node2 . Item , result [ 0 ] ) ;
@@ -131,8 +129,7 @@ public void CombinedTest()
131
129
132
130
private void TestSort < T > ( T [ ] data , Predicate < T , T > connector , T [ ] expected , T [ ] loops )
133
131
{
134
- List < Node < T , object > > actualLoopNodes ;
135
- List < T > actual = TopologicalSorter . Sort ( data , connector , out actualLoopNodes ) ;
132
+ var actual = TopologicalSorter . SortToList ( data , connector , out List < Node < T , object > > actualLoopNodes ) ;
136
133
T [ ] actualLoops = null ;
137
134
if ( actualLoopNodes != null )
138
135
actualLoops = actualLoopNodes
@@ -143,8 +140,7 @@ private void TestSort<T>(T[] data, Predicate<T, T> connector, T[] expected, T[]
143
140
AssertEx . HasSameElements ( expected , actual ) ;
144
141
AssertEx . HasSameElements ( loops , actualLoops ) ;
145
142
146
- List < NodeConnection < T , object > > removedEdges ;
147
- List < T > sortWithRemove = TopologicalSorter . Sort ( data , connector , out removedEdges ) ;
143
+ var sortWithRemove = TopologicalSorter . SortToList ( data , connector , out List < NodeConnection < T , object > > removedEdges ) ;
148
144
Assert . AreEqual ( sortWithRemove . Count , data . Length ) ;
149
145
if ( loops == null ) {
150
146
Assert . AreEqual ( sortWithRemove . Count , actual . Count ) ;
0 commit comments