Generated on Tue May 22 09:40:07 2018 for Gecode by doxygen 1.6.3

ranges-negative.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 
00046   template<class I, bool strict=false>
00047   class Negative {
00048   protected:
00050     I i;
00051   public:
00053 
00054 
00055     Negative(void);
00057     Negative(I& i);
00059     void init(I& i);
00061 
00063 
00064 
00065     bool operator ()(void) const;
00067     void operator ++(void);
00069 
00071 
00072 
00073     int min(void) const;
00075     int max(void) const;
00077     unsigned int width(void) const;
00079   };
00080 
00081 
00082   template<class I, bool strict>
00083   forceinline
00084   Negative<I,strict>::Negative(void) {}
00085 
00086   template<class I, bool strict>
00087   forceinline void
00088   Negative<I,strict>::init(I& i0) {
00089     i=i0;
00090   }
00091 
00092   template<class I, bool strict>
00093   forceinline
00094   Negative<I,strict>::Negative(I& i0) : i(i0) {}
00095 
00096   template<class I, bool strict>
00097   forceinline void
00098   Negative<I,strict>::operator ++(void) {
00099     ++i;
00100   }
00101   template<class I, bool strict>
00102   forceinline bool
00103   Negative<I,strict>::operator ()(void) const {
00104     if (strict) {
00105       return i() && (i.min() < 0);
00106     } else {
00107       return i() && (i.min() <= 0);
00108     }
00109   }
00110 
00111   template<class I, bool strict>
00112   forceinline int
00113   Negative<I,strict>::min(void) const {
00114     return i.min();
00115   }
00116   template<class I, bool strict>
00117   forceinline int
00118   Negative<I,strict>::max(void) const {
00119     if (strict) {
00120       return std::min(i.max(),-1);
00121     } else {
00122       return std::min(i.max(),0);
00123     }
00124   }
00125   template<class I, bool strict>
00126   forceinline unsigned int
00127   Negative<I,strict>::width(void) const {
00128     return static_cast<unsigned int>(max()-min()+1);
00129   }
00130 
00131 }}}
00132 
00133 // STATISTICS: iter-any