[10324] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2013 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Linq;
|
---|
| 25 |
|
---|
| 26 | namespace HeuristicLab.Common {
|
---|
| 27 | public static class ListExtensions {
|
---|
| 28 | public static void StableSort<T>(this List<T> values) {
|
---|
| 29 | values.StableSort(0, values.Count);
|
---|
| 30 | }
|
---|
| 31 |
|
---|
| 32 | public static void StableSort<T>(this List<T> values, int index, int count) {
|
---|
[10477] | 33 | var orderedList = values.Skip(index).Take(count).OrderBy(x => x);
|
---|
| 34 | int i = index;
|
---|
| 35 | foreach (var e in orderedList)
|
---|
| 36 | values[i++] = e;
|
---|
[10324] | 37 | }
|
---|
| 38 |
|
---|
| 39 | public static void StableSort<T>(this List<T> values, IComparer<T> comparer) {
|
---|
| 40 | values.StableSort(0, values.Count, comparer);
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | public static void StableSort<T>(this List<T> values, int index, int count, IComparer<T> comparer) {
|
---|
[10477] | 44 | var orderedList = values.OrderBy(x => x, comparer);
|
---|
| 45 | int i = 0;
|
---|
| 46 | foreach (var e in orderedList)
|
---|
| 47 | values[i++] = e;
|
---|
[10324] | 48 | }
|
---|
| 49 |
|
---|
| 50 | public static void StableSort<T>(this List<T> values, Comparison<T> comparison) {
|
---|
| 51 | values.StableSort(0, values.Count, comparison);
|
---|
| 52 | }
|
---|
| 53 |
|
---|
| 54 | public static void StableSort<T>(this List<T> values, int index, int count, Comparison<T> comparison) {
|
---|
[10477] | 55 | var orderedList = values.OrderBy(x => x, new StableSortComparer<T>(comparison));
|
---|
| 56 | int i = 0;
|
---|
| 57 | foreach (var e in orderedList)
|
---|
| 58 | values[i++] = e;
|
---|
[10324] | 59 | }
|
---|
| 60 |
|
---|
| 61 | public class StableSortComparer<T> : IComparer<T> {
|
---|
| 62 | public StableSortComparer(Comparison<T> comparison) {
|
---|
| 63 | this.comparison = comparison;
|
---|
| 64 | }
|
---|
| 65 | public int Compare(T x, T y) {
|
---|
| 66 | return comparison(x, y);
|
---|
| 67 | }
|
---|
| 68 | private readonly Comparison<T> comparison;
|
---|
| 69 | }
|
---|
| 70 | }
|
---|
| 71 | }
|
---|