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