Generated on Wed Feb 7 10:28:04 2018 for Gecode by doxygen 1.6.3

ranges-size.hpp

Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
00002 /*
00003  *  Main authors:
00004  *     Guido Tack <tack@gecode.org>
00005  *
00006  *  Copyright:
00007  *     Guido Tack, 2006
00008  *
00009  *  Last modified:
00010  *     $Date: 2010-07-28 17:35:33 +0200 (Wed, 28 Jul 2010) $ by $Author: schulte $
00011  *     $Revision: 11294 $
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 Ranges {
00039 
00049   template<class I>
00050   class Size {
00051   protected:
00053     I i;
00055     unsigned int _size;
00056   public:
00058 
00059 
00060     Size(void);
00062     Size(I& i);
00064     void init(I& i);
00066 
00068 
00069 
00070     bool operator ()(void);
00072     void operator ++(void);
00074 
00076 
00077 
00078     int min(void) const;
00080     int max(void) const;
00082     unsigned int width(void) const;
00084 
00086 
00087 
00088     unsigned int size(void) const;
00090   };
00091 
00092 
00093   template<class I>
00094   forceinline
00095   Size<I>::Size(void)
00096     : _size(0) {}
00097 
00098   template<class I>
00099   inline void
00100   Size<I>::init(I& i0) {
00101     i.init(i0);
00102     _size = 0;
00103   }
00104 
00105   template<class I>
00106   inline
00107   Size<I>::Size(I& i0) : i(i0), _size(0) {}
00108 
00109   template<class I>
00110   forceinline void
00111   Size<I>::operator ++(void) {
00112     _size += i.width();
00113     ++i;
00114   }
00115   template<class I>
00116   forceinline bool
00117   Size<I>::operator ()(void) {
00118     return i();
00119   }
00120 
00121   template<class I>
00122   forceinline int
00123   Size<I>::min(void) const {
00124     return i.min();
00125   }
00126   template<class I>
00127   forceinline int
00128   Size<I>::max(void) const {
00129     return i.max();
00130   }
00131   template<class I>
00132   forceinline unsigned int
00133   Size<I>::width(void) const {
00134     return i.width();
00135   }
00136 
00137   template<class I>
00138   forceinline unsigned int
00139   Size<I>::size(void) const {
00140     return _size;
00141   }
00142 
00143 }}}
00144 
00145 // STATISTICS: iter-any
00146