1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2018 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 HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
26 |
|
---|
27 | namespace HeuristicLab.Encodings.LinearLinkageEncoding {
|
---|
28 | [Item("Merge Move", "Merges two groups together.")]
|
---|
29 | [StorableClass]
|
---|
30 | public sealed class MergeMove : EMSSMove {
|
---|
31 | [Storable]
|
---|
32 | private int lastItemOfOtherGroup;
|
---|
33 | public int LastItemOfOtherGroup { get { return lastItemOfOtherGroup; } }
|
---|
34 |
|
---|
35 | [StorableConstructor]
|
---|
36 | private MergeMove(bool deserializing) : base(deserializing) { }
|
---|
37 | private MergeMove(MergeMove original, Cloner cloner)
|
---|
38 | : base(original, cloner) {
|
---|
39 | lastItemOfOtherGroup = original.lastItemOfOtherGroup;
|
---|
40 | }
|
---|
41 | public MergeMove(int item, int lastOfOther)
|
---|
42 | : base(item) {
|
---|
43 | lastItemOfOtherGroup = lastOfOther;
|
---|
44 | }
|
---|
45 |
|
---|
46 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
47 | return new MergeMove(this, cloner);
|
---|
48 | }
|
---|
49 |
|
---|
50 | public override void Apply(LinearLinkage lle) {
|
---|
51 | if (lle[LastItemOfOtherGroup] != LastItemOfOtherGroup) throw new ArgumentException("Move conditions have changed, group does not terminate at " + LastItemOfOtherGroup);
|
---|
52 | lle[LastItemOfOtherGroup] = Item;
|
---|
53 | }
|
---|
54 |
|
---|
55 | public override void Undo(LinearLinkage lle) {
|
---|
56 | if (lle[LastItemOfOtherGroup] != Item) throw new ArgumentException("Move conditions have changed, groups are no longer linked between " + LastItemOfOtherGroup + " and " + Item);
|
---|
57 | lle[LastItemOfOtherGroup] = LastItemOfOtherGroup;
|
---|
58 | }
|
---|
59 |
|
---|
60 | public override void ApplyToLLEb(int[] lleb) {
|
---|
61 | lleb[Item] = LastItemOfOtherGroup;
|
---|
62 | }
|
---|
63 | }
|
---|
64 | }
|
---|