Generated on Mon Nov 30 23:53:31 2009 for Gecode by doxygen 1.6.1

values-inter.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, class J>
00047   class Inter  {
00048   private:
00050     I i;
00052     J j;
00054     void next(void);
00055   private:
00056     IsValueIter<I> constraintI; IsValueIter<J> constraintJ;
00057   public:
00059 
00060 
00061     Inter(void);
00063     Inter(I& i, J& j);
00065     void init(I& i, J& j);
00067 
00069 
00070 
00071     bool operator ()(void) const;
00073     void operator ++(void);
00075 
00077 
00078 
00079     int val(void) const;
00081   };
00082 
00083 
00084   template<class I, class J>
00085   forceinline
00086   Inter<I,J>::Inter(void) {}
00087 
00088   template<class I, class J>
00089   forceinline void
00090   Inter<I,J>::next(void) {
00091     do {
00092       while (i() && j() && (i.val() < j.val()))
00093         ++i;
00094       while (i() && j() && (j.val() < i.val()))
00095         ++j;
00096     } while (i() && j() && (i.val() != j.val()));
00097   }
00098 
00099   template<class I, class J>
00100   inline void
00101   Inter<I,J>::init(I& i0, J& j0) {
00102     i=i0; j=j0; next();
00103   }
00104 
00105   template<class I, class J>
00106   forceinline
00107   Inter<I,J>::Inter(I& i0, J& j0) : i(i0), j(j0) {
00108     next();
00109   }
00110 
00111   template<class I, class J>
00112   forceinline void
00113   Inter<I,J>::operator ++(void) {
00114     ++i; ++j; next();
00115   }
00116 
00117   template<class I, class J>
00118   forceinline bool
00119   Inter<I,J>::operator ()(void) const {
00120     return i() && j();
00121   }
00122 
00123   template<class I, class J>
00124   forceinline int
00125   Inter<I,J>::val(void) const {
00126     assert(i.val() == j.val());
00127     return i.val();
00128   }
00129 
00130 }}}
00131 
00132 // STATISTICS: iter-any