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 "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 "paper-column.hh"
+#include "line-of-score.hh"
+#include "break-align-item.hh"
-
-void
-Spanner::do_print() const
-{
-#ifndef NPRINT
- DOUT << "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 ();
- }*/
-#endif
-}
-
void
-Spanner::break_into_pieces ()
+Spanner::do_break_processing ()
{
- if (broken_b ())
- return;
-
+ //break_into_pieces
Item * left = spanned_drul_[LEFT];
Item * right = spanned_drul_[RIGHT];
+
+ if (!left || !right)
+ return;
if (left == right)
{
- warning (_ ("left spanpoint is right spanpoint\n"));
- 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);
- Link_array<Spanner> broken_into_l_arr;
-
- 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)
{
- Breaking_information info;
- info.bounds_[LEFT] = break_points[i-1];
- info.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 = info.bounds_[d] ;
- if (!pc_l->line_l())
- pc_l = pc_l->find_prebroken_piece(- d);
-
- assert (pc_l);
- if (!info.line_l_)
- info.line_l_ = pc_l-> line_l ();
- else
- assert( info.line_l_ = pc_l->line_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);
- info.broken_spanner_l_ = 0;
- broken_info_.push (info);
}
+ 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);
}
void
Spanner::set_my_columns()
{
- Direction i = (Direction)1;
+ Direction i = (Direction) LEFT;
do
{
if (!spanned_drul_[i]->line_l())
- set_bounds(i,spanned_drul_[i]->find_prebroken_piece((Direction)-i));
+ set_bound(i,spanned_drul_[i]->find_prebroken_piece((Direction) -i));
}
- while (flip(&i) != 1);
+ while (flip(&i) != LEFT);
}
+Interval_t<int>
+Spanner::spanned_rank_iv ()
+{
+ Interval_t<int> iv (0, 0);
+
+ if (spanned_drul_[LEFT])
+ {
+ 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_bounds(Direction d, Item*i)
+Spanner::set_bound(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);
- if (spanned_drul_[Direction(-d)] == spanned_drul_[d]
+ /**
+ 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\' 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 ();
- else
- handle_broken_dependencies();
-}
-Spanner::Spanner ()
+Spanner::Spanner (SCM s)
+ : Score_element (s)
{
- 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_ = 0;
}
-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
+Spanner::spanner_length() 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");
-
- return Interval (0, r-l);
+ programming_error ("spanner with negative length");
+
+ return r-l;
}
Line_of_score *
{
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_info_.size (); i++)
- {
- Spanner *me =(Spanner*) this;
- Breaking_information &info = me->broken_info_[i];
- if (info.line_l_ == l)
- {
- if (!info.broken_spanner_l_)
- {
- Spanner *span_p = dynamic_cast<Spanner*>(clone ());
- span_p -> unbroken_original_l_ =(Spanner*)this;
- span_p->set_bounds(LEFT,info.bounds_[LEFT]);
- span_p->set_bounds(RIGHT,info.bounds_[RIGHT]);
- pscore_l_->typeset_element (span_p);
-
-
- info.broken_spanner_l_ = span_p;
- /* if (Axis_group_spanner *ags
- = dynamic_cast<Axis_group_spanner*> (span_p))
- {
- do something
- }
- */
- span_p->handle_broken_dependencies();
+ 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];
+}
- }
- return info.broken_spanner_l_;
- }
- }
- return 0;
+int
+Spanner::compare (Spanner * const &p1, Spanner * const &p2)
+{
+ return p1->line_l ()->rank_i_ - p2->line_l ()->rank_i_;
}
bool
Spanner::broken_b() const
{
- return broken_info_.size();
+ return broken_into_l_arr_.size();
}
-
-
-
Array<Rod>
Spanner::get_rods () const
{
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++)
+ {
+ if (isinf (ss[i].distance_f_))
+ programming_error ("weird spring");
+ else
+ ss[i].add_to_cols ();
+ }
+}
+
+/*
+ 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
+{
+ 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 &&
+ 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 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