{
calculate();
+ /*
+ quick and dirty!
+ */
for (PCursor<Stem*> i(stems); i.ok(); i++)
i->beams_left = i->beams_right = intlog2(ABS(i->flag)) - 2;
if (next){
int rhalfs = here->beams_right - next->beams_left;
- int rwholebeams = here->beams_right <? next->beams_left; // g++
+ int rwholebeams = here->beams_right <? next->beams_left;
Real w = next->hpos() - here->hpos();
Atom a = paper()->lookup_->beam(sl, w + stemdx);
assert(left->line == right->line);
int minp=1000, maxp=-1000; // todo
for (int i=0; i<encompass.sz(); i++) {
- minp = MIN(encompass[i]->position, minp);
- maxp = MAX(encompass[i]->position, maxp);
- }
-
+ minp = encompass[i]->position <? minp;
+ maxp = encompass[i]->position <? maxp;
+ }
assert(encompass.sz()>0); // todo
int pos1 = encompass.last()->position;
int pos2 = encompass[0]->position;