38 namespace Gecode {
namespace Int {
namespace Sorted {
67 for (
int z = 0; z < xs; z++) {
68 int maxy = y[z].max();
70 for( ; s <xs && x[s].min() <= maxy; s++) {
77 for (
int i = 0;
i < xs;
i++) {
81 int iter = seq[perm].iset;
91 if (x[perm].
max() < y[j].
min())
95 int sqjsucc = seq[j].succ;
97 seq.
unite(j,sqjsucc,sqjsucc);
99 seq[seq[j].root].name = sqjsucc;
103 int pr = seq[j].pred;
105 seq[pr].succ = sqjsucc;
107 seq[sqjsucc].pred = pr;
128 for (
int z = xs; z--; ) {
131 for ( ; s > -1 && x[tau[s]].max() >= miny; s--) {
132 seq[tau[s]].iset = z;
138 for (
int i = xs;
i--; ) {
140 int iter = seq[perm].iset;
149 if (x[perm].
min() > y[j].
max())
153 int sqjsucc = seq[j].pred;
155 seq.
unite(j, sqjsucc, sqjsucc);
157 seq[seq[j].root].name = sqjsucc;
161 int pr = seq[j].succ;
163 seq[pr].pred = sqjsucc;
165 seq[sqjsucc].succ = pr;