Generated on Tue Feb 11 2025 17:33:26 for Gecode by doxygen 1.12.0
iter.hpp
Go to the documentation of this file.
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2/*
3 * Main authors:
4 * Christian Schulte <schulte@gecode.org>
5 *
6 * Copyright:
7 * Christian Schulte, 2009
8 *
9 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#include <algorithm>
35
36namespace Gecode { namespace Int {
37
38 template<class TaskView, SortTaskOrder sto, bool inc>
41
42 template<class TaskView, SortTaskOrder sto, bool inc>
46 : map(r.alloc<int>(t.size())), i(t.size()-1) {
48 }
49
50 template<class TaskView, SortTaskOrder sto, bool inc>
51 forceinline bool
53 return i>=0;
54 }
55 template<class TaskView, SortTaskOrder sto, bool inc>
56 forceinline int
58 return i+1;
59 }
60 template<class TaskView, SortTaskOrder sto, bool inc>
61 forceinline void
65
66 template<class TaskView, SortTaskOrder sto, bool inc>
67 forceinline int
69 return map[i];
70 }
71
72
73 template<class OptTaskView, SortTaskOrder sto, bool inc>
77 map = r.alloc<int>(t.size()); i=0;
78 for (int j=0; j<t.size(); j++)
79 if (t[j].mandatory())
80 map[i++]=j;
82 i--;
83 }
84
85
86}}
87
88// STATISTICS: int-prop
NodeType t
Type of node.
Allows to iterate over mandatory task views according to a specified order.
Definition task.hh:339
Task view array.
Definition task.hh:233
Allows to iterate over task views according to a specified order.
Definition task.hh:309
void operator++(void)
Move iterator to next task.
Definition iter.hpp:62
bool operator()(void) const
Test whether iterator is still at a task.
Definition iter.hpp:52
int * map
Map for iteration order.
Definition task.hh:312
int task(void) const
Return current task position.
Definition iter.hpp:68
int left(void) const
How many tasks are left to be iterated.
Definition iter.hpp:57
TaskViewIter(void)
Default constructor (no initialization)
Definition iter.hpp:40
Handle to region.
Definition region.hpp:55
void sort(TaskViewArray< TaskView > &t)
Sort task view array t according to sto and inc (increasing or decreasing)
Definition sort.hpp:133
Gecode toplevel namespace
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition set.hh:767
#define forceinline
Definition config.hpp:187