1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2019 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 HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HEAL.Attic;
|
---|
26 |
|
---|
27 | namespace HeuristicLab.Encodings.LinearLinkageEncoding {
|
---|
28 | [Item("Extract Move", "Extracts an item into a group of its own.")]
|
---|
29 | [StorableType("D42CB819-F307-4081-9227-7F6786E6853B")]
|
---|
30 | public sealed class ExtractMove : EMSSMove {
|
---|
31 | [Storable]
|
---|
32 | private int previousItem;
|
---|
33 | public int PreviousItem { get { return previousItem; } }
|
---|
34 | [Storable]
|
---|
35 | private int nextItem;
|
---|
36 | public int NextItem { get { return nextItem; } }
|
---|
37 |
|
---|
38 | private bool IsFirst { get { return PreviousItem == Item; } }
|
---|
39 | private bool IsLast { get { return NextItem == Item; } }
|
---|
40 |
|
---|
41 |
|
---|
42 | [StorableConstructor]
|
---|
43 | private ExtractMove(StorableConstructorFlag _) : base(_) { }
|
---|
44 | private ExtractMove(ExtractMove original, Cloner cloner)
|
---|
45 | : base(original, cloner) {
|
---|
46 | previousItem = original.previousItem;
|
---|
47 | nextItem = original.nextItem;
|
---|
48 | }
|
---|
49 | public ExtractMove(int item, int prev, int next)
|
---|
50 | : base(item) {
|
---|
51 | previousItem = prev;
|
---|
52 | nextItem = next;
|
---|
53 | }
|
---|
54 |
|
---|
55 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
56 | return new ExtractMove(this, cloner);
|
---|
57 | }
|
---|
58 |
|
---|
59 | public override void Apply(LinearLinkage lle) {
|
---|
60 | if ((!IsFirst && lle[PreviousItem] != Item)
|
---|
61 | || lle[Item] != NextItem)
|
---|
62 | throw new ArgumentException("Move conditions have changed!");
|
---|
63 | if (!IsFirst) lle[PreviousItem] = IsLast ? PreviousItem : NextItem;
|
---|
64 | lle[Item] = Item;
|
---|
65 | }
|
---|
66 |
|
---|
67 | public override void Undo(LinearLinkage lle) {
|
---|
68 | if (!IsFirst && lle[PreviousItem] != (IsLast ? PreviousItem : NextItem)
|
---|
69 | || lle[Item] != Item)
|
---|
70 | throw new ArgumentException("Move conditions have changed, cannot undo move.");
|
---|
71 |
|
---|
72 | if (!IsFirst) lle[PreviousItem] = Item;
|
---|
73 | lle[Item] = NextItem;
|
---|
74 | }
|
---|
75 |
|
---|
76 | public override void ApplyToLLEb(int[] lleb) {
|
---|
77 | if (!IsLast) lleb[NextItem] = IsFirst ? NextItem : PreviousItem;
|
---|
78 | lleb[Item] = Item;
|
---|
79 | }
|
---|
80 | }
|
---|
81 | }
|
---|