/usr/include/gecode/iter/ranges-singleton-append.hpp is in libgecode-dev 3.7.1-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Christian Schulte, 2004
* Guido Tack, 2006
*
* Last modified:
* $Date: 2010-07-28 17:35:33 +0200 (Wed, 28 Jul 2010) $ by $Author: schulte $
* $Revision: 11294 $
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
namespace Gecode { namespace Iter { namespace Ranges {
/**
* \brief %Range iterator for appending a singleton with a range iterator
*
* The singleton is not allowed to be adjacent to the iterator.
*
* \ingroup FuncIterRanges
*/
template<class J>
class SingletonAppend : public MinMax {
protected:
/// Iterator to be appended
J j;
public:
/// \name Constructors and initialization
//@{
/// Default constructor
SingletonAppend(void);
/// Initialize with singleton (\a i0, \a i1) and iterator \a j
SingletonAppend(int i0, int i1, J& j);
/// Initialize with singleton (\a i0, \a i1) and iterator \a j
void init(int i0, int i1, J& j);
//@}
/// \name Iteration control
//@{
/// Move iterator to next range (if possible)
void operator ++(void);
//@}
};
/*
* Binary SingletonAppend
*
*/
template<class J>
inline void
SingletonAppend<J>::operator ++(void) {
if (j()) {
mi = j.min(); ma = j.max();
++j;
} else {
finish();
}
}
template<class J>
forceinline
SingletonAppend<J>::SingletonAppend(void) {}
template<class J>
forceinline
SingletonAppend<J>::SingletonAppend(int i0, int i1, J& j0)
: j(j0) {
mi=i0; ma=i1;
}
template<class J>
forceinline void
SingletonAppend<J>::init(int i0, int i1, J& j0) {
mi=i0; ma=i1; j=j0;
}
}}}
// STATISTICS: iter-any
|