Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/HeuristicLab.Common/3.3/NaturalStringComparer.cs @ 17764

Last change on this file since 17764 was 17180, checked in by swagner, 5 years ago

#2875: Removed years in copyrights

File size: 1.9 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using System.Collections.Generic;
23using System.Text.RegularExpressions;
24using HEAL.Attic;
25
26namespace HeuristicLab.Common {
27  [StorableType("fa583e6f-b8cf-4046-b144-4c1938caa418")]
28  public class NaturalStringComparer : IComparer<string> {
29
30    [StorableConstructor]
31    protected NaturalStringComparer(StorableConstructorFlag _) { }
32    public NaturalStringComparer() { }
33
34    public int Compare(string x, string y) {
35      if (x == y) return 0;
36
37      string[] first = Regex.Split(x, "([0-9]+)");
38      string[] second = Regex.Split(y, "([0-9]+)");
39
40      for (int i = 0; i < first.Length && i < second.Length; i++) {
41        if (first[i] != second[i]) return CompareWithParsing(first[i], second[i]);
42      }
43
44      if (first.Length < second.Length) return -1;
45      if (second.Length < first.Length) return 1;
46      return 0;
47    }
48
49    private int CompareWithParsing(string x, string y) {
50      int first, second;
51      if (int.TryParse(x, out first) && int.TryParse(y, out second))
52        return first.CompareTo(second);
53      return x.CompareTo(y);
54    }
55  }
56}
Note: See TracBrowser for help on using the repository browser.