2 score-elem.cc -- implement Score_element
4 source file of the GNU LilyPond music typesetter
6 (c) 1997--1998 Han-Wen Nienhuys <hanwen@cs.uu.nl>
13 #include "paper-def.hh"
15 #include "molecule.hh"
16 #include "score-element.hh"
19 #include "line-of-score.hh"
22 #include "molecule.hh"
24 #include "paper-outputter.hh"
26 Score_element::Score_element()
29 transparent_b_ = false;
35 Score_element::Score_element (Score_element const&s)
36 : Directed_graph_node (s), Graphical_element (s)
38 /* called from derived ctor, so most info points to the same deps
39 as (Directed_graph_node&)s. Nobody points to us, so don't copy
44 transparent_b_ = s.transparent_b_;
45 status_i_ = s.status_i_;
46 pscore_l_ = s.pscore_l_;
53 Score_element::~Score_element()
56 assert (status_i_ >=0);
60 Score_element::dependency (int i) const
62 return (Score_element*) get_out_edge_arr ()[i];
66 Score_element::dependency_size () const
68 return get_out_edge_arr ().size ();
72 Score_element::dependent (int i) const
74 return (Score_element*) get_in_edge_arr()[i];
78 Score_element::dependent_size() const
80 return get_in_edge_arr().size ();
86 Score_element::do_width() const
90 Molecule*m = output_p_ ? output_p_ : do_brew_molecule_p();
100 Score_element::do_height() const
103 Molecule*m = output_p_ ? output_p_ : do_brew_molecule_p();
104 r = m->extent().y ();
116 Score_element::print() const
119 DOUT << classname(this) << "{\n";
120 DOUT << "dets: " << dependent_size() << "dependencies: " <<
123 Graphical_element::do_print ();
132 Score_element::paper() const
135 return pscore_l_->paper_l_;
140 Score_element::lookup_l () const
142 return pscore_l_->paper_l_->lookup_l (size_i_);
146 Score_element::add_processing()
156 Score_element::calculate_dependencies (int final, int busy,
157 Score_element_method_pointer funcptr)
159 if (status_i_ >= final)
162 assert (status_i_!= busy);
165 for (int i=0; i < dependency_size(); i++)
166 dependency (i)->calculate_dependencies (final, busy, funcptr);
168 Link_array<Score_element> extra (get_extra_dependencies());
169 for (int i=0; i < extra.size(); i++)
170 extra[i]->calculate_dependencies (final, busy, funcptr);
172 invalidate_cache (X_AXIS);
173 invalidate_cache (Y_AXIS);
179 Score_element::output_processing ()
186 output_p_ = do_brew_molecule_p ();
187 for (PCursor<Atom*> i(output_p_->atoms_); i.ok(); i++)
192 pscore_l_->outputter_l_->output_molecule (output_p_,
204 Score_element::do_break_processing()
206 handle_broken_dependencies();
210 Score_element::do_post_processing()
215 Score_element::do_breakable_col_processing()
217 handle_prebroken_dependencies();
221 Score_element::do_pre_processing()
226 Score_element::do_space_processing ()
231 Score_element::do_add_processing()
236 Score_element::do_substitute_dependency (Score_element*,Score_element*)
240 Score_element::do_substitute_dependent (Score_element*,Score_element*)
245 Score_element::do_unlink()
250 Score_element::do_junk_links()
257 Score_element::do_brew_molecule_p() const
259 Atom a (lookup_l ()->fill (Box (Interval (0,0), Interval (0,0))));
260 return new Molecule (a);
265 Score_element::line_l() const
277 Score_element::remove_dependency (Score_element*e)
280 substitute_dependency (e, 0);
284 Score_element::add_dependency (Score_element*e)
286 Directed_graph_node::add_edge (e);
289 Score_element::substitute_dependency (Score_element* old, Score_element* new_l)
291 do_substitute_dependency (old,new_l);
292 old->do_substitute_dependent (this, 0);
296 Score_element::handle_broken_dependencies()
298 Line_of_score *line = line_l();
302 Link_array<Score_element> remove_us_arr;
303 for (int i=0; i < dependency_size(); i++)
305 Score_element * elt = dependency (i);
306 if (elt->line_l() != line)
308 if (Spanner *sp = dynamic_cast<Spanner *> (elt))
310 Spanner * broken = sp->find_broken_piece (line);
311 substitute_dependency (sp, broken);
313 add_dependency (broken);
315 else if (Item *original = dynamic_cast <Item *> (elt))
317 Item * my_item = original->find_prebroken_piece (line);
319 substitute_dependency (elt, my_item);
321 add_dependency (my_item);
323 remove_us_arr.push (elt);
327 remove_us_arr.default_sort();
328 remove_us_arr.uniq();
329 for (int i=0; i <remove_us_arr.size(); i++)
330 remove_dependency (remove_us_arr[i]);
336 unlike with spanners, the number of items can increase
342 span: item1 item2 item3
344 How to let span (a derived class) know that this happened?
347 Score_element::handle_prebroken_dependencies()
349 Link_array<Score_element> old_arr, new_arr;
351 for (int i=0; i < dependency_size(); i++)
353 Score_element * elt = dependency (i);
354 Item *it_l = dynamic_cast <Item *> (elt);
355 if (it_l && it_l->breakable_b_)
356 if (Item *me = dynamic_cast<Item*> (this) )
358 Score_element *new_l = it_l->find_prebroken_piece (me->break_status_dir_);
361 new_arr.push (new_l);
367 new_arr.push (it_l->broken_to_drul_[LEFT]);
370 new_arr.push (it_l->broken_to_drul_[RIGHT]);
374 for (int i=0; i < old_arr.size(); i++)
376 substitute_dependency (old_arr[i], new_arr[i]);
380 Score_element::handle_prebroken_dependents()
386 Score_element::junk_links ()
388 Directed_graph_node::junk_links();
389 Graphical_element::junk_links ();
394 Score_element::unlink()
397 while (dependency_size())
399 do_substitute_dependency (dependency (0),0);
400 remove_edge_out_idx (0);
402 while (dependent_size())
404 dependent (0)->remove_dependency (this);
406 Graphical_element::unlink ();
410 Link_array<Score_element>
411 Score_element::get_extra_dependencies() const
413 Link_array<Score_element> empty;
418 Score_element::linked_b() const
420 return get_extra_dependencies().size() ||