/usr/include/gecode/int/extensional/tuple-set.hpp is in libgecode-dev 4.4.0-5.
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 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Mikael Lagerkvist <lagerkvist@gecode.org>
*
* Copyright:
* Mikael Lagerkvist, 2007
*
* Last modified:
* $Date: 2012-04-11 02:34:42 +0200 (Wed, 11 Apr 2012) $ by $Author: tack $
* $Revision: 12728 $
*
* 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.
*
*/
#include <sstream>
namespace Gecode {
forceinline bool
TupleSet::TupleSetI::finalized(void) const {
assert(((excess == -1) && (domsize > 0)) ||
((excess != -1) && (domsize == 0)));
return excess == -1;
}
forceinline
TupleSet::TupleSetI::TupleSetI(void)
: arity(-1),
size(0),
tuples(NULL),
tuple_data(NULL),
data(NULL),
excess(0),
min(Int::Limits::max),
max(Int::Limits::min),
domsize(0),
last(NULL),
nullpointer(NULL)
{}
template<class T>
void
TupleSet::TupleSetI::add(T t) {
assert(arity != -1); // Arity has been set
assert(excess != -1); // Tuples may still be added
if (excess == 0) resize();
assert(excess >= 0);
--excess;
int end = size*arity;
for (int i = arity; i--; ) {
data[end+i] = t[i];
if (t[i] < min) min = t[i];
if (t[i] > max) max = t[i];
}
++size;
}
forceinline
TupleSet::TupleSet(void) {
}
forceinline
TupleSet::TupleSet(const TupleSet& ts)
: SharedHandle(ts) {}
forceinline TupleSet::TupleSetI*
TupleSet::implementation(void) {
TupleSetI* imp = static_cast<TupleSetI*>(object());
assert(imp);
return imp;
}
inline void
TupleSet::add(const IntArgs& tuple) {
TupleSetI* imp = static_cast<TupleSetI*>(object());
if (imp == NULL) {
imp = new TupleSetI;
object(imp);
}
assert(imp->arity == -1 ||
imp->arity == tuple.size());
imp->arity = tuple.size();
imp->add(tuple);
}
forceinline void
TupleSet::finalize(void) {
TupleSetI* imp = static_cast<TupleSetI*>(object());
if (imp == NULL) {
imp = new TupleSetI;
imp->arity = 0;
imp->excess = -1;
imp->domsize = 1;
imp->size = 1;
object(imp);
}
if (!imp->finalized()) {
imp->finalize();
}
}
forceinline bool
TupleSet::finalized(void) const {
TupleSetI* imp = static_cast<TupleSetI*>(object());
assert(imp);
return imp->finalized();
}
forceinline int
TupleSet::arity(void) const {
TupleSetI* imp = static_cast<TupleSetI*>(object());
assert(imp);
assert(imp->arity != -1);
return imp->arity;
}
forceinline int
TupleSet::tuples(void) const {
TupleSetI* imp = static_cast<TupleSetI*>(object());
assert(imp);
assert(imp->finalized());
return imp->size-1;
}
forceinline TupleSet::Tuple
TupleSet::operator [](int i) const {
TupleSetI* imp = static_cast<TupleSetI*>(object());
assert(imp);
assert(imp->finalized());
return imp->data + i*imp->arity;
}
forceinline int
TupleSet::min(void) const {
TupleSetI* imp = static_cast<TupleSetI*>(object());
assert(imp);
assert(imp->finalized());
return imp->min;
}
forceinline int
TupleSet::max(void) const {
TupleSetI* imp = static_cast<TupleSetI*>(object());
assert(imp);
assert(imp->finalized());
return imp->max;
}
template<class Char, class Traits, class T>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const TupleSet& ts) {
std::basic_ostringstream<Char,Traits> s;
s.copyfmt(os); s.width(0);
s << "Number of tuples: " << ts.tuples() << std::endl
<< "Tuples:" << std::endl;
for (int i = 0; i < ts.tuples(); ++i) {
s << '\t';
for (int j = 0; j < ts.arity(); ++j) {
s.width(3);
s << " " << ts[i][j];
}
s << std::endl;
}
return os << s.str();
}
}
// STATISTICS: int-prop
|