Generated on Mon May 10 06:46:42 2010 for Gecode by doxygen 1.6.3

values-positive.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, 2008
00008  *
00009  *  Last modified:
00010  *     $Date: 2009-09-08 21:10:29 +0200 (Tue, 08 Sep 2009) $ by $Author: schulte $
00011  *     $Revision: 9692 $
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 Values {
00039 
00046   template<class I, bool strict=false>
00047   class Positive {
00048   private:
00050     IsValueIter<I> _checkI;
00051   protected:
00053     I i;
00054   public:
00056 
00057 
00058     Positive(void);
00060     Positive(I& i);
00062     void init(I& i);
00064 
00066 
00067 
00068     bool operator ()(void) const;
00070     void operator ++(void);
00072 
00074 
00075 
00076     int val(void) const;
00078   };
00079 
00080 
00081   template<class I, bool strict>
00082   forceinline
00083   Positive<I,strict>::Positive(void) {}
00084 
00085   template<class I, bool strict>
00086   forceinline void
00087   Positive<I,strict>::init(I& i0) {
00088     i=i0;
00089     if (strict) {
00090       while (i() && (i.val() <= 0)) ++i;
00091     } else {
00092       while (i() && (i.val() < 0)) ++i;
00093     }
00094   }
00095 
00096   template<class I, bool strict>
00097   forceinline
00098   Positive<I,strict>::Positive(I& i0) : i(i0) {
00099     if (strict) {
00100       while (i() && (i.val() <= 0)) ++i;
00101     } else {
00102       while (i() && (i.val() < 0)) ++i;
00103     }
00104   }
00105 
00106   template<class I, bool strict>
00107   forceinline void
00108   Positive<I,strict>::operator ++(void) {
00109     ++i;
00110   }
00111   template<class I, bool strict>
00112   forceinline bool
00113   Positive<I,strict>::operator ()(void) const {
00114     return i();
00115   }
00116 
00117   template<class I, bool strict>
00118   forceinline int
00119   Positive<I,strict>::val(void) const {
00120     return i.val();
00121   }
00122 
00123 }}}
00124 
00125 // STATISTICS: iter-any
00126