array.hpp
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, 2009
*
* 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.
*
*/
namespace Gecode { namespace Int {
/*
* Task array
*/
template<class Task>
forceinline
TaskArray<Task>::TaskArray(void)
: n(0), t(NULL) {}
template<class Task>
forceinline
TaskArray<Task>::TaskArray(Space& home, int n0)
: n(n0), t(home.alloc<Task>(n)) {
assert(n > 0);
}
template<class Task>
forceinline
TaskArray<Task>::TaskArray(const TaskArray<Task>& a)
: n(a.n), t(a.t) {}
template<class Task>
forceinline const TaskArray<Task>&
TaskArray<Task>::operator =(const TaskArray<Task>& a) {
n=a.n; t=a.t;
return *this;
}
template<class Task>
forceinline int
TaskArray<Task>::size(void) const {
return n;
}
template<class Task>
forceinline void
TaskArray<Task>::size(int n0) {
n = n0;
}
template<class Task>
forceinline Task&
TaskArray<Task>::operator [](int i) {
assert((i >= 0) && (i < n));
return t[i];
}
template<class Task>
forceinline const Task&
TaskArray<Task>::operator [](int i) const {
assert((i >= 0) && (i < n));
return t[i];
}
template<class Task>
forceinline void
TaskArray<Task>::subscribe(Space& home, Propagator& p, PropCond pc) {
for (int i=0; i<n; i++)
t[i].subscribe(home,p,pc);
}
template<class Task>
forceinline void
TaskArray<Task>::cancel(Space& home, Propagator& p, PropCond pc) {
for (int i=0; i<n; i++)
t[i].cancel(home,p,pc);
}
template<class Task>
forceinline void
TaskArray<Task>::reschedule(Space& home, Propagator& p, PropCond pc) {
for (int i=0; i<n; i++)
t[i].reschedule(home,p,pc);
}
template<class Task>
forceinline void
TaskArray<Task>::update(Space& home, TaskArray& a) {
n=a.n; t=home.alloc<Task>(n);
for (int i=0; i<n; i++)
t[i].update(home,a.t[i]);
}
template<class Char, class Traits, class Task>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os,
const TaskArray<Task>& t) {
std::basic_ostringstream<Char,Traits> s;
s.copyfmt(os); s.width(0);
s << '{';
if (t.size() > 0) {
s << t[0];
for (int i=1; i<t.size(); i++)
s << ", " << t[i];
}
s << '}';
return os << s.str();
}
/*
* Task view array
*/
template<class TaskView>
forceinline
TaskViewArray<TaskView>::TaskViewArray(TaskArray<Task>& t0)
: t(t0) {}
template<class TaskView>
forceinline int
TaskViewArray<TaskView>::size(void) const {
return t.size();
}
template<class TaskView>
forceinline void
TaskViewArray<TaskView>::size(int n) {
t.size(n);
}
template<class TaskView>
forceinline TaskView&
TaskViewArray<TaskView>::operator [](int i) {
return static_cast<TaskView&>(t[i]);
}
template<class TaskView>
forceinline const TaskView&
TaskViewArray<TaskView>::operator [](int i) const {
return static_cast<const TaskView&>(t[i]);
}
template<class Char, class Traits, class TaskView>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os,
const TaskViewArray<TaskView>& t) {
std::basic_ostringstream<Char,Traits> s;
s.copyfmt(os); s.width(0);
s << '{';
if (t.size() > 0) {
s << t[0];
for (int i=1; i<t.size(); i++)
s << ", " << t[i];
}
s << '}';
return os << s.str();
}
}}
// STATISTICS: int-other
Gecode::ArgArrayBase::size
int size(void) const
Return size of array (number of elements).
Definition array.hpp:1607
Gecode::Int::TaskArray
Task array.
Definition task.hh:165
Gecode::Int::TaskArray::operator[]
Task & operator[](int i)
Return task at position i.
Definition array.hpp:74
Gecode::Int::TaskArray::update
void update(Space &, TaskArray &a)
Update array to be a clone of array a.
Definition array.hpp:108
Gecode::Int::TaskArray::TaskArray
TaskArray(void)
Default constructor (array of size 0).
Definition array.hpp:42
Gecode::Int::TaskArray::subscribe
void subscribe(Space &home, Propagator &p, PropCond pc=Int::PC_INT_BND)
Subscribe propagator p to all tasks.
Definition array.hpp:87
Gecode::Int::TaskArray::cancel
void cancel(Space &home, Propagator &p, PropCond pc=Int::PC_INT_BND)
Cancel subscription of propagator p for all tasks.
Definition array.hpp:94
Gecode::Int::TaskArray::reschedule
void reschedule(Space &home, Propagator &p, PropCond pc=Int::PC_INT_BND)
Schedule propagator p.
Definition array.hpp:101
Gecode::Int::TaskArray::size
int size(void) const
Return size of array (number of elements).
Definition array.hpp:63
Gecode::Int::TaskArray::operator=
const TaskArray< Task > & operator=(const TaskArray< Task > &a)
Initialize from task array a (share elements).
Definition array.hpp:56
Gecode::Int::TaskViewArray
Task view array.
Definition task.hh:233
Gecode::Int::TaskViewArray::t
TaskArray< Task > & t
Access to task array.
Definition task.hh:238
Gecode::Int::TaskViewArray::TaskViewArray
TaskViewArray(TaskArray< Task > &t)
Initialize from task array a.
Definition array.hpp:137
Gecode::Int::TaskViewArray::size
int size(void) const
Return size of array (number of elements).
Definition array.hpp:142
Gecode::Int::TaskViewArray::operator[]
TaskView & operator[](int i)
Return task view at position i.
Definition array.hpp:154
Gecode::Int::Task
Gecode::Propagator
Base-class for propagators.
Definition core.hpp:1064
Gecode::Space
Computation spaces.
Definition core.hpp:1742
Gecode::Space::alloc
T * alloc(long unsigned int n)
Allocate block of n objects of type T from space heap.
Definition core.hpp:2837
Gecode::Int::OffsetView::update
void update(const NoOffset &)
Integer-precision integer scale view.
Definition view.hpp:638
Gecode::Int
Finite domain integers.
Gecode::Int::operator<<
std::basic_ostream< Char, Traits > & operator<<(std::basic_ostream< Char, Traits > &os, const IdxViewArray< View > &x)
Definition idx-view.hpp:167
Gecode
Gecode toplevel namespace
Gecode::PropCond
int PropCond
Type for propagation conditions.
Definition core.hpp:72
forceinline
#define forceinline
Definition config.hpp:187