Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
7.5 kB · 329 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Contributing authors: * Samuel Gagnon <samuel.gagnon92@gmail.com> * * Copyright: * Christian Schulte, 2002 * Samuel Gagnon, 2018 * * 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 OffsetView::OffsetView(void) {} forceinline OffsetView::OffsetView(const IntView& y, int d) : DerivedView<IntView>(y), c(d) {}
/* * Value access * */ forceinline int OffsetView::offset(void) const { return c; } forceinline void OffsetView::offset(int n) { c = n; } forceinline int OffsetView::min(void) const { return x.min()+c; } forceinline int OffsetView::max(void) const { return x.max()+c; } forceinline int OffsetView::med(void) const { return x.med()+c; } forceinline int OffsetView::val(void) const { return x.val()+c; }#ifdef GECODE_HAS_CBS forceinline int OffsetView::baseval(int val) const { return val-c; }#endif
forceinline unsigned int OffsetView::width(void) const { return x.width(); } forceinline unsigned int OffsetView::size(void) const { return x.size(); } forceinline unsigned int OffsetView::regret_min(void) const { return x.regret_min(); } forceinline unsigned int OffsetView::regret_max(void) const { return x.regret_max(); }
/* * Domain tests * */ forceinline bool OffsetView::range(void) const { return x.range(); } forceinline bool OffsetView::in(int n) const { return x.in(n-c); } forceinline bool OffsetView::in(long long int n) const { return x.in(n-c); }
/* * Domain update by value * */ forceinline ModEvent OffsetView::lq(Space& home, int n) { return x.lq(home,n-c); } forceinline ModEvent OffsetView::lq(Space& home, long long int n) { return x.lq(home,n-c); }
forceinline ModEvent OffsetView::le(Space& home, int n) { return x.le(home,n-c); } forceinline ModEvent OffsetView::le(Space& home, long long int n) { return x.le(home,n-c); }
forceinline ModEvent OffsetView::gq(Space& home, int n) { return x.gq(home,n-c); } forceinline ModEvent OffsetView::gq(Space& home, long long int n) { return x.gq(home,n-c); }
forceinline ModEvent OffsetView::gr(Space& home, int n) { return x.gr(home,n-c); } forceinline ModEvent OffsetView::gr(Space& home, long long int n) { return x.gr(home,n-c); }
forceinline ModEvent OffsetView::nq(Space& home, int n) { return x.nq(home,n-c); } forceinline ModEvent OffsetView::nq(Space& home, long long int n) { return x.nq(home,n-c); }
forceinline ModEvent OffsetView::eq(Space& home, int n) { return x.eq(home,n-c); } forceinline ModEvent OffsetView::eq(Space& home, long long int n) { return x.eq(home,n-c); }
/* * Iterator-based domain update * */ template<class I> forceinline ModEvent OffsetView::narrow_r(Space& home, I& i, bool depend) { Iter::Ranges::Offset<I> oi(i,-c); return x.narrow_r(home,oi,depend); } template<class I> forceinline ModEvent OffsetView::inter_r(Space& home, I& i, bool depend) { Iter::Ranges::Offset<I> oi(i,-c); return x.inter_r(home,oi,depend); } template<class I> forceinline ModEvent OffsetView::minus_r(Space& home, I& i, bool depend) { Iter::Ranges::Offset<I> oi(i,-c); return x.minus_r(home,oi,depend); } template<class I> forceinline ModEvent OffsetView::narrow_v(Space& home, I& i, bool depend) { Iter::Values::Offset<I> oi(i,-c); return x.narrow_v(home,oi,depend); } template<class I> forceinline ModEvent OffsetView::inter_v(Space& home, I& i, bool depend) { Iter::Values::Offset<I> oi(i,-c); return x.inter_v(home,oi,depend); } template<class I> forceinline ModEvent OffsetView::minus_v(Space& home, I& i, bool depend) { Iter::Values::Offset<I> oi(i,-c); return x.minus_v(home,oi,depend); }
/* * Propagator modification events * */ forceinline ModEventDelta OffsetView::med(ModEvent me) { return IntView::med(me); }
/* * Delta information for advisors * */ forceinline int OffsetView::min(const Delta& d) const { return x.min(d)+c; } forceinline int OffsetView::max(const Delta& d) const { return x.max(d)+c; } forceinline unsigned int OffsetView::width(const Delta& d) const { return x.width(d); } forceinline bool OffsetView::any(const Delta& d) const { return x.any(d); }
/* * Cloning * */ forceinline void OffsetView::update(Space& home, OffsetView& y) { DerivedView<IntView>::update(home,y); c=y.c; }
/* * Ordering * */ forceinline bool OffsetView::operator <(const OffsetView& y) const { return ((base() < y.base()) || ((base() == y.base()) && (offset() < y.offset()))); }
/** * \brief %Range iterator for offset integer views * \ingroup TaskActorIntView */ template<> class ViewRanges<OffsetView> : public Iter::Ranges::Offset<ViewRanges<IntView> > { public: /// \name Constructors and initialization //@{ /// Default constructor ViewRanges(void); /// Initialize with ranges for view \a x ViewRanges(const OffsetView& x); /// Initialize with ranges for view \a x void init(const OffsetView& x); //@} };
forceinline ViewRanges<OffsetView>::ViewRanges(void) {}
forceinline ViewRanges<OffsetView>::ViewRanges(const OffsetView& x) { ViewRanges<IntView> xi(x.base()); Iter::Ranges::Offset<ViewRanges<IntView> >::init(xi,x.offset()); }
forceinline void ViewRanges<OffsetView>::init(const OffsetView& x) { ViewRanges<IntView> xi(x.base()); Iter::Ranges::Offset<ViewRanges<IntView> >::init(xi,x.offset()); }
/* * View comparison * */ forceinline bool operator ==(const OffsetView& x, const OffsetView& y) { return (x.base() == y.base()) && (x.offset() == y.offset()); } forceinline bool operator !=(const OffsetView& x, const OffsetView& y) { return !(x == y); }
}}
// STATISTICS: int-var