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"
18 FIXME: should use SCM iso. arrays and have-to-delete pointers.
20 FIXME: this contains memleaks.
24 construct from parser output
27 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)
29 // urg: catch dim modifier: 3rd, 5th, 7th, .. should be lowered
31 for (int i=0; i < add_arr_p->size (); i++)
33 Musical_pitch* p = &(*add_arr_p)[i];
34 if (p->octave_i_ == -100)
40 Chord::rebuild_transpose (add_arr_p, tonic, true);
41 Chord::rebuild_transpose (sub_arr_p, tonic, true);
43 Musical_pitch fifth = Chord::base_arr (tonic).top ();
46 remove double adds (urg: sus4)
48 for (int i = add_arr_p->size () - 1; i >= 0 ; i--)
50 int j = Chord::find_pitch_i (add_arr_p, (*add_arr_p)[i]);
51 if ((j != -1) && (i != j))
58 default chord includes upto 5: <1, 3, 5>
60 add_arr_p->insert (tonic, 0);
61 Array<Musical_pitch> tmp = *add_arr_p;
62 int highest_step = Chord::step_i (tonic, tmp.top ());
67 Musical_pitch* p = &add_arr_p->top ();
74 Array<Musical_pitch> missing_arr = Chord::missing_thirds_pitch_arr (&tmp);
76 missing_arr.push (fifth);
79 if dim modifier is given: lower all missing
83 for (int i=0; i < missing_arr.size (); i++)
85 missing_arr[i].accidental_i_--;
90 if additions include some 3, don't add third
92 Musical_pitch third = Chord::base_arr (tonic)[1];
93 if (Chord::find_notename_i (add_arr_p, third) != -1)
95 int i = Chord::find_pitch_i (&missing_arr, third);
101 if additions include 4, assume sus4 and don't add third implicitely
102 C-sus (4) = c f g (1 4 5)
104 Musical_pitch sus = tonic;
105 sus.transpose (Musical_pitch (3));
106 if (Chord::find_pitch_i (add_arr_p, sus) != -1)
108 int i = Chord::find_pitch_i (&missing_arr, third);
114 if additions include some 5, don't add fifth
116 if (Chord::find_notename_i (add_arr_p, fifth) != -1)
118 int i = Chord::find_pitch_i (&missing_arr, fifth);
125 complete the list of thirds to be added
127 add_arr_p->concat (missing_arr);
128 add_arr_p->sort (Musical_pitch::compare);
130 Array<Musical_pitch> pitch_arr;
132 add all that aren't subtracted
134 for (int i = 0; i < add_arr_p->size (); i++)
136 Musical_pitch p = (*add_arr_p)[i];
138 for (; j < sub_arr_p->size (); j++)
139 if (p == (*sub_arr_p)[j])
145 if (j == sub_arr_p->size ())
149 pitch_arr.sort (Musical_pitch::compare);
151 for (int i = 0; i < sub_arr_p->size (); i++)
152 warning (_f ("invalid subtraction: not part of chord: %s",
153 (*sub_arr_p)[i].str ()));
155 return Chord (pitch_arr, inversion_p, bass_p);
159 Construct from list of pitches and requests
162 to_chord (Array<Musical_pitch> pitch_arr, Tonic_req* tonic_req, Inversion_req* inversion_req, Bass_req* bass_req, bool find_inversion_b)
164 Musical_pitch* inversion_p = 0;
165 Musical_pitch* bass_p = 0;
169 assert (pitch_arr[0].notename_i_ == bass_req->pitch_.notename_i_);
170 bass_p = new Musical_pitch (pitch_arr.get (0));
175 assert (pitch_arr[0].notename_i_ == inversion_req->pitch_.notename_i_);
176 inversion_p = new Musical_pitch (inversion_req->pitch_);
178 int tonic_i = Chord::find_notename_i (&pitch_arr, tonic_req->pitch_);
180 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
183 if (find_inversion_b && !inversion_p)
185 int tonic_i = tonic_req
186 ? Chord::find_notename_i (&pitch_arr, tonic_req->pitch_)
187 : Chord::find_tonic_i (&pitch_arr);
191 inversion_p = &pitch_arr[0];
192 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
198 assert (pitch_arr[0].notename_i_ == tonic_req->pitch_.notename_i_);
201 return Chord (pitch_arr, inversion_p, bass_p);
206 inversion_b_ = false;
210 Chord::Chord (Array<Musical_pitch> pitch_arr, Musical_pitch* inversion_p, Musical_pitch* bass_p)
212 pitch_arr_ = pitch_arr;
213 inversion_b_ = false;
217 inversion_pitch_ = *inversion_p;
222 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_;
239 do something smarter.
242 Chord::base_arr (Musical_pitch p)
244 Array<Musical_pitch> base;
246 p.transpose (Musical_pitch (2));
248 p.transpose (Musical_pitch (2, -1));
254 Chord::rebuild_transpose (Array<Musical_pitch>* pitch_arr_p, Musical_pitch tonic, bool fix7_b)
256 for (int i = 0; i < pitch_arr_p->size (); i++)
258 Musical_pitch p = tonic;
259 Musical_pitch q = (*pitch_arr_p)[i];
261 // duh, c7 should mean <c bes>
262 if (fix7_b && (step_i (tonic, p) == 7))
264 (*pitch_arr_p)[i] = p;
266 pitch_arr_p->sort (Musical_pitch::compare);
270 Chord::find_pitch_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
272 for (int i = 0; i < pitch_arr_p->size (); i++)
273 if (p == (*pitch_arr_p)[i])
279 Chord::find_notename_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
281 int i = find_pitch_i (pitch_arr_p, p);
284 for (int i = 0; i < pitch_arr_p->size (); i++)
286 p.octave_i_ = (*pitch_arr_p)[i].octave_i_;
287 if (p == (*pitch_arr_p)[i])
295 Chord::step_i (Musical_pitch tonic, Musical_pitch p)
297 int i = p.notename_i_ - tonic.notename_i_
298 + (p.octave_i_ - tonic.octave_i_) * 7;
307 do something smarter.
310 Chord::missing_thirds_pitch_arr (Array<Musical_pitch> const* pitch_arr_p)
312 Array<Musical_pitch> thirds;
314 /* is the third c-e, d-f, etc. small or large? */
315 int minormajor_a[] = {0, -1, -1, 0,0,-1,-1};
316 for (int i=0; i < 7; i++)
317 thirds.push (Musical_pitch( 2, minormajor_a[i]));
319 Musical_pitch tonic = (*pitch_arr_p)[0];
320 Musical_pitch last = tonic;
321 Array<Musical_pitch> missing_arr;
323 for (int i = 0; i < pitch_arr_p->size ();)
325 Musical_pitch p = (*pitch_arr_p)[i];
326 int step = step_i (tonic, p);
327 if (last.notename_i_ == p.notename_i_)
328 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
329 if (step > step_i (tonic, last))
331 while (step > step_i (tonic, last))
333 if ((last.notename_i_ - tonic.notename_i_ + 7) % 7 == 6)
335 Musical_pitch special_seven = last;
336 Musical_pitch lower (0, -1);
337 special_seven.transpose (lower);
338 missing_arr.push (special_seven);
342 missing_arr.push (last);
344 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
357 Mangle into list of pitches.
358 For normal chord entry, inversion and bass pitches are retained in
362 Chord::to_pitch_arr () const
364 Array<Musical_pitch> pitch_arr = pitch_arr_;
368 for (; i < pitch_arr.size (); i++)
370 if ((pitch_arr[i].notename_i_ == inversion_pitch_.notename_i_)
371 && (pitch_arr[i].accidental_i_ == inversion_pitch_.accidental_i_))
374 if (i == pitch_arr.size ())
376 warning (_f ("invalid inversion pitch: not part of chord: %s",
377 inversion_pitch_.str ()));
380 rebuild_with_bass (&pitch_arr, i);
385 pitch_arr.insert (bass_pitch_, 0);
386 rebuild_with_bass (&pitch_arr, 0);
392 This routine tries to guess tonic in a possibly inversed chord, ie
393 <e g c'> should produce: C.
394 This is only used for chords that are entered as simultaneous notes,
395 chords entered in \chord mode are fully defined.
398 Chord::find_tonic_i (Array<Musical_pitch> const* pitch_arr_p)
403 first try: base of longest line of thirds
407 for (int i = 0; i < pitch_arr_p->size (); i++)
410 int last_i = (*pitch_arr_p)[i % pitch_arr_p->size ()].notename_i_;
412 for (; j < pitch_arr_p->size (); j++)
414 int cur_i = (*pitch_arr_p)[(i + j + 1) % pitch_arr_p->size ()].notename_i_;
415 int gap = cur_i - last_i;
424 if (j - no_third_i > longest_i)
426 longest_i = j - no_third_i;
432 second try: note after biggest gap
437 for (int i = 0; i < pitch_arr_p->size (); i++)
439 int gap = (*pitch_arr_p)[i].notename_i_
440 - (*pitch_arr_p)[(i - 1 + pitch_arr_p->size ())
441 % pitch_arr_p->size ()].notename_i_;
455 Chord::rebuild_from_base (Array<Musical_pitch>* pitch_arr_p, int base_i)
457 assert (base_i >= 0);
458 Musical_pitch last (0, 0, -5);
459 Array<Musical_pitch> new_arr;
460 for (int i = 0; i < pitch_arr_p->size (); i++)
462 Musical_pitch p = (*pitch_arr_p)[(base_i + i) % pitch_arr_p->size ()];
465 p.octave_i_ = last.octave_i_;
472 *pitch_arr_p = new_arr;
476 Chord::rebuild_insert_inversion (Array<Musical_pitch>* pitch_arr_p, int tonic_i)
478 assert (tonic_i > 0);
479 Musical_pitch inversion = pitch_arr_p->get (0);
480 rebuild_from_base (pitch_arr_p, tonic_i - 1);
481 if (pitch_arr_p->size ())
483 inversion.octave_i_ = (*pitch_arr_p)[0].octave_i_ - 1;
484 while (inversion < (*pitch_arr_p)[0])
485 inversion.octave_i_++;
487 for (int i = 0; i < pitch_arr_p->size (); i++)
488 if ((*pitch_arr_p)[i] > inversion)
490 pitch_arr_p->insert (inversion, i);
496 Chord::rebuild_with_bass (Array<Musical_pitch>* pitch_arr_p, int bass_i)
498 assert (bass_i >= 0);
499 Musical_pitch bass = pitch_arr_p->get (bass_i);
500 // is lowering fine, or should others be raised?
501 if (pitch_arr_p->size ())
502 while (bass > (*pitch_arr_p)[0])
504 pitch_arr_p->insert (bass, 0);