source: branches/HeuristicLab.Analysis.AlgorithmBehavior/HeuristicLab.Analysis.AlgorithmBehavior.Analyzers/3.3/SolutionsCaching/PermutationWrapper.cs @ 9711

Last change on this file since 9711 was 9711, checked in by ascheibe, 6 years ago

#1886 started working on a solution cache

File size: 2.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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.Collections.Generic;
23using HeuristicLab.Common;
24using HeuristicLab.Encodings.PermutationEncoding;
25
26namespace HeuristicLab.Analysis.AlgorithmBehavior.Analyzers {
27  public enum ElementType { Complete, Diff };
28
29  public class PermutationWrapper {
30    public ElementType ElementType { get; set; }
31    public Permutation Permutation { get; set; }
32    public List<int> Diffs { get; set; }
33
34    public PermutationWrapper(Permutation p) {
35      ElementType = ElementType.Complete;
36      Diffs = new List<int>();
37      Permutation = p;
38    }
39
40    public Permutation GetPermutation() {
41      if (ElementType == ElementType.Complete) {
42        return Permutation;
43      } else {
44        Permutation result = (Permutation)Permutation.Clone(new Cloner());
45        for (int i = 0; i < Diffs.Count; i++) {
46          int index = Diffs[i] >> 16;
47          int value = Diffs[i] & 0x0000FFFF;
48          result[index] = value;
49        }
50        return result;
51      }
52    }
53
54    public void StorePartialPermutation(Permutation original, Permutation newPermutation) {
55      ElementType = ElementType.Diff;
56      Diffs = new List<int>();
57      Permutation = original;
58
59      for (int i = 0; i < original.Length; i++) {
60        if (original[i] != newPermutation[i]) {
61          int diff = (i << 16) | newPermutation[i];
62          Diffs.Add(diff);
63        }
64      }
65    }
66
67    public void StoreCompletePermutation(Permutation original) {
68      ElementType = ElementType.Complete;
69      Diffs = new List<int>();
70      Permutation = original;
71    }
72  }
73}
Note: See TracBrowser for help on using the repository browser.