Generated on Wed Feb 28 2024 15:56:55 for Gecode by doxygen 1.9.8
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>
40 TaskViewIter<TaskView,sto,inc>::TaskViewIter(void) {}
41
42 template<class TaskView, SortTaskOrder sto, bool inc>
44 TaskViewIter<TaskView,sto,inc>
45 ::TaskViewIter(Region& r, const TaskViewArray<TaskView>& t)
46 : map(r.alloc<int>(t.size())), i(t.size()-1) {
47 sort<TaskView,sto,!inc>(map,t);
48 }
49
50 template<class TaskView, SortTaskOrder sto, bool inc>
51 forceinline bool
52 TaskViewIter<TaskView,sto,inc>::operator ()(void) const {
53 return i>=0;
54 }
55 template<class TaskView, SortTaskOrder sto, bool inc>
56 forceinline int
57 TaskViewIter<TaskView,sto,inc>::left(void) const {
58 return i+1;
59 }
60 template<class TaskView, SortTaskOrder sto, bool inc>
61 forceinline void
62 TaskViewIter<TaskView,sto,inc>::operator ++(void) {
63 i--;
64 }
65
66 template<class TaskView, SortTaskOrder sto, bool inc>
67 forceinline int
68 TaskViewIter<TaskView,sto,inc>::task(void) const {
69 return map[i];
70 }
71
72
73 template<class OptTaskView, SortTaskOrder sto, bool inc>
75 ManTaskViewIter<OptTaskView,sto,inc>
76 ::ManTaskViewIter(Region& r, const TaskViewArray<OptTaskView>& t) {
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;
81 sort<OptTaskView,sto,!inc>(map,i,t);
82 i--;
83 }
84
85
86}}
87
88// STATISTICS: int-prop
NodeType t
Type of node.
NNF * r
Right subtree.
unsigned int size(I &i)
Size of all ranges of range iterator i.
Gecode toplevel namespace
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition set.hh:767
Gecode::IntArgs i({1, 2, 3, 4})
#define forceinline
Definition config.hpp:187