Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
4.4 kB · 180 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2011 * * 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 {
/* * Value sets * */ forceinline ValSet::ValSet(void) : fst(nullptr), lst(nullptr), n(0) {}
forceinline void ValSet::add(Space& home, int v) { RangeList* c = fst; RangeList** p = &fst; while (c != nullptr) { if (v < c->min()) { if (v+1 == c->min()) { c->min(v); n++; return; } else { *p = new (home) RangeList(v,v,c); n++; return; } } else if (v <= c->max()) { // Value already included return; } else if (v == c->max()+1) { if ((c->next() != nullptr) && (v+1 == c->next()->min())) { c->next()->min(c->min()); *p = c->next(); c->dispose(home,c); } else { c->max(v); } n++; return; } else { p = c->nextRef(); c = *p; } } *p = new (home) RangeList(v,v,nullptr); n++; lst = *p; }
forceinline int ValSet::size(void) const { return n; }
forceinline bool ValSet::empty(void) const { return n == 0; }
forceinline int ValSet::min(void) const { return fst->min(); }
forceinline int ValSet::max(void) const { return lst->max(); }
forceinline void ValSet::update(Space& home, ValSet& vs) { if (vs.n > 0) { n = vs.n; // Count number of ranges int m = 0; for (RangeList* c = vs.fst; c != nullptr; c = c->next()) m++; fst = home.alloc<RangeList>(m); lst = fst + (m-1); int i=0; for (RangeList* c = vs.fst; c != nullptr; c = c->next()) { fst[i].min(c->min()); fst[i].max(c->max()); fst[i].next(fst+i+1); i++; } lst->next(nullptr); } }
forceinline void ValSet::flush(void) { fst = lst = nullptr; }
forceinline void ValSet::dispose(Space& home) { if (fst != nullptr) fst->dispose(home,lst); }
forceinline ValSet::Ranges::Ranges(const ValSet& vs) : c(vs.fst) {}
forceinline bool ValSet::Ranges::operator ()(void) const { return c != nullptr; }
forceinline void ValSet::Ranges::operator ++(void) { c = c->next(); }
forceinline int ValSet::Ranges::min(void) const { return c->min(); } forceinline int ValSet::Ranges::max(void) const { return c->max(); }
forceinline unsigned int ValSet::Ranges::width(void) const { return c->width(); }
template<class View> forceinline Iter::Ranges::CompareStatus ValSet::compare(View x) const { if (empty() || (x.max() < min()) || (x.min() > max())) return Iter::Ranges::CS_DISJOINT; ValSet::Ranges vsr(*this); ViewRanges<View> xr(x); return Iter::Ranges::compare(xr,vsr); }
template<class View> forceinline bool ValSet::subset(View x) const { if (empty() || (x.min() < min()) || (x.max() > max())) return false; ValSet::Ranges vsr(*this); ViewRanges<View> xr(x); return Iter::Ranges::subset(xr,vsr); }
}}
// STATISTICS: int-other