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 "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 "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"
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 ()
+Paper_score::Paper_score (Paper_score const &s)
+ : Music_output (s)
{
- super_elem_l_->unlink_all ();
- for (PCursor<Score_elem*> i(elem_p_list_.top()); i.ok(); i++)
- assert(!i->linked_b());
+ assert (false);
}
-void
-Paper_score::typeset_element (Score_elem * elem_p)
+Paper_score::~Paper_score ()
{
- elem_p_list_.bottom ().add (elem_p);
- elem_p->pscore_l_ = this;
-
- elem_p->add_processing ();
+ for (int i=0; i < span_p_arr_.size (); i++)
+ delete span_p_arr_[i];
+ for (int i=0; i < elem_p_arr_.size (); i++)
+ delete elem_p_arr_[i];
}
void
-Paper_score::typeset_broken_spanner (Spanner*span_p)
+Paper_score::typeset_element (Score_element * elem_p)
{
- typeset_element (span_p);
+ elem_p_arr_.push (elem_p);
+ elem_p->pscore_l_ = this;
+ elem_p->add_processing ();
}
void
Paper_score::typeset_unbroken_spanner (Spanner*span_p)
{
- span_p_list_.bottom ().add (span_p);
+ span_p_arr_.push (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::clean_cols ()
-{
- int rank_i = 0;
- for (iter_top (col_p_list_,c); c.ok ();)
- {
- c->set_rank (rank_i++);
- c++;
- }
-}
-
void
Paper_score::add_column (Paper_column *p)
{
- col_p_list_.bottom ().add (p);
+ p->set_rank (col_l_arr_.size ());
+ col_l_arr_.push (p);
typeset_element(p);
}
-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++)
- cc->print ();
- DOUT << "\n unbroken spanners: ";
- for (iter (span_p_list_.top (), i); i.ok (); i++)
- i->print ();
+ for (int i=0; i < span_p_arr_.size (); i++)
+ span_p_arr_[i]->print ();
+ for (int i=0; i < elem_p_arr_.size (); i++)
+ elem_p_arr_[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 ();
+#endif
}
-PCursor<Paper_column *>
-Paper_score::find_col (Paper_column const *c) const
+int
+Paper_score::find_col_idx (Paper_column const *c) const
{
Paper_column const *what = c;
-
- return col_p_list_.find ((Paper_column*)what);
-}
-
-
-void
-Paper_score::set_breaking (Array<Col_hpositions> 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 ();)
- {
- 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++;
- }
+ return col_l_arr_.find_i ((Paper_column*)what);
}
-void
+Array<Column_x_positions>
Paper_score::calc_breaking ()
{
Break_algorithm *algorithm_p=0;
- Array<Col_hpositions> sol;
- bool try_wrap = ! paper_l_->get_var ("castingalgorithm");
+ 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 delete_array_contents (Link_array<Score_element> const&to_remove, Dictionary<int> &type_stats)
+{
+ for (int i=0; i < to_remove.size (); i++)
+ {
+ Score_element * e = to_remove[i];
+ String nm = e->name();
+ if (type_stats.elem_b (nm))
+ type_stats[nm] ++;
+ else
+ type_stats[nm] = 1;
+
+ if (dynamic_cast<Item*> (e))
+ type_stats["Item"] ++;
+ else if (dynamic_cast<Spanner*>(e))
+ type_stats["Spanner"] ++;
+ type_stats["Total"] ++;
+
+ e->unlink ();
+ assert (!e->linked_b ());
+ delete e;
+ }
+
+}
+Link_array<Score_element>
+Paper_score::remove_break_helpers ()
+{
+ Link_array<Score_element> to_remove;
+ Link_array<Score_element> keep;
+ for (int i=0; i < elem_p_arr_.size (); i++)
+ {
+ Score_element*e = elem_p_arr_[i];
+ if (e->break_helper_only_b_)
+ to_remove.push (e);
+ else
+ keep.push (e);
+ }
+
+ elem_p_arr_ = keep;
+ Link_array<Spanner> keeps;
+ for (int i=0; i<span_p_arr_.size ();i++)
+ {
+ Spanner *s = span_p_arr_[i];
+ Score_element *e = s;
+ if (e->break_helper_only_b_)
+ to_remove.push (e);
+ else
+ keeps.push (s);
+ }
+
+
+ span_p_arr_ =keeps;
+
+ return to_remove;
}
void
Paper_score::process ()
{
- clean_cols ();
+ Dictionary<int> type_stats;
+ type_stats["Item"] =0;
+ type_stats["Spanner"] =0;
+ type_stats["Total"]=0;
+
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);
+ *mlog << '\n' << _ ("Calculating column positions...") << " " << flush;
+ line_l_->space_processing ();
+
+ Array<Column_x_positions> breaking = calc_breaking ();
+
+ delete_array_contents (remove_break_helpers(), type_stats);
- the_output << "% outputting Score, defined at: " << origin_str_ << "\n";
- if (header_l_)
+ 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++)
{
- the_output << header_l_->TeX_string();
+ Line_of_score *line_l = line_l_->set_breaking (breaking, i);
+ lines.push (line_l);
+ if (line_l != line_l_)
+ typeset_element (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";
-}
-/** 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
-{
- Link_array<Paper_column> ret;
+ if (experimental_features_global_b)
+ *mlog << elem_p_arr_.size () + span_p_arr_.size () << " elements. ";
+ *mlog << "\nLine ... ";
+ for (int i=0; i < lines.size (); i++)
+ {
+ *mlog << '[' << flush;
+
+ Line_of_score *line_l = lines[i];
+ line_l->break_processing ();
+ line_l->post_processing ();
+ *mlog << i << flush;
+ line_l->output_all ();
+
+ if (experimental_features_global_b)
+ *mlog << '(' << elem_p_arr_.size () + span_p_arr_.size () << ')';
+
+ *mlog << ']' << flush;
+ Link_array<Score_element> to_remove (remove_line (line_l));
+
+ delete_array_contents (to_remove, type_stats);
+ }
+
+ // huh?
+ delete outputter_l_;
+ delete paper_stream_p;
+ outputter_l_ = 0;
- 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)
+ todo: sort output
+ */
+ if (experimental_features_global_b)
{
- if (start->breakable_b_)
- ret.push (start);
- start++;
+ for (Dictionary_iter<int> i(type_stats); i.ok(); i++)
+ {
+ *mlog << i.key () << ": " << i.val () << " objects\n";
+ }
}
-
- return ret;
+ *mlog << '\n' << flush;
+
}
-Link_array<Paper_column>
-Paper_score::col_range (Paper_column*l, Paper_column*r) const
+
+
+Link_array<Score_element>
+Paper_score::remove_line (Line_of_score *l)
{
- 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<Score_element> to_remove;
+ Link_array<Score_element> keep;
+ for (int i=0; i < elem_p_arr_.size (); i++)
+ {
+ Score_element*e = elem_p_arr_[i];
+ if (e->line_l () == l)
+ to_remove.push (e);
+ else
+ keep.push (e);
+ }
+
+ elem_p_arr_ = keep;
+ Link_array<Spanner> keeps;
+ for (int i=0; i<span_p_arr_.size ();i++)
+ {
+ Spanner *s = span_p_arr_[i];
+ Score_element *e = s;
+ if (e->line_l () == l)
+ to_remove.push (e);
+ else
+ keeps.push (s);
+ }
+
+
+ span_p_arr_ =keeps;
+ return to_remove;
}
Link_array<Item>
-Paper_score::broken_col_range (Item const*l_item_l, Item const*r_item_l) const
+Paper_score::broken_col_range (Item const*l, Item const*r) 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 ());
+
+ l = l->column_l ();
+ r = r->column_l ();
- /*
- ugh! windows-suck-suck-suck.
- */
- while (PCursor<Paper_column*>::compare (start,stop) < 0)
+ int start = l
+ ? find_col_idx (dynamic_cast<Paper_column*> ((Item*)l))+1
+ : 0;
+
+ int stop = r
+ ? find_col_idx (dynamic_cast<Paper_column*>((Item*)r))
+ : col_l_arr_.size ();
+
+ while (start < stop)
{
- if (start->breakable_b_ && !start->line_l_)
- ret.push (start);
+ Paper_column *c = col_l_arr_[start];
+ if (c->breakable_b_ && !c->line_l_)
+ ret.push (c);
start++;
}
projects / lilypond.git / blobdiff