Generated on Mon May 10 06:46:44 2010 for Gecode by doxygen 1.6.3

unary.cpp

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: 2010-03-25 14:23:47 +0100 (Thu, 25 Mar 2010) $ by $Author: tack $
00011  *     $Revision: 10571 $
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 <gecode/scheduling/unary.hh>
00039 
00040 #include <algorithm>
00041 
00042 namespace Gecode {
00043 
00044   void
00045   unary(Home home, const IntVarArgs& s, const IntArgs& p) {
00046     using namespace Gecode::Scheduling;
00047     using namespace Gecode::Scheduling::Unary;
00048     if (s.same(home))
00049       throw Int::ArgumentSame("Scheduling::unary");
00050     if (s.size() != p.size())
00051       throw Int::ArgumentSizeMismatch("Scheduling::unary");
00052     for (int i=p.size(); i--; ) {
00053       Int::Limits::nonnegative(p[i],"Scheduling::unary");
00054       Int::Limits::check(static_cast<double>(s[i].max()) + p[i],
00055                          "Scheduling::unary");
00056     }
00057     if (home.failed()) return;
00058     TaskArray<ManFixTask> t(home,s.size());
00059     for (int i=s.size(); i--; )
00060       t[i].init(s[i],p[i]);
00061     GECODE_ES_FAIL(ManProp<ManFixTask>::post(home,t));
00062   }
00063 
00064   void
00065   unary(Home home, const IntVarArgs& s, const IntArgs& p, 
00066         const BoolVarArgs& m) {
00067     using namespace Gecode::Scheduling;
00068     using namespace Gecode::Scheduling::Unary;
00069     if (s.same(home))
00070       throw Int::ArgumentSame("Scheduling::unary");
00071     if ((s.size() != p.size()) || (s.size() != m.size()))
00072       throw Int::ArgumentSizeMismatch("Scheduling::unary");
00073     for (int i=p.size(); i--; ) {
00074       Int::Limits::nonnegative(p[i],"Scheduling::unary");
00075       Int::Limits::check(static_cast<double>(s[i].max()) + p[i],
00076                          "Scheduling::unary");
00077     }
00078     if (home.failed()) return;
00079     TaskArray<OptFixTask> t(home,s.size());
00080     for (int i=s.size(); i--; )
00081       t[i].init(s[i],p[i],m[i]);
00082     GECODE_ES_FAIL(OptProp<OptFixTask>::post(home,t));
00083   }
00084 
00085 }
00086 
00087 // STATISTICS: scheduling-post