[2997] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12009] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[2997] | 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 |
|
---|
[3376] | 22 | using HeuristicLab.Common;
|
---|
[2997] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 25 |
|
---|
[3053] | 26 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
[5933] | 27 | [Item("TwoIndexMove", "A move on a permutation that is specified by 2 indices.")]
|
---|
[3017] | 28 | [StorableClass]
|
---|
[2997] | 29 | public class TwoIndexMove : Item {
|
---|
| 30 | [Storable]
|
---|
| 31 | public int Index1 { get; protected set; }
|
---|
| 32 | [Storable]
|
---|
| 33 | public int Index2 { get; protected set; }
|
---|
| 34 | [Storable]
|
---|
| 35 | public Permutation Permutation { get; protected set; }
|
---|
| 36 |
|
---|
[4722] | 37 | [StorableConstructor]
|
---|
| 38 | protected TwoIndexMove(bool deserializing) : base(deserializing) { }
|
---|
| 39 | protected TwoIndexMove(TwoIndexMove original, Cloner cloner)
|
---|
| 40 | : base(original, cloner) {
|
---|
| 41 | this.Index1 = original.Index1;
|
---|
| 42 | this.Index2 = original.Index2;
|
---|
| 43 | if (original.Permutation != null)
|
---|
| 44 | this.Permutation = cloner.Clone(original.Permutation);
|
---|
[2997] | 45 | }
|
---|
[4722] | 46 | public TwoIndexMove() : this(-1, -1, null) { }
|
---|
[2997] | 47 | public TwoIndexMove(int index1, int index2, Permutation permutation)
|
---|
| 48 | : base() {
|
---|
| 49 | Index1 = index1;
|
---|
| 50 | Index2 = index2;
|
---|
| 51 | Permutation = permutation;
|
---|
| 52 | }
|
---|
| 53 |
|
---|
| 54 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[4722] | 55 | return new TwoIndexMove(this, cloner);
|
---|
[2997] | 56 | }
|
---|
| 57 | }
|
---|
| 58 | } |
---|