Row add_row();
Row operator[](unsigned);
- Row get_object_row();
+ Row get_objective_row();
bool solve();
float get_variable(unsigned);
private:
void Layout::set_container(Container &c)
{
if(container)
- throw InvalidState("This layout is already assigned to a Container");
+ throw logic_error("container!=0");
container = &c;
}
void Layout::add_widget(Widget &wdg)
{
if(!container)
- throw InvalidState("Can't add Widgets without a Container");
+ throw logic_error("!container");
Slot *slot = create_slot(wdg);
for(list<Constraint>::iterator i=slot->constraints.begin(); i!=slot->constraints.end(); ++i)
if(&(*i)->widget==&wdg)
return **i;
- throw InvalidParameterValue("Widget is not in the Layout");
+ throw hierarchy_error("widget not in layout");
}
Layout::ConstraintType Layout::complement(ConstraintType type)
void Layout::add_constraint(Widget &src, ConstraintType type, Widget &tgt)
{
if(&src==&tgt)
- throw InvalidParameterValue("Can't add a self-referencing constraint");
+ throw invalid_argument("&src==&tgt");
Slot &src_slot = get_slot_for_widget(src);
Slot &tgt_slot = get_slot_for_widget(tgt);
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)
{
Pointers &ptrs = pointers[dir&VERTICAL];
+ /* Set up a linear program to solve the constraints. The program matrix has
+ five columns for each widget, and one constant column. The first and second
+ columns of a widget are its position and dimension, respectively. The
+ remaining three are slack columns; see below for their purposes. */
LinearProgram linprog(slots.size()*5+1);
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;
row[(*i)->index*5+2] = -1;
}
{
+ // Prevent the widget from going past the container's high edge.
LinearProgram::Row row = linprog.add_row();
row[(*i)->index*5] = 1;
row[(*i)->index*5+1] = 1;
}
{
+ /* Only allow the widget's dimension to increase. The geometry has
+ previously been set to the smallest allowable size. */
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();
}
Layout::LinearProgram::Row Layout::LinearProgram::operator[](unsigned r)
{
if(r>=n_rows)
- throw InvalidParameterValue("Row index out of range");
+ throw out_of_range("LinearProgram::operator[]");
return Row(*this, r);
}
-Layout::LinearProgram::Row Layout::LinearProgram::get_object_row()
+Layout::LinearProgram::Row Layout::LinearProgram::get_objective_row()
{
return Row(*this, 0);
}
float Layout::LinearProgram::get_variable(unsigned i)
{
if(!solved || infeasible)
- throw InvalidState("Not solved");
+ throw logic_error("not solved");
if(i+1>=n_columns)
- throw InvalidParameterValue("Variable index out of range");
+ 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()
if(solved || infeasible)
return !infeasible;
- // Force all columns fully into existence and relocate objective row to bottom
+ /* Solve the program using the simplex method. The column representing the
+ objective variable is kept implicit, as it would never change during the
+ execution of the algorithm. */
+
+ /* Force all columns fully into existence and relocate objective row to
+ bottom in preparation of phase 1. A new objective row is calculated by
+ 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;
}
- // Create artificial variables for phase 1
+ /* Create artificial variables for phase 1. This ensures that each row has
+ a basic variable associated with it. The original objective row already
+ contains the implicit objective variable, which is basic. */
columns.resize(n_columns+n_rows-1);
columns.back() = columns[n_columns-1];
columns[n_columns-1].values.clear();
column.basic = i;
}
- // Solve the phase 1 problem
+ // Solve the phase 1 problem.
while(pivot()) ;
+ /* All artificial variables should now be non-basic and thus zero, so the
+ objective function's value should also be zero. If it isn't, the original
+ program can't be solved. */
if(columns.back().values.front())
{
infeasible = true;
return false;
}
- // Get rid of artificial columns and restore objective row
+ /* Get rid of the artificial variables and restore the original objective
+ row to form the phase 2 problem. */
columns.erase(columns.begin()+(n_columns-1), columns.end()-1);
for(vector<Column>::iterator i=columns.begin(); i!=columns.end(); ++i)
if(!i->basic)
i->values.pop_back();
}
+ // Solve the phase 2 problem. We already know it to be feasible.
while(pivot()) ;
solved = true;
unsigned Layout::LinearProgram::find_minimal_ratio(unsigned c)
{
+ /* 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();
unsigned row = 0;
- /* Intentionally use n_rows since we need to ignore the relocated original
- objective row in phase 1 */
for(unsigned i=1; i<n_rows; ++i)
if(columns[c].values[i]>0)
{
row = i;
}
}
-
+
return row;
}
void Layout::LinearProgram::make_basic_column(unsigned c, unsigned r)
{
+ /* Perform row transfer operations to make the pivot column basic,
+ containing a 1 on the pivot row. */
for(unsigned i=0; i<columns.size(); ++i)
if(i!=c && (columns[i].basic==r || (!columns[i].basic && columns[i].values[r])))
{
}
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;
bool Layout::LinearProgram::pivot()
{
+ /* Pick a nonbasic column and make it basic. Requiring a positive objective
+ coefficient ensures that the objective function's value will decrease in the
+ process. */
for(unsigned i=0; i+1<columns.size(); ++i)
if(!columns[i].basic && columns[i].values.front()>0)
if(unsigned row = find_minimal_ratio(i))
float &Layout::LinearProgram::Row::operator[](unsigned c)
{
if(c>=linprog.n_columns)
- throw InvalidParameterValue("Column index out of range");
+ throw out_of_range("Row::operator[]");
Column &column = linprog.columns[c];
if(column.values.size()<=index)
projects / libs / gltk.git / blobdiff