2 score-elem.cc -- implement Score_elem
4 source file of the GNU LilyPond music typesetter
6 (c) 1997 Han-Wen Nienhuys <hanwen@stack.nl>
8 #include "outputter.hh"
10 #include "paper-def.hh"
12 #include "molecule.hh"
13 #include "score-elem.hh"
18 #include "scoreline.hh"
22 Score_elem::Score_elem()
24 transparent_b_ = false;
29 Score_elem::Score_elem (Score_elem const&s)
30 : Graphical_element (s)
32 /* called from derived ctor, so most info points to the same deps
33 as (Directed_graph_node&)s. Nobody points to us, so don't copy
37 transparent_b_ = s.transparent_b_;
38 status_i_ = s.status_i_;
39 pscore_l_ = s.pscore_l_;
42 Score_elem::~Score_elem()
44 assert (status_i_ >=0);
49 Score_elem::dependency (int i) const
51 return (Score_elem*) get_out_edge_arr ()[i];
55 Score_elem::dependency_size () const
57 return get_out_edge_arr ().size ();
61 Score_elem::dependent (int i) const
63 return (Score_elem*) get_in_edge_arr()[i];
67 Score_elem::dependent_size() const
69 return get_in_edge_arr().size ();
75 Score_elem::do_width() const
79 Molecule*m = brew_molecule_p();
87 Score_elem::do_height() const
90 Molecule*m = brew_molecule_p();
101 Score_elem::print() const
104 DOUT << name() << "{\n";
105 DOUT << "dets: " << dependent_size() << "dependencies: " <<
108 Graphical_element::print ();
117 Score_elem::paper() const
120 return pscore_l_->paper_l_;
125 Score_elem::add_processing()
135 Score_elem::calcalute_dependencies (int final, int busy,
136 Score_elem_method_pointer funcptr)
138 if (status_i_ >= final)
141 assert (status_i_!= busy);
144 for (int i=0; i < dependency_size(); i++)
145 dependency (i)->calcalute_dependencies (final, busy, funcptr);
147 Link_array<Score_elem> extra (get_extra_dependencies());
148 for (int i=0; i < extra.size(); i++)
149 extra[i]->calcalute_dependencies (final, busy, funcptr);
151 invalidate_cache (X_AXIS);
152 invalidate_cache (Y_AXIS);
158 Score_elem::do_brew_molecule ()
162 Molecule *output= brew_molecule_p ();
163 pscore_l_->outputter_l_->output_molecule (output, absolute_offset ());
173 Score_elem::do_break_processing()
175 handle_broken_dependencies();
179 Score_elem::do_post_processing()
184 Score_elem::do_breakable_col_processing()
186 handle_prebroken_dependencies();
190 Score_elem::do_pre_processing()
195 Score_elem::do_add_processing()
200 Score_elem::do_substitute_dependency (Score_elem*,Score_elem*)
204 Score_elem::do_substitute_dependent (Score_elem*,Score_elem*)
209 Score_elem::do_unlink()
214 Score_elem::do_junk_links()
218 IMPLEMENT_IS_TYPE_B1(Score_elem, Graphical_element);
221 Score_elem::brew_molecule_p() const
223 Atom a (paper()->lookup_l ()->fill (Box (Interval (0,0), Interval (0,0))));
224 return new Molecule (a);
229 Score_elem::line_l() const
241 Score_elem::remove_dependency (Score_elem*e)
244 substitute_dependency (e, 0);
248 Score_elem::add_dependency (Score_elem*e)
250 Directed_graph_node::add (e);
253 Score_elem::substitute_dependency (Score_elem* old, Score_elem* new_l)
255 do_substitute_dependency (old,new_l);
256 old->do_substitute_dependent (this, 0);
260 Score_elem::handle_broken_dependencies()
262 Line_of_score *line = line_l();
266 Link_array<Score_elem> remove_us_arr;
267 for (int i=0; i < dependency_size(); i++)
269 Score_elem * elt = dependency (i);
270 if (elt->line_l() != line)
274 Spanner * sp = elt->spanner();
275 Spanner * broken = sp->find_broken_piece (line);
276 substitute_dependency (sp, broken);
278 add_dependency (broken);
280 else if (elt->item())
282 Item * my_item = elt->item()->find_prebroken_piece (line);
284 substitute_dependency (elt, my_item);
286 add_dependency (my_item);
288 remove_us_arr.push (elt);
292 remove_us_arr.default_sort();
293 remove_us_arr.uniq();
294 for (int i=0; i <remove_us_arr.size(); i++)
295 remove_dependency (remove_us_arr[i]);
301 unlike with spanners, the number of items can increase
307 span: item1 item2 item3
309 How to let span (a derived class) know that this happened?
312 Score_elem::handle_prebroken_dependencies()
314 Link_array<Score_elem> old_arr, new_arr;
316 for (int i=0; i < dependency_size(); i++)
318 Score_elem * elt = dependency (i);
319 Item *it_l = elt->item();
320 if (it_l && it_l->breakable_b_)
323 Score_elem *new_l = it_l->find_prebroken_piece (item()->break_status_i_);
326 new_arr.push (new_l);
332 new_arr.push (it_l->broken_to_drul_[LEFT]);
335 new_arr.push (it_l->broken_to_drul_[RIGHT]);
339 for (int i=0; i < old_arr.size(); i++)
341 substitute_dependency (old_arr[i], new_arr[i]);
346 Score_elem::junk_links ()
348 Directed_graph_node::junk_links();
349 Graphical_element::junk_links ();
357 while (dependency_size())
359 do_substitute_dependency (dependency (0),0);
360 remove_edge_out_idx (0);
362 while (dependent_size())
364 dependent (0)->remove_dependency (this);
366 for (int j=0; j < 2; j++)
367 if (axis_group_l_a_[j])
368 axis_group_l_a_[j]->remove_element (this);
372 Link_array<Score_elem>
373 Score_elem::get_extra_dependencies() const
375 Link_array<Score_elem> empty;
380 Score_elem::linked_b() const
382 return get_extra_dependencies().size() ||