#include "lookup.hh"
#include "grouping.hh"
+NAME_METHOD(Beam);
+
struct Stem_info {
Real x;
Real idealy;
Beam::add(Stem*s)
{
stems.bottom().add(s);
- s->dependencies.add(this);
+ s->dependencies.push(this);
s->print_flag = false;
}
for (iter_top(stems,i); i.ok(); i++) {
i->set_default_extents();
Stem_info info(i);
- sinfo.add(info);
+ sinfo.push(info);
}
Real leftx = sinfo[0].x;
Least_squares l;
for (int i=0; i < sinfo.size(); i++) {
sinfo[i].x -= leftx;
- l.input.add(Offset(sinfo[i].x, sinfo[i].idealy));
+ l.input.push(Offset(sinfo[i].x, sinfo[i].idealy));
}
l.minimise(slope, left_pos);
for (; s.ok(); s++) {
int f = intlog2(abs(s->flag))-2;
assert(f>0);
- flags.add(f);
+ flags.push(f);
}
int fi =0;
b= cur.generate_beams(flags, fi);
b.insert(0,0);
- b.add(0);
+ b.push(0);
assert(stems.size() == b.size()/2);
}
}
void
-Beam::print()const
+Beam::do_print()const
{
#ifndef NPRINT
- mtor << "{ slope " <<slope << "left ypos " << left_pos;
+ mtor << "slope " <<slope << "left ypos " << left_pos;
Spanner::print();
- mtor << "}\n";
#endif
}
}
for (int i = 0; i < cols.size(); i++)
if (cols[i].fixed())
- fixed.add(i);
+ fixed.push(i);
for (int i = 0; i < cols.size(); i++) {
bool c=false;
for (int j =0; j<fixed.size(); j++)
Array<Real> posns(sol);
- posns.add(lp.eval(sol));
+ posns.push(lp.eval(sol));
return posns;
}
Spacing_problem::add_column(const PCol *col, bool fixed, Real fixpos)
{
Colinfo c(col,(fixed)? &fixpos : 0);
- cols.add(c);
+ cols.push(c);
}
void
if (!contains(l) || !contains(r)) {
return;
}
- ideals.add(i);
+ ideals.push(i);
}
void