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"] ++;
151 Link_array<Score_element>
152 Paper_score::remove_break_helpers ()
154 Link_array<Score_element> to_remove;
155 Link_array<Score_element> keep;
156 for (int i=0; i < elem_p_arr_.size (); i++)
158 Score_element*e = elem_p_arr_[i];
159 if (e->break_helper_only_b_)
166 Link_array<Spanner> keeps;
167 for (int i=0; i<span_p_arr_.size ();i++)
169 Spanner *s = span_p_arr_[i];
170 Score_element *e = s;
171 if (e->break_helper_only_b_)
184 Paper_score::process ()
186 Dictionary<int> type_stats;
187 type_stats["Item"] =0;
188 type_stats["Spanner"] =0;
189 type_stats["Total"]=0;
192 *mlog << _ ("Preprocessing elements...") << " " << flush;
193 line_l_->breakable_col_processing ();
194 line_l_->pre_processing ();
196 *mlog << '\n' << _ ("Calculating column positions...") << " " << flush;
197 line_l_->space_processing ();
199 Array<Column_x_positions> breaking = calc_breaking ();
201 delete_array_contents (remove_break_helpers(), type_stats);
203 Paper_stream* paper_stream_p = paper_l_->paper_stream_p ();
204 outputter_l_ = paper_l_->paper_outputter_p (paper_stream_p, header_l_, origin_str_);
206 Link_array<Line_of_score> lines;
207 for (int i=0; i < breaking.size (); i++)
209 Line_of_score *line_l = line_l_->set_breaking (breaking, i);
211 if (line_l != line_l_)
212 typeset_element (line_l);
215 if (experimental_features_global_b)
216 *mlog << elem_p_arr_.size () + span_p_arr_.size () << " elements. ";
217 *mlog << "\nLine ... ";
218 for (int i=0; i < lines.size (); i++)
220 *mlog << '[' << flush;
222 Line_of_score *line_l = lines[i];
223 line_l->break_processing ();
224 line_l->post_processing ();
226 line_l->output_all ();
228 if (experimental_features_global_b)
229 *mlog << '(' << elem_p_arr_.size () + span_p_arr_.size () << ')';
231 *mlog << ']' << flush;
232 Link_array<Score_element> to_remove (remove_line (line_l));
234 delete_array_contents (to_remove, type_stats);
239 delete paper_stream_p;
246 if (experimental_features_global_b)
248 for (Dictionary_iter<int> i(type_stats); i.ok(); i++)
250 *mlog << i.key () << ": " << i.val () << " objects\n";
253 *mlog << '\n' << flush;
258 Link_array<Score_element>
259 Paper_score::remove_line (Line_of_score *l)
261 Link_array<Score_element> to_remove;
262 Link_array<Score_element> keep;
263 for (int i=0; i < elem_p_arr_.size (); i++)
265 Score_element*e = elem_p_arr_[i];
266 if (e->line_l () == l)
273 Link_array<Spanner> keeps;
274 for (int i=0; i<span_p_arr_.size ();i++)
276 Spanner *s = span_p_arr_[i];
277 Score_element *e = s;
278 if (e->line_l () == l)
290 Paper_score::broken_col_range (Item const*l, Item const*r) const
292 Link_array<Item> ret;
298 ? find_col_idx (dynamic_cast<Paper_column*> ((Item*)l))+1
302 ? find_col_idx (dynamic_cast<Paper_column*>((Item*)r))
303 : col_l_arr_.size ();
307 Paper_column *c = col_l_arr_[start];
308 if (c->breakable_b_ && !c->line_l_)