ranges-singleton-append.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 * Guido Tack <tack@gecode.org> 00006 * 00007 * Copyright: 00008 * Christian Schulte, 2004 00009 * Guido Tack, 2006 00010 * 00011 * Last modified: 00012 * $Date: 2010-07-28 17:35:33 +0200 (Wed, 28 Jul 2010) $ by $Author: schulte $ 00013 * $Revision: 11294 $ 00014 * 00015 * This file is part of Gecode, the generic constraint 00016 * development environment: 00017 * http://www.gecode.org 00018 * 00019 * Permission is hereby granted, free of charge, to any person obtaining 00020 * a copy of this software and associated documentation files (the 00021 * "Software"), to deal in the Software without restriction, including 00022 * without limitation the rights to use, copy, modify, merge, publish, 00023 * distribute, sublicense, and/or sell copies of the Software, and to 00024 * permit persons to whom the Software is furnished to do so, subject to 00025 * the following conditions: 00026 * 00027 * The above copyright notice and this permission notice shall be 00028 * included in all copies or substantial portions of the Software. 00029 * 00030 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00031 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00032 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00033 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00034 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00035 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00036 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00037 * 00038 */ 00039 00040 namespace Gecode { namespace Iter { namespace Ranges { 00041 00050 template<class J> 00051 class SingletonAppend : public MinMax { 00052 protected: 00054 J j; 00055 public: 00057 00058 00059 SingletonAppend(void); 00061 SingletonAppend(int i0, int i1, J& j); 00063 void init(int i0, int i1, J& j); 00065 00067 00068 00069 void operator ++(void); 00071 }; 00072 00073 00074 /* 00075 * Binary SingletonAppend 00076 * 00077 */ 00078 00079 template<class J> 00080 inline void 00081 SingletonAppend<J>::operator ++(void) { 00082 if (j()) { 00083 mi = j.min(); ma = j.max(); 00084 ++j; 00085 } else { 00086 finish(); 00087 } 00088 } 00089 00090 00091 template<class J> 00092 forceinline 00093 SingletonAppend<J>::SingletonAppend(void) {} 00094 00095 template<class J> 00096 forceinline 00097 SingletonAppend<J>::SingletonAppend(int i0, int i1, J& j0) 00098 : j(j0) { 00099 mi=i0; ma=i1; 00100 } 00101 00102 template<class J> 00103 forceinline void 00104 SingletonAppend<J>::init(int i0, int i1, J& j0) { 00105 mi=i0; ma=i1; j=j0; 00106 } 00107 00108 }}} 00109 00110 // STATISTICS: iter-any 00111