Free cookie consent management tool by TermsFeed Policy Generator

source: branches/3.0/sources/HeuristicLab.Permutation/InversionManipulator.cs @ 15668

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

Added HeuristicLab 3.0 sources from former SVN repository at revision 52

File size: 1.9 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 InversionManipulator : 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 breakPoint1, breakPoint2;
36
37      breakPoint1 = random.Next(result.Length - 1);
38      do {
39        breakPoint2 = random.Next(result.Length - 1);
40      } while (breakPoint2 == breakPoint1);
41      if (breakPoint2 < breakPoint1) { int h = breakPoint1; breakPoint1 = breakPoint2; breakPoint2 = h; }
42
43      for (int i = 0; i <= (breakPoint2 - breakPoint1); i++) {  // reverse permutation between breakpoints
44        result[breakPoint1 + i] = permutation[breakPoint2 - i];
45      }
46      return result;
47    }
48
49    protected override int[] Manipulate(IScope scope, IRandom random, int[] permutation) {
50      return Apply(random, permutation);
51    }
52  }
53}
Note: See TracBrowser for help on using the repository browser.