38 #ifndef __GECODE_SEARCH_META_NO_GOODS_HH__
39 #define __GECODE_SEARCH_META_NO_GOODS_HH__
43 namespace Gecode {
namespace Search {
namespace Meta {
100 :
NGL(home,share,ngl) {}
111 while ((l != NULL) && l->
leaf()) {
113 notice = notice || l->
notice();
119 while (!notice && (l != NULL)) {
120 notice = notice || l->
notice();
130 assert(p.
root != NULL);
133 for (
NGL* pc = p.
root; pc != NULL; pc = pc->
next()) {
134 NGL*
n = pc->copy(home,shared);
147 int n =
std::min(p.ds.entries(),p.ngdl());
149 unsigned long int n_nogood = 0;
152 while ((n > s) && (p.ds[n-1].truealt() == 0U))
161 while ((s < n) && (p.ds[s].truealt() > 0U))
163 if (p.ds[s].rightmost()) {
165 home.
trycommit(*p.ds[s].choice(),p.ds[s].truealt());
169 for (
unsigned int a=0U;
a<p.ds[s].truealt();
a++) {
170 NGL*
l = home.
ngl(*p.ds[s].choice(),
a);
177 if (
NGL*
l = home.
ngl(*p.ds[s].choice(),p.ds[s].truealt())) {
191 ((n-s == 1) && (c != &nn)));
197 for (
int i=s;
i<
n;
i++) {
199 for (
unsigned int a=0U;
a<p.ds[
i].truealt();
a++) {
208 c = c->
add(l,
true); ll =
c;
212 if (
NGL*
l = home.
ngl(*p.ds[
i].choice(),p.ds[
i].truealt())) {
214 }
else if (!p.ds[
i].rightmost()) {