- Timestamp:
- 10/24/18 18:48:10 (6 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Hashing/HashExtensions.cs
r16252 r16255 120 120 121 121 public static HashNode<T>[] Sort<T>(this HashNode<T>[] nodes) where T : class { 122 int sort(int a, int b) => nodes[a].CompareTo(nodes[b]); 123 122 124 for (int i = 0; i < nodes.Length; ++i) { 123 125 var node = nodes[i]; … … 136 138 var sorted = new HashNode<T>[size]; 137 139 var indices = nodes.IterateChildren(i); 138 Array.Sort(indices, (a, b) => nodes[a].CompareTo(nodes[b]));140 Array.Sort(indices, sort); 139 141 140 142 int idx = 0;
Note: See TracChangeset
for help on using the changeset viewer.