source: branches/2817-BinPackingSpeedup/HeuristicLab.Problems.BinPacking.Views/3.3/PackingPlan3DView.cs @ 16140

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2018 Joseph Helm and 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 HeuristicLab.Core.Views;
using HeuristicLab.MainForm;
using HeuristicLab.Problems.BinPacking3D;
using System.Collections.Generic;

namespace HeuristicLab.Problems.BinPacking.Views {
  [View("3-dimensional packing plan View")]
  [Content(typeof(PackingPlan<BinPacking3D.PackingPosition, PackingShape, PackingItem>), true)]
  public partial class PackingPlan3DView : ItemView {

    public PackingPlan3DView() {
      InitializeComponent();
    }

    public new PackingPlan<BinPacking3D.PackingPosition, PackingShape, PackingItem> Content {
      get { return (PackingPlan<BinPacking3D.PackingPosition, PackingShape, PackingItem>)base.Content; }
      set { base.Content = value; }
    }


    protected override void OnContentChanged() {
      base.OnContentChanged();
      binSelection.Items.Clear();
      if (Content == null) {
        packingPlan3D.Packing = null;
      } else {
        int i = 0;
        foreach (var bp in Content.Bins) {
          binSelection.Items.Add(i++ + " (" + Math.Round(bp.PackingDensity * 100, 2) + "%)");
        }


        binSelection.SelectedIndex = 0;
        ShowSelectedPacking();
      }
    }

    private void ShowSelectedPacking() {
      int currentBin = (binSelection != null) ? (int)(binSelection.SelectedIndex) : 0;
      packingPlan3D.Packing = Content.Bins[currentBin];
    }

    private void binSelection_SelectedIndexChanged(object sender, EventArgs e) {
      itemSelection.SelectedIndex = -1;
      itemSelection.Items.Clear();
      extremePointsSelection.Items.Clear();
      packingPlan3D.ResidualSpaces.Clear();
      packingPlan3D.ExtremePoints.Clear();

      // add items of this container
      int currentBin = (binSelection != null) ? (int)(binSelection.SelectedIndex) : 0;
      var packing = Content.Bins[currentBin];
      foreach (var item in packing.Items) {
        itemSelection.Items.Add(item.Key);
      }
      foreach (var extremPoint in ((BinPacking3D.BinPacking3D)packing).ExtremePoints) {
        var ep = extremPoint.Key;
        extremePointsSelection.Items.Add($"({ep.X}, {ep.Y}, {ep.Z})");
        packingPlan3D.ExtremePoints.Add(ep);
        packingPlan3D.ResidualSpaces.Add(ep, extremPoint.Value as IList<ResidualSpace>);
      }

      ShowSelectedPacking();
    }

    private void itemSelection_SelectedIndexChanged(object sender, EventArgs e) {
      int selectedItem = -1;
      if ((itemSelection != null && itemSelection.SelectedItem != null) && Int32.TryParse(itemSelection.SelectedItem.ToString(), out selectedItem)) {
        packingPlan3D.SelectItem(selectedItem);
      } else
        packingPlan3D.ClearSelection();
    }

    private void extremePointsSelection_SelectedIndexChanged(object sender, EventArgs e) {
      if (extremePointsSelection != null && extremePointsSelection.SelectedIndex >= 0) {
        packingPlan3D.SelectExtremePoint(extremePointsSelection.SelectedIndex);
      } else {
        packingPlan3D.ClearSelection();
      }
    }
  }
}