46 namespace Gecode {
namespace Float {
namespace Linear {
52 est += t[
i].
a * t[
i].
x.domain();
85 et[
n].
a=-1.0; et[
n].
x=
x;
116 if (t[
i].
x.assigned()) {
131 Support::quicksort<Term,TermLess>(
t,
n,tl);
140 while ((++i < n) &&
same(t[i].x,x)) {
145 t[j].a =
a; t[j].x =
x; j++;
162 while ((t[j].
a < 0) && (--j >= 0)) ;
163 while ((t[i].
a > 0) && (++i < n)) ;
165 std::swap(t[i],t[j]);
168 t_n = t+n_p; n_n = n-n_p;
178 for (
int i=n_n;
i--; )
179 t_n[
i].
a = -t_n[
i].
a;
183 std::swap(n_p,n_n); std::swap(t_p,t_n); c = -
c;
209 for (
int i = n_p;
i--; )
212 for (
int i = n_n;
i--; )
214 post_nary<FloatView>(home,
x,y,frt,
c);
218 for (
int i = n_p;
i--; )
221 for (
int i = n_n;
i--; )
223 post_nary<ScaleView>(home,
x,y,frt,
c);
240 dopost(home, t, n, frt, c);
246 rel(home,
extend(home,re,t,n), frt, c, r);