2 tie-engraver.cc -- implement Tie_engraver
4 source file of the GNU LilyPond music typesetter
6 (c) 1998--2002 Han-Wen Nienhuys <hanwen@cs.uu.nl>
13 #include "translator-group.hh"
15 #include "tie-column.hh"
16 #include "engraver.hh"
18 #include "grob-pitch-tuple.hh"
20 #include "note-head.hh"
23 Manufacture ties. Acknowledge noteheads, and put them into a
24 priority queue. If we have a TieEvent, connect the notes that finish
25 just at this time, and note that start at this time.
27 TODO: Remove the dependency on musical info. We should tie on the
28 basis of position and duration-log of the heads (not of the reqs).
31 class Tie_engraver : public Engraver
37 Link_array<Grob> now_heads_;
38 Link_array<Grob> stopped_heads_;
39 Link_array<Grob> ties_;
41 Spanner * tie_column_;
43 void set_melisma (bool);
46 virtual void start_translation_timestep ();
47 virtual void stop_translation_timestep ();
48 virtual void acknowledge_grob (Grob_info);
49 virtual bool try_music (Music*);
50 virtual void process_acknowledged_grobs ();
51 void typeset_tie (Grob*);
53 TRANSLATOR_DECLARATIONS(Tie_engraver);
58 Tie_engraver::Tie_engraver ()
66 Tie_engraver::try_music (Music *mus)
69 SCM m = get_property ("automaticMelismata");
70 bool am = gh_boolean_p (m) &&gh_scm2bool (m);
79 Tie_engraver::set_melisma (bool m)
81 daddy_trans_->set_property ("tieMelismaBusy", m ? SCM_BOOL_T : SCM_BOOL_F);
85 Tie_engraver::acknowledge_grob (Grob_info i)
87 if (Note_head::has_interface (i.grob_))
89 now_heads_.push (i.grob_);
94 head_pitch_compare (Grob *const&a,Grob *const&b)
96 Music *m1 =unsmob_music (a->get_grob_property ("cause"));
97 Music *m2 =unsmob_music (b->get_grob_property ("cause"));
99 return Pitch::compare (* unsmob_pitch (m1->get_mus_property ("pitch")),
100 * unsmob_pitch (m2->get_mus_property ("pitch")));
104 Tie_engraver::process_acknowledged_grobs ()
108 now_heads_.sort (&head_pitch_compare);
110 We could sort stopped_heads_ as well (and use a linear alg. in
111 stead of nested loop), but we'd have to use a stable sorting
112 algorithm, since the ordering of the stopped heads (of the
113 same pitch) is relevant.
116 SCM head_list = SCM_EOL;
118 for (int i = now_heads_.size(); i--;)
120 for (int j = stopped_heads_.size(); j--;)
123 = head_pitch_compare (now_heads_[i], stopped_heads_[j]);
127 head_list = gh_cons (gh_cons (stopped_heads_[j]->self_scm (),
128 now_heads_[i]->self_scm ()),
132 stopped_heads_.del (j);
138 SCM basic = get_property ("Tie");
139 SCM sparse = get_property ("sparseTies");
140 if (to_boolean (sparse))
142 int i = scm_ilength (head_list);
147 SCM pair = scm_list_ref (head_list, gh_int2scm (i/2));
149 Spanner * p = new Spanner (basic);
151 Tie::set_interface (p); // cannot remove.
152 Tie::set_head (p,LEFT, dynamic_cast<Item*> (unsmob_grob (ly_car (pair))));
153 Tie::set_head (p,RIGHT, dynamic_cast<Item*> (unsmob_grob (ly_cdr (pair))));
156 announce_grob(p, req_->self_scm());
158 else for (SCM s = head_list; gh_pair_p (s); s = ly_cdr (s))
160 Grob * p = new Spanner (basic);
161 Tie::set_interface (p); // cannot remove yet!
163 Tie::set_head (p, LEFT, dynamic_cast<Item*> (unsmob_grob (ly_caar (s))));
164 Tie::set_head (p, RIGHT, dynamic_cast<Item*> (unsmob_grob (ly_cdar (s))));
167 announce_grob(p, req_->self_scm());
170 if (ties_.size () > 1 && !tie_column_)
172 tie_column_ = new Spanner (get_property ("TieColumn"));
174 for (int i = ties_.size (); i--;)
175 Tie_column::add_tie (tie_column_,ties_ [i]);
176 announce_grob(tie_column_, SCM_EOL);
183 Tie_engraver::stop_translation_timestep ()
190 we don't warn for no ties, since this happens naturally when you
191 use skipTypesetting. */
193 for (int i=0; i< ties_.size (); i++)
195 typeset_tie (ties_[i]);
200 typeset_grob (tie_column_);
206 Tie_engraver::typeset_tie (Grob *her)
208 if (! (Tie::head (her,LEFT) && Tie::head (her,RIGHT)))
209 warning (_ ("lonely tie"));
212 Drul_array<Grob *> new_head_drul;
213 new_head_drul[LEFT] = Tie::head (her,LEFT);
214 new_head_drul[RIGHT] = Tie::head (her,RIGHT);
216 if (!Tie::head (her,d))
217 new_head_drul[d] = Tie::head (her, (Direction)-d);
218 } while (flip (&d) != LEFT);
220 index_set_cell (her->get_grob_property ("heads"), LEFT, new_head_drul[LEFT]->self_scm ());
221 index_set_cell (her->get_grob_property ("heads"), RIGHT, new_head_drul[RIGHT]->self_scm ());
227 Tie_engraver::start_translation_timestep ()
229 SCM m = get_property ("automaticMelismata");
235 SCM grobs = get_property ("busyGrobs");
236 Moment now = now_mom();
237 stopped_heads_.clear ();
239 for (; gh_pair_p (grobs); grobs = gh_cdr (grobs))
241 Grob * grob = unsmob_grob (gh_cdar (grobs));
242 Moment end =*unsmob_moment (gh_caar (grobs));
245 This is slightly ugh: we are now confunding the frontend
246 (iterators) and the backend (note heads) */
250 && Note_head::has_interface (grob))
251 stopped_heads_.push (grob);
257 The list starts with entries that start earlier. By going through
258 it, we reverse the order, where as we'd like to use the `last'
261 This makes a difference for grace notes. If we have
265 Then busyGrobs will have ((1/4 . gc8) (1/4 . c4)).
267 We want stopped_heads_ to contain (c4 gc8), because we start with
270 stopped_heads_.reverse();
274 ENTER_DESCRIPTION(Tie_engraver,
275 /* descr */ "Generate ties between noteheads of equal pitch.",
276 /* creats*/ "Tie TieColumn",
277 /* accepts */ "tie-event",
278 /* acks */ "rhythmic-head-interface",
279 /* reads */ "sparseTies tieMelismaBusy",