source file of the GNU LilyPond music typesetter
- (c) 1996,1997 Han-Wen Nienhuys <hanwen@stack.nl>
+ (c) 1996, 1997--2000 Han-Wen Nienhuys <hanwen@cs.uu.nl>
*/
+#include <math.h>
+#include "dimension-cache.hh"
#include "debug.hh"
#include "spanner.hh"
-#include "p-col.hh"
-#include "p-score.hh"
-
-
-IMPLEMENT_IS_TYPE_B1(Spanner,Score_elem);
+#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
- mtor << "Between col ";
- if ( left_col_l_ )
- mtor << left_col_l_->rank_i();
- else
- mtor << "nop";
- mtor << ", ";
- if ( right_col_l_ )
- mtor << right_col_l_->rank_i();
- else
- mtor << "nop";
- if (broken_into_l_arr_.size())
- mtor << "with broken pieces\n";
-#endif
-}
-
-void
-Spanner::break_into_pieces(bool copy_deps_b)
+Spanner::do_break_processing()
{
- if ( broken_into_l_arr_.size() )
- return;
-
- PCol * left = left_col_l_;
- PCol * right = right_col_l_;
- if(left->daddy_l_) left = left->daddy_l_;
- if(right->daddy_l_) right = right->daddy_l_;
-
-
- Link_array<PCol> break_cols = pscore_l_->broken_col_range(left,right);
- Link_array<Spanner> broken_into_l_arr;
-
- break_cols.insert(left,0);
- break_cols.push(right);
-
- for (int i=1; i < break_cols.size(); i++) {
- Spanner* span_p = clone()->spanner();
- if (copy_deps_b)
- span_p->copy_dependencies( *this );
- left = break_cols[i-1];
- right = break_cols[i];
- if (!right->line_l_)
- right = right->prebreak_p_;
- if (!left->line_l_)
- left = left->postbreak_p_;
-
- assert(left&&right && left->line_l_ == right->line_l_);
-
- span_p->left_col_l_ = left;
- span_p->right_col_l_ = right;
-
- pscore_l_->typeset_broken_spanner(span_p);
- broken_into_l_arr.push( span_p );
+ //break_into_pieces
+
+ if (line_l () || broken_b ())
+ return;
+
+ Item * left = spanned_drul_[LEFT];
+ Item * right = spanned_drul_[RIGHT];
+
+ if (left == right)
+ {
+ warning (_ ("Left spanpoint is right spanpoint"));
+
+ /*
+ 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* bound = left->find_broken_piece (d);
+ Spanner * span_p = dynamic_cast<Spanner*>( clone ());
+ span_p->set_bound (LEFT, bound);
+ span_p->set_bound (RIGHT, bound);
+
+ assert (span_p->line_l ());
+ pscore_l_->typeset_element (span_p);
+ broken_into_l_arr_.push (span_p);
+ }
+ while ((flip(&d))!= LEFT);
+ }
+ else
+ {
+ Link_array<Item> break_points = pscore_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
+ {
+ 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_bound(LEFT,bounds[LEFT]);
+ span_p->set_bound(RIGHT,bounds[RIGHT]);
+
+ pscore_l_->typeset_element (span_p);
+ broken_into_l_arr_.push (span_p);
+ }
}
-
- broken_into_l_arr_ = broken_into_l_arr;
+ broken_into_l_arr_.sort (Spanner::compare);
}
void
Spanner::set_my_columns()
{
- if (!left_col_l_->line_l_)
- left_col_l_ = left_col_l_->postbreak_p_;
- if (!right_col_l_->line_l_)
- right_col_l_ = right_col_l_->prebreak_p_;
+ Direction i = (Direction) LEFT;
+ do
+ {
+ if (!spanned_drul_[i]->line_l())
+ set_bound(i,spanned_drul_[i]->find_broken_piece((Direction) -i));
+ }
+ while (flip(&i) != LEFT);
}
+
+Item*
+Spanner::get_bound (Direction d) const
+{
+ return spanned_drul_ [d];
+}
+
void
-Spanner::do_break_processing()
+Spanner::set_bound(Direction d, Item*i)
{
- set_my_columns();
-
- if (!line_l()) {
- break_into_pieces(true);
- for (int i=0; i < broken_into_l_arr_.size(); i++)
- broken_into_l_arr_[i]->handle_broken_dependencies();
- } else {
- handle_broken_dependencies();
+ spanned_drul_[d] =i;
+ if (i)
+ {
+ 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' has equal left and right spanpoints", classname (this)));
}
-Spanner::Spanner()
+Spanner::Spanner ()
{
- left_col_l_ = right_col_l_ = 0;
+ spanned_drul_[LEFT]=0;
+ spanned_drul_[RIGHT]=0;
}
-
-Interval
-Spanner::do_width()const
+Spanner::Spanner (Spanner const &s)
+ : Score_element (s)
{
- Real r = right_col_l_->hpos_f_;
- Real l = left_col_l_->hpos_f_;
- assert(*left_col_l_ < *right_col_l_);
- assert(r>=l);
-
- return Interval(0, r-l);
+ spanned_drul_[LEFT] = spanned_drul_[RIGHT] =0;
+}
+
+
+Real
+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)
+ programming_error ("spanner with negative length");
+
+ return r-l;
}
Line_of_score *
-Spanner::line_l()const
+Spanner::line_l() const
{
- if ( left_col_l_->line_l_ != right_col_l_->line_l_)
- return 0;
- return left_col_l_->line_l_;
+ if (!spanned_drul_[LEFT] || !spanned_drul_[RIGHT])
+ return 0;
+ if (spanned_drul_[LEFT]->line_l () != spanned_drul_[RIGHT]->line_l ())
+ return 0;
+ return spanned_drul_[LEFT]->line_l();
}
-Spanner*
-Spanner::find_broken_piece(Line_of_score*l)const
+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;
-
+ 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];
+}
+
+
+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
+Spanner::broken_b() const
+{
+ return broken_into_l_arr_.size();
+}
+
+Array<Rod>
+Spanner::get_rods () const
+{
+ Array<Rod> r;
+ return r;
+}
+
+Array<Spring>
+Spanner::get_springs () const
+{
+ Array<Spring> s;
+ return s;
+}
+
+void
+Spanner::do_space_processing ()
{
- return broken_into_l_arr_.size();
+ Array<Rod> rs (get_rods ());
+ for (int i=0; i < rs.size (); i++)
+ {
+ 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;
}
projects / lilypond.git / blobdiff