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

values-union.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 Union  {
00048   private:
00050     I i;
00052     J j;
00054     int v;
00056     bool done;
00057   private:
00058     IsValueIter<I> constraintI; IsValueIter<J> constraintJ;
00059   public:
00061 
00062 
00063     Union(void);
00065     Union(I& i, J& j);
00067     void init(I& i, J& j);
00069 
00071 
00072 
00073     bool operator ()(void) const;
00075     void operator ++(void);
00077 
00079 
00080 
00081     int val(void) const;
00083   };
00084 
00085 
00086   template<class I, class J>
00087   forceinline
00088   Union<I,J>::Union(void) {}
00089 
00090   template<class I, class J>
00091   forceinline void
00092   Union<I,J>::operator ++(void) {
00093     if (i()) {
00094       if (j()) {
00095         if (i.val() == j.val()) {
00096           v=i.val(); ++i; ++j;
00097         } else if (i.val() < j.val()) {
00098           v=i.val(); ++i;
00099         } else {
00100           v=j.val(); ++j;
00101         }
00102       } else {
00103         v=i.val(); ++i;
00104       }
00105     } else if (j()) {
00106       v=j.val(); ++j;
00107     } else {
00108       done=true;
00109     }
00110   }
00111 
00112   template<class I, class J>
00113   inline void
00114   Union<I,J>::init(I& i0, J& j0) {
00115     i=i0; j=j0; done=false;
00116     operator ++();
00117   }
00118 
00119   template<class I, class J>
00120   forceinline
00121   Union<I,J>::Union(I& i0, J& j0) : i(i0), j(j0), done(false) {
00122     operator ++();
00123   }
00124 
00125   template<class I, class J>
00126   forceinline bool
00127   Union<I,J>::operator ()(void) const {
00128     return !done;
00129   }
00130 
00131   template<class I, class J>
00132   forceinline int
00133   Union<I,J>::val(void) const {
00134     return v;
00135   }
00136 
00137 }}}
00138 
00139 // STATISTICS: iter-any