enhance: improve NumericSort.Compare performance

Signed-off-by: leo <[email protected]>

Author: love-linger

src/Models/NumericSort.cs

@@ -21,6 +21,10 @@ public static int Compare(string s1, string s2)
                 int loc2 = 0;
 
                 bool isDigit1 = char.IsDigit(c1);
+                bool isDigit2 = char.IsDigit(c2);
+                if (isDigit1 != isDigit2)
+                    return c1.CompareTo(c2);
+
                 do
                 {
                     tmp1[loc1] = c1;
@@ -33,7 +37,6 @@ public static int Compare(string s1, string s2)
                         break;
                 } while (char.IsDigit(c1) == isDigit1);
 
-                bool isDigit2 = char.IsDigit(c2);
                 do
                 {
                     tmp2[loc2] = c2;
@@ -49,7 +52,7 @@ public static int Compare(string s1, string s2)
                 string sub1 = new string(tmp1, 0, loc1);
                 string sub2 = new string(tmp2, 0, loc2);
                 int result;
-                if (isDigit1 && isDigit2)
+                if (isDigit1)
                     result = loc1 == loc2 ? string.CompareOrdinal(sub1, sub2) : loc1 - loc2;
                 else
                     result = string.CompareOrdinal(sub1, sub2);