Generated on Fri Oct 19 11:25:10 2018 for Gecode by doxygen 1.6.3

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  *  This file is part of Gecode, the generic constraint
00012  *  development environment:
00013  *     http://www.gecode.org
00014  *
00015  *  Permission is hereby granted, free of charge, to any person obtaining
00016  *  a copy of this software and associated documentation files (the
00017  *  "Software"), to deal in the Software without restriction, including
00018  *  without limitation the rights to use, copy, modify, merge, publish,
00019  *  distribute, sublicense, and/or sell copies of the Software, and to
00020  *  permit persons to whom the Software is furnished to do so, subject to
00021  *  the following conditions:
00022  *
00023  *  The above copyright notice and this permission notice shall be
00024  *  included in all copies or substantial portions of the Software.
00025  *
00026  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00027  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00028  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00029  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00030  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00031  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00032  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00033  *
00034  */
00035 
00036 namespace Gecode { namespace Iter { namespace Ranges {
00037 
00046   template<class J>
00047   class SingletonAppend : public MinMax {
00048   protected:
00050     J j;
00051   public:
00053 
00054 
00055     SingletonAppend(void);
00057     SingletonAppend(int i0, int i1, J& j);
00059     void init(int i0, int i1, J& j);
00061 
00063 
00064 
00065     void operator ++(void);
00067   };
00068 
00069 
00070   /*
00071    * Binary SingletonAppend
00072    *
00073    */
00074 
00075   template<class J>
00076   inline void
00077   SingletonAppend<J>::operator ++(void) {
00078     if (j()) {
00079       mi = j.min();  ma = j.max();
00080       ++j;
00081     } else {
00082       finish();
00083     }
00084   }
00085 
00086 
00087   template<class J>
00088   forceinline
00089   SingletonAppend<J>::SingletonAppend(void) {}
00090 
00091   template<class J>
00092   forceinline
00093   SingletonAppend<J>::SingletonAppend(int i0, int i1, J& j0)
00094     : j(j0) {
00095     mi=i0; ma=i1;
00096   }
00097 
00098   template<class J>
00099   forceinline void
00100   SingletonAppend<J>::init(int i0, int i1, J& j0) {
00101     mi=i0; ma=i1; j=j0;
00102   }
00103 
00104 }}}
00105 
00106 // STATISTICS: iter-any
00107