source file of the GNU LilyPond music typesetter
- (c) 1996,1997 Han-Wen Nienhuys <hanwen@stack.nl>
+ (c) 1996, 1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
*/
#include "debug.hh"
#include "spanner.hh"
#include "p-col.hh"
#include "p-score.hh"
-
-IMPLEMENT_STATIC_NAME(Spanner);
+#include "molecule.hh"
+#include "paper-outputter.hh"
void
-Spanner::do_print()const
+Spanner::do_print() const
{
- if (broken_into_l_arr_.size())
- mtor << "Spanner with broken pieces\n";
+#ifndef NPRINT
+ DOUT << "Between " << classname (spanned_drul_[LEFT])
+ << " and " << classname (spanned_drul_[RIGHT]) << '\n';
+
+ if (broken_b ())
+ DOUT << "Broken in " << to_str (broken_info_.size ()) << " pieces";
+#endif
}
void
-Spanner::break_into_pieces()
+Spanner::break_into_pieces ()
{
- 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> all_cols = pscore_l_->col_range(left, right);
-
- Line_of_score *line = left->line_l_;
- if (!line) {
- left = left->postbreak_p_;
- line = left->line_l_;
+ if (broken_b ())
+ return;
+
+ Item * left = spanned_drul_[LEFT];
+ Item * right = spanned_drul_[RIGHT];
+
+ if (left == right)
+ {
+ warning (_ ("left spanpoint is right spanpoint\n"));
+ return;
}
-
- for (int i=1; i < all_cols.size(); i++) {
- if (!all_cols[i]->line_l_) {
-
- Spanner* span_p = clone();
- right = all_cols[i]->prebreak_p_;
- assert(left&&right && left->line_l_ == right->line_l_);
-
- span_p->left_col_l_ = left;
- span_p->right_col_l_ = right;
- left = all_cols[i]->postbreak_p_;
- line = left->line_l_;
-
- pscore_l_->typeset_broken_spanner(span_p);
- broken_into_l_arr_.push( span_p );
+
+ 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);
+
+ for (int i=1; i < break_points.size(); i++)
+ {
+ Breaking_information info;
+ info.bounds_[LEFT] = break_points[i-1];
+ info.bounds_[RIGHT] = break_points[i];
+ 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 ());
+
}
+ while ((flip(&d))!= LEFT);
+ info.broken_spanner_l_ = 0;
+ broken_info_.push (info);
}
}
void
-Spanner::do_break_processing()
+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_;
-
-
- 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();
- } else {
- handle_broken_dependencies();
+ Direction i = (Direction)1;
+ do
+ {
+ if (!spanned_drul_[i]->line_l())
+ set_bounds(i,spanned_drul_[i]->find_prebroken_piece((Direction)-i));
+ }
+ while (flip(&i) != 1);
+}
+
+void
+Spanner::set_bounds(Direction d, Item*i)
+{
+ spanned_drul_[d] =i;
+ if (i)
+ {
+ i->used_b_ = true;
+ }
+
+ if (d== LEFT)
+ {
+ dim_cache_[X_AXIS]->parent_l_ = i->dim_cache_[X_AXIS];
}
+
+ if (spanned_drul_[Direction(-d)] == spanned_drul_[d]
+ && i)
+ warning (_f ("Spanner `%s\' with 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 ()
{
- left_col_l_ = right_col_l_ = 0;
+ spanned_drul_[LEFT]=0;
+ spanned_drul_[RIGHT]=0;
+}
+
+Spanner::Spanner (Spanner const &s)
+ : Score_element (s)
+{
+ spanned_drul_[LEFT] = spanned_drul_[RIGHT] =0;
}
Interval
-Spanner::do_width()const
-{
- Real r = right_col_l_->hpos;
- Real l = left_col_l_->hpos;
- assert(*left_col_l_ < *right_col_l_);
- assert(r>=l);
+Spanner::do_width() const
+{
+ Real l = spanned_drul_[LEFT]->absolute_coordinate (X_AXIS);
+ Real r = spanned_drul_[RIGHT]->absolute_coordinate (X_AXIS);
+
+ if (r< l)
+ warning ("Spanner with negative length");
- return Interval(0, r-l);
+ return Interval (0, 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
+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;
-
+ 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->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;
+ span_p->handle_broken_dependencies();
+
+ }
+ return info.broken_spanner_l_;
+ }
+ }
+
+ return 0;
}
bool
-Spanner::broken_b()const
+Spanner::broken_b() const
{
- return broken_into_l_arr_.size();
+ return broken_info_.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 ()
+{
+ 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++)
+ {
+ ss[i].add_to_cols ();
+ }
}