-#include "idealspacing.hh"
+/*
+ p-score.cc -- implement Paper_score
+
+ source file of the GNU LilyPond music typesetter
+
+ (c) 1996, 1997 Han-Wen Nienhuys <hanwen@stack.nl>
+*/
+
+#include "super-elem.hh"
#include "debug.hh"
#include "lookup.hh"
#include "spanner.hh"
#include "paper-def.hh"
-#include "molecule.hh"
-#include "dimen.hh"
#include "scoreline.hh"
#include "p-score.hh"
#include "tex-stream.hh"
-#include "item.hh"
-#include "break.hh"
-
-Idealspacing*
-PScore::get_spacing(PCol*l, PCol*r)
-{
- assert(l!=r);
-
- Idealspacing*i_p =new Idealspacing(l,r);
- suz.bottom().add(i_p);
-
- return i_p;
-}
-
+#include "p-col.hh"
+#include "header.hh"
+#include "word-wrap.hh"
+#include "gourlay-breaking.hh"
-void
-PScore::clean_cols()
+Paper_score::Paper_score ()
{
- for (iter_top(cols,c); c.ok(); )
- if (!c->used_b()) {
- delete c.remove_p();
- } else
- c++;
+ super_elem_l_ = new Super_elem;
+ typeset_element (super_elem_l_);
}
-
-void
-PScore::add(PStaff *s)
+Paper_score::~Paper_score ()
{
- assert(s->pscore_l_ == this);
- staffs.bottom().add(s);
+ super_elem_l_->unlink_all ();
+ for (PCursor<Score_elem*> i(elem_p_list_.top()); i.ok(); i++)
+ assert(!i->linked_b());
}
-
void
-PScore::do_connect(PCol *c1, PCol *c2, Real d, Real h)
+Paper_score::typeset_element (Score_elem * elem_p)
{
- if (!c1 || !c2 )
- return;
- Idealspacing*s_l=get_spacing(c1,c2);
+ elem_p_list_.bottom ().add (elem_p);
+ elem_p->pscore_l_ = this;
-
- s_l->hooke = h;
- s_l->space =d;
+ elem_p->add_processing ();
}
void
-PScore::connect(PCol* c1, PCol *c2, Real d, Real h)
+Paper_score::typeset_broken_spanner (Spanner*span_p)
{
- do_connect(c1,c2,d,h);
- do_connect(c1->postbreak_p_, c2,d,h);
- do_connect(c1, c2->prebreak_p_,d,h);
- do_connect(c1->postbreak_p_, c2->prebreak_p_,d,h);
+ typeset_element (span_p);
}
-void
-PScore::typeset_item(Item *i, PCol *c, PStaff *s, int breakstat)
-{
- assert(c && i && s);
-
- if (breakstat == 0) {
- typeset_item(i, c->prebreak_p_, s);
- return;
- }
-
- if (breakstat == 2) {
- typeset_item(i, c->postbreak_p_, s);
- return;
- }
-
-
- its.bottom().add(i);
- s->add(i);
- c->add(i);
-
- /* first do this, because i->width() may follow the 0-pointer */
- i->add_processing();
-}
void
-PScore::typeset_spanner(Spanner*span_p, PStaff*ps)
+Paper_score::typeset_unbroken_spanner (Spanner*span_p)
{
- span_p->pstaff_l_ = ps;
- spanners.bottom().add(span_p);
- ps->spans.bottom().add(span_p);
+ span_p_list_.bottom ().add (span_p);
+ span_p->pscore_l_=this;
- // do not init start/stop fields. These are for broken spans only.
- span_p->add_processing();
+
+ // do not init start/stop fields. These are for broken spans only.
+ span_p->add_processing ();
}
void
-PScore::add(PCol *p)
+Paper_score::clean_cols ()
{
- p->pscore_l_ = this;
- if (p->breakable_b()){
- p->prebreak_p_->pscore_l_ = this;
- p->postbreak_p_->pscore_l_ = this;
+ int rank_i = 0;
+ for (iter_top (col_p_list_,c); c.ok ();)
+ {
+ c->set_rank (rank_i++);
+ c++;
}
- cols.bottom().add(p);
-}
-
-PScore::PScore( Paper_def*p)
-{
- paper_l_ = p;
}
void
-PScore::output(Tex_stream &ts)
+Paper_score::add_column (Paper_column *p)
{
- int l=1;
-
- ts << "\n "<< paper_l_->lookup_l()->texsetting << "%(Tex id)\n";
- for (iter_top(lines,lic); lic.ok(); lic++) {
- ts << "% line of score no. " << l++ <<"\n";
- ts << lic->TeXstring();
- if ((lic+1).ok())
- ts << "\\interscoreline\n";
- }
+ col_p_list_.bottom ().add (p);
+ typeset_element(p);
}
-Array<Item*>
-PScore::select_items(PStaff*ps, PCol*pc)
-{
- Array<Item*> ret;
- assert(ps && pc);
- for (iter_top(pc->its,i); i.ok(); i++){
- if (i->pstaff_l_ == ps)
- ret.push((Item*)(Item const *)i);
- }
- return ret;
-}
void
-PScore::OK()const
+Paper_score::OK () const
{
-#ifdef NDEBUG
- for (iter_top(cols,cc); cc.ok(); cc++)
- cc->OK();
- for (iter_top(suz,i); i.ok(); i++)
- i->OK();
+#ifndef NDEBUG
+ for (PCursor<Score_elem*> i (elem_p_list_.top ()); i.ok (); i++)
+ i->OK ();
#endif
}
void
-PScore::print() const
+Paper_score::print () const
{
#ifndef NPRINT
- mtor << "PScore { ";
- paper_l_->print();
- mtor << "\ncolumns: ";
- for (iter_top(cols,cc); cc.ok(); cc++)
- cc->print();
-
- mtor << "\nideals: ";
- for (iter_top(suz,i); i.ok(); i++)
- i->print();
- mtor << "}\n";
+ if (!check_debug)
+ return ;
+ DOUT << "Paper_score { ";
+ DOUT << "\n elements: ";
+ for (iter_top (elem_p_list_,cc); cc.ok (); cc++)
+ cc->print ();
+ DOUT << "\n unbroken spanners: ";
+ for (iter (span_p_list_.top (), i); i.ok (); i++)
+ i->print ();
+
+ DOUT << "}\n";
#endif
}
void
-PScore::preprocess()
+Paper_score::preprocess ()
{
- for (iter_top(spanners,i); i.ok(); i++) {
- i->pre_processing();
- }
- for (iter_top(its,i); i.ok(); i++){
- i->pre_processing();
- }
+ super_elem_l_->breakable_col_processing ();
+ super_elem_l_->pre_processing ();
}
void
-PScore::postprocess()
+Paper_score::postprocess ()
{
- for (iter_top(broken_spans,i); i.ok(); i++) { // could chase spans as well.
- i->post_processing();
- }
- for (iter_top(its,i); i.ok(); i++){
- i->post_processing();
- }
-
- for (iter_top(broken_spans,i); i.ok(); i++) {
- i->molecule_processing();
- }
- for (iter_top(its,i); i.ok(); i++){
- i->molecule_processing();
- }
-
- for (iter_top(lines,i); i.ok(); i++)
- i->process();
-
+ super_elem_l_->post_processing ();
+ super_elem_l_->molecule_processing ();
}
-PCursor<PCol *>
-PScore::find_col(PCol const *c)const
+PCursor<Paper_column *>
+Paper_score::find_col (Paper_column const *c) const
{
- PCol const *what = c;
- if (what->daddy_l_ )
- what = what->daddy_l_;
-
- return cols.find((PCol*)what);
+ Paper_column const *what = c;
+
+ return col_p_list_.find ((Paper_column*)what);
}
+
void
-PScore::add_broken(Spanner*s)
+Paper_score::set_breaking (Array<Col_hpositions> const &breaking)
{
- assert(s->left->line_l_ == s->right->line_l_);
- broken_spans.bottom().add(s);
- s->left->starters.bottom().add (s);
- s->right->stoppers.bottom().add (s);
+ super_elem_l_->line_of_score_l_->set_breaking (breaking);
+ super_elem_l_->break_processing ();
+
+
+ for (iter (span_p_list_.top (),i); i.ok ();)
+ {
+ Spanner *span_p = i.remove_p ();
+ if (span_p->broken_b ())
+ {
+ span_p->unlink ();
+ delete span_p;
+ }else
+ {
+ typeset_broken_spanner (span_p);
+ }
+ }
+ for (iter (elem_p_list_.top (),i); i.ok () ;)
+ {
+ Item *i_l =i->item ();
+ if (i_l && !i_l->line_l ())
+ {
+ i_l->unlink ();
+ delete i.remove_p ();
+ }
+ else
+ i++;
+ }
}
void
-PScore::set_breaking(Array<Col_hpositions> breaking)
+Paper_score::calc_breaking ()
{
- for (int j=0; j < breaking.size(); j++) {
- Array<PCol*> &curline(breaking[j].cols);
- Array<Real> &config(breaking[j].config);
-
- Line_of_score *s_p = new Line_of_score(curline,this);
- lines.bottom().add(s_p);
- for (int i=0; i < curline.size(); i++){
- curline[i]->hpos = config[i];
+ Break_algorithm *algorithm_p=0;
+ Array<Col_hpositions> sol;
+ bool try_wrap = ! paper_l_->get_var ("castingalgorithm");
+
+ if (!try_wrap)
+ {
+ algorithm_p = new Gourlay_breaking ;
+ algorithm_p->set_pscore (this);
+ sol = algorithm_p->solve ();
+ delete algorithm_p;
+ if (! sol.size ())
+ {
+ warning ("Can not solve this casting problem exactly; revert to Word_wrap");
+ try_wrap = true;
}
}
+ if (try_wrap)
+ {
+ algorithm_p = new Word_wrap;
+ algorithm_p->set_pscore (this);
+ sol = algorithm_p->solve ();
+ delete algorithm_p;
+ }
+ set_breaking (sol);
}
void
-PScore::calc_breaking()
+Paper_score::process ()
{
- Word_wrap w(*this);
- set_breaking(w.solve());
+ clean_cols ();
+ print ();
+ *mlog << "Preprocessing elements... " <<flush;
+ preprocess ();
+ *mlog << "\nCalculating column positions ... " <<flush;
+ calc_breaking ();
+ *mlog << "\nPostprocessing elements..." << endl;
+ postprocess ();
+
+ // output
+ String outname = paper_l_->outfile_str_ ;
+ if (outname == "")
+ outname = default_out_str_+ ".tex";
+
+ *mlog << "TeX output to " << outname << " ...\n";
+
+ Tex_stream the_output (outname);
+
+ the_output << "% outputting Score, defined at: " << origin_str_ << "\n";
+ if (header_l_)
+ {
+ the_output << header_l_->TeX_string();
+ }
+
+ the_output << "\n "<< paper_l_->lookup_l ()->texsetting << "%(Tex id)\n";
+ the_output<< super_elem_l_->TeX_output_str ();
+ the_output << "\n\\EndLilyPondOutput";
}
-void
-PScore::process()
+/** Get all breakable columns between l and r, (not counting l and r). */
+Link_array<Paper_column>
+Paper_score::breakable_col_range (Paper_column*l,Paper_column*r) const
{
- clean_cols();
- *mlog << "Preprocessing ... " <<flush;
- preprocess();
- *mlog << "\nCalculating column positions ... " <<flush;
- calc_breaking();
- *mlog << "\nPostprocessing ..." << endl;
- postprocess();
+ Link_array<Paper_column> ret;
+
+ PCursor<Paper_column*> start (l ? find_col (l)+1 : col_p_list_.top ());
+ PCursor<Paper_column*> stop (r ? find_col (r) : col_p_list_.bottom ());
+
+ /*
+ ugh! windows-suck-suck-suck.
+ */
+ while (PCursor<Paper_column*>::compare (start,stop) < 0)
+ {
+ if (start->breakable_b_)
+ ret.push (start);
+ start++;
+ }
+
+ return ret;
+}
+Link_array<Paper_column>
+Paper_score::col_range (Paper_column*l, Paper_column*r) const
+{
+ Link_array<Paper_column> ret;
+
+ PCursor<Paper_column*> start (l ? find_col (l)+1 : col_p_list_.top ());
+ PCursor<Paper_column*> stop (r ? find_col (r) : col_p_list_.bottom ());
+ ret.push (l);
+
+ /*
+ ugh! windows-suck-suck-suck.
+ */
+ while (PCursor<Paper_column*>::compare (start,stop) < 0)
+ ret.push (start++);
+ ret.push (r);
+ return ret;
+}
+
+Link_array<Item>
+Paper_score::broken_col_range (Item const*l_item_l, Item const*r_item_l) const
+{
+ Link_array<Item> ret;
+ Item const*l=l_item_l;
+ Item const*r=r_item_l;
+
+ while (! l->is_type_b(Paper_column::static_name ()))
+ l = l->axis_group_l_a_[X_AXIS]->item ();
+
+ while (! r->is_type_b(Paper_column::static_name ()))
+ r = r->axis_group_l_a_[X_AXIS]->item ();
+
+ PCursor<Paper_column*> start (l ? find_col ((Paper_column*)l)+1 : col_p_list_.top ());
+ PCursor<Paper_column*> stop (r ? find_col ((Paper_column*)r) : col_p_list_.bottom ());
+
+ /*
+ ugh! windows-suck-suck-suck.
+ */
+ while (PCursor<Paper_column*>::compare (start,stop) < 0)
+ {
+ if (start->breakable_b_ && !start->line_l_)
+ ret.push (start);
+ start++;
+ }
+
+ return ret;
}