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 "ps-stream.hh"
25 #include "tex-stream.hh"
26 #include "paper-outputter.hh"
27 #include "ps-outputter.hh"
28 #include "tex-outputter.hh"
29 #include "file-results.hh"
32 // sucking Cygnus egcs - w32
36 Paper_score::Paper_score ()
39 Line_of_score * line_p = new Line_of_score;
40 typeset_unbroken_spanner (line_p);
45 Paper_score::~Paper_score ()
48 for (int i=0; i< line_l_arr_.size (); i++)
49 line_l_arr_[i]->unlink_all ();
51 for (PCursor<Score_element*> i(elem_p_list_.top()); i.ok(); i++)
56 assert (! i->linked_b ());
62 Paper_score::typeset_element (Score_element * elem_p)
64 elem_p_list_.bottom ().add (elem_p);
65 elem_p->pscore_l_ = this;
66 elem_p->add_processing ();
70 Paper_score::typeset_broken_spanner (Spanner*span_p)
72 typeset_element (span_p);
77 Paper_score::typeset_unbroken_spanner (Spanner*span_p)
79 span_p_list_.bottom ().add (span_p);
80 span_p->pscore_l_=this;
82 // do not init start/stop fields. These are for broken spans only.
83 span_p->add_processing ();
88 Paper_score::clean_cols ()
91 for (iter_top (col_p_list_,c); c.ok ();)
93 c->set_rank (rank_i++);
99 Paper_score::add_column (Paper_column *p)
101 col_p_list_.bottom ().add (p);
108 Paper_score::print () const
113 DOUT << "Paper_score { ";
114 DOUT << "\n elements: ";
115 for (iter_top (elem_p_list_,cc); cc.ok (); cc++)
117 DOUT << "\n unbroken spanners: ";
118 for (iter (span_p_list_.top (), i); i.ok (); i++)
125 PCursor<Paper_column *>
126 Paper_score::find_col (Paper_column const *c) const
128 Paper_column const *what = c;
130 return col_p_list_.find ((Paper_column*)what);
136 Paper_score::set_breaking (Array<Column_x_positions> const &breaking)
138 for (iter (span_p_list_.top (),i); i.ok ();)
140 Spanner *span_p = i.remove_p ();
141 if (span_p->broken_b ()
142 || !((Score_element*)span_p)->line_l ())
149 typeset_broken_spanner (span_p);
152 for (iter (elem_p_list_.top (),i); i.ok () ;)
154 Item *i_l =i->access_Item ();
155 if (i_l && !i_l->line_l ())
158 Score_element * item_p= i.remove_p ();
168 Array<Column_x_positions>
169 Paper_score::calc_breaking ()
171 Break_algorithm *algorithm_p=0;
172 Array<Column_x_positions> sol;
173 bool try_wrap = ! paper_l_->get_var ("castingalgorithm");
177 algorithm_p = new Gourlay_breaking ;
178 algorithm_p->set_pscore (this);
179 sol = algorithm_p->solve ();
183 warning (_ ("Can't solve this casting problem exactly; revert to Word_wrap"));
189 algorithm_p = new Word_wrap;
190 algorithm_p->set_pscore (this);
191 sol = algorithm_p->solve ();
200 Paper_score::process ()
204 *mlog << _ ("Preprocessing elements...") << " " << flush;
205 line_l_->breakable_col_processing ();
206 line_l_->pre_processing ();
208 *mlog << '\n' << _ ("Calculating column positions...") << " " << flush;
209 line_l_->space_processing ();
211 Array<Column_x_positions> breaking = calc_breaking ();
213 Paper_stream* paper_stream_p = global_lookup_l->paper_stream_p ();
214 outputter_l_ = global_lookup_l->paper_outputter_p (paper_stream_p, paper_l_, header_l_, origin_str_);
216 Link_array<Line_of_score> lines;
217 for (int i=0; i < breaking.size (); i++)
219 Line_of_score *line_l = line_l_->set_breaking (breaking, i);
221 if (line_l != line_l_)
222 typeset_broken_spanner (line_l);
226 *mlog << "\nLine ... ";
227 for (int i=0; i < lines.size (); i++)
229 *mlog << '[' << flush;
231 Line_of_score *line_l = lines[i];
232 line_l->break_processing ();
233 line_l->post_processing ();
235 line_l->output_all ();
236 *mlog << ']' << flush;
237 remove_line (line_l);
242 delete paper_stream_p;
245 *mlog << '\n' << flush;
249 Paper_score::remove_line (Line_of_score *l)
251 Link_array<Score_element> to_remove;
252 for (PCursor<Score_element*> i(elem_p_list_.top ()); i.ok (); )
254 if (i->line_l () == l)
255 to_remove.push (i.remove_p ());
260 for (PCursor<Spanner*> i (span_p_list_.top ()); i.ok (); )
262 Score_element *e = i.ptr ();
263 if (e->line_l () == l)
264 to_remove.push (i.remove_p ());
270 for (int i=0; i < to_remove.size (); i++)
272 to_remove[i]->unlink ();
273 assert (!to_remove[i]->linked_b ());
274 delete to_remove [i];
278 /** Get all breakable columns between l and r, (not counting l and r). */
279 Link_array<Paper_column>
280 Paper_score::breakable_col_range (Paper_column*l, Paper_column*r) const
282 Link_array<Paper_column> ret;
284 PCursor<Paper_column*> start (l ? find_col (l)+1 : col_p_list_.top ());
285 PCursor<Paper_column*> stop (r ? find_col (r) : col_p_list_.bottom ());
288 ugh! windows-suck-suck-suck.
290 while (PCursor<Paper_column*>::compare (start,stop) < 0)
292 if (start->breakable_b_)
301 Link_array<Paper_column>
302 Paper_score::col_range (Paper_column*l, Paper_column*r) const
304 Link_array<Paper_column> ret;
306 PCursor<Paper_column*> start (l ? find_col (l)+1 : col_p_list_.top ());
307 PCursor<Paper_column*> stop (r ? find_col (r) : col_p_list_.bottom ());
311 ugh! windows-suck-suck-suck.
313 while (PCursor<Paper_column*>::compare (start,stop) < 0)
320 Paper_score::broken_col_range (Item const*l_item_l, Item const*r_item_l) const
322 Link_array<Item> ret;
323 Item const*l=l_item_l;
324 Item const*r=r_item_l;
326 while (! l->is_type_b(Paper_column::static_name ()))
327 l = l->axis_group_l_a_[X_AXIS]->access_Score_element ()->access_Item ();
329 while (! r->is_type_b(Paper_column::static_name ()))
330 r = r->axis_group_l_a_[X_AXIS]->access_Score_element ()->access_Item ();
332 PCursor<Paper_column*> start (l ? find_col ((Paper_column*)l)+1 : col_p_list_.top ());
333 PCursor<Paper_column*> stop (r ? find_col ((Paper_column*)r) : col_p_list_.bottom ());
336 ugh! windows-suck-suck-suck.
338 while (PCursor<Paper_column*>::compare (start,stop) < 0)
340 if (start->breakable_b_ && !start->line_l_)