2 p-score.cc -- implement Paper_score
4 source file of the GNU LilyPond music typesetter
6 (c) 1996, 1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
13 #include "paper-def.hh"
14 #include "line-of-score.hh"
19 #include "word-wrap.hh"
20 #include "gourlay-breaking.hh"
21 #include "paper-stream.hh"
22 #include "paper-outputter.hh"
23 #include "file-results.hh"
26 Paper_score::Paper_score ()
29 Line_of_score * line_p = new Line_of_score;
30 typeset_unbroken_spanner (line_p);
35 Paper_score::Paper_score (Paper_score const &s)
41 Paper_score::~Paper_score ()
43 for (int i=0; i < span_p_arr_.size (); i++)
44 delete span_p_arr_[i];
45 for (int i=0; i < elem_p_arr_.size (); i++)
46 delete elem_p_arr_[i];
50 Paper_score::typeset_element (Score_element * elem_p)
52 elem_p_arr_.push (elem_p);
53 elem_p->pscore_l_ = this;
54 elem_p->add_processing ();
59 Paper_score::typeset_unbroken_spanner (Spanner*span_p)
61 span_p_arr_.push (span_p);
62 span_p->pscore_l_=this;
63 span_p->add_processing ();
67 Paper_score::add_column (Paper_column *p)
69 p->set_rank (col_l_arr_.size ());
77 Paper_score::print () const
82 DOUT << "Paper_score { ";
83 DOUT << "\n elements: ";
84 for (int i=0; i < span_p_arr_.size (); i++)
85 span_p_arr_[i]->print ();
86 for (int i=0; i < elem_p_arr_.size (); i++)
87 elem_p_arr_[i]->print();
94 Paper_score::find_col_idx (Paper_column const *c) const
96 Paper_column const *what = c;
98 return col_l_arr_.find_i ((Paper_column*)what);
101 Array<Column_x_positions>
102 Paper_score::calc_breaking ()
104 Break_algorithm *algorithm_p=0;
105 Array<Column_x_positions> sol;
106 bool try_wrap = !paper_l_->get_var ("castingalgorithm");
110 algorithm_p = new Gourlay_breaking ;
111 algorithm_p->set_pscore (this);
112 sol = algorithm_p->solve ();
116 warning (_ ("Can't solve this casting problem exactly; revert to Word_wrap"));
122 algorithm_p = new Word_wrap;
123 algorithm_p->set_pscore (this);
124 sol = algorithm_p->solve ();
132 void delete_array_contents (Link_array<Score_element> const&to_remove, Dictionary<int> &type_stats)
134 for (int i=0; i < to_remove.size (); i++)
136 Score_element * e = to_remove[i];
137 String nm = e->name();
138 if (type_stats.elem_b (nm))
143 if (dynamic_cast<Item*> (e))
144 type_stats["Item"] ++;
145 else if (dynamic_cast<Spanner*>(e))
146 type_stats["Spanner"] ++;
147 type_stats["Total"] ++;
150 assert (!e->linked_b ());
155 Link_array<Score_element>
156 Paper_score::remove_break_helpers ()
158 Link_array<Score_element> to_remove;
159 Link_array<Score_element> keep;
160 for (int i=0; i < elem_p_arr_.size (); i++)
162 Score_element*e = elem_p_arr_[i];
163 if (e->break_helper_only_b_)
170 Link_array<Spanner> keeps;
171 for (int i=0; i<span_p_arr_.size ();i++)
173 Spanner *s = span_p_arr_[i];
174 Score_element *e = s;
175 if (e->break_helper_only_b_)
188 Paper_score::process ()
190 Dictionary<int> type_stats;
191 type_stats["Item"] =0;
192 type_stats["Spanner"] =0;
193 type_stats["Total"]=0;
196 *mlog << _ ("Preprocessing elements...") << " " << flush;
197 line_l_->breakable_col_processing ();
198 line_l_->pre_processing ();
200 *mlog << '\n' << _ ("Calculating column positions...") << " " << flush;
201 line_l_->space_processing ();
203 Array<Column_x_positions> breaking = calc_breaking ();
205 delete_array_contents (remove_break_helpers(), type_stats);
207 Paper_stream* paper_stream_p = paper_l_->paper_stream_p ();
208 outputter_l_ = paper_l_->paper_outputter_p (paper_stream_p, header_l_, origin_str_);
210 Link_array<Line_of_score> lines;
211 for (int i=0; i < breaking.size (); i++)
213 Line_of_score *line_l = line_l_->set_breaking (breaking, i);
215 if (line_l != line_l_)
216 typeset_element (line_l);
219 if (experimental_features_global_b)
220 *mlog << elem_p_arr_.size () + span_p_arr_.size () << " elements. ";
221 *mlog << "\nLine ... ";
222 for (int i=0; i < lines.size (); i++)
224 *mlog << '[' << flush;
226 Line_of_score *line_l = lines[i];
227 line_l->break_processing ();
228 line_l->post_processing ();
230 line_l->output_all ();
232 if (experimental_features_global_b)
233 *mlog << '(' << elem_p_arr_.size () + span_p_arr_.size () << ')';
235 *mlog << ']' << flush;
236 Link_array<Score_element> to_remove (remove_line (line_l));
238 delete_array_contents (to_remove, type_stats);
243 delete paper_stream_p;
250 if (experimental_features_global_b)
252 for (Dictionary_iter<int> i(type_stats); i.ok(); i++)
254 *mlog << i.key () << ": " << i.val () << " objects\n";
257 *mlog << '\n' << flush;
262 Link_array<Score_element>
263 Paper_score::remove_line (Line_of_score *l)
265 Link_array<Score_element> to_remove;
266 Link_array<Score_element> keep;
267 for (int i=0; i < elem_p_arr_.size (); i++)
269 Score_element*e = elem_p_arr_[i];
270 if (e->line_l () == l)
277 Link_array<Spanner> keeps;
278 for (int i=0; i<span_p_arr_.size ();i++)
280 Spanner *s = span_p_arr_[i];
281 Score_element *e = s;
282 if (e->line_l () == l)
294 Paper_score::broken_col_range (Item const*l, Item const*r) const
296 Link_array<Item> ret;
302 ? find_col_idx (dynamic_cast<Paper_column*> ((Item*)l))+1
306 ? find_col_idx (dynamic_cast<Paper_column*>((Item*)r))
307 : col_l_arr_.size ();
311 Paper_column *c = col_l_arr_[start];
312 if (c->breakable_b_ && !c->line_l_)