Generated on Fri Oct 19 11:25:09 2018 for Gecode by doxygen 1.6.3

iter.hpp

Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
00002 /*
00003  *  Main authors:
00004  *     Christian Schulte <schulte@gecode.org>
00005  *
00006  *  Copyright:
00007  *     Christian Schulte, 2009
00008  *
00009  *  This file is part of Gecode, the generic constraint
00010  *  development environment:
00011  *     http://www.gecode.org
00012  *
00013  *  Permission is hereby granted, free of charge, to any person obtaining
00014  *  a copy of this software and associated documentation files (the
00015  *  "Software"), to deal in the Software without restriction, including
00016  *  without limitation the rights to use, copy, modify, merge, publish,
00017  *  distribute, sublicense, and/or sell copies of the Software, and to
00018  *  permit persons to whom the Software is furnished to do so, subject to
00019  *  the following conditions:
00020  *
00021  *  The above copyright notice and this permission notice shall be
00022  *  included in all copies or substantial portions of the Software.
00023  *
00024  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00025  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00026  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00027  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00028  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00029  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00030  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00031  *
00032  */
00033 
00034 #include <algorithm>
00035 
00036 namespace Gecode { namespace Int {
00037 
00038   template<class TaskView, SortTaskOrder sto, bool inc>
00039   forceinline
00040   TaskViewIter<TaskView,sto,inc>::TaskViewIter(void) {}
00041 
00042   template<class TaskView, SortTaskOrder sto, bool inc>
00043   forceinline
00044   TaskViewIter<TaskView,sto,inc>
00045   ::TaskViewIter(Region& r, const TaskViewArray<TaskView>& t)
00046     : map(r.alloc<int>(t.size())), i(t.size()-1) {
00047     sort<TaskView,sto,!inc>(map,t);
00048   }
00049 
00050   template<class TaskView, SortTaskOrder sto, bool inc>
00051   forceinline bool
00052   TaskViewIter<TaskView,sto,inc>::operator ()(void) const {
00053     return i>=0;
00054   }
00055   template<class TaskView, SortTaskOrder sto, bool inc>
00056   forceinline int
00057   TaskViewIter<TaskView,sto,inc>::left(void) const {
00058     return i+1;
00059   }
00060   template<class TaskView, SortTaskOrder sto, bool inc>
00061   forceinline void
00062   TaskViewIter<TaskView,sto,inc>::operator ++(void) {
00063     i--;
00064   }
00065 
00066   template<class TaskView, SortTaskOrder sto, bool inc>
00067   forceinline int
00068   TaskViewIter<TaskView,sto,inc>::task(void) const {
00069     return map[i];
00070   }
00071 
00072 
00073   template<class OptTaskView, SortTaskOrder sto, bool inc>
00074   forceinline
00075   ManTaskViewIter<OptTaskView,sto,inc>
00076   ::ManTaskViewIter(Region& r, const TaskViewArray<OptTaskView>& t) {
00077     map = r.alloc<int>(t.size()); i=0;
00078     for (int j=0; j<t.size(); j++)
00079       if (t[j].mandatory())
00080         map[i++]=j;
00081     sort<OptTaskView,sto,!inc>(map,i,t);
00082     i--;
00083   }
00084 
00085 
00086 }}
00087 
00088 // STATISTICS: int-prop