Generated on Wed Mar 19 07:30:00 2008 for Gecode by doxygen 1.5.5

sorted.cc

Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
00002 /*
00003  *  Main authors:
00004  *     Patrick Pekczynski <pekczynski@ps.uni-sb.de>
00005  *
00006  *  Copyright:
00007  *     Patrick Pekczynski, 2004
00008  *
00009  *  Last modified:
00010  *     $Date: 2007-09-11 21:43:38 +0200 (Tue, 11 Sep 2007) $ by $Author: schulte $
00011  *     $Revision: 4982 $
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/int/sorted.hh"
00039 
00040 namespace Gecode {
00041 
00042   void 
00043   sorted(Space* home, const IntVarArgs& x, const IntVarArgs& y,
00044          IntConLevel, PropKind) {
00045     using namespace Int;
00046     if (x.size() != y.size())
00047       throw ArgumentSizeMismatch("Int::Sorted");
00048     if (x.same(y))
00049       throw ArgumentSame("Int::Sorted");
00050       
00051     if (home->failed()) return;
00052 
00053     // construct single tuple for propagation without permutation variables
00054     ViewArray<ViewTuple<IntView,1> > x0(home, x.size());
00055     for (int i = x.size(); i--; )
00056       x0[i][0] = x[i];
00057     ViewArray<IntView> y0(home, y);
00058 
00059     GECODE_ES_FAIL(home,
00060                    (Sorted::
00061                     Sorted<IntView, ViewTuple<IntView,1>, false>::
00062                     post(home, x0, y0)));
00063   }
00064 
00065   void 
00066   sorted(Space* home, const IntVarArgs& x, const IntVarArgs& y, 
00067          const IntVarArgs& z, IntConLevel, PropKind) {
00068     using namespace Int;
00069     if ((x.size() != y.size()) || (x.size() != z.size()))
00070       throw ArgumentSizeMismatch("Int::Sorted");
00071     if (x.same(y) || x.same(z) || y.same(z))
00072       throw ArgumentSame("Int::Sorted");
00073     
00074     if (home->failed()) return;
00075 
00076     ViewArray<ViewTuple<IntView, 2> > xz0(home, x.size());
00077 
00078     // assert that permutation variables encode a permutation
00079     ViewArray<IntView> y0(home, y);
00080     for (int i = x.size(); i--; ) {
00081       xz0[i][0]=x[i]; xz0[i][1] = z[i];
00082     }
00083 
00084     GECODE_ES_FAIL(home,
00085                    (Sorted::
00086                     Sorted<IntView, ViewTuple<IntView,2>, true>::
00087                     post(home, xz0, y0)));
00088   }
00089 }
00090 
00091 // STATISTICS: int-post