source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Dimensions/TwoDimensionalPacking.cs @ 11291

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2012 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 System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using HeuristicLab.Problems.BinPacking.Interfaces;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
using HeuristicLab.Core;
using HeuristicLab.Common;

namespace HeuristicLab.Problems.BinPacking.Dimensions {
  [Item("Two Dimensional Packing", "Represents a packing-position associated with a two dimensional packing-problem.")]
  [StorableClass]
  public class TwoDimensionalPacking : PackingDimensions {
    public int X { get; set; }
    public int Y { get; set; }

    [StorableConstructor]
    protected TwoDimensionalPacking(bool deserializing) : base(deserializing) { }
    protected TwoDimensionalPacking(TwoDimensionalPacking original, Cloner cloner)
      : base(original, cloner) {
        X = original.X;
        Y = original.Y;
    }
    public override IDeepCloneable Clone(Cloner cloner) {
      return new TwoDimensionalPacking(this, cloner);
    }

    public TwoDimensionalPacking(int assignedBin, int x, int y) : this(assignedBin, x, y, false) { }
    public TwoDimensionalPacking(int assignedBin, int x, int y, bool rotated)
      : base(assignedBin, rotated) {
      this.X = x;
      this.Y = y;
    }
    public override string ToString() {
      StringBuilder sb = new StringBuilder();
      sb.Append("[");
      sb.Append("AssignedBin: ");
      sb.Append(AssignedBin);
      sb.Append("; (");
      sb.Append(X + ",");
      sb.Append(Y);
      sb.Append(")");
      sb.Append("]");
      return sb.ToString();
    }


    public override bool Equals(object obj) {
      var tdp = obj as TwoDimensionalPacking;
      if (tdp != null)
        return (tdp.X == this.X && tdp.Y == this.Y);
      else return false;
    }

    public override int GetHashCode() {
      return base.GetHashCode() + 13 * X + 17 * Y;
    }

    public static TwoDimensionalPacking MoveLeft(TwoDimensionalPacking original) {
      return new TwoDimensionalPacking(original.AssignedBin, original.X - 1, original.Y, original.Rotated);
    }
    public static TwoDimensionalPacking MoveDown(TwoDimensionalPacking original) {
      return new TwoDimensionalPacking(original.AssignedBin, original.X, original.Y - 1, original.Rotated);
    }

    public static TwoDimensionalPacking MoveRight(TwoDimensionalPacking original) {
      return new TwoDimensionalPacking(original.AssignedBin, original.X + 1, original.Y, original.Rotated);
    }
    public static TwoDimensionalPacking MoveUp(TwoDimensionalPacking original) {
      return new TwoDimensionalPacking(original.AssignedBin, original.X, original.Y + 1, original.Rotated);
    }

  }
}