+ /*
+ 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.
+ */
+ if (Separation_item::width (r).empty_b ())
+ return;
+
+ for(; gh_pair_p (next); next = ly_cdr (next))
+ {
+ Item *l = dynamic_cast<Item*> (unsmob_grob (ly_car( next)));
+ Item *lb = l->find_prebroken_piece (RIGHT);
+
+ if (lb)
+ {
+ Interval li (Separation_item::width (lb));
+ Interval ri (Separation_item::conditional_width (r, lb));
+ if (!li.empty_b () && !ri.empty_b())
+ {
+ Rod rod;
+
+ rod.item_l_drul_[LEFT] = lb;
+ rod.item_l_drul_[RIGHT] = r;
+
+ rod.distance_ = li[RIGHT] - ri[LEFT];
+ rod.add_to_cols ();
+ }
+ }