Created
August 21, 2012 09:27
-
-
Save KennyEliasson/3413908 to your computer and use it in GitHub Desktop.
Natural Sort c#
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class NaturalSortComparer : IComparer<string>, IDisposable | |
{ | |
private bool isAscending; | |
public NaturalSortComparer(bool inAscendingOrder = true) | |
{ | |
this.isAscending = inAscendingOrder; | |
} | |
public int Compare(string x, string y) | |
{ | |
throw new NotImplementedException(); | |
} | |
int IComparer<string>.Compare(string x, string y) | |
{ | |
if (x == y) | |
return 0; | |
string[] x1, y1; | |
if (!table.TryGetValue(x, out x1)) | |
{ | |
x1 = Regex.Split(x.Replace(" ", ""), "([0-9]+)"); | |
table.Add(x, x1); | |
} | |
if (!table.TryGetValue(y, out y1)) | |
{ | |
y1 = Regex.Split(y.Replace(" ", ""), "([0-9]+)"); | |
table.Add(y, y1); | |
} | |
int returnVal; | |
for (int i = 0; i < x1.Length && i < y1.Length; i++) | |
{ | |
if (x1[i] != y1[i]) | |
{ | |
returnVal = PartCompare(x1[i], y1[i]); | |
return isAscending ? returnVal : -returnVal; | |
} | |
} | |
if (y1.Length > x1.Length) | |
{ | |
returnVal = 1; | |
} | |
else if (x1.Length > y1.Length) | |
{ | |
returnVal = -1; | |
} | |
else | |
{ | |
returnVal = 0; | |
} | |
return isAscending ? returnVal : -returnVal; | |
} | |
private static int PartCompare(string left, string right) | |
{ | |
int x, y; | |
if (!int.TryParse(left, out x)) | |
return left.CompareTo(right); | |
if (!int.TryParse(right, out y)) | |
return left.CompareTo(right); | |
return x.CompareTo(y); | |
} | |
private Dictionary<string, string[]> table = new Dictionary<string, string[]>(); | |
public void Dispose() | |
{ | |
table.Clear(); | |
table = null; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment