Row add_row();
Row operator[](unsigned);
- Row get_object_row();
+ Row get_objective_row();
bool solve();
float get_variable(unsigned);
private:
void Layout::update()
{
- for(list<Slot *>::iterator i=slots.begin(); i!=slots.end(); ++i)
- {
- (*i)->widget.autosize();
- (*i)->geom = (*i)->widget.get_geometry();
- }
-
solve_constraints(HORIZONTAL);
solve_constraints(VERTICAL);
for(list<Slot *>::iterator i=slots.begin(); i!=slots.end(); ++i)
(*i)->widget.set_geometry((*i)->geom);
-
}
void Layout::solve_constraints(int dir)
float weight = slots.size();
for(list<Slot *>::iterator i=slots.begin(); i!=slots.end(); ++i)
{
- linprog.get_object_row()[(*i)->index*5] = ((*i)->*(ptrs.packing)).gravity/weight;
- linprog.get_object_row()[(*i)->index*5+1] = (((*i)->*(ptrs.packing)).expand ? weight : -1);
+ linprog.get_objective_row()[(*i)->index*5] = ((*i)->*(ptrs.packing)).gravity/weight;
+ linprog.get_objective_row()[(*i)->index*5+1] = (((*i)->*(ptrs.packing)).expand ? weight : -1);
{
// Prevent the widget from going past the container's low edge.
LinearProgram::Row row = linprog.add_row();
row[(*i)->index*5+1] = 1;
row[(*i)->index*5+4] = -1;
- row.back() = (*i)->geom.*(ptrs.dim);
+ row.back() = (*i)->autosize_geom.*(ptrs.dim);
}
/* Add rows for user-defined constraints. Below/above and left/right of
constraints are always added in pairs, so it's only necessary to create a
row for one half. */
for(list<Constraint>::iterator j=(*i)->constraints.begin(); j!=(*i)->constraints.end(); ++j)
- {
if((j->type&1)==dir && j->type!=BELOW && j->type!=LEFT_OF)
{
LinearProgram::Row row = linprog.add_row();
if(j->type&SPACING)
row.back() = this->*(ptrs.spacing);
}
- }
}
if(!linprog.solve())
{
vert_pack.gravity = 1;
widget.signal_autosize_changed.connect(sigc::mem_fun(this, &Slot::autosize_changed));
+ widget.autosize();
+ autosize_geom = widget.get_geometry();
}
void Layout::Slot::autosize_changed()
{
- layout.update();
+ widget.autosize();
+ autosize_geom = widget.get_geometry();
+
+ // If the widget fits in the area it had, just leave it there.
+ if(autosize_geom.w<=geom.w && autosize_geom.h<=geom.h)
+ widget.set_geometry(geom);
+ else
+ layout.update();
}
return Row(*this, r);
}
-Layout::LinearProgram::Row Layout::LinearProgram::get_object_row()
+Layout::LinearProgram::Row Layout::LinearProgram::get_objective_row()
{
return Row(*this, 0);
}
if(i+1>=n_columns)
throw out_of_range("LinearProgram::get_variable");
- unsigned r = columns[i].basic;
- return columns.back().values[r];
+ if(unsigned r = columns[i].basic)
+ return columns.back().values[r];
+ else
+ return 0;
}
bool Layout::LinearProgram::solve()
pricing out the constraint rows. */
for(vector<Column>::iterator i=columns.begin(); i!=columns.end(); ++i)
{
- float objective = i->values.front();
- i->values.front() = 0.0f;
- for(vector<float>::iterator j=i->values.begin(); j!=i->values.end(); ++j)
- i->values.front() += *j;
+ float objective = 0.0f;
+ if(!i->values.empty())
+ {
+ objective = i->values.front();
+ i->values.front() = 0.0f;
+ for(vector<float>::iterator j=i->values.begin(); j!=i->values.end(); ++j)
+ i->values.front() += *j;
+ }
i->values.resize(n_rows+1, 0.0f);
i->values.back() = objective;
}
/* Pick the row with the minimum ratio between the constant column and the
pivot column. This ensures that when the pivot column is made basic, values
in the constant column stay positive.
-
+
The use of n_rows instead of the true size of the column is intentional,
since the relocated objective row must be ignored in phase 1. */
float best = numeric_limits<float>::infinity();
row = i;
}
}
-
+
return row;
}
}
float scale = columns[i].values[r]/columns[c].values[r];
-
+
+ columns[i].values[r] = scale;
for(unsigned j=0; j<columns[i].values.size(); ++j)
- {
- if(j==r)
- columns[i].values[j] = scale;
- else
+ if(j!=r)
columns[i].values[j] -= scale*columns[c].values[j];
- }
}
columns[c].basic = r;