2 chord.cc -- implement Chord
4 source file of the GNU LilyPond music typesetter
6 (c) 1999--2000 Jan Nieuwenhuizen <janneke@gnu.org>
10 #include "musical-request.hh"
13 #include "molecule.hh"
14 #include "paper-def.hh"
19 construct from parser output
22 to_chord (Musical_pitch tonic, Array<Musical_pitch>* add_arr_p, Array<Musical_pitch>* sub_arr_p, Musical_pitch* inversion_p, Musical_pitch* bass_p)
24 // urg: catch dim modifier: 3rd, 5th, 7th, .. should be lowered
26 for (int i=0; i < add_arr_p->size (); i++)
28 Musical_pitch* p = &(*add_arr_p)[i];
29 if (p->octave_i_ == -100)
35 Chord::rebuild_transpose (add_arr_p, tonic, true);
36 Chord::rebuild_transpose (sub_arr_p, tonic, true);
38 Musical_pitch fifth = Chord::base_arr (tonic).top ();
41 remove double adds (urg: sus4)
43 for (int i = add_arr_p->size () - 1; i >= 0 ; i--)
45 int j = Chord::find_pitch_i (add_arr_p, (*add_arr_p)[i]);
46 if ((j != -1) && (i != j))
53 default chord includes upto 5: <1, 3, 5>
55 add_arr_p->insert (tonic, 0);
56 Array<Musical_pitch> tmp = *add_arr_p;
57 int highest_step = Chord::step_i (tonic, tmp.top ());
62 Musical_pitch* p = &add_arr_p->top ();
69 Array<Musical_pitch> missing_arr = Chord::missing_thirds_pitch_arr (&tmp);
71 missing_arr.push (fifth);
74 if dim modifier is given: lower all missing
78 for (int i=0; i < missing_arr.size (); i++)
80 missing_arr[i].accidental_i_--;
85 if additions include some 3, don't add third
87 Musical_pitch third = Chord::base_arr (tonic)[1];
88 if (Chord::find_notename_i (add_arr_p, third) != -1)
90 int i = Chord::find_pitch_i (&missing_arr, third);
96 if additions include 4, assume sus4 and don't add third implicitely
97 C-sus (4) = c f g (1 4 5)
99 Musical_pitch sus = tonic;
100 sus.transpose (Musical_pitch (3));
101 if (Chord::find_pitch_i (add_arr_p, sus) != -1)
103 int i = Chord::find_pitch_i (&missing_arr, third);
109 if additions include some 5, don't add fifth
111 if (Chord::find_notename_i (add_arr_p, fifth) != -1)
113 int i = Chord::find_pitch_i (&missing_arr, fifth);
120 complete the list of thirds to be added
122 add_arr_p->concat (missing_arr);
123 add_arr_p->sort (Musical_pitch::compare);
125 Array<Musical_pitch> pitch_arr;
127 add all that aren't subtracted
129 for (int i = 0; i < add_arr_p->size (); i++)
131 Musical_pitch p = (*add_arr_p)[i];
133 for (; j < sub_arr_p->size (); j++)
134 if (p == (*sub_arr_p)[j])
140 if (j == sub_arr_p->size ())
144 pitch_arr.sort (Musical_pitch::compare);
146 for (int i = 0; i < sub_arr_p->size (); i++)
147 warning (_f ("invalid subtraction: not part of chord: %s",
148 (*sub_arr_p)[i].str ()));
150 return Chord (pitch_arr, inversion_p, bass_p);
154 Construct from list of pitches and requests
157 to_chord (Array<Musical_pitch> pitch_arr, Tonic_req* tonic_req, Inversion_req* inversion_req, Bass_req* bass_req, bool find_inversion_b)
159 Musical_pitch* inversion_p = 0;
160 Musical_pitch* bass_p = 0;
164 assert (pitch_arr[0].notename_i_ == bass_req->pitch_.notename_i_);
165 bass_p = new Musical_pitch (pitch_arr.get (0));
170 assert (pitch_arr[0].notename_i_ == inversion_req->pitch_.notename_i_);
171 inversion_p = new Musical_pitch (inversion_req->pitch_);
173 int tonic_i = Chord::find_notename_i (&pitch_arr, tonic_req->pitch_);
175 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
178 if (find_inversion_b && !inversion_p)
180 int tonic_i = tonic_req
181 ? Chord::find_notename_i (&pitch_arr, tonic_req->pitch_)
182 : Chord::find_tonic_i (&pitch_arr);
186 inversion_p = &pitch_arr[0];
187 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
193 assert (pitch_arr[0].notename_i_ == tonic_req->pitch_.notename_i_);
196 Chord chord (pitch_arr, inversion_p, bass_p);
204 inversion_b_ = false;
208 Chord::Chord (Array<Musical_pitch> pitch_arr, Musical_pitch* inversion_p, Musical_pitch* bass_p)
210 pitch_arr_ = pitch_arr;
211 inversion_b_ = false;
215 inversion_pitch_ = *inversion_p;
221 bass_pitch_ = *bass_p;
227 Chord::Chord (Chord const& chord)
229 pitch_arr_ = chord.pitch_arr_;
230 inversion_b_ = chord.inversion_b_;
231 inversion_pitch_ = chord.inversion_pitch_;
232 bass_b_ = chord.bass_b_;
233 bass_pitch_ = chord.bass_pitch_;
238 Chord::base_arr (Musical_pitch p)
240 Array<Musical_pitch> base;
242 p.transpose (Musical_pitch (2));
244 p.transpose (Musical_pitch (2, -1));
250 Chord::rebuild_transpose (Array<Musical_pitch>* pitch_arr_p, Musical_pitch tonic, bool fix7_b)
252 for (int i = 0; i < pitch_arr_p->size (); i++)
254 Musical_pitch p = tonic;
255 Musical_pitch q = (*pitch_arr_p)[i];
257 // duh, c7 should mean <c bes>
258 if (fix7_b && (step_i (tonic, p) == 7))
260 (*pitch_arr_p)[i] = p;
262 pitch_arr_p->sort (Musical_pitch::compare);
266 Chord::find_pitch_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
268 for (int i = 0; i < pitch_arr_p->size (); i++)
269 if (p == (*pitch_arr_p)[i])
275 Chord::find_notename_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
277 int i = find_pitch_i (pitch_arr_p, p);
280 for (int i = 0; i < pitch_arr_p->size (); i++)
282 p.octave_i_ = (*pitch_arr_p)[i].octave_i_;
283 if (p == (*pitch_arr_p)[i])
291 Chord::step_i (Musical_pitch tonic, Musical_pitch p)
293 int i = p.notename_i_ - tonic.notename_i_
294 + (p.octave_i_ - tonic.octave_i_) * 7;
302 Chord::missing_thirds_pitch_arr (Array<Musical_pitch> const* pitch_arr_p)
304 Array<Musical_pitch> thirds;
306 /* is the third c-e, d-f, etc. small or large? */
307 int minormajor_a[] = {0, -1, -1, 0,0,-1,-1};
308 for (int i=0; i < 7; i++)
309 thirds.push (Musical_pitch( 2, minormajor_a[i]));
311 Musical_pitch tonic = (*pitch_arr_p)[0];
312 Musical_pitch last = tonic;
313 Array<Musical_pitch> missing_arr;
315 for (int i = 0; i < pitch_arr_p->size ();)
317 Musical_pitch p = (*pitch_arr_p)[i];
318 int step = step_i (tonic, p);
319 if (last.notename_i_ == p.notename_i_)
320 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
321 if (step > step_i (tonic, last))
323 while (step > step_i (tonic, last))
325 if ((last.notename_i_ - tonic.notename_i_ + 7) % 7 == 6)
327 Musical_pitch special_seven = last;
328 Musical_pitch lower (0, -1);
329 special_seven.transpose (lower);
330 missing_arr.push (special_seven);
334 missing_arr.push (last);
336 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
349 Mangle into list of pitches.
350 For normal chord entry, inversion and bass pitches are retained in
354 Chord::to_pitch_arr () const
356 Array<Musical_pitch> pitch_arr = pitch_arr_;
360 for (; i < pitch_arr.size (); i++)
362 if ((pitch_arr[i].notename_i_ == inversion_pitch_.notename_i_)
363 && (pitch_arr[i].accidental_i_ == inversion_pitch_.accidental_i_))
366 if (i == pitch_arr.size ())
368 warning (_f ("invalid inversion pitch: not part of chord: %s",
369 inversion_pitch_.str ()));
372 rebuild_with_bass (&pitch_arr, i);
377 pitch_arr.insert (bass_pitch_, 0);
378 rebuild_with_bass (&pitch_arr, 0);
384 Chord::find_additions_and_subtractions (Array<Musical_pitch> pitch_arr, Array<Musical_pitch>* add_arr_p, Array<Musical_pitch>* sub_arr_p)
386 Musical_pitch tonic = pitch_arr[0];
388 construct an array of thirds for a normal chord
390 Array<Musical_pitch> all_arr;
391 all_arr.push (tonic);
392 if (step_i (tonic, pitch_arr.top ()) >= 5)
393 all_arr.push (pitch_arr.top ());
395 all_arr.push (base_arr (tonic).top ());
396 all_arr.concat (missing_thirds_pitch_arr (&all_arr));
397 all_arr.sort (Musical_pitch::compare);
401 Musical_pitch last_extra = tonic;
402 while ((i < all_arr.size ()) || (j < pitch_arr.size ()))
404 Musical_pitch a = all_arr [i <? all_arr.size () - 1];
405 Musical_pitch p = pitch_arr[j <? pitch_arr.size () - 1];
407 this pitch is present: do nothing, check next
416 found an extra pitch: chord addition
418 else if ((p < a) || (p.notename_i_ == a.notename_i_))
422 (j < pitch_arr.size ()) ? j++ : i++;
425 a third is missing: chord subtraction
429 if (last_extra.notename_i_ != a.notename_i_)
431 (i < all_arr.size ()) ? i++ : j++;
436 /* add missing basic steps */
437 if (step_i (tonic, pitch_arr.top ()) < 3)
438 sub_arr_p->push (base_arr (tonic)[1]);
439 if (step_i (tonic, pitch_arr.top ()) < 5)
440 sub_arr_p->push (base_arr (tonic).top ());
443 add highest addition, because it names chord, if greater than 5
445 (1, 3 and) 5 not additions: part of normal chord
447 if ((step_i (tonic, pitch_arr.top ()) > 5)
448 || pitch_arr.top ().accidental_i_)
449 add_arr_p->push (pitch_arr.top ());
454 This routine tries to guess tonic in a possibly inversed chord, ie
455 <e g c'> should produce: C.
456 This is only used for chords that are entered as simultaneous notes,
457 chords entered in \chord mode are fully defined.
460 Chord::find_tonic_i (Array<Musical_pitch> const* pitch_arr_p)
465 first try: base of longest line of thirds
469 for (int i = 0; i < pitch_arr_p->size (); i++)
472 int last_i = (*pitch_arr_p)[i % pitch_arr_p->size ()].notename_i_;
474 for (; j < pitch_arr_p->size (); j++)
476 int cur_i = (*pitch_arr_p)[(i + j + 1) % pitch_arr_p->size ()].notename_i_;
477 int gap = cur_i - last_i;
486 if (j - no_third_i > longest_i)
488 longest_i = j - no_third_i;
494 second try: note after biggest gap
499 for (int i = 0; i < pitch_arr_p->size (); i++)
501 int gap = (*pitch_arr_p)[i].notename_i_
502 - (*pitch_arr_p)[(i - 1 + pitch_arr_p->size ())
503 % pitch_arr_p->size ()].notename_i_;
517 Chord::rebuild_from_base (Array<Musical_pitch>* pitch_arr_p, int base_i)
519 assert (base_i >= 0);
520 Musical_pitch last (0, 0, -5);
521 Array<Musical_pitch> new_arr;
522 for (int i = 0; i < pitch_arr_p->size (); i++)
524 Musical_pitch p = (*pitch_arr_p)[(base_i + i) % pitch_arr_p->size ()];
527 p.octave_i_ = last.octave_i_;
534 *pitch_arr_p = new_arr;
538 Chord::rebuild_insert_inversion (Array<Musical_pitch>* pitch_arr_p, int tonic_i)
540 assert (tonic_i > 0);
541 Musical_pitch inversion = pitch_arr_p->get (0);
542 rebuild_from_base (pitch_arr_p, tonic_i - 1);
543 if (pitch_arr_p->size ())
545 inversion.octave_i_ = (*pitch_arr_p)[0].octave_i_ - 1;
546 while (inversion < (*pitch_arr_p)[0])
547 inversion.octave_i_++;
549 for (int i = 0; i < pitch_arr_p->size (); i++)
550 if ((*pitch_arr_p)[i] > inversion)
552 pitch_arr_p->insert (inversion, i);
558 Chord::rebuild_with_bass (Array<Musical_pitch>* pitch_arr_p, int bass_i)
560 assert (bass_i >= 0);
561 Musical_pitch bass = pitch_arr_p->get (bass_i);
562 // is lowering fine, or should others be raised?
563 if (pitch_arr_p->size ())
564 while (bass > (*pitch_arr_p)[0])
566 pitch_arr_p->insert (bass, 0);