source file of the GNU LilyPond music typesetter
- (c) 1996, 1997 Han-Wen Nienhuys <hanwen@stack.nl>
+ (c) 1996, 1997--1998 Han-Wen Nienhuys <hanwen@cs.uu.nl>
*/
-#include "super-elem.hh"
+#include "main.hh"
#include "debug.hh"
#include "lookup.hh"
#include "spanner.hh"
#include "paper-def.hh"
-#include "scoreline.hh"
+#include "line-of-score.hh"
+#include "pcursor.hh"
+#include "plist.hh"
+#include "p-col.hh"
#include "p-score.hh"
-#include "tex-stream.hh"
#include "p-col.hh"
-#include "header.hh"
+#include "scope.hh"
#include "word-wrap.hh"
#include "gourlay-breaking.hh"
+#include "paper-stream.hh"
+#include "paper-outputter.hh"
+#include "file-results.hh"
+#include "misc.hh"
+
+#if 0 // has w32 advanced?
+// sucking Cygnus egcs - w32
+#include "list.tcc"
+#include "cursor.tcc"
+#endif
Paper_score::Paper_score ()
{
- super_elem_l_ = new Super_elem;
- typeset_element (super_elem_l_);
+ outputter_l_ =0;
+ Line_of_score * line_p = new Line_of_score;
+ typeset_unbroken_spanner (line_p);
+
+ line_l_ = line_p;
}
Paper_score::~Paper_score ()
{
- super_elem_l_->unlink_all ();
- for (PCursor<Score_elem*> i(elem_p_list_.top()); i.ok(); i++)
- assert(!i->linked_b());
+#if 0
+ for (int i=0; i< line_l_arr_.size (); i++)
+ line_l_arr_[i]->unlink_all ();
+
+ for (PCursor<Score_element*> i(elem_p_list_.top()); i.ok(); i++)
+ {
+
+ if (i->linked_b())
+ i->unlink ();
+ assert (! i->linked_b ());
+ }
+#endif
}
void
-Paper_score::typeset_element (Score_elem * elem_p)
+Paper_score::typeset_element (Score_element * elem_p)
{
elem_p_list_.bottom ().add (elem_p);
elem_p->pscore_l_ = this;
-
elem_p->add_processing ();
}
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 ();
}
-void
-Paper_score::OK () const
-{
-#ifndef NDEBUG
- for (PCursor<Score_elem*> i (elem_p_list_.top ()); i.ok (); i++)
- i->OK ();
-#endif
-}
-
void
Paper_score::print () const
-{
+{
#ifndef NPRINT
if (!check_debug)
return ;
DOUT << "Paper_score { ";
DOUT << "\n elements: ";
- for (iter_top (elem_p_list_,cc); cc.ok (); cc++)
+ 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
-Paper_score::preprocess ()
-{
- super_elem_l_->breakable_col_processing ();
- super_elem_l_->pre_processing ();
-}
-void
-Paper_score::postprocess ()
-{
- super_elem_l_->post_processing ();
- super_elem_l_->molecule_processing ();
+ DOUT << "}\n";
+#endif
}
PCursor<Paper_column *>
Paper_score::find_col (Paper_column const *c) const
{
Paper_column const *what = c;
-
+
return col_p_list_.find ((Paper_column*)what);
}
+#if 0
void
-Paper_score::set_breaking (Array<Col_hpositions> const &breaking)
+Paper_score::set_breaking (Array<Column_x_positions> const &breaking)
{
- super_elem_l_->line_of_score_l_->set_breaking (breaking);
- super_elem_l_->break_processing ();
-
-
- for (iter (span_p_list_.top (),i); i.ok ();)
+ for (iter (span_p_list_.top (),i); i.ok ();)
{
Spanner *span_p = i.remove_p ();
- if (span_p->broken_b ())
+ if (span_p->broken_b ()
+ || !((Score_element*)span_p)->line_l ())
{
span_p->unlink ();
delete span_p;
- }else
- {
- typeset_broken_spanner (span_p);
- }
+ }
+ else
+ {
+ typeset_broken_spanner (span_p);
+ }
}
- for (iter (elem_p_list_.top (),i); i.ok () ;)
+ for (iter (elem_p_list_.top (),i); i.ok () ;)
{
- Item *i_l =i->item ();
- if (i_l && !i_l->line_l ())
+ Item *i_l =dynamic_cast <Item *> (i);
+ if (i_l && !i_l->line_l ())
{
i_l->unlink ();
- delete i.remove_p ();
+ Score_element * item_p= i.remove_p ();
+ delete item_p;
}
else
i++;
}
}
+#endif
-void
+
+Array<Column_x_positions>
Paper_score::calc_breaking ()
{
Break_algorithm *algorithm_p=0;
- Array<Col_hpositions> sol;
+ Array<Column_x_positions> sol;
bool try_wrap = ! paper_l_->get_var ("castingalgorithm");
- if (!try_wrap)
+ if (!try_wrap)
{
algorithm_p = new Gourlay_breaking ;
algorithm_p->set_pscore (this);
sol = algorithm_p->solve ();
delete algorithm_p;
- if (! sol.size ())
+ if (! sol.size ())
{
- warning ("Can not solve this casting problem exactly; revert to Word_wrap");
+ warning (_ ("Can't solve this casting problem exactly; revert to Word_wrap"));
try_wrap = true;
}
}
- if (try_wrap)
+ if (try_wrap)
{
- algorithm_p = new Word_wrap;
+ algorithm_p = new Word_wrap;
algorithm_p->set_pscore (this);
sol = algorithm_p->solve ();
delete algorithm_p;
}
- set_breaking (sol);
+ return sol;
}
+
+
void
Paper_score::process ()
{
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";
+ *mlog << _ ("Preprocessing elements...") << " " << flush;
+ line_l_->breakable_col_processing ();
+ line_l_->pre_processing ();
- Tex_stream the_output (outname);
-
- the_output << "% outputting Score, defined at: " << origin_str_ << "\n";
- if (header_l_)
+ *mlog << '\n' << _ ("Calculating column positions...") << " " << flush;
+ line_l_->space_processing ();
+
+ Array<Column_x_positions> breaking = calc_breaking ();
+
+ Paper_stream* paper_stream_p = paper_l_->paper_stream_p ();
+ outputter_l_ = paper_l_->paper_outputter_p (paper_stream_p, header_l_, origin_str_);
+
+ Link_array<Line_of_score> lines;
+ for (int i=0; i < breaking.size (); i++)
+ {
+ Line_of_score *line_l = line_l_->set_breaking (breaking, i);
+ lines.push (line_l);
+ if (line_l != line_l_)
+ typeset_broken_spanner (line_l);
+
+ }
+
+ *mlog << "\nLine ... ";
+ for (int i=0; i < lines.size (); i++)
{
- the_output << header_l_->TeX_string();
+ *mlog << '[' << flush;
+
+ Line_of_score *line_l = lines[i];
+ line_l->break_processing ();
+ line_l->post_processing ();
+ *mlog << i << flush;
+ line_l->output_all ();
+ *mlog << ']' << flush;
+ remove_line (line_l);
}
- the_output << "\n "<< paper_l_->lookup_l ()->texsetting << "%(Tex id)\n";
- the_output<< super_elem_l_->TeX_output_str ();
- the_output << "\n\\EndLilyPondOutput";
+ // huh?
+ delete outputter_l_;
+ delete paper_stream_p;
+ outputter_l_ = 0;
+
+ *mlog << '\n' << flush;
+}
+
+void
+Paper_score::remove_line (Line_of_score *l)
+{
+ Link_array<Score_element> to_remove;
+ for (PCursor<Score_element*> i(elem_p_list_.top ()); i.ok (); )
+ {
+ if (i->line_l () == l)
+ to_remove.push (i.remove_p ());
+ else
+ i++;
+ }
+
+ for (PCursor<Spanner*> i (span_p_list_.top ()); i.ok (); )
+ {
+ Score_element *e = i.ptr ();
+ if (e->line_l () == l)
+ to_remove.push (i.remove_p ());
+ else
+ i++;
+ }
+
+ // l->unlink_all ();
+ for (int i=0; i < to_remove.size (); i++)
+ {
+ to_remove[i]->unlink ();
+ assert (!to_remove[i]->linked_b ());
+ delete to_remove [i];
+ }
}
/** 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
+Paper_score::breakable_col_range (Paper_column*l, Paper_column*r) const
{
Link_array<Paper_column> ret;
/*
ugh! windows-suck-suck-suck.
*/
- while (PCursor<Paper_column*>::compare (start,stop) < 0)
+ while (PCursor<Paper_column*>::compare (start,stop) < 0)
{
if (start->breakable_b_)
ret.push (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.
*/
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 ();
-
+
+ // huh? see Item::left_right_compare ()
+ while (! (dynamic_cast<Paper_column const *> (l)))
+ l = dynamic_cast<Item*> (l->axis_group_l_a_[X_AXIS]);
+
+ while (! (dynamic_cast<Paper_column const *> (r)))
+ r = dynamic_cast<Item*>(r->axis_group_l_a_[X_AXIS]);
+
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)
+ while (PCursor<Paper_column*>::compare (start,stop) < 0)
{
if (start->breakable_b_ && !start->line_l_)
ret.push (start);