Generated on Fri May 13 2011 22:41:20 for Gecode by doxygen 1.7.1

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  *  Last modified:
00010  *     $Date: 2010-07-28 16:13:53 +0200 (Wed, 28 Jul 2010) $ by $Author: schulte $
00011  *     $Revision: 11292 $
00012  *
00013  *  This file is part of Gecode, the generic constraint
00014  *  development environment:
00015  *     http://www.gecode.org
00016  *
00017  *  Permission is hereby granted, free of charge, to any person obtaining
00018  *  a copy of this software and associated documentation files (the
00019  *  "Software"), to deal in the Software without restriction, including
00020  *  without limitation the rights to use, copy, modify, merge, publish,
00021  *  distribute, sublicense, and/or sell copies of the Software, and to
00022  *  permit persons to whom the Software is furnished to do so, subject to
00023  *  the following conditions:
00024  *
00025  *  The above copyright notice and this permission notice shall be
00026  *  included in all copies or substantial portions of the Software.
00027  *
00028  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00029  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00030  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00031  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00032  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00033  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00034  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00035  *
00036  */
00037 
00038 namespace Gecode { namespace Iter { namespace Ranges {
00039 
00051   template<class I>
00052   class Minus : public RangeListIter {
00053   public:
00055 
00056 
00057     Minus(void);
00059     Minus(const Minus& m);
00061     Minus(Region& r, I& i);
00063     void init(Region& r, I& i);
00065     Minus& operator =(const Minus& m);
00067   };
00068 
00069 
00070   template<class I>
00071   forceinline
00072   Minus<I>::Minus(void) {}
00073 
00074   template<class I>
00075   forceinline
00076   Minus<I>::Minus(const Minus& m) 
00077     : RangeListIter(m) {}
00078 
00079   template<class I>
00080   void
00081   Minus<I>::init(Region& r, I& i) {
00082     RangeListIter::init(r);
00083     RangeList* p = NULL;
00084     for (; i(); ++i) {
00085       RangeList* t = new (*rlio) RangeList;
00086       t->next = p;
00087       t->min = -i.max();
00088       t->max = -i.min();
00089       p = t;
00090     }
00091     RangeListIter::set(p);
00092   }
00093 
00094   template<class I>
00095   forceinline
00096   Minus<I>::Minus(Region& r, I& i) {
00097     init(r,i);
00098   }
00099 
00100   template<class I>
00101   forceinline Minus<I>&
00102   Minus<I>::operator =(const Minus<I>& m) {
00103     return static_cast<Minus&>(RangeListIter::operator =(m));
00104   }
00105 
00106 }}}
00107 
00108 // STATISTICS: iter-any
00109