array.cpp
Go to the documentation of this file.
/* -*- 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
Gecode::ArgArrayBase< IntVar >::a
IntVar * a
Definition array.hpp:544
Gecode::ArgArrayBase< IntVar >::n
int n
Definition array.hpp:540
Gecode::ArgArrayBase< IntVar >::size
int size(void) const
Definition array.hpp:1607
Gecode::BoolVarArgs::BoolVarArgs
BoolVarArgs(void)
Allocate empty array.
Definition array.hpp:114
Gecode::BoolVarArray::BoolVarArray
BoolVarArray(void)
Default constructor (array of size 0).
Definition array.hpp:159
Gecode::BoolVar
Boolean integer variables.
Definition int.hh:512
Gecode::IntSet
Integer sets.
Definition int.hh:174
Gecode::IntSet::min
int min(int i) const
Return minimum of range at position i.
Definition int-set-1.hpp:152
Gecode::IntSet::max
int max(int i) const
Return maximum of range at position i.
Definition int-set-1.hpp:158
Gecode::IntSet::size
unsigned int size(void) const
Return size (cardinality) of set.
Definition int-set-1.hpp:198
Gecode::IntVarArgs::IntVarArgs
IntVarArgs(void)
Allocate empty array.
Definition array.hpp:85
Gecode::IntVarArray::IntVarArray
IntVarArray(void)
Default constructor (array of size 0).
Definition array.hpp:143
Gecode::IntVar
Integer variables.
Definition int.hh:371
Gecode::Int::NotZeroOne
Exception: Not 0/1 integer
Definition exception.hpp:51
Gecode::Int::VariableEmptyDomain
Exception: Variable created with empty domain
Definition exception.hpp:59
Gecode::Space
Computation spaces.
Definition core.hpp:1742
Gecode::VarArgArray< IntVar >::VarArgArray
VarArgArray(void)
Definition array.hpp:1839
Gecode::VarArray< IntVar >::n
int n
Definition array.hpp:115
Gecode::VarArray< IntVar >::VarArray
VarArray(void)
Definition array.hpp:901
Gecode::VarArray< IntVar >::size
int size(void) const
Definition array.hpp:926
Gecode::VarArray< IntVar >::x
IntVar * x
Definition array.hpp:117
int.hh
Gecode::Int::Limits::check
void check(int n, const char *l)
Check whether n is in range, otherwise throw out of limits with information l.
Definition limits.hpp:46
Gecode
Gecode toplevel namespace
Gecode::min
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:67
Gecode::max
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:49