+ /*
+ This is an inner loop: look for the first normal (unbroken) Left
+ grob. This looks like an inner loop (ie. quadratic total), but in
+ most cases, the interesting L will just be the first entry of
+ NEXT, making it linear in most of the cases.
+ */
+ for (; idx != VPOS; idx--)
+ {
+ Item *l = dynamic_cast<Item *> (separators[idx]);
+ Item *lb = l->find_prebroken_piece (RIGHT);