source: branches/MemPRAlgorithm/HeuristicLab.Encodings.BinaryVectorEncoding/3.3/Moves/OneIndexMove.cs @ 14429

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion

using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;

namespace HeuristicLab.Encodings.BinaryVectorEncoding {
  [Item("OneIndexMove", "A move on a binary vector that is specified by 1 index")]
  [StorableClass]
  public class OneIndexMove : Item {
    [Storable]
    public int Index { get; protected set; }
    [Storable]
    public BinaryVector BinaryVector { get; protected set; }

    [StorableConstructor]
    protected OneIndexMove(bool deserializing) : base(deserializing) { }
    protected OneIndexMove(OneIndexMove original, Cloner cloner)
      : base(original, cloner) {
      this.Index = original.Index;
      if (original.BinaryVector != null)
        this.BinaryVector = cloner.Clone(original.BinaryVector);
    }
    public OneIndexMove() : this(-1, null) { }
    public OneIndexMove(int index, BinaryVector binaryVector)
      : base() {
      Index = index;
      BinaryVector = binaryVector;
    }

    public override IDeepCloneable Clone(Cloner cloner) {
      return new OneIndexMove(this, cloner);
    }
  }
}