/usr/include/gecode/iter/ranges-minus.hpp is in libgecode-dev 3.7.3-1.
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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2004
*
* Last modified:
* $Date: 2011-08-09 02:04:53 +1000 (Tue, 09 Aug 2011) $ by $Author: schulte $
* $Revision: 12253 $
*
* 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 pointwise minus of a range iterator
*
* This iterator in effect changes the order of how ranges
* are iterated: the first range of the input iterator defines
* the last range of the Minus iterator. Upon initialization
* all ranges of the input iterator are stored
* which later allows iteration in inverse direction.
*
* \ingroup FuncIterRanges
*/
class Minus : public RangeListIter {
public:
/// \name Constructors and initialization
//@{
/// Default constructor
Minus(void);
/// Copy constructor
Minus(const Minus& m);
/// Initialize with ranges from \a i
template<class I>
Minus(Region& r, I& i);
/// Initialize with ranges from \a i
template<class I>
void init(Region& r, I& i);
/// Assignment operator
Minus& operator =(const Minus& m);
//@}
};
forceinline
Minus::Minus(void) {}
forceinline
Minus::Minus(const Minus& m)
: RangeListIter(m) {}
template<class I>
void
Minus::init(Region& r, I& i) {
RangeListIter::init(r);
RangeList* p = NULL;
for (; i(); ++i) {
RangeList* t = new (*rlio) RangeList;
t->next = p;
t->min = -i.max();
t->max = -i.min();
p = t;
}
RangeListIter::set(p);
}
template<class I>
forceinline
Minus::Minus(Region& r, I& i) {
init(r,i);
}
forceinline Minus&
Minus::operator =(const Minus& m) {
return static_cast<Minus&>(RangeListIter::operator =(m));
}
}}}
// STATISTICS: iter-any
|