(c) 1996, 1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
*/
+#include "dimension-cache.hh"
#include "debug.hh"
#include "spanner.hh"
-#include "p-col.hh"
-#include "p-score.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"
void
Spanner::do_print() const
{
#ifndef NPRINT
- DOUT << "Between " << classname (spanned_drul_[LEFT])
+ DEBUG_OUT << "Between " << classname (spanned_drul_[LEFT])
<< " and " << classname (spanned_drul_[RIGHT]) << '\n';
- if (broken_into_l_arr_.size())
- {
- DOUT << "with broken pieces:\n";
- for (int i=0; i < broken_into_l_arr_.size (); i++)
- broken_into_l_arr_[i]->print ();
- }
+
+ if (broken_b ())
+ DEBUG_OUT << "Broken in " << to_str (broken_into_l_arr_.size ()) << " pieces";
#endif
}
void
Spanner::break_into_pieces ()
{
- if (broken_into_l_arr_.size())
+ if (broken_b ())
return;
Item * left = spanned_drul_[LEFT];
Item * right = spanned_drul_[RIGHT];
-
+
if (left == right)
{
- warning (_ ("left spanpoint is right spanpoint\n"));
+ warning (_ ("Left spanpoint is right spanpoint"));
return;
}
- Link_array<Item> break_cols = pscore_l_->broken_col_range (left,right);
- Link_array<Spanner> broken_into_l_arr;
+ Link_array<Item> break_points = pscore_l_->broken_col_range (left,right);
- break_cols.insert (left,0);
- break_cols.push (right);
+ break_points.insert (left,0);
+ break_points.push (right);
- for (int i=1; i < break_cols.size(); i++)
+ for (int i=1; i < break_points.size(); i++)
{
- Spanner* span_p = dynamic_cast<Spanner*> (clone());
- Item *left = break_cols[i-1];
- Item *right = break_cols[i];
- if (!right->line_l())
- right = right->find_prebroken_piece(LEFT);
- if (!left->line_l())
- left = left->find_prebroken_piece(RIGHT);
-
- assert (left&&right && left->line_l() == right->line_l());
-
- span_p->set_bounds(LEFT,left);
- span_p->set_bounds(RIGHT,right);
-
- pscore_l_->typeset_broken_spanner (span_p);
- broken_into_l_arr.push (span_p);
+ Drul_array<Item*> bounds;
+ bounds[LEFT] = break_points[i-1];
+ bounds[RIGHT] = break_points[i];
+ 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);
+ }
+ while ((flip(&d))!= LEFT);
+
+ Spanner *span_p = dynamic_cast<Spanner*>(clone ());
+ span_p->set_bounds(LEFT,bounds[LEFT]);
+ span_p->set_bounds(RIGHT,bounds[RIGHT]);
+
+ pscore_l_->typeset_element (span_p);
+ span_p->handle_broken_dependencies();
+
+ broken_into_l_arr_.push (span_p);
}
-
- broken_into_l_arr_ = broken_into_l_arr;
+
+ broken_into_l_arr_.sort (Spanner::compare);
}
void
do
{
if (!spanned_drul_[i]->line_l())
- set_bounds(i,spanned_drul_[i]->find_prebroken_piece((Direction)-i));
+ set_bounds(i,spanned_drul_[i]->find_broken_piece((Direction)-i));
}
while (flip(&i) != 1);
}
-
void
Spanner::set_bounds(Direction d, Item*i)
{
- if (spanned_drul_[d])
- spanned_drul_[d]->attached_span_l_arr_.substitute(this,0);
-
spanned_drul_[d] =i;
if (i)
- i->attached_span_l_arr_.push(this);
+ {
+ i->used_b_ = true;
+ }
+ /**
+ Prevent the column -> line_of_score -> column -> line_of_score -> etc situation
+ */
+ if (d== LEFT && !dynamic_cast<Line_of_score*> (this))
+ {
+ set_parent (i, X_AXIS);
+ }
+
if (spanned_drul_[Direction(-d)] == spanned_drul_[d]
&& i)
- warning (_f ("Spanner `%s\' with equal left and right spanpoints", classname (this)));
+ warning (_f ("Spanner `%s' has equal left and right spanpoints", classname (this)));
}
void
Spanner::do_break_processing()
{
if (!line_l())
- {
- break_into_pieces ();
- for (int i=0; i < broken_into_l_arr_.size(); i++)
- {
- broken_into_l_arr_[i]->handle_broken_dependencies();
- }
- }
+ break_into_pieces ();
else
- {
- handle_broken_dependencies();
- }
+ handle_broken_dependencies();
}
Spanner::Spanner ()
{
- unbroken_original_l_ =0;
spanned_drul_[LEFT]=0;
spanned_drul_[RIGHT]=0;
}
Spanner::Spanner (Spanner const &s)
- :Score_element (s)
+ : Score_element (s)
{
spanned_drul_[LEFT] = spanned_drul_[RIGHT] =0;
- unbroken_original_l_ = &s;
}
-void
-Spanner::output_processing ()
-{
- if (transparent_b_)
- return ;
- output_p_ = do_brew_molecule_p ();
- Offset left_off (spanned_drul_[LEFT]->absolute_coordinate(X_AXIS), 0);
- Offset o = absolute_offset() + left_off;
- pscore_l_->outputter_l_->output_molecule (output_p_, o, classname (this));
-}
Interval
Spanner::do_width() const
-{
-
-
- Real l = spanned_drul_[LEFT]->absolute_coordinate (X_AXIS);
- Real r = spanned_drul_[RIGHT]->absolute_coordinate (X_AXIS);
+{
+ 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");
+ warning (_ ("spanner with negative length"));
return Interval (0, r-l);
}
{
if (!spanned_drul_[LEFT] || !spanned_drul_[RIGHT])
return 0;
- if (spanned_drul_[LEFT]->line_l() != spanned_drul_[RIGHT]->line_l())
+ if (spanned_drul_[LEFT]->line_l () != spanned_drul_[RIGHT]->line_l ())
return 0;
return spanned_drul_[LEFT]->line_l();
}
-Spanner*
+Score_element*
Spanner::find_broken_piece (Line_of_score*l) const
{
- for (int i=0; i < broken_into_l_arr_.size(); i++)
- if (broken_into_l_arr_[i]->line_l() == l)
- return broken_into_l_arr_[i];
- return 0;
-
-}
-
-bool
-Spanner::broken_b() const
-{
- return broken_into_l_arr_.size();
+ 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];
}
-void
-Spanner::do_unlink()
-{
- set_bounds (LEFT, 0);
- set_bounds (RIGHT, 0);
-
- if (unbroken_original_l_)
+/*
+ for (int i=0; i < broken_into_l_arr_.size (); i++)
{
- unbroken_original_l_->broken_into_l_arr_.substitute (this, 0);
- unbroken_original_l_ =0;
+ if (broken_into_l_arr_[i]->line_l () == l)
+ return broken_into_l_arr_[i];
}
+ return 0;
+*/
+
+
+int
+Spanner::compare (Spanner * const &p1, Spanner * const &p2)
+{
+ return p1->line_l ()->rank_i_ - p2->line_l ()->rank_i_;
}
-void
-Spanner::do_junk_links()
+bool
+Spanner::broken_b() const
{
- spanned_drul_[LEFT] = spanned_drul_[RIGHT] =0;
+ return broken_into_l_arr_.size();
}
Array<Rod>
return r;
}
+Array<Spring>
+Spanner::get_springs () const
+{
+ Array<Spring> s;
+ return s;
+}
+
void
Spanner::do_space_processing ()
{
{
rs[i].add_to_cols ();
}
+
+ Array<Spring> ss (get_springs ());
+ for (int i=0; i < ss.size (); i++)
+ {
+ ss[i].add_to_cols ();
+ }
+}
+
+/*
+ UGH.
+ */
+void
+Spanner::handle_broken_dependents ()
+{
+ Spanner *unbrok = dynamic_cast<Spanner*> (original_l_);
+ if (!unbrok || parent_l(Y_AXIS))
+ return;
+
+ Spanner *refpoint = dynamic_cast<Spanner*> (unbrok->parent_l (Y_AXIS));
+
+ if (refpoint)
+ {
+ Score_element * broken_refpoint = refpoint->find_broken_piece (line_l ());
+ if (broken_refpoint)
+ set_parent (broken_refpoint,Y_AXIS);
+ else
+ programming_error ("Spanner y -refpoint lost.");
+ }
+}
+
+/*
+ If this is a broken spanner, return the amount the left end is to be
+ shifted horizontally so that the spanner starts after the initial
+ clef and key on the staves. This is necessary for ties, slurs,
+ crescendo and decrescendo signs, for example.
+*/
+Real
+Spanner::get_broken_left_end_align () const
+{
+ int i;
+
+ Score_column *sc = dynamic_cast<Score_column*> (spanned_drul_[LEFT]->column_l());
+
+ // Relevant only if left span point is first column in line
+ if(sc != NULL && sc->line_l ()->cols_.find_i (sc) == 0)
+ {
+ // We could possibly return the right edge of the whole Score_column here,
+ // but we do a full search for the Break_align_item.
+ for(i = 0; i < sc->elem_l_arr_.size (); i++)
+ {
+ if(0 == strcmp (classname (sc->elem_l_arr_[i]), "Break_align_item"))
+ {
+ return sc->elem_l_arr_[i]->extent (X_AXIS) [RIGHT];
+ }
+ }
+ }
+
+ return 0.0;
}
projects / lilypond.git / blobdiff