Generated on Tue Apr 18 10:21:51 2017 for Gecode by doxygen 1.6.3

subsumption.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, 2015
00008  *
00009  *  Last modified:
00010  *     $Date: 2016-04-19 17:19:45 +0200 (Tue, 19 Apr 2016) $ by $Author: schulte $
00011  *     $Revision: 14967 $
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 namespace Gecode { namespace Int { namespace Cumulative {
00039 
00040   template<class Task>
00041   forceinline ExecStatus
00042   subsumed(Space& home, Propagator& p, int c, TaskArray<Task>& t) {
00043     Region r(home);
00044 
00045     if (Event* e = Event::events(r,t)) {
00046       // Process events, use ccur as the capacity that is still free
00047       do {
00048         // Current time
00049         int time = e->time();
00050         // Process events for completion of required part
00051         for ( ; (e->type() == Event::LRT) && (e->time() == time); e++)
00052           c += t[e->idx()].c();
00053         // Process events for zero-length task
00054         for ( ; (e->type() == Event::ZRO) && (e->time() == time); e++)
00055           if (c < t[e->idx()].c())
00056             return ES_FAILED;
00057         // Process events for start of required part
00058         for ( ;  (e->type() == Event::ERT) && (e->time() == time); e++) {
00059           c -= t[e->idx()].c();
00060           if (c < 0)
00061             return ES_FAILED;
00062         }
00063       } while (e->type() != Event::END);
00064     } else {
00065       return ES_OK;
00066     }
00067 
00068     return home.ES_SUBSUMED(p);
00069   }
00070 
00071 }}}
00072 
00073 // STATISTICS: int-prop