array.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, 2002 00008 * 00009 * Last modified: 00010 * $Date: 2010-10-04 10:01:21 +0200 (Mon, 04 Oct 2010) $ by $Author: schulte $ 00011 * $Revision: 11440 $ 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.hh> 00039 00040 namespace Gecode { 00041 00042 IntArgs::IntArgs(int n, int e0, ...) : PrimArgArray<int>(n) { 00043 va_list args; 00044 va_start(args, e0); 00045 a[0] = e0; 00046 for (int i = 1; i < n; i++) 00047 a[i] = va_arg(args,int); 00048 va_end(args); 00049 } 00050 00051 IntVarArray::IntVarArray(Space& home, int n, int min, int max) 00052 : VarArray<IntVar>(home,n) { 00053 Int::Limits::check(min,"IntVarArray::IntVarArray"); 00054 Int::Limits::check(max,"IntVarArray::IntVarArray"); 00055 if (min > max) 00056 throw Int::VariableEmptyDomain("IntVarArray::IntVarArray"); 00057 for (int i = size(); i--; ) 00058 x[i]._init(home,min,max); 00059 } 00060 00061 IntVarArray::IntVarArray(Space& home, int n, const IntSet& s) 00062 : VarArray<IntVar>(home,n) { 00063 Int::Limits::check(s.min(),"IntVarArray::IntVarArray"); 00064 Int::Limits::check(s.max(),"IntVarArray::IntVarArray"); 00065 if (s.size() == 0) 00066 throw Int::VariableEmptyDomain("IntVarArray::IntVarArray"); 00067 for (int i = size(); i--; ) 00068 x[i]._init(home,s); 00069 } 00070 00071 BoolVarArray::BoolVarArray(Space& home, int n, int min, int max) 00072 : VarArray<BoolVar>(home, n) { 00073 if ((min < 0) || (max > 1)) 00074 throw Int::NotZeroOne("BoolVarArray::BoolVarArray"); 00075 if (min > max) 00076 throw Int::VariableEmptyDomain("BoolVarArray::BoolVarArray"); 00077 for (int i = size(); i--; ) 00078 x[i]._init(home,min,max); 00079 } 00080 00081 IntVarArgs::IntVarArgs(Space& home, int n, int min, int max) 00082 : VarArgArray<IntVar>(n) { 00083 Int::Limits::check(min,"IntVarArgs::IntVarArgs"); 00084 Int::Limits::check(max,"IntVarArgs::IntVarArgs"); 00085 if (min > max) 00086 throw Int::VariableEmptyDomain("IntVarArgs::IntVarArgs"); 00087 for (int i = size(); i--; ) 00088 a[i]._init(home,min,max); 00089 } 00090 00091 IntVarArgs::IntVarArgs(Space& home, int n, const IntSet& s) 00092 : VarArgArray<IntVar>(n) { 00093 Int::Limits::check(s.min(),"IntVarArgs::IntVarArgs"); 00094 Int::Limits::check(s.max(),"IntVarArgs::IntVarArgs"); 00095 if (s.size() == 0) 00096 throw Int::VariableEmptyDomain("IntVarArgs::IntVarArgs"); 00097 for (int i = size(); i--; ) 00098 a[i]._init(home,s); 00099 } 00100 00101 BoolVarArgs::BoolVarArgs(Space& home, int n, int min, int max) 00102 : VarArgArray<BoolVar>(n) { 00103 if ((min < 0) || (max > 1)) 00104 throw Int::NotZeroOne("BoolVarArgs::BoolVarArgs"); 00105 if (min > max) 00106 throw Int::VariableEmptyDomain("BoolVarArgs::BoolVarArgs"); 00107 for (int i = size(); i--; ) 00108 a[i]._init(home,min,max); 00109 } 00110 00111 } 00112 00113 // STATISTICS: int-post