tuple-set.hpp
Go to the documentation of this file.00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038 #include <sstream>
00039
00040 namespace Gecode {
00041
00042 forceinline bool
00043 TupleSet::TupleSetI::finalized(void) const {
00044 assert(((excess == -1) && (domsize > 0)) ||
00045 ((excess != -1) && (domsize == 0)));
00046 return excess == -1;
00047 }
00048
00049 forceinline
00050 TupleSet::TupleSetI::TupleSetI(void)
00051 : arity(-1),
00052 size(0),
00053 tuples(NULL),
00054 tuple_data(NULL),
00055 data(NULL),
00056 excess(0),
00057 min(Int::Limits::max),
00058 max(Int::Limits::min),
00059 domsize(0),
00060 last(NULL),
00061 nullpointer(NULL)
00062 {}
00063
00064
00065 template<class T>
00066 void
00067 TupleSet::TupleSetI::add(T t) {
00068 assert(arity != -1);
00069 assert(excess != -1);
00070 if (excess == 0) resize();
00071 assert(excess >= 0);
00072 --excess;
00073 int end = size*arity;
00074 for (int i = arity; i--; ) {
00075 data[end+i] = t[i];
00076 if (t[i] < min) min = t[i];
00077 if (t[i] > max) max = t[i];
00078 }
00079 ++size;
00080 }
00081
00082 forceinline
00083 TupleSet::TupleSet(void) {
00084 }
00085
00086 forceinline
00087 TupleSet::TupleSet(const TupleSet& ts)
00088 : SharedHandle(ts) {}
00089
00090 forceinline TupleSet::TupleSetI*
00091 TupleSet::implementation(void) {
00092 TupleSetI* imp = static_cast<TupleSetI*>(object());
00093 assert(imp);
00094 return imp;
00095 }
00096
00097 inline void
00098 TupleSet::add(const IntArgs& tuple) {
00099 TupleSetI* imp = static_cast<TupleSetI*>(object());
00100 if (imp == NULL) {
00101 imp = new TupleSetI;
00102 object(imp);
00103 }
00104 assert(imp->arity == -1 ||
00105 imp->arity == tuple.size());
00106 imp->arity = tuple.size();
00107 imp->add(tuple);
00108 }
00109
00110 forceinline void
00111 TupleSet::finalize(void) {
00112 TupleSetI* imp = static_cast<TupleSetI*>(object());
00113 assert(imp);
00114 if (!imp->finalized()) {
00115 imp->finalize();
00116 }
00117 }
00118
00119 forceinline bool
00120 TupleSet::finalized(void) const {
00121 TupleSetI* imp = static_cast<TupleSetI*>(object());
00122 assert(imp);
00123 return imp->finalized();
00124 }
00125
00126 forceinline int
00127 TupleSet::arity(void) const {
00128 TupleSetI* imp = static_cast<TupleSetI*>(object());
00129 assert(imp);
00130 assert(imp->arity != -1);
00131 return imp->arity;
00132 }
00133 forceinline int
00134 TupleSet::tuples(void) const {
00135 TupleSetI* imp = static_cast<TupleSetI*>(object());
00136 assert(imp);
00137 assert(imp->finalized());
00138 return imp->size-1;
00139 }
00140 forceinline TupleSet::Tuple
00141 TupleSet::operator [](int i) const {
00142 TupleSetI* imp = static_cast<TupleSetI*>(object());
00143 assert(imp);
00144 assert(imp->finalized());
00145 return imp->data + i*imp->arity;
00146 }
00147 forceinline int
00148 TupleSet::min(void) const {
00149 TupleSetI* imp = static_cast<TupleSetI*>(object());
00150 assert(imp);
00151 assert(imp->finalized());
00152 return imp->min;
00153 }
00154 forceinline int
00155 TupleSet::max(void) const {
00156 TupleSetI* imp = static_cast<TupleSetI*>(object());
00157 assert(imp);
00158 assert(imp->finalized());
00159 return imp->max;
00160 }
00161
00162
00163 template<class Char, class Traits, class T>
00164 std::basic_ostream<Char,Traits>&
00165 operator <<(std::basic_ostream<Char,Traits>& os, const TupleSet& ts) {
00166 std::basic_ostringstream<Char,Traits> s;
00167 s.copyfmt(os); s.width(0);
00168 s << "Number of tuples: " << ts.tuples() << std::endl
00169 << "Tuples:" << std::endl;
00170 for (int i = 0; i < ts.tuples(); ++i) {
00171 s << '\t';
00172 for (int j = 0; j < ts.arity(); ++j) {
00173 s.width(3);
00174 s << " " << ts[i][j];
00175 }
00176 s << std::endl;
00177 }
00178 return os << s.str();
00179 }
00180
00181 }
00182
00183
00184