- int nc = numkids * 2 + cols * 3 + 1 + 2;
- if (coeff == null || nc+1>coeff.length) coeff = new float[nc+1];
- LinearProgramming.Simplex lp_h = new LinearProgramming.Simplex();
- LinearProgramming.Problem lpr_h = new LinearProgramming.Problem(nc, nc);
- LinearProgramming.Simplex lp_v = new LinearProgramming.Simplex();
- LinearProgramming.Problem lpr_v = new LinearProgramming.Problem(nc, nc);
-
- //#repeat col/row colspan/rowspan contentwidth/contentheight width/height colMaxWidth/rowMaxHeight colWidth/rowHeight \
- // HSHRINK/VSHRINK maxwidth/maxheight cols/rows minwidth/minheight colWidth/rowHeight x_slack/y_slack lp_h/lp_v lpr_h/lpr_v
- do {
- // objective function
- coeff[cols*2+numkids] = coeff[cols*2+numkids+1] = (float)-10000.0; // attempt to make sum of columns equal to parent width
- for(int i=cols*2; i<cols*2+numkids; i++) coeff[i] = (float)100.0; // second priority: try to honor maxwidths
- for(int i=cols; i<cols*2; i++) coeff[i] = (float)(-1.0); // third priority: try to make all columns similar size
- lp_h.set_obj_fn(lpr_h, coeff);
- lp_h.set_maxim(lpr_h);
-
- // top priority: try to match the parent's width
- for(int i=0; i<coeff.length; i++) coeff[i] = (i<cols) ? (float)1.0 : (float)0.0;
- coeff[cols*2+numkids] = (float)-1.0;
- lp_h.add_constraint(lpr_h, coeff, LinearProgramming.LE, (float)width);
-
- for(int i=0; i<coeff.length; i++) coeff[i] = (i<cols) ? (float)1.0 : (float)0.0;
- coeff[cols*2+numkids+1] = (float)1.0;
- lp_h.add_constraint(lpr_h, coeff, LinearProgramming.GE, (float)width);
-
- // obey minwidth, second priority: try to obey maxwidth (if relevant)
+ int numregions = 0, numregions_v = 0;
+ //#repeat col/row colspan/rowspan contentwidth/contentheight width/height HSHRINK/VSHRINK numregions/numregions_v \
+ // maxwidth/maxheight cols/rows minwidth/minheight lp_h/lp lp_h/lp easy_width/easy_height regions/regions_v
+ if (cols > 1) do {
+ /* boolean easy_width = contentwidth >= width; */
+ for(Box c = firstPackedChild(); c != null; c = c.nextPackedSibling()) {
+ breakpoints[c.col] = true;
+ breakpoints[min(cols, c.col+c.colspan)] = true;
+ }
+ numregions = 0;
+ // FIXME: depends on cols
+ for(int i=0; i<cols; i++) if (breakpoints[i]) regions[numregions++] = i;
+ regions[numregions] = cols;
+ for(int i=0; i<numkids; i++) breakpoints[i] = false;
+ /*
+ for(Box c = firstPackedChild(); easy_width && c != null; c = c.nextPackedSibling()) {
+ if (c.contentwidth == c.maxwidth) continue;
+ if (c.maxwidth == Integer.MAX_VALUE) continue;
+ easy_width = false;
+ }
+ if (easy_width) for(int i=0; i<cols; i++) {
+ easy_width = false;
+ boolean good = true;
+ for(Box c = firstPackedChild(); good && c != null; c = c.nextPackedSibling())
+ if (c.col <= i && c.col + c.colspan > i && c.maxwidth < Integer.MAX_VALUE)
+ good = false;
+ if (good) { easy_width = true; break; }
+ }
+ if (easy_width) break;
+ */
+ int nc = numregions * 2 + numkids + 1;
+ if (coeff == null || nc+1>coeff.length) coeff = new float[nc+1];
+ lp_h.init(nc);
+
+ for(int i=0; i<coeff.length; i++) coeff[i] = (float)0.0;
+ coeff[numregions*2+numkids] = (float)10000.0; // priority 1: sum of columns no greater than parent
+ for(int i=numregions*2; i<numregions*2+numkids; i++) coeff[i] = (float)100.0; // priority 2: honor maxwidths
+ for(int i=numregions; i<numregions*2; i++) coeff[i] = (float)(0.1); // priority 3: equalize columns
+ lp_h.setObjective(coeff, false);
+
+ for(int i=0; i<numregions; i++) lp_h.set_lowbo(i+1, (float)0.0); // invariant: columns cannot have negative size
+
+ // invariant: columns must be at least as large as parent
+ for(int i=0; i<coeff.length; i++) coeff[i] = (i<numregions) ? (float)(regions[i+1] - regions[i]) : (float)0.0;
+ lp_h.add_constraint(coeff, LinearProgramming.GE, (float)width);
+
+ // priority 1: sum of columns as close to parent's width as possible
+ for(int i=0; i<coeff.length; i++) coeff[i] = (i<numregions) ? (float)(regions[i+1] - regions[i]) : (float)0.0;
+ coeff[numregions*2+numkids] = (float)-1.0;
+ lp_h.add_constraint(coeff, LinearProgramming.EQ, (float)width);
+