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 compare (Chord* left, Chord* right)
24 return !(left->inversion_b_ == right->inversion_b_
25 && left->bass_b_ == right->bass_b_
26 && !compare (&left->pitch_arr_, &right->pitch_arr_));
30 FIXME: should use SCM iso. arrays and have-to-delete pointers.
32 FIXME: this contains memleaks.
36 construct from parser output
39 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)
41 // urg: catch dim modifier: 3rd, 5th, 7th, .. should be lowered
43 for (int i=0; i < add_arr_p->size (); i++)
45 Musical_pitch* p = &(*add_arr_p)[i];
46 if (p->octave_i_ == -100)
52 Chord::rebuild_transpose (add_arr_p, tonic, true);
53 Chord::rebuild_transpose (sub_arr_p, tonic, true);
55 Musical_pitch fifth = Chord::base_arr (tonic).top ();
58 remove double adds (urg: sus4)
60 for (int i = add_arr_p->size () - 1; i >= 0 ; i--)
62 int j = Chord::find_pitch_i (add_arr_p, (*add_arr_p)[i]);
63 if ((j != -1) && (i != j))
70 default chord includes upto 5: <1, 3, 5>
72 add_arr_p->insert (tonic, 0);
73 Array<Musical_pitch> tmp = *add_arr_p;
74 int highest_step = Chord::step_i (tonic, tmp.top ());
79 Musical_pitch* p = &add_arr_p->top ();
86 Array<Musical_pitch> missing_arr = Chord::missing_thirds_pitch_arr (&tmp);
88 missing_arr.push (fifth);
91 if dim modifier is given: lower all missing
95 for (int i=0; i < missing_arr.size (); i++)
97 missing_arr[i].accidental_i_--;
102 if additions include some 3, don't add third
104 Musical_pitch third = Chord::base_arr (tonic)[1];
105 if (Chord::find_notename_i (add_arr_p, third) != -1)
107 int i = Chord::find_pitch_i (&missing_arr, third);
113 if additions include 4, assume sus4 and don't add third implicitely
114 C-sus (4) = c f g (1 4 5)
116 Musical_pitch sus = tonic;
117 sus.transpose (Musical_pitch (3));
118 if (Chord::find_pitch_i (add_arr_p, sus) != -1)
120 int i = Chord::find_pitch_i (&missing_arr, third);
126 if additions include some 5, don't add fifth
128 if (Chord::find_notename_i (add_arr_p, fifth) != -1)
130 int i = Chord::find_pitch_i (&missing_arr, fifth);
137 complete the list of thirds to be added
139 add_arr_p->concat (missing_arr);
140 add_arr_p->sort (Musical_pitch::compare);
142 Array<Musical_pitch> pitch_arr;
144 add all that aren't subtracted
146 for (int i = 0; i < add_arr_p->size (); i++)
148 Musical_pitch p = (*add_arr_p)[i];
150 for (; j < sub_arr_p->size (); j++)
151 if (p == (*sub_arr_p)[j])
157 if (j == sub_arr_p->size ())
161 pitch_arr.sort (Musical_pitch::compare);
163 for (int i = 0; i < sub_arr_p->size (); i++)
164 warning (_f ("invalid subtraction: not part of chord: %s",
165 (*sub_arr_p)[i].str ()));
167 return Chord (pitch_arr, inversion_p, bass_p);
171 Construct from list of pitches and requests
174 to_chord (Array<Musical_pitch> pitch_arr, Tonic_req* tonic_req, Inversion_req* inversion_req, Bass_req* bass_req, bool find_inversion_b)
176 Musical_pitch* inversion_p = 0;
177 Musical_pitch* bass_p = 0;
181 assert (pitch_arr[0].notename_i_ == bass_req->pitch_.notename_i_);
182 bass_p = new Musical_pitch (pitch_arr.get (0));
187 assert (pitch_arr[0].notename_i_ == inversion_req->pitch_.notename_i_);
188 inversion_p = new Musical_pitch (inversion_req->pitch_);
190 int tonic_i = Chord::find_notename_i (&pitch_arr, tonic_req->pitch_);
192 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
195 if (find_inversion_b && !inversion_p)
197 int tonic_i = tonic_req
198 ? Chord::find_notename_i (&pitch_arr, tonic_req->pitch_)
199 : Chord::find_tonic_i (&pitch_arr);
203 inversion_p = &pitch_arr[0];
204 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
210 assert (pitch_arr[0].notename_i_ == tonic_req->pitch_.notename_i_);
213 return Chord (pitch_arr, inversion_p, bass_p);
218 inversion_b_ = false;
222 Chord::Chord (Array<Musical_pitch> pitch_arr, Musical_pitch* inversion_p, Musical_pitch* bass_p)
224 pitch_arr_ = pitch_arr;
225 inversion_b_ = false;
229 inversion_pitch_ = *inversion_p;
234 bass_pitch_ = *bass_p;
239 Chord::Chord (Chord const& chord)
241 pitch_arr_ = chord.pitch_arr_;
242 inversion_b_ = chord.inversion_b_;
243 inversion_pitch_ = chord.inversion_pitch_;
244 bass_b_ = chord.bass_b_;
245 bass_pitch_ = chord.bass_pitch_;
251 do something smarter.
254 Chord::base_arr (Musical_pitch p)
256 Array<Musical_pitch> base;
258 p.transpose (Musical_pitch (2));
260 p.transpose (Musical_pitch (2, -1));
266 Chord::rebuild_transpose (Array<Musical_pitch>* pitch_arr_p, Musical_pitch tonic, bool fix7_b)
268 for (int i = 0; i < pitch_arr_p->size (); i++)
270 Musical_pitch p = tonic;
271 Musical_pitch q = (*pitch_arr_p)[i];
273 // duh, c7 should mean <c bes>
274 if (fix7_b && (step_i (tonic, p) == 7))
276 (*pitch_arr_p)[i] = p;
278 pitch_arr_p->sort (Musical_pitch::compare);
282 Chord::find_pitch_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
284 for (int i = 0; i < pitch_arr_p->size (); i++)
285 if (p == (*pitch_arr_p)[i])
291 Chord::find_notename_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
293 int i = find_pitch_i (pitch_arr_p, p);
296 for (int i = 0; i < pitch_arr_p->size (); i++)
298 p.octave_i_ = (*pitch_arr_p)[i].octave_i_;
299 if (p == (*pitch_arr_p)[i])
307 Chord::step_i (Musical_pitch tonic, Musical_pitch p)
309 int i = p.notename_i_ - tonic.notename_i_
310 + (p.octave_i_ - tonic.octave_i_) * 7;
319 do something smarter.
322 Chord::missing_thirds_pitch_arr (Array<Musical_pitch> const* pitch_arr_p)
324 Array<Musical_pitch> thirds;
326 /* is the third c-e, d-f, etc. small or large? */
327 int minormajor_a[] = {0, -1, -1, 0,0,-1,-1};
328 for (int i=0; i < 7; i++)
329 thirds.push (Musical_pitch( 2, minormajor_a[i]));
331 Musical_pitch tonic = (*pitch_arr_p)[0];
332 Musical_pitch last = tonic;
333 Array<Musical_pitch> missing_arr;
335 for (int i = 0; i < pitch_arr_p->size ();)
337 Musical_pitch p = (*pitch_arr_p)[i];
338 int step = step_i (tonic, p);
339 if (last.notename_i_ == p.notename_i_)
340 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
341 if (step > step_i (tonic, last))
343 while (step > step_i (tonic, last))
345 if ((last.notename_i_ - tonic.notename_i_ + 7) % 7 == 6)
347 Musical_pitch special_seven = last;
348 Musical_pitch lower (0, -1);
349 special_seven.transpose (lower);
350 missing_arr.push (special_seven);
354 missing_arr.push (last);
356 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
369 Mangle into list of pitches.
370 For normal chord entry, inversion and bass pitches are retained in
374 Chord::to_pitch_arr () const
376 Array<Musical_pitch> pitch_arr = pitch_arr_;
380 for (; i < pitch_arr.size (); i++)
382 if ((pitch_arr[i].notename_i_ == inversion_pitch_.notename_i_)
383 && (pitch_arr[i].accidental_i_ == inversion_pitch_.accidental_i_))
386 if (i == pitch_arr.size ())
388 warning (_f ("invalid inversion pitch: not part of chord: %s",
389 inversion_pitch_.str ()));
392 rebuild_with_bass (&pitch_arr, i);
397 pitch_arr.insert (bass_pitch_, 0);
398 rebuild_with_bass (&pitch_arr, 0);
404 This routine tries to guess tonic in a possibly inversed chord, ie
405 <e g c'> should produce: C.
406 This is only used for chords that are entered as simultaneous notes,
407 chords entered in \chord mode are fully defined.
410 Chord::find_tonic_i (Array<Musical_pitch> const* pitch_arr_p)
415 first try: base of longest line of thirds
419 for (int i = 0; i < pitch_arr_p->size (); i++)
422 int last_i = (*pitch_arr_p)[i % pitch_arr_p->size ()].notename_i_;
424 for (; j < pitch_arr_p->size (); j++)
426 int cur_i = (*pitch_arr_p)[(i + j + 1) % pitch_arr_p->size ()].notename_i_;
427 int gap = cur_i - last_i;
436 if (j - no_third_i > longest_i)
438 longest_i = j - no_third_i;
444 second try: note after biggest gap
449 for (int i = 0; i < pitch_arr_p->size (); i++)
451 int gap = (*pitch_arr_p)[i].notename_i_
452 - (*pitch_arr_p)[(i - 1 + pitch_arr_p->size ())
453 % pitch_arr_p->size ()].notename_i_;
467 Chord::rebuild_from_base (Array<Musical_pitch>* pitch_arr_p, int base_i)
469 assert (base_i >= 0);
470 Musical_pitch last (0, 0, -5);
471 Array<Musical_pitch> new_arr;
472 for (int i = 0; i < pitch_arr_p->size (); i++)
474 Musical_pitch p = (*pitch_arr_p)[(base_i + i) % pitch_arr_p->size ()];
477 p.octave_i_ = last.octave_i_;
484 *pitch_arr_p = new_arr;
488 Chord::rebuild_insert_inversion (Array<Musical_pitch>* pitch_arr_p, int tonic_i)
490 assert (tonic_i > 0);
491 Musical_pitch inversion = pitch_arr_p->get (0);
492 rebuild_from_base (pitch_arr_p, tonic_i - 1);
493 if (pitch_arr_p->size ())
495 inversion.octave_i_ = (*pitch_arr_p)[0].octave_i_ - 1;
496 while (inversion < (*pitch_arr_p)[0])
497 inversion.octave_i_++;
499 for (int i = 0; i < pitch_arr_p->size (); i++)
500 if ((*pitch_arr_p)[i] > inversion)
502 pitch_arr_p->insert (inversion, i);
508 Chord::rebuild_with_bass (Array<Musical_pitch>* pitch_arr_p, int bass_i)
510 assert (bass_i >= 0);
511 Musical_pitch bass = pitch_arr_p->get (bass_i);
512 // is lowering fine, or should others be raised?
513 if (pitch_arr_p->size ())
514 while (bass > (*pitch_arr_p)[0])
516 pitch_arr_p->insert (bass, 0);