source: branches/MemPRAlgorithm/HeuristicLab.Encodings.LinearLinkageEncoding/3.3/Moves/ExtractMove.cs @ 14477

Last change on this file since 14477 was 14477, checked in by abeham, 4 years ago

#2701:

  • Added TryGetBy(First|Second) method to BidirectionalDictionary
  • Updated linear linkage encoding
    • Added move generator and moves for shift, merge, split, and extract moves
    • Added unit test (Apply/Undo)
  • Updated MemPR (linear linkage)
    • Added basic tabu walk
  • Fixed bug in MemPR (permutation)
  • Updated Tests project
File size: 2.2 KB
Line 
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
22using System;
23using HeuristicLab.Collections;
24
25namespace HeuristicLab.Encodings.LinearLinkageEncoding {
26  public class ExtractMove : Move {
27    public int PreviousItem { get; private set; }
28    public int NextItem { get; private set; }
29
30    private bool IsFirst { get { return PreviousItem == Item; } }
31    private bool IsLast { get { return NextItem == Item; } }
32
33    public ExtractMove(int item, int prev, int next) {
34      Item = item;
35      PreviousItem = prev;
36      NextItem = next;
37    }
38
39    public override void Apply(LinearLinkage lle) {
40      if ((!IsFirst && lle[PreviousItem] != Item)
41        || lle[Item] != NextItem)
42        throw new ArgumentException("Move conditions have changed!");
43      if (!IsFirst)
44        lle[PreviousItem] = IsLast ? PreviousItem : NextItem;
45      lle[Item] = Item;
46    }
47
48    public override void Undo(LinearLinkage lle) {
49      if (!IsFirst && lle[PreviousItem] != (IsLast ? PreviousItem : NextItem)
50        || lle[Item] != Item)
51        throw new ArgumentException("Move conditions have changed, cannot undo move.");
52
53      if (!IsFirst)
54        lle[PreviousItem] = Item;
55      lle[Item] = NextItem;
56    }
57
58    public override void UpdateLinks(BidirectionalDictionary<int, int> links) {
59      if (!IsFirst) {
60        links.RemoveBySecond(Item);
61        links.SetByFirst(PreviousItem, IsLast ? PreviousItem : NextItem);
62      }
63    }
64  }
65}
Note: See TracBrowser for help on using the repository browser.