Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Dimensions/OccupiedPoints.cs @ 9596

Last change on this file since 9596 was 9596, checked in by jhelm, 11 years ago

#1966: More refactoring; Added more sophisticated structures for packing-plan and bin-packing representation; Transferred parts of the decoding-algorithms to these structures; Did some more refactoring and cleanup;

File size: 2.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
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
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using System.Text;
26using HeuristicLab.Problems.BinPacking.Interfaces;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28using HeuristicLab.Core;
29using HeuristicLab.Common;
30using HeuristicLab.Problems.BinPacking.Shapes;
31
32namespace HeuristicLab.Problems.BinPacking.Dimensions {
33  [Item("Occupated Points", "A datastructure holding all currently occupied points of a packing-bin.")]
34  [StorableClass]
35  public abstract class OccupiedPoints<D, B, I> : Item
36    where D : class, IPackingDimensions
37    where B : PackingShape<D>, IPackingBin
38    where I : PackingShape<D>, IPackingItem {
39
40    public OccupiedPoints(B binMeasures) : base() { }
41    [StorableConstructor]
42    protected OccupiedPoints(bool deserializing) : base(deserializing) { }
43    protected OccupiedPoints(OccupiedPoints<D,B,I> original, Cloner cloner)
44      : base(original, cloner) {
45    }
46
47
48    public abstract bool IsPositionFeasible(I measures, D position);
49    public abstract void OccupyPoints(I measures, D position, int itemID);
50    public abstract bool IsPointOccupied(D point);
51    public abstract int ShortestPossibleSideFromEP(D ep);
52    public abstract bool IsStaticStable(I item, D ep);
53    public abstract bool WeightIsSupported(I item, D ep, ItemList<I> items);
54    public abstract void ChangeBinMeasures(B binMeasures);
55  }
56}
Note: See TracBrowser for help on using the repository browser.