1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 2 /* 3 * Main authors: 4 * Christian Schulte <schulte@gecode.org> 5 * 6 * Copyright: 7 * Christian Schulte, 2004 8 * 9 * This file is part of Gecode, the generic constraint 10 * development environment: 11 * http://www.gecode.org 12 * 13 * Permission is hereby granted, free of charge, to any person obtaining 14 * a copy of this software and associated documentation files (the 15 * "Software"), to deal in the Software without restriction, including 16 * without limitation the rights to use, copy, modify, merge, publish, 17 * distribute, sublicense, and/or sell copies of the Software, and to 18 * permit persons to whom the Software is furnished to do so, subject to 19 * the following conditions: 20 * 21 * The above copyright notice and this permission notice shall be 22 * included in all copies or substantial portions of the Software. 23 * 24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 31 * 32 */ 33 34 namespace Gecode { namespace Iter { namespace Ranges { 35 36 /** 37 * \brief Range iterator for empty range 38 * 39 * \ingroup FuncIterRanges 40 */ 41 42 class Empty { 43 public: 44 /// \name Constructors and initialization 45 //@{ 46 /// Default constructor 47 Empty(void); 48 /// Initialize 49 void init(void); 50 //@} 51 52 /// \name Iteration control 53 //@{ 54 /// Test whether iterator is still at a range or done 55 bool operator ()(void) const; 56 /// Move iterator to next range (if possible) 57 void operator ++(void); 58 //@} 59 60 /// \name Range access 61 //@{ 62 /// Return smallest value of range 63 int min(void) const; 64 /// Return largest value of range 65 int max(void) const; 66 /// Return width of range (distance between minimum and maximum) 67 unsigned int width(void) const; 68 //@} 69 }; 70 71 72 forceinline Empty(void)73 Empty::Empty(void) {} 74 75 forceinline void init(void)76 Empty::init(void) {} 77 78 forceinline void operator ++(void)79 Empty::operator ++(void) { 80 GECODE_NEVER; 81 } 82 83 forceinline bool operator ()(void) const84 Empty::operator ()(void) const { 85 return false; 86 } 87 88 forceinline int min(void) const89 Empty::min(void) const { 90 GECODE_NEVER; 91 return 0; 92 } 93 forceinline int max(void) const94 Empty::max(void) const { 95 GECODE_NEVER; 96 return 0; 97 } 98 forceinline unsigned int width(void) const99 Empty::width(void) const { 100 GECODE_NEVER; 101 return 0; 102 } 103 104 }}} 105 106 // STATISTICS: iter-any 107 108