Generated on Thu Mar 22 10:39:42 2012 for Gecode by doxygen 1.6.3

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: 2011-02-01 14:31:23 +0100 (Tue, 01 Feb 2011) $ by $Author: schulte $
00011  *     $Revision: 11595 $
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   protected:
00050     I i;
00052     J j;
00054     int v;
00056     bool done;
00057   public:
00059 
00060 
00061     Union(void);
00063     Union(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   Union<I,J>::Union(void) : v(0) {}
00087 
00088   template<class I, class J>
00089   forceinline void
00090   Union<I,J>::operator ++(void) {
00091     if (i()) {
00092       if (j()) {
00093         if (i.val() == j.val()) {
00094           v=i.val(); ++i; ++j;
00095         } else if (i.val() < j.val()) {
00096           v=i.val(); ++i;
00097         } else {
00098           v=j.val(); ++j;
00099         }
00100       } else {
00101         v=i.val(); ++i;
00102       }
00103     } else if (j()) {
00104       v=j.val(); ++j;
00105     } else {
00106       done=true;
00107     }
00108   }
00109 
00110   template<class I, class J>
00111   inline void
00112   Union<I,J>::init(I& i0, J& j0) {
00113     i=i0; j=j0; v=0; done=false;
00114     operator ++();
00115   }
00116 
00117   template<class I, class J>
00118   forceinline
00119   Union<I,J>::Union(I& i0, J& j0) : i(i0), j(j0), v(0), done(false) {
00120     operator ++();
00121   }
00122 
00123   template<class I, class J>
00124   forceinline bool
00125   Union<I,J>::operator ()(void) const {
00126     return !done;
00127   }
00128 
00129   template<class I, class J>
00130   forceinline int
00131   Union<I,J>::val(void) const {
00132     return v;
00133   }
00134 
00135 }}}
00136 
00137 // STATISTICS: iter-any