ranges-minus.hpp
Go to the documentation of this file.00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2004 00008 * 00009 * This file is part of Gecode, the generic constraint 00010 * development environment: 00011 * http://www.gecode.org 00012 * 00013 * Permission is hereby granted, free of charge, to any person obtaining 00014 * a copy of this software and associated documentation files (the 00015 * "Software"), to deal in the Software without restriction, including 00016 * without limitation the rights to use, copy, modify, merge, publish, 00017 * distribute, sublicense, and/or sell copies of the Software, and to 00018 * permit persons to whom the Software is furnished to do so, subject to 00019 * the following conditions: 00020 * 00021 * The above copyright notice and this permission notice shall be 00022 * included in all copies or substantial portions of the Software. 00023 * 00024 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00025 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00026 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00027 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00028 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00029 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00030 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00031 * 00032 */ 00033 00034 namespace Gecode { namespace Iter { namespace Ranges { 00035 00047 class Minus : public RangeListIter { 00048 public: 00050 00051 00052 Minus(void); 00054 Minus(const Minus& m); 00056 template<class I> 00057 Minus(Region& r, I& i); 00059 template<class I> 00060 void init(Region& r, I& i); 00062 Minus& operator =(const Minus& m); 00064 }; 00065 00066 00067 forceinline 00068 Minus::Minus(void) {} 00069 00070 forceinline 00071 Minus::Minus(const Minus& m) 00072 : RangeListIter(m) {} 00073 00074 template<class I> 00075 void 00076 Minus::init(Region& r, I& i) { 00077 RangeListIter::init(r); 00078 RangeList* p = NULL; 00079 for (; i(); ++i) { 00080 RangeList* t = new (*rlio) RangeList; 00081 t->next = p; 00082 t->min = -i.max(); 00083 t->max = -i.min(); 00084 p = t; 00085 } 00086 RangeListIter::set(p); 00087 } 00088 00089 template<class I> 00090 forceinline 00091 Minus::Minus(Region& r, I& i) { 00092 init(r,i); 00093 } 00094 00095 forceinline Minus& 00096 Minus::operator =(const Minus& m) { 00097 return static_cast<Minus&>(RangeListIter::operator =(m)); 00098 } 00099 00100 }}} 00101 00102 // STATISTICS: iter-any 00103