Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
3.6 kB · 100 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2002 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
#include <gecode/int.hh>
namespace Gecode {
IntVarArray::IntVarArray(Space& home, int n, int min, int max) : VarArray<IntVar>(home,n) { Int::Limits::check(min,"IntVarArray::IntVarArray"); Int::Limits::check(max,"IntVarArray::IntVarArray"); if (min > max) throw Int::VariableEmptyDomain("IntVarArray::IntVarArray"); for (int i=0; i<size(); i++) x[i]._init(home,min,max); }
IntVarArray::IntVarArray(Space& home, int n, const IntSet& s) : VarArray<IntVar>(home,n) { Int::Limits::check(s.min(),"IntVarArray::IntVarArray"); Int::Limits::check(s.max(),"IntVarArray::IntVarArray"); if (s.size() == 0) throw Int::VariableEmptyDomain("IntVarArray::IntVarArray"); for (int i=0; i<size(); i++) x[i]._init(home,s); }
BoolVarArray::BoolVarArray(Space& home, int n, int min, int max) : VarArray<BoolVar>(home, n) { if ((min < 0) || (max > 1)) throw Int::NotZeroOne("BoolVarArray::BoolVarArray"); if (min > max) throw Int::VariableEmptyDomain("BoolVarArray::BoolVarArray"); for (int i=0; i<size(); i++) x[i]._init(home,min,max); }
IntVarArgs::IntVarArgs(Space& home, int n, int min, int max) : VarArgArray<IntVar>(n) { Int::Limits::check(min,"IntVarArgs::IntVarArgs"); Int::Limits::check(max,"IntVarArgs::IntVarArgs"); if (min > max) throw Int::VariableEmptyDomain("IntVarArgs::IntVarArgs"); for (int i=0; i<size(); i++) a[i]._init(home,min,max); }
IntVarArgs::IntVarArgs(Space& home, int n, const IntSet& s) : VarArgArray<IntVar>(n) { Int::Limits::check(s.min(),"IntVarArgs::IntVarArgs"); Int::Limits::check(s.max(),"IntVarArgs::IntVarArgs"); if (s.size() == 0) throw Int::VariableEmptyDomain("IntVarArgs::IntVarArgs"); for (int i=0; i<size(); i++) a[i]._init(home,s); }
BoolVarArgs::BoolVarArgs(Space& home, int n, int min, int max) : VarArgArray<BoolVar>(n) { if ((min < 0) || (max > 1)) throw Int::NotZeroOne("BoolVarArgs::BoolVarArgs"); if (min > max) throw Int::VariableEmptyDomain("BoolVarArgs::BoolVarArgs"); for (int i=0; i<size(); i++) a[i]._init(home,min,max); }
}
// STATISTICS: int-post