2 p-score.cc -- implement Paper_score
4 source file of the GNU LilyPond music typesetter
6 (c) 1996, 1997--1998 Han-Wen Nienhuys <hanwen@cs.uu.nl>
13 #include "paper-def.hh"
14 #include "line-of-score.hh"
21 #include "word-wrap.hh"
22 #include "gourlay-breaking.hh"
23 #include "paper-stream.hh"
24 #include "paper-outputter.hh"
25 #include "file-results.hh"
28 #if 0 // has w32 advanced?
29 // sucking Cygnus egcs - w32
34 Paper_score::Paper_score ()
37 Line_of_score * line_p = new Line_of_score;
38 typeset_unbroken_spanner (line_p);
43 Paper_score::~Paper_score ()
46 for (int i=0; i< line_l_arr_.size (); i++)
47 line_l_arr_[i]->unlink_all ();
49 for (PCursor<Score_element*> i(elem_p_list_.top()); i.ok(); i++)
54 assert (! i->linked_b ());
60 Paper_score::typeset_element (Score_element * elem_p)
62 elem_p_list_.bottom ().add (elem_p);
63 elem_p->pscore_l_ = this;
64 elem_p->add_processing ();
68 Paper_score::typeset_broken_spanner (Spanner*span_p)
70 typeset_element (span_p);
75 Paper_score::typeset_unbroken_spanner (Spanner*span_p)
77 span_p_list_.bottom ().add (span_p);
78 span_p->pscore_l_=this;
80 // do not init start/stop fields. These are for broken spans only.
81 span_p->add_processing ();
86 Paper_score::clean_cols ()
89 for (iter_top (col_p_list_,c); c.ok ();)
91 c->set_rank (rank_i++);
97 Paper_score::add_column (Paper_column *p)
99 col_p_list_.bottom ().add (p);
106 Paper_score::print () const
111 DOUT << "Paper_score { ";
112 DOUT << "\n elements: ";
113 for (iter_top (elem_p_list_,cc); cc.ok (); cc++)
115 DOUT << "\n unbroken spanners: ";
116 for (iter (span_p_list_.top (), i); i.ok (); i++)
123 PCursor<Paper_column *>
124 Paper_score::find_col (Paper_column const *c) const
126 Paper_column const *what = c;
128 return col_p_list_.find ((Paper_column*)what);
134 Paper_score::set_breaking (Array<Column_x_positions> const &breaking)
136 for (iter (span_p_list_.top (),i); i.ok ();)
138 Spanner *span_p = i.remove_p ();
139 if (span_p->broken_b ()
140 || !((Score_element*)span_p)->line_l ())
147 typeset_broken_spanner (span_p);
150 for (iter (elem_p_list_.top (),i); i.ok () ;)
152 Item *i_l =dynamic_cast <Item *> (i);
153 if (i_l && !i_l->line_l ())
156 Score_element * item_p= i.remove_p ();
166 Array<Column_x_positions>
167 Paper_score::calc_breaking ()
169 Break_algorithm *algorithm_p=0;
170 Array<Column_x_positions> sol;
171 bool try_wrap = ! paper_l_->get_var ("castingalgorithm");
175 algorithm_p = new Gourlay_breaking ;
176 algorithm_p->set_pscore (this);
177 sol = algorithm_p->solve ();
181 warning (_ ("Can't solve this casting problem exactly; revert to Word_wrap"));
187 algorithm_p = new Word_wrap;
188 algorithm_p->set_pscore (this);
189 sol = algorithm_p->solve ();
198 Paper_score::process ()
202 *mlog << _ ("Preprocessing elements...") << " " << flush;
203 line_l_->breakable_col_processing ();
204 line_l_->pre_processing ();
206 *mlog << '\n' << _ ("Calculating column positions...") << " " << flush;
207 line_l_->space_processing ();
209 Array<Column_x_positions> breaking = calc_breaking ();
211 Paper_stream* paper_stream_p = paper_l_->paper_stream_p ();
212 outputter_l_ = paper_l_->paper_outputter_p (paper_stream_p, header_l_, origin_str_);
214 Link_array<Line_of_score> lines;
215 for (int i=0; i < breaking.size (); i++)
217 Line_of_score *line_l = line_l_->set_breaking (breaking, i);
219 if (line_l != line_l_)
220 typeset_broken_spanner (line_l);
224 *mlog << "\nLine ... ";
225 for (int i=0; i < lines.size (); i++)
227 *mlog << '[' << flush;
229 Line_of_score *line_l = lines[i];
230 line_l->break_processing ();
231 line_l->post_processing ();
233 line_l->output_all ();
234 *mlog << ']' << flush;
235 remove_line (line_l);
240 delete paper_stream_p;
243 *mlog << '\n' << flush;
247 Paper_score::remove_line (Line_of_score *l)
249 Link_array<Score_element> to_remove;
250 for (PCursor<Score_element*> i(elem_p_list_.top ()); i.ok (); )
252 if (i->line_l () == l)
253 to_remove.push (i.remove_p ());
258 for (PCursor<Spanner*> i (span_p_list_.top ()); i.ok (); )
260 Score_element *e = i.ptr ();
261 if (e->line_l () == l)
262 to_remove.push (i.remove_p ());
268 for (int i=0; i < to_remove.size (); i++)
270 to_remove[i]->unlink ();
271 assert (!to_remove[i]->linked_b ());
272 delete to_remove [i];
276 /** Get all breakable columns between l and r, (not counting l and r). */
277 Link_array<Paper_column>
278 Paper_score::breakable_col_range (Paper_column*l, Paper_column*r) const
280 Link_array<Paper_column> ret;
282 PCursor<Paper_column*> start (l ? find_col (l)+1 : col_p_list_.top ());
283 PCursor<Paper_column*> stop (r ? find_col (r) : col_p_list_.bottom ());
286 ugh! windows-suck-suck-suck.
288 while (PCursor<Paper_column*>::compare (start,stop) < 0)
290 if (start->breakable_b_)
299 Link_array<Paper_column>
300 Paper_score::col_range (Paper_column*l, Paper_column*r) const
302 Link_array<Paper_column> ret;
304 PCursor<Paper_column*> start (l ? find_col (l)+1 : col_p_list_.top ());
305 PCursor<Paper_column*> stop (r ? find_col (r) : col_p_list_.bottom ());
309 ugh! windows-suck-suck-suck.
311 while (PCursor<Paper_column*>::compare (start,stop) < 0)
318 Paper_score::broken_col_range (Item const*l_item_l, Item const*r_item_l) const
320 Link_array<Item> ret;
321 Item const*l=l_item_l;
322 Item const*r=r_item_l;
324 // huh? see Item::left_right_compare ()
325 while (! (dynamic_cast<Paper_column const *> (l)))
326 l = dynamic_cast<Item*> (l->axis_group_l_a_[X_AXIS]);
328 while (! (dynamic_cast<Paper_column const *> (r)))
329 r = dynamic_cast<Item*>(r->axis_group_l_a_[X_AXIS]);
331 PCursor<Paper_column*> start (l ? find_col ((Paper_column*)l)+1 : col_p_list_.top ());
332 PCursor<Paper_column*> stop (r ? find_col ((Paper_column*)r) : col_p_list_.bottom ());
335 ugh! windows-suck-suck-suck.
337 while (PCursor<Paper_column*>::compare (start,stop) < 0)
339 if (start->breakable_b_ && !start->line_l_)