Generated on Sat Feb 7 2015 02:01:25 for Gecode by doxygen 1.8.9.1
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  * Last modified:
10  * $Date: 2011-05-25 16:56:41 +0200 (Wed, 25 May 2011) $ by $Author: schulte $
11  * $Revision: 12022 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include <algorithm>
39 
40 namespace Gecode { namespace Int {
41 
42  template<class TaskView, SortTaskOrder sto, bool inc>
45 
46  template<class TaskView, SortTaskOrder sto, bool inc>
50  : map(r.alloc<int>(t.size())), i(t.size()-1) {
51  sort<TaskView,sto,!inc>(map,t);
52  }
53 
54  template<class TaskView, SortTaskOrder sto, bool inc>
55  forceinline bool
57  return i>=0;
58  }
59  template<class TaskView, SortTaskOrder sto, bool inc>
60  forceinline int
62  return i+1;
63  }
64  template<class TaskView, SortTaskOrder sto, bool inc>
65  forceinline void
67  i--;
68  }
69 
70  template<class TaskView, SortTaskOrder sto, bool inc>
71  forceinline int
73  return map[i];
74  }
75 
76 
77  template<class OptTaskView, SortTaskOrder sto, bool inc>
81  map = r.alloc<int>(t.size()); i=0;
82  for (int j=t.size(); j--; )
83  if (t[j].mandatory())
84  map[i++]=j;
85  sort<OptTaskView,sto,!inc>(map,i,t);
86  i--;
87  }
88 
89 
90 }}
91 
92 // STATISTICS: int-prop
int left(void) const
How many tasks are left to be iterated.
Definition: iter.hpp:61
ManTaskViewIter(Region &r, const TaskViewArray< OptTaskView > &t)
Initialize iterator with mandatory tasks.
Definition: iter.hpp:80
NodeType t
Type of node.
Definition: bool-expr.cpp:234
Task view array.
Definition: task.hh:233
void operator++(void)
Move iterator to next task.
Definition: iter.hpp:66
T * alloc(long unsigned int n)
Allocate block of n objects of type T from region.
Definition: region.hpp:326
bool operator()(void) const
Test whether iterator is still at a task.
Definition: iter.hpp:56
Handle to region.
Definition: region.hpp:61
TaskViewIter(void)
Default constructor (no initialization)
Definition: iter.hpp:44
Gecode::IntArgs i(4, 1, 2, 3, 4)
NNF * r
Right subtree.
Definition: bool-expr.cpp:246
unsigned int size(I &i)
Size of all ranges of range iterator i.
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:139
int task(void) const
Return current task position.
Definition: iter.hpp:72
#define forceinline
Definition: config.hpp:132
Gecode toplevel namespace