[15079] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16956] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[15079] | 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;
|
---|
[16956] | 25 | using HEAL.Attic;
|
---|
[15079] | 26 |
|
---|
| 27 | namespace HeuristicLab.Encodings.LinearLinkageEncoding {
|
---|
| 28 | [Item("Split Move", "Splits a group into two groups.")]
|
---|
[16956] | 29 | [StorableType("98EB5FF6-A384-482B-B700-7EB012639E64")]
|
---|
[15079] | 30 | public sealed class SplitMove : EMSSMove {
|
---|
| 31 | [Storable]
|
---|
| 32 | private int nextItem; // is only used for undo -> no public property
|
---|
| 33 |
|
---|
| 34 | [StorableConstructor]
|
---|
[16956] | 35 | private SplitMove(StorableConstructorFlag _) : base(_) { }
|
---|
[15079] | 36 | private SplitMove(SplitMove original, Cloner cloner)
|
---|
| 37 | : base(original, cloner) {
|
---|
| 38 | nextItem = original.nextItem;
|
---|
| 39 | }
|
---|
| 40 | public SplitMove(int item)
|
---|
| 41 | : base(item) {
|
---|
| 42 | nextItem = -1;
|
---|
| 43 | }
|
---|
| 44 |
|
---|
| 45 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 46 | return new SplitMove(this, cloner);
|
---|
| 47 | }
|
---|
| 48 |
|
---|
| 49 | public override void Apply(LinearLinkage lle) {
|
---|
| 50 | if (lle[Item] == Item) throw new ArgumentException("Move conditions have changed, group is already split at " + Item);
|
---|
| 51 | nextItem = lle[Item];
|
---|
| 52 | lle[Item] = Item;
|
---|
| 53 | }
|
---|
| 54 |
|
---|
| 55 | public override void Undo(LinearLinkage lle) {
|
---|
| 56 | if (lle[Item] != Item) throw new ArgumentException("Move conditions have changed, group no longer terminates at " + Item);
|
---|
| 57 | if (nextItem < 0) throw new InvalidOperationException("Cannot undo move that has not been applied first.");
|
---|
| 58 | lle[Item] = nextItem;
|
---|
| 59 | }
|
---|
| 60 |
|
---|
| 61 | public override void ApplyToLLEb(int[] lleb) {
|
---|
| 62 | if (nextItem < 0) throw new InvalidOperationException("Cannot undo move that has not been applied first to LLE.");
|
---|
| 63 | lleb[nextItem] = nextItem;
|
---|
| 64 | }
|
---|
| 65 | }
|
---|
| 66 | }
|
---|