this repo has no description
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 2/* 3 * Main authors: 4 * Christian Schulte <schulte@gecode.org> 5 * 6 * Copyright: 7 * Christian Schulte, 2019 8 * 9 * This file is part of Gecode, the generic constraint 10 * development environment: 11 * http://www.gecode.org 12 * 13 * Permission is hereby granted, free of charge, to any person obtaining 14 * a copy of this software and associated documentation files (the 15 * "Software"), to deal in the Software without restriction, including 16 * without limitation the rights to use, copy, modify, merge, publish, 17 * distribute, sublicense, and/or sell copies of the Software, and to 18 * permit persons to whom the Software is furnished to do so, subject to 19 * the following conditions: 20 * 21 * The above copyright notice and this permission notice shall be 22 * included in all copies or substantial portions of the Software. 23 * 24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 31 * 32 */ 33 34#include <gecode/int/order.hh> 35 36#include <algorithm> 37 38namespace Gecode { 39 40 void 41 order(Home home, IntVar s0, int p0, IntVar s1, int p1, BoolVar b, 42 IntPropLevel) { 43 using namespace Gecode::Int; 44 Int::Limits::nonnegative(p0,"Int::order"); 45 Int::Limits::nonnegative(p1,"Int::order"); 46 Int::Limits::check(static_cast<long long int>(s0.max()) + p0, 47 "Int::order"); 48 Int::Limits::check(static_cast<long long int>(s1.max()) + p1, 49 "Int::order"); 50 GECODE_POST; 51 GECODE_ES_FAIL(Order::OrderProp::post(home,s0,p0,s1,p1,b)); 52 } 53 54} 55 56// STATISTICS: int-post