/usr/include/gecode/int/task/iter.hpp is in libgecode-dev 3.7.1-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2009
*
* Last modified:
* $Date: 2011-05-25 16:56:41 +0200 (Wed, 25 May 2011) $ by $Author: schulte $
* $Revision: 12022 $
*
* 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 <algorithm>
namespace Gecode { namespace Int {
template<class TaskView, SortTaskOrder sto, bool inc>
forceinline
TaskViewIter<TaskView,sto,inc>::TaskViewIter(void) {}
template<class TaskView, SortTaskOrder sto, bool inc>
forceinline
TaskViewIter<TaskView,sto,inc>
::TaskViewIter(Region& r, const TaskViewArray<TaskView>& t)
: map(r.alloc<int>(t.size())), i(t.size()-1) {
sort<TaskView,sto,!inc>(map,t);
}
template<class TaskView, SortTaskOrder sto, bool inc>
forceinline bool
TaskViewIter<TaskView,sto,inc>::operator ()(void) const {
return i>=0;
}
template<class TaskView, SortTaskOrder sto, bool inc>
forceinline int
TaskViewIter<TaskView,sto,inc>::left(void) const {
return i+1;
}
template<class TaskView, SortTaskOrder sto, bool inc>
forceinline void
TaskViewIter<TaskView,sto,inc>::operator ++(void) {
i--;
}
template<class TaskView, SortTaskOrder sto, bool inc>
forceinline int
TaskViewIter<TaskView,sto,inc>::task(void) const {
return map[i];
}
template<class OptTaskView, SortTaskOrder sto, bool inc>
forceinline
ManTaskViewIter<OptTaskView,sto,inc>
::ManTaskViewIter(Region& r, const TaskViewArray<OptTaskView>& t) {
map = r.alloc<int>(t.size()); i=0;
for (int j=t.size(); j--; )
if (t[j].mandatory())
map[i++]=j;
sort<OptTaskView,sto,!inc>(map,i,t);
i--;
}
}}
// STATISTICS: int-prop
|