source file of the GNU LilyPond music typesetter
- (c) 1996, 1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
+ (c) 1996--2000 Han-Wen Nienhuys <hanwen@cs.uu.nl>
*/
+#include <math.h>
+#include <libc-extension.hh>
#include "dimension-cache.hh"
#include "debug.hh"
#include "paper-score.hh"
#include "molecule.hh"
#include "paper-outputter.hh"
-#include "score-column.hh"
+#include "paper-column.hh"
#include "line-of-score.hh"
#include "break-align-item.hh"
+
void
-Spanner::do_break_processing()
+Spanner::do_break_processing ()
{
//break_into_pieces
-
- if (line_l () || broken_b ())
- return;
-
Item * left = spanned_drul_[LEFT];
Item * right = spanned_drul_[RIGHT];
+ if (!left || !right)
+ return;
+
if (left == right)
{
- warning (_ ("Left spanpoint is right spanpoint"));
- return;
+ warning (_f ("Spanner `%s' has equal left and right spanpoints",
+ classname (this)));
}
-
- Link_array<Item> break_points = pscore_l_->broken_col_range (left,right);
- break_points.insert (left,0);
- break_points.push (right);
+ /*
+ 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<Spanner*> (parent_l ((Axis)a)))
+ {
+ if (!parent->spanned_rank_iv ().contains_b (this->spanned_rank_iv ()))
+ {
+ programming_error (to_str ("Spanner `%s' is not fully contained in parent spanner `%s'.",
+ classname (this),
+ classname (parent)));
+ }
+ }
+ }
+
+ if (line_l () || broken_b ())
+ return;
- for (int i=1; i < break_points.size(); i++)
+ if (left == right)
{
- Drul_array<Item*> bounds;
- bounds[LEFT] = break_points[i-1];
- bounds[RIGHT] = break_points[i];
+ /*
+ FIXME: this is broken.
+ */
+ /*
+ 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->line_l ())
+ {
+ Spanner * span_p = dynamic_cast<Spanner*>( clone ());
+ span_p->set_bound (LEFT, bound);
+ span_p->set_bound (RIGHT, bound);
+
+ assert (span_p->line_l ());
+ span_p->line_l ()->typeset_element (span_p);
+ broken_into_l_arr_.push (span_p);
+ }
}
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);
- broken_into_l_arr_.push (span_p);
}
+ else
+ {
+ Link_array<Item> break_points = pscore_l_->line_l_->broken_col_range (left,right);
+
+ break_points.insert (left,0);
+ break_points.push (right);
+ for (int i=1; i < break_points.size(); i++)
+ {
+ Drul_array<Item*> bounds;
+ bounds[LEFT] = break_points[i-1];
+ bounds[RIGHT] = break_points[i];
+ Direction d = LEFT;
+ do
+ {
+ if (!bounds[d]->line_l())
+ 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;
+ }
+
+ Spanner *span_p = dynamic_cast<Spanner*>(clone ());
+ span_p->set_bound(LEFT,bounds[LEFT]);
+ span_p->set_bound(RIGHT,bounds[RIGHT]);
+
+
+ assert (bounds[LEFT]->line_l () ==
+ bounds[RIGHT]->line_l ());
+
+ bounds[LEFT]->line_l ()->typeset_element (span_p);
+ broken_into_l_arr_.push (span_p);
+ }
+ }
broken_into_l_arr_.sort (Spanner::compare);
}
do
{
if (!spanned_drul_[i]->line_l())
- set_bounds(i,spanned_drul_[i]->find_broken_piece((Direction) -i));
+ set_bound(i,spanned_drul_[i]->find_prebroken_piece((Direction) -i));
}
while (flip(&i) != LEFT);
}
-void
-Spanner::set_bounds(Direction d, Item*i)
+Interval_t<int>
+Spanner::spanned_rank_iv ()
{
- spanned_drul_[d] =i;
- if (i)
+ Interval_t<int> iv (0, 0);
+
+ if (spanned_drul_[LEFT])
{
- i->used_b_ = true;
+ iv[LEFT] = spanned_drul_[LEFT]->column_l ()->rank_i ();
}
+ if (spanned_drul_[RIGHT])
+ {
+ iv[RIGHT] = spanned_drul_[RIGHT]->column_l ()->rank_i ();
+ }
+ return iv;
+}
+
+Item*
+Spanner::get_bound (Direction d) const
+{
+ return spanned_drul_ [d];
+}
+
+void
+Spanner::set_bound(Direction d, Item*i)
+{
+ spanned_drul_[d] =i;
/**
- Prevent the column -> line_of_score -> column -> line_of_score -> etc situation
- */
+ We check for Line_of_score to 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' has equal left and right spanpoints", classname (this)));
+ warning (_f ("Spanner `%s' has equal left and right spanpoints",
+ classname (this)));
}
-Spanner::Spanner ()
+Spanner::Spanner (SCM s)
+ : Score_element (s)
{
spanned_drul_[LEFT]=0;
spanned_drul_[RIGHT]=0;
Array<Spring> ss (get_springs ());
for (int i=0; i < ss.size (); i++)
{
- ss[i].add_to_cols ();
+ if (isinf (ss[i].distance_f_))
+ programming_error ("weird spring");
+ else
+ ss[i].add_to_cols ();
}
}
Real
Spanner::get_broken_left_end_align () const
{
- Score_column *sc = dynamic_cast<Score_column*> (spanned_drul_[LEFT]->column_l());
+ Paper_column *sc = dynamic_cast<Paper_column*> (spanned_drul_[LEFT]->column_l());
// Relevant only if left span point is first column in line
if(sc != NULL &&
/*
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 0.0;
}
+
+void
+Spanner::do_derived_mark ()
+{
+ Direction d = LEFT;
+ do
+ if (spanned_drul_[d])
+ scm_gc_mark (spanned_drul_[d]->self_scm_);
+ while (flip (&d) != LEFT);
+}
+
projects / lilypond.git / blobdiff