[3117] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16565] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3117] | 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;
|
---|
[3117] | 23 | using HeuristicLab.Core;
|
---|
[16565] | 24 | using HEAL.Attic;
|
---|
[3117] | 25 |
|
---|
| 26 | namespace HeuristicLab.Encodings.BinaryVectorEncoding {
|
---|
| 27 | [Item("OneIndexMove", "A move on a binary vector that is specified by 1 index")]
|
---|
[16565] | 28 | [StorableType("C7948F7F-EC47-4752-9E18-9299123189D1")]
|
---|
[3117] | 29 | public class OneIndexMove : Item {
|
---|
| 30 | [Storable]
|
---|
| 31 | public int Index { get; protected set; }
|
---|
| 32 | [Storable]
|
---|
| 33 | public BinaryVector BinaryVector { get; protected set; }
|
---|
| 34 |
|
---|
[4722] | 35 | [StorableConstructor]
|
---|
[16565] | 36 | protected OneIndexMove(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 37 | protected OneIndexMove(OneIndexMove original, Cloner cloner)
|
---|
| 38 | : base(original, cloner) {
|
---|
| 39 | this.Index = original.Index;
|
---|
| 40 | if (original.BinaryVector != null)
|
---|
| 41 | this.BinaryVector = cloner.Clone(original.BinaryVector);
|
---|
[3117] | 42 | }
|
---|
[4722] | 43 | public OneIndexMove() : this(-1, null) { }
|
---|
[3117] | 44 | public OneIndexMove(int index, BinaryVector binaryVector)
|
---|
| 45 | : base() {
|
---|
| 46 | Index = index;
|
---|
| 47 | BinaryVector = binaryVector;
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[4722] | 51 | return new OneIndexMove(this, cloner);
|
---|
[3117] | 52 | }
|
---|
| 53 | }
|
---|
| 54 | } |
---|