source: branches/2520_PersistenceReintegration/HeuristicLab.Common/3.3/ListExtensions.cs @ 16453

Last change on this file since 16453 was 16453, checked in by jkarder, 10 months ago

#2520: updated year of copyrights

File size: 2.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2019 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;
23using System.Collections.Generic;
24using System.Linq;
25
26namespace HeuristicLab.Common {
27  public static class ListExtensions {
28
29    public static void StableSort<T>(this List<T> values, Comparison<T> comparison) {
30      values.StableSort(new StableSortComparer<T>(comparison));
31    }
32
33    public static void StableSort<T>(this List<T> values, IComparer<T> comparer = null) {
34      int i = 0;
35      foreach (var e in values.OrderBy(x => x, comparer ?? Comparer<T>.Default))
36        values[i++] = e;
37    }
38
39    public static void StableSort<T>(this List<T> values, int index, int count, Comparison<T> comparison) {
40      values.StableSort(index, count, new StableSortComparer<T>(comparison));
41    }
42
43    public static void StableSort<T>(this List<T> values, int index, int count, IComparer<T> comparer = null) {
44      if (index < 0) throw new ArgumentOutOfRangeException("index is less than zero.");
45      if (count < 0) throw new ArgumentOutOfRangeException("count is less than zero.");
46      if (index + count > values.Count) throw new ArgumentException("index and count do not specify a valid range in the List<T>.");
47      var orderedList = values.Skip(index).Take(count).OrderBy(x => x, comparer ?? Comparer<T>.Default);
48      int i = index;
49      foreach (var e in orderedList)
50        values[i++] = e;
51    }
52
53    private class StableSortComparer<T> : IComparer<T> {
54      public StableSortComparer(Comparison<T> comparison) {
55        this.comparison = comparison;
56      }
57      public int Compare(T x, T y) {
58        return comparison(x, y);
59      }
60      private readonly Comparison<T> comparison;
61    }
62  }
63}
Note: See TracBrowser for help on using the repository browser.