Free cookie consent management tool by TermsFeed Policy Generator

source: branches/3.0/sources/HeuristicLab.Permutation/InsertionManipulator.cs @ 12214

Last change on this file since 12214 was 2, checked in by swagner, 17 years ago

Added HeuristicLab 3.0 sources from former SVN repository at revision 52

File size: 2.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2008 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.Text;
25using HeuristicLab.Core;
26
27namespace HeuristicLab.Permutation {
28  public class InsertionManipulator : PermutationManipulatorBase {
29    public override string Description {
30      get { return @"TODO\r\nOperator description still missing ..."; }
31    }
32
33    public static int[] Apply(IRandom random, int[] permutation) {
34      int[] result = (int[])permutation.Clone();
35      int cutIndex, insertIndex, number;
36
37      cutIndex = random.Next(permutation.Length);
38      insertIndex = random.Next(permutation.Length);
39      number = permutation[cutIndex];
40
41      int i = 0;  // index in new permutation
42      int j = 0;  // index in old permutation
43      while (i < permutation.Length) {
44        if (j == cutIndex) {
45          j++;
46        }
47        if (i == insertIndex) {
48          result[i] = number;
49          i++;
50        }
51        if ((i < permutation.Length) && (j < permutation.Length)) {
52          result[i] = permutation[j];
53          i++;
54          j++;
55        }
56      }
57      return result;
58    }
59
60    protected override int[] Manipulate(IScope scope, IRandom random, int[] permutation) {
61      return Apply(random, permutation);
62    }
63  }
64}
Note: See TracBrowser for help on using the repository browser.