Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Common/3.3/ArrayExtensions.cs @ 15612

Last change on this file since 15612 was 15583, checked in by swagner, 7 years ago

#2640: Updated year of copyrights in license headers

File size: 2.5 KB
RevLine 
[10324]1#region License Information
2/* HeuristicLab
[15583]3 * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[10324]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 ArrayExtensions {
28
[10787]29    public static void StableSort<T>(this T[] values, Comparison<T> comparison) {
30      values.StableSort(new StableSortComparer<T>(comparison));
[10324]31    }
32
[10787]33    public static void StableSort<T>(this T[] values, IComparer<T> comparer = null) {
34      var sorted = values.OrderBy(x => x, comparer ?? Comparer<T>.Default).ToArray();
35      Array.ConstrainedCopy(sorted, 0, values, 0, values.Length);
[10324]36    }
37
[10787]38    public static void StableSort<T>(this T[] values, int index, int length, Comparison<T> comparison) {
39      values.StableSort(index, length, new StableSortComparer<T>(comparison));
[10324]40    }
41
[10787]42    public static void StableSort<T>(this T[] values, int index, int length, IComparer<T> comparer = null) {
43      if (index < 0) throw new ArgumentOutOfRangeException("index is less than zero.");
44      if (length < 0) throw new ArgumentOutOfRangeException("length is less than zero.");
45      if (index + length > values.Length) throw new ArgumentException("index and length do not specify a valid range in the array.");
46      var sortedArray = values.Skip(index).Take(length).OrderBy(x => x, comparer ?? Comparer<T>.Default).ToArray();
47      Array.ConstrainedCopy(sortedArray, 0, values, index, length);
[10324]48    }
49
[10787]50    private class StableSortComparer<T> : IComparer<T> {
[10324]51      public StableSortComparer(Comparison<T> comparison) {
52        this.comparison = comparison;
53      }
54      public int Compare(T x, T y) {
55        return comparison(x, y);
56      }
57      private readonly Comparison<T> comparison;
58    }
59  }
60}
Note: See TracBrowser for help on using the repository browser.