Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
7.7 kB · 334 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2003 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
namespace Gecode { namespace Int {
/* * Constructors and initialization * */ forceinline ConstIntView::ConstIntView(void) {} forceinline ConstIntView::ConstIntView(int n) : x(n) {}
/* * Value access * */ forceinline int ConstIntView::min(void) const { return x; } forceinline int ConstIntView::max(void) const { return x; } forceinline int ConstIntView::med(void) const { return x; } forceinline int ConstIntView::val(void) const { return x; }
forceinline unsigned int ConstIntView::size(void) const { return 1; } forceinline unsigned int ConstIntView::width(void) const { return 1; } forceinline unsigned int ConstIntView::regret_min(void) const { return 0; } forceinline unsigned int ConstIntView::regret_max(void) const { return 0; }
/* * Domain tests * */ forceinline bool ConstIntView::range(void) const { return true; } forceinline bool ConstIntView::in(int n) const { return n == x; } forceinline bool ConstIntView::in(long long int n) const { return n == x; }
/* * Domain update by value * */ forceinline ModEvent ConstIntView::lq(Space&, int n) { return (x <= n) ? ME_INT_NONE : ME_INT_FAILED; } forceinline ModEvent ConstIntView::lq(Space&, long long int n) { return (x <= n) ? ME_INT_NONE : ME_INT_FAILED; }
forceinline ModEvent ConstIntView::le(Space&, int n) { return (x < n) ? ME_INT_NONE : ME_INT_FAILED; } forceinline ModEvent ConstIntView::le(Space&, long long int n) { return (x < n) ? ME_INT_NONE : ME_INT_FAILED; }
forceinline ModEvent ConstIntView::gq(Space&, int n) { return (x >= n) ? ME_INT_NONE : ME_INT_FAILED; } forceinline ModEvent ConstIntView::gq(Space&, long long int n) { return (x >= n) ? ME_INT_NONE : ME_INT_FAILED; }
forceinline ModEvent ConstIntView::gr(Space&, int n) { return (x > n) ? ME_INT_NONE : ME_INT_FAILED; } forceinline ModEvent ConstIntView::gr(Space&, long long int n) { return (x > n) ? ME_INT_NONE : ME_INT_FAILED; }
forceinline ModEvent ConstIntView::nq(Space&, int n) { return (x != n) ? ME_INT_NONE : ME_INT_FAILED; } forceinline ModEvent ConstIntView::nq(Space&, long long int n) { return (x != n) ? ME_INT_NONE : ME_INT_FAILED; }
forceinline ModEvent ConstIntView::eq(Space&, int n) { return (x == n) ? ME_INT_NONE : ME_INT_FAILED; } forceinline ModEvent ConstIntView::eq(Space&, long long int n) { return (x == n) ? ME_INT_NONE : ME_INT_FAILED; }
/* * Iterator-based domain update * */ template<class I> forceinline ModEvent ConstIntView::narrow_r(Space&, I& i, bool) { return i() ? ME_INT_NONE : ME_INT_FAILED; } template<class I> forceinline ModEvent ConstIntView::inter_r(Space&, I& i, bool) { while (i() && (i.max() < x)) ++i; return (i() && (i.min() <= x)) ? ME_INT_NONE : ME_INT_FAILED; } template<class I> forceinline ModEvent ConstIntView::minus_r(Space&, I& i, bool) { while (i() && (i.max() < x)) ++i; return (i() && (i.min() <= x)) ? ME_INT_FAILED : ME_INT_NONE; } template<class I> forceinline ModEvent ConstIntView::narrow_v(Space&, I& i, bool) { return i() ? ME_INT_NONE : ME_INT_FAILED; } template<class I> forceinline ModEvent ConstIntView::inter_v(Space&, I& i, bool) { while (i() && (i.val() < x)) ++i; return (i() && (i.val() == x)) ? ME_INT_NONE : ME_INT_FAILED; } template<class I> forceinline ModEvent ConstIntView::minus_v(Space&, I& i, bool) { while (i() && (i.val() < x)) ++i; return (i() && (i.val() == x)) ? ME_INT_FAILED : ME_INT_NONE; }
/* * Delta information for advisors * */ forceinline int ConstIntView::min(const Delta&) const { return 1; } forceinline int ConstIntView::max(const Delta&) const { return 0; } forceinline unsigned int ConstIntView::width(const Delta&) const { return 1U; } forceinline bool ConstIntView::any(const Delta&) const { return true; }
/* * Cloning * */ forceinline void ConstIntView::update(Space& home, ConstIntView& y) { ConstView<IntView>::update(home,y); x = y.x; }
/* * Ordering * */ forceinline bool ConstIntView::operator <(const ConstIntView& y) const { return min() < y.min(); }
/** * \brief %Range iterator for constant integer views * \ingroup TaskActorIntView */ template<> class ViewRanges<ConstIntView> { private: /// The single integer to iterate int n; public: /// \name Constructors and initialization //@{ /// Default constructor ViewRanges(void); /// Initialize with ranges for view \a x ViewRanges(const ConstIntView& x); /// Initialize with ranges for view \a x void init(const ConstIntView& x); //@}
/// \name Iteration control //@{ /// Test whether iterator is still at a range or done bool operator ()(void) const; /// Move iterator to next range (if possible) void operator ++(void); //@}
/// \name Range access //@{ /// Return smallest value of range int min(void) const; /// Return largest value of range int max(void) const; /// Return width of ranges (distance between minimum and maximum) unsigned int width(void) const; //@} };
forceinline ViewRanges<ConstIntView>::ViewRanges(void) {}
forceinline ViewRanges<ConstIntView>::ViewRanges(const ConstIntView& x) : n(x.val()) {}
forceinline bool ViewRanges<ConstIntView>::operator ()(void) const { return n <= Limits::max; } forceinline void ViewRanges<ConstIntView>::operator ++(void) { n = Limits::max+1; }
forceinline int ViewRanges<ConstIntView>::min(void) const { return n; } forceinline int ViewRanges<ConstIntView>::max(void) const { return n; } forceinline unsigned int ViewRanges<ConstIntView>::width(void) const { return 1; }
/* * View comparison * */ forceinline bool operator ==(const ConstIntView& x, const ConstIntView& y) { return x.min() == y.min(); } forceinline bool operator !=(const ConstIntView& x, const ConstIntView& y) { return !(x == y); }
}}
// STATISTICS: int-var