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

ranges-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  *  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 #include <algorithm>
00035 
00036 namespace Gecode { namespace Iter { namespace Ranges {
00037 
00045   template<class I, bool strict=false>
00046   class Positive {
00047   protected:
00049     I i;
00050   public:
00052 
00053 
00054     Positive(void);
00056     Positive(I& i);
00058     void init(I& i);
00060 
00062 
00063 
00064     bool operator ()(void) const;
00066     void operator ++(void);
00068 
00070 
00071 
00072     int min(void) const;
00074     int max(void) const;
00076     unsigned int width(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.max() < 0)) ++i;
00091     } else {
00092       while (i() && (i.max() <= 0)) ++i;
00093     }
00094   }
00095 
00096   template<class I, bool strict>
00097   forceinline
00098   Positive<I,strict>::Positive(I& i) {
00099     init(i);
00100   }
00101 
00102   template<class I, bool strict>
00103   forceinline void
00104   Positive<I,strict>::operator ++(void) {
00105     ++i;
00106   }
00107   template<class I, bool strict>
00108   forceinline bool
00109   Positive<I,strict>::operator ()(void) const {
00110     return i();
00111   }
00112 
00113   template<class I, bool strict>
00114   forceinline int
00115   Positive<I,strict>::min(void) const {
00116     if (strict) {
00117       return std::max(i.min(),1);
00118     } else {
00119       return std::max(i.min(),0);
00120     }
00121   }
00122   template<class I, bool strict>
00123   forceinline int
00124   Positive<I,strict>::max(void) const {
00125     return i.max();
00126   }
00127   template<class I, bool strict>
00128   forceinline unsigned int
00129   Positive<I,strict>::width(void) const {
00130     return static_cast<unsigned int>(max()-min()+1);
00131   }
00132 
00133 }}}
00134 
00135 // STATISTICS: iter-any