X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=lily%2Fspanner.cc;h=476f75d8c26e8da85be44c334e3ca6fd18641149;hb=5a44d42908f7722f9f4a7675ec81325087c42e9a;hp=5fb0da4792f5485a04d89a52c48fbfedd9bac27d;hpb=163503e56aa0c03d41d37fd083bdb96a6a473a11;p=lilypond.git diff --git a/lily/spanner.cc b/lily/spanner.cc index 5fb0da4792..476f75d8c2 100644 --- a/lily/spanner.cc +++ b/lily/spanner.cc @@ -3,200 +3,294 @@ source file of the GNU LilyPond music typesetter - (c) 1996, 1997--1999 Han-Wen Nienhuys + (c) 1996--2008 Han-Wen Nienhuys */ -#include "dimension-cache.hh" -#include "debug.hh" -#include "spanner.hh" +#include "pointer-group-interface.hh" +#include "libc-extension.hh" +#include "paper-column.hh" #include "paper-column.hh" #include "paper-score.hh" -#include "molecule.hh" -#include "paper-outputter.hh" -#include "score-column.hh" -#include "line-of-score.hh" -#include "break-align-item.hh" +#include "stencil.hh" +#include "system.hh" +#include "warn.hh" +#include "moment.hh" + +Grob * +Spanner::clone () const +{ + return new Spanner (*this); +} void -Spanner::break_into_pieces () +Spanner::do_break_processing () { - if (line_l () || broken_b ()) + //break_into_pieces + Item *left = spanned_drul_[LEFT]; + Item *right = spanned_drul_[RIGHT]; + + if (!left || !right) return; - - Item * left = spanned_drul_[LEFT]; - Item * right = spanned_drul_[RIGHT]; - if (left == right) - { - warning (_ ("Left spanpoint is right spanpoint")); - return; - } - - Link_array break_points = pscore_l_->broken_col_range (left,right); - break_points.insert (left,0); - break_points.push (right); + if (get_system () || is_broken ()) + return; - for (int i=1; i < break_points.size(); i++) + if (left == right) { - Drul_array bounds; - bounds[LEFT] = break_points[i-1]; - bounds[RIGHT] = break_points[i]; + /* + If we have a spanner spanning one column, we must break it + anyway because it might provide a parent for another item. */ Direction d = LEFT; do { - Item *&pc_l = bounds[d] ; - if (!pc_l->line_l()) - pc_l = pc_l->find_broken_piece(- d); - - assert (pc_l); + Item *bound = left->find_prebroken_piece (d); + if (!bound) + programming_error ("no broken bound"); + else if (bound->get_system ()) + { + Spanner *span = dynamic_cast (clone ()); + span->set_bound (LEFT, bound); + span->set_bound (RIGHT, bound); + + assert (span->get_system ()); + span->get_system ()->typeset_grob (span); + broken_intos_.push_back (span); + } } - while ((flip(&d))!= LEFT); + while ((flip (&d)) != LEFT); + } + else + { + System *root = get_root_system (this); + vector break_points = root->broken_col_range (left, right); + + break_points.insert (break_points.begin () + 0, left); + break_points.push_back (right); - Spanner *span_p = dynamic_cast(clone ()); - span_p->set_bounds(LEFT,bounds[LEFT]); - span_p->set_bounds(RIGHT,bounds[RIGHT]); + Slice parent_rank_slice; + parent_rank_slice.set_full (); - pscore_l_->typeset_element (span_p); - broken_into_l_arr_.push (span_p); + /* + Check if our parent in X-direction spans equally wide + or wider than we do. + */ + for (int a = X_AXIS; a < NO_AXES; a++) + { + if (Spanner *parent = dynamic_cast (get_parent ((Axis)a))) + { + parent_rank_slice.intersect (parent->spanned_rank_interval ()); + } + } + + for (vsize i = 1; i < break_points.size (); i++) + { + Drul_array bounds; + bounds[LEFT] = break_points[i - 1]; + bounds[RIGHT] = break_points[i]; + Direction d = LEFT; + do + { + if (!bounds[d]->get_system ()) + bounds[d] = bounds[d]->find_prebroken_piece (- d); + } + while ((flip (&d)) != LEFT); + + if (!bounds[LEFT] || ! bounds[RIGHT]) + { + programming_error ("bounds of this piece aren't breakable. "); + continue; + } + + bool ok = parent_rank_slice.contains (bounds[LEFT]->get_column ()->get_rank ()); + ok = ok && parent_rank_slice.contains (bounds[RIGHT]->get_column ()->get_rank ()); + + if (!ok) + { + programming_error (to_string ("Spanner `%s' is not fully contained in parent spanner. Ignoring orphaned part", + name ().c_str ())); + continue; + } + + + Spanner *span = dynamic_cast (clone ()); + span->set_bound (LEFT, bounds[LEFT]); + span->set_bound (RIGHT, bounds[RIGHT]); + + if (!bounds[LEFT]->get_system () + + || !bounds[RIGHT]->get_system () + || bounds[LEFT]->get_system () != bounds[RIGHT]->get_system ()) + { + programming_error ("bounds of spanner are invalid"); + span->suicide (); + } + else + { + bounds[LEFT]->get_system ()->typeset_grob (span); + broken_intos_.push_back (span); + } + } } + vector_sort (broken_intos_, Spanner::less); + for (vsize i = broken_intos_.size (); i--;) + broken_intos_[i]->break_index_ = i; +} - broken_into_l_arr_.sort (Spanner::compare); +vsize +Spanner::get_break_index () const +{ + return break_index_; } void -Spanner::set_my_columns() +Spanner::set_my_columns () { Direction i = (Direction) LEFT; - do + do { - if (!spanned_drul_[i]->line_l()) - set_bounds(i,spanned_drul_[i]->find_broken_piece((Direction) -i)); - } - while (flip(&i) != LEFT); -} + if (!spanned_drul_[i]->get_system ()) + set_bound (i, spanned_drul_[i]->find_prebroken_piece ((Direction) -i)); + } + while (flip (&i) != LEFT); +} +Interval_t +Spanner::spanned_rank_interval () const +{ + Interval_t iv (0, 0); + + if (spanned_drul_[LEFT] && spanned_drul_[LEFT]->get_column ()) + iv[LEFT] = spanned_drul_[LEFT]->get_column ()->get_rank (); + if (spanned_drul_[RIGHT] && spanned_drul_[RIGHT]->get_column ()) + iv[RIGHT] = spanned_drul_[RIGHT]->get_column ()->get_rank (); + return iv; +} + +Interval_t +Spanner::spanned_time () const +{ + return spanned_time_interval (spanned_drul_[LEFT], + spanned_drul_[RIGHT]); +} + + +Item * +Spanner::get_bound (Direction d) const +{ + return spanned_drul_ [d]; +} + +/* + Set the items that this spanner spans. If D == LEFT, we also set the + X-axis parent of THIS to S. +*/ void -Spanner::set_bounds(Direction d, Item*i) +Spanner::set_bound (Direction d, Grob *s) { - spanned_drul_[d] =i; - if (i) + Item *i = dynamic_cast (s); + if (!i) { - i->used_b_ = true; + programming_error ("must have Item for spanner bound of " + name()); + return; } + spanned_drul_[d] = i; + /** - Prevent the column -> line_of_score -> column -> line_of_score -> etc situation - */ - if (d== LEFT && !dynamic_cast (this)) - { - set_parent (i, X_AXIS); - } - - if (spanned_drul_[Direction(-d)] == spanned_drul_[d] - && i) - warning (_f ("Spanner `%s' has equal left and right spanpoints", classname (this))); -} + We check for System to prevent the column -> line_of_score + -> column -> line_of_score -> etc situation */ + if (d == LEFT && !dynamic_cast (this)) + set_parent (i, X_AXIS); + /* + Signal that this column needs to be kept alive. They need to be + kept alive to have meaningful position and linebreaking. + [maybe we should try keeping all columns alive?, and perhaps + inherit position from their (non-)musical brother] -void -Spanner::do_break_processing() -{ - break_into_pieces (); + */ + if (dynamic_cast (i)) + Pointer_group_interface::add_grob (i, ly_symbol2scm ("bounded-by-me"), this); } -Spanner::Spanner () +Spanner::Spanner (SCM s) + : Grob (s) { - spanned_drul_[LEFT]=0; - spanned_drul_[RIGHT]=0; + break_index_ = 0; + spanned_drul_[LEFT] = 0; + spanned_drul_[RIGHT] = 0; } Spanner::Spanner (Spanner const &s) - : Score_element (s) + : Grob (s) { - spanned_drul_[LEFT] = spanned_drul_[RIGHT] =0; + spanned_drul_[LEFT] = spanned_drul_[RIGHT] = 0; } - Real -Spanner::spanner_length() const -{ +Spanner::spanner_length () const +{ Real l = spanned_drul_[LEFT]->relative_coordinate (0, X_AXIS); Real r = spanned_drul_[RIGHT]->relative_coordinate (0, X_AXIS); - if (r< l) - warning (_ ("spanner with negative length")); - - return r-l; + if (r < l) + programming_error ("spanner with negative length"); + + return r - l; } -Line_of_score * -Spanner::line_l() const +System * +Spanner::get_system () const { if (!spanned_drul_[LEFT] || !spanned_drul_[RIGHT]) return 0; - if (spanned_drul_[LEFT]->line_l () != spanned_drul_[RIGHT]->line_l ()) + if (spanned_drul_[LEFT]->get_system () != spanned_drul_[RIGHT]->get_system ()) return 0; - return spanned_drul_[LEFT]->line_l(); + return spanned_drul_[LEFT]->get_system (); } - -Score_element* -Spanner::find_broken_piece (Line_of_score*l) const +Grob * +Spanner::find_broken_piece (System *l) const { - Spanner* me = (Spanner*) this; - me->break_into_pieces (); - - int idx = binsearch_link_array (broken_into_l_arr_, (Spanner*)l, Spanner::compare); - - if (idx < 0) - return 0; - else - return broken_into_l_arr_ [idx]; + vsize idx = binary_search (broken_intos_, (Spanner *)l, Spanner::less); + if (idx != VPOS) + return broken_intos_ [idx]; + return 0; } - -int -Spanner::compare (Spanner * const &p1, Spanner * const &p2) +Spanner * +Spanner::broken_neighbor (Direction d) const { - return p1->line_l ()->rank_i_ - p2->line_l ()->rank_i_; -} + if (!original_) + return 0; -bool -Spanner::broken_b() const -{ - return broken_into_l_arr_.size(); + vsize k = broken_spanner_index (this); + Spanner *orig = dynamic_cast (original_); + int j = int (k) + d; + if (j < 0 || vsize (j) >= orig->broken_intos_.size ()) + return 0; + + return orig->broken_intos_[j]; } -Array -Spanner::get_rods () const +int +Spanner::compare (Spanner *const &p1, Spanner *const &p2) { - Array r; - return r; + return p1->get_system ()->get_rank () - p2->get_system ()->get_rank (); } -Array -Spanner::get_springs () const +bool +Spanner::less (Spanner *const &a, Spanner *const &b) { - Array s; - return s; + return a->get_system ()->get_rank () < b->get_system ()->get_rank (); } -void -Spanner::do_space_processing () +bool +Spanner::is_broken () const { - Array rs (get_rods ()); - for (int i=0; i < rs.size (); i++) - { - rs[i].add_to_cols (); - } - - Array ss (get_springs ()); - for (int i=0; i < ss.size (); i++) - { - ss[i].add_to_cols (); - } + return broken_intos_.size (); } /* @@ -208,20 +302,137 @@ Spanner::do_space_processing () Real Spanner::get_broken_left_end_align () const { - Score_column *sc = dynamic_cast (spanned_drul_[LEFT]->column_l()); + Paper_column *sc = dynamic_cast (spanned_drul_[LEFT]->get_column ()); // Relevant only if left span point is first column in line - if(sc != NULL && - sc->break_status_dir () == RIGHT) + if (sc != NULL + && sc->break_status_dir () == RIGHT) { /* - We used to do a full search for the Break_align_item. - But that doesn't make a difference, since the Score_column + But that doesn't make a difference, since the Paper_column is likely to contain only a Break_align_item. */ - return sc->extent (X_AXIS)[RIGHT]; + return sc->extent (sc, X_AXIS)[RIGHT]; } return 0.0; } + +void +Spanner::derived_mark () const +{ + Direction d = LEFT; + do + if (spanned_drul_[d]) + scm_gc_mark (spanned_drul_[d]->self_scm ()); + while (flip (&d) != LEFT) + ; + + for (vsize i = broken_intos_.size (); i--;) + scm_gc_mark (broken_intos_[i]->self_scm ()); +} + +/* + Set left or right bound to IT. + + Warning: caller should ensure that subsequent calls put in ITems + that are left-to-right ordered. +*/ +void +add_bound_item (Spanner *sp, Grob *it) +{ + if (!sp->get_bound (LEFT)) + sp->set_bound (LEFT, it); + else + sp->set_bound (RIGHT, it); +} + +MAKE_SCHEME_CALLBACK (Spanner, set_spacing_rods, 1); +SCM +Spanner::set_spacing_rods (SCM smob) +{ + Grob *me = unsmob_grob (smob); + SCM num_length = me->get_property ("minimum-length"); + if (scm_is_number (num_length)) + { + Rod r; + Spanner *sp = dynamic_cast (me); + System *root = get_root_system (me); + Drul_array bounds (sp->get_bound (LEFT), + sp->get_bound (RIGHT)); + if (!bounds[LEFT] || !bounds[RIGHT]) + return SCM_UNSPECIFIED; + + vector cols (root->broken_col_range (bounds[LEFT]->get_column (), + bounds[RIGHT]->get_column ())); + + if (cols.size ()) + { + Rod r ; + r.item_drul_[LEFT] = sp->get_bound (LEFT); + r.item_drul_[RIGHT] = cols[0]->find_prebroken_piece (LEFT); + r.distance_ = robust_scm2double (num_length, 0); + r.add_to_cols (); + + r.item_drul_[LEFT] = cols.back ()->find_prebroken_piece (RIGHT); + r.item_drul_[RIGHT] = sp->get_bound (RIGHT); + r.add_to_cols (); + } + + r.distance_ = robust_scm2double (num_length, 0); + r.item_drul_[LEFT] = sp->get_bound (LEFT); + r.item_drul_[RIGHT] = sp->get_bound (RIGHT); + r.add_to_cols (); + } + + return SCM_UNSPECIFIED; +} + +/* + Return I such that SP == SP->ORIGINAL ()->BROKEN_INTOS_[I]. +*/ +int +broken_spanner_index (Spanner const *sp) +{ + Spanner *parent = dynamic_cast (sp->original ()); + /* ugh: casting */ + return find (parent->broken_intos_, (Spanner*) sp) - parent->broken_intos_.begin (); +} + +Spanner * +unsmob_spanner (SCM s) +{ + return dynamic_cast (unsmob_grob (s)); +} + +MAKE_SCHEME_CALLBACK (Spanner, bounds_width, 1); +SCM +Spanner::bounds_width (SCM grob) +{ + Spanner *me = unsmob_spanner (grob); + + + Grob *common = me->get_bound (LEFT)->common_refpoint (me->get_bound (RIGHT), X_AXIS); + + Interval w (me->get_bound (LEFT)->relative_coordinate (common, X_AXIS), + me->get_bound (RIGHT)->relative_coordinate (common, X_AXIS)); + + w -= me->relative_coordinate (common, X_AXIS); + + return ly_interval2scm (w); +} + +ADD_INTERFACE (Spanner, + "Some objects are horizontally spanned between objects. For" + " example, slurs, beams, ties, etc. These grobs form a subtype" + " called @code{Spanner}. All spanners have two span points" + " (these must be @code{Item} objects), one on the left and one" + " on the right. The left bound is also the X@tie{}reference" + " point of the spanner.", + + /* properties */ + "minimum-length " + "to-barline " + ); +