bin-packing.cpp
Go to the documentation of this file.00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2010 00008 * 00009 * Last modified: 00010 * $Date: 2010-10-06 23:20:35 +0200 (Wed, 06 Oct 2010) $ by $Author: schulte $ 00011 * $Revision: 11468 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 #include <gecode/int/bin-packing.hh> 00039 00040 namespace Gecode { 00041 00042 void 00043 binpacking(Home home, 00044 const IntVarArgs& l, 00045 const IntVarArgs& b, const IntArgs& s, 00046 IntConLevel) { 00047 using namespace Int; 00048 if (l.same(home,b)) 00049 throw ArgumentSame("Int::binpacking"); 00050 if (b.size() != s.size()) 00051 throw ArgumentSizeMismatch("Int::binpacking"); 00052 for (int i=s.size(); i--; ) 00053 Limits::positive(s[i],"Int::binpacking"); 00054 if (home.failed()) return; 00055 00056 ViewArray<OffsetView> lv(home,l.size()); 00057 for (int i=l.size(); i--; ) 00058 lv[i] = OffsetView(l[i],0); 00059 00060 ViewArray<BinPacking::Item> bs(home,b.size()); 00061 for (int i=bs.size(); i--; ) 00062 bs[i] = BinPacking::Item(b[i],s[i]); 00063 00064 Support::quicksort(&bs[0], bs.size()); 00065 00066 GECODE_ES_FAIL(Int::BinPacking::Pack::post(home,lv,bs)); 00067 } 00068 00069 } 00070 00071 // STATISTICS: int-post