this repo has no description
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 2/* 3 * Main authors: 4 * Christopher Mears <Chris.Mears@monash.edu> 5 * 6 * Contributing authors: 7 * Christian Schulte <schulte@gecode.org> 8 * 9 * Copyright: 10 * Christopher Mears, 2011 11 * Christian Schulte, 2011 12 * 13 * This file is part of Gecode, the generic constraint 14 * development environment: 15 * http://www.gecode.org 16 * 17 * Permission is hereby granted, free of charge, to any person obtaining 18 * a copy of this software and associated documentation files (the 19 * "Software"), to deal in the Software without restriction, including 20 * without limitation the rights to use, copy, modify, merge, publish, 21 * distribute, sublicense, and/or sell copies of the Software, and to 22 * permit persons to whom the Software is furnished to do so, subject to 23 * the following conditions: 24 * 25 * The above copyright notice and this permission notice shall be 26 * included in all copies or substantial portions of the Software. 27 * 28 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 29 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 30 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 31 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 32 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 33 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 34 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 35 * 36 */ 37 38#include <gecode/int/precede.hh> 39 40namespace Gecode { 41 42 void 43 precede(Home home, const IntVarArgs& x, int s, int t, IntPropLevel) { 44 using namespace Int; 45 Limits::check(s,"Int::precede"); 46 Limits::check(t,"Int::precede"); 47 GECODE_POST; 48 49 ViewArray<IntView> y(home, x); 50 GECODE_ES_FAIL(Precede::Single<IntView>::post(home, y, s, t)); 51 } 52 53 void 54 precede(Home home, const IntVarArgs& x, const IntArgs& c, IntPropLevel) { 55 using namespace Int; 56 if (c.size() < 2) 57 return; 58 for (int i=c.size(); i--; ) 59 Limits::check(c[i],"Int::precede"); 60 GECODE_POST; 61 62 for (int i=c.size()-1; i--; ) { 63 ViewArray<IntView> y(home, x); 64 GECODE_ES_FAIL(Precede::Single<IntView>::post(home, y, c[i], c[i+1])); 65 } 66 } 67 68} 69 70// STATISTICS: int-post 71