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

edge-finding.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 { namespace Unary {
00037 
00038   template<class TaskView>
00039   forceinline ExecStatus
00040   edgefinding(Space& home, TaskViewArray<TaskView>& t) {
00041     Region r;
00042 
00043     OmegaLambdaTree<TaskView> ol(r,t);
00044     TaskViewIter<TaskView,STO_LCT,false> q(r,t);
00045 
00046     int j = q.task();
00047     while (q.left() > 1) {
00048       if (ol.ect() > t[j].lct())
00049         return ES_FAILED;
00050       ol.shift(j);
00051       ++q;
00052       j = q.task();
00053       while (!ol.lempty() && (ol.lect() > t[j].lct())) {
00054         int i = ol.responsible();
00055         GECODE_ME_CHECK(t[i].est(home,ol.ect()));
00056         ol.lremove(i);
00057       }
00058     }
00059 
00060     return ES_OK;
00061   }
00062 
00063   template<class Task>
00064   ExecStatus
00065   edgefinding(Space& home, TaskArray<Task>& t) {
00066     TaskViewArray<typename TaskTraits<Task>::TaskViewFwd> f(t);
00067     GECODE_ES_CHECK(edgefinding(home,f));
00068     TaskViewArray<typename TaskTraits<Task>::TaskViewBwd> b(t);
00069     return edgefinding(home,b);
00070   }
00071 
00072 }}}
00073 
00074 // STATISTICS: int-prop