Generated on Mon Nov 30 23:53:31 2009 for Gecode by doxygen 1.6.1

ranges-singleton-append.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  *     Guido Tack <tack@gecode.org>
00006  *
00007  *  Copyright:
00008  *     Christian Schulte, 2004
00009  *    Guido Tack, 2006
00010  *
00011  *  Last modified:
00012  *     $Date: 2009-09-08 21:10:29 +0200 (Tue, 08 Sep 2009) $ by $Author: schulte $
00013  *     $Revision: 9692 $
00014  *
00015  *  This file is part of Gecode, the generic constraint
00016  *  development environment:
00017  *     http://www.gecode.org
00018  *
00019  *  Permission is hereby granted, free of charge, to any person obtaining
00020  *  a copy of this software and associated documentation files (the
00021  *  "Software"), to deal in the Software without restriction, including
00022  *  without limitation the rights to use, copy, modify, merge, publish,
00023  *  distribute, sublicense, and/or sell copies of the Software, and to
00024  *  permit persons to whom the Software is furnished to do so, subject to
00025  *  the following conditions:
00026  *
00027  *  The above copyright notice and this permission notice shall be
00028  *  included in all copies or substantial portions of the Software.
00029  *
00030  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00031  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00032  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00033  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00034  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00035  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00036  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00037  *
00038  */
00039 
00040 namespace Gecode { namespace Iter { namespace Ranges {
00041 
00050   template<class J>
00051   class SingletonAppend : public MinMax {
00052   private:
00054     IsRangeIter<J> _checkJ;
00055   protected:
00057     J j;
00058   public:
00060 
00061 
00062     SingletonAppend(void);
00064     SingletonAppend(int i0, int i1, J& j);
00066     void init(int i0, int i1, J& j);
00068 
00070 
00071 
00072     void operator ++(void);
00074   };
00075 
00076 
00077   /*
00078    * Binary SingletonAppend
00079    *
00080    */
00081 
00082   template<class J>
00083   inline void
00084   SingletonAppend<J>::operator ++(void) {
00085     if (j()) {
00086       mi = j.min();  ma = j.max();
00087       ++j;
00088     } else {
00089       finish();
00090     }
00091   }
00092 
00093 
00094   template<class J>
00095   forceinline
00096   SingletonAppend<J>::SingletonAppend(void) {}
00097 
00098   template<class J>
00099   forceinline
00100   SingletonAppend<J>::SingletonAppend(int i0, int i1, J& j0)
00101     : j(j0) {
00102     mi=i0; ma=i1;
00103   }
00104 
00105   template<class J>
00106   forceinline void
00107   SingletonAppend<J>::init(int i0, int i1, J& j0) {
00108     mi=i0; ma=i1; j=j0;
00109   }
00110 
00111 }}}
00112 
00113 // STATISTICS: iter-any
00114