gecode » iter
values-minus.hpp

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, 2007
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 
00052   template<class I>
00053   class Minus {
00054   private:
00056     IsValueIter<I> _checkI;
00057   private:
00059     SharedArray<int> v;
00061     int c;
00062   public:
00064 
00065 
00066     Minus(void);
00068     Minus(I& i);
00070     void init(I& i);
00072 
00074 
00075 
00076     bool operator ()(void) const;
00078     void operator ++(void);
00080 
00082 
00083 
00084     int val(void) const;
00086   };
00087 
00088 
00089   template<class I>
00090   forceinline
00091   Minus<I>::Minus(void) {}
00092 
00093   template<class I>
00094   inline void
00095   Minus<I>::init(I& i) {
00096     Support::DynamicArray<int,Heap> d(heap);
00097     int n=0;
00098     while (i()) {
00099       d[n] = -i.val();
00100       ++n; ++i;
00101     }
00102     v.init(n);
00103     for (int j=n; j--; )
00104       v[j]=d[j];
00105     c = n-1;
00106   }
00107 
00108   template<class I>
00109   forceinline
00110   Minus<I>::Minus(I& i) {
00111     init(i);
00112   }
00113 
00114   template<class I>
00115   forceinline void
00116   Minus<I>::operator ++(void) {
00117     c--;
00118   }
00119   template<class I>
00120   forceinline bool
00121   Minus<I>::operator ()(void) const {
00122     return c >= 0;
00123   }
00124 
00125   template<class I>
00126   forceinline int
00127   Minus<I>::val(void) const {
00128     return v[c];
00129   }
00130 
00131 }}}
00132 
00133 // STATISTICS: iter-any