1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 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 |
|
---|
24 | namespace HeuristicLab.Encodings.LinearLinkageEncoding {
|
---|
25 | public class ExtractMove : Move {
|
---|
26 | public int PreviousItem { get; private set; }
|
---|
27 | public int NextItem { get; private set; }
|
---|
28 |
|
---|
29 | private bool IsFirst { get { return PreviousItem == Item; } }
|
---|
30 | private bool IsLast { get { return NextItem == Item; } }
|
---|
31 |
|
---|
32 | public ExtractMove(int item, int prev, int next) {
|
---|
33 | Item = item;
|
---|
34 | PreviousItem = prev;
|
---|
35 | NextItem = next;
|
---|
36 | }
|
---|
37 |
|
---|
38 | public override void Apply(LinearLinkage lle) {
|
---|
39 | if ((!IsFirst && lle[PreviousItem] != Item)
|
---|
40 | || lle[Item] != NextItem)
|
---|
41 | throw new ArgumentException("Move conditions have changed!");
|
---|
42 | if (!IsFirst) lle[PreviousItem] = IsLast ? PreviousItem : NextItem;
|
---|
43 | lle[Item] = Item;
|
---|
44 | }
|
---|
45 |
|
---|
46 | public override void Undo(LinearLinkage lle) {
|
---|
47 | if (!IsFirst && lle[PreviousItem] != (IsLast ? PreviousItem : NextItem)
|
---|
48 | || lle[Item] != Item)
|
---|
49 | throw new ArgumentException("Move conditions have changed, cannot undo move.");
|
---|
50 |
|
---|
51 | if (!IsFirst) lle[PreviousItem] = Item;
|
---|
52 | lle[Item] = NextItem;
|
---|
53 | }
|
---|
54 |
|
---|
55 | public override void ApplyToLLEb(int[] lleb) {
|
---|
56 | if (!IsLast) lleb[NextItem] = IsFirst ? NextItem : PreviousItem;
|
---|
57 | lleb[Item] = Item;
|
---|
58 | }
|
---|
59 | }
|
---|
60 | }
|
---|