2 chord.cc -- implement Chord
4 source file of the GNU LilyPond music typesetter
6 (c) 1999 Jan Nieuwenhuizen <janneke@gnu.org>
12 // doesn't seem common, and we should know about this during parsing
13 // #define INVERSION_ADDED_AS_BASE 1
15 Chord::Chord (Array<Musical_pitch> pitch_arr)
17 pitch_arr_ = pitch_arr;
21 rebuild_transpose (Musical_pitch tonic, Array<Musical_pitch>* pitch_arr_p)
23 for (int i = 0; i < pitch_arr_p->size (); i++)
25 Musical_pitch p = tonic;
26 Musical_pitch q = (*pitch_arr_p)[i];
27 // duh, c7 should mean <c bes>
28 if (q.notename_i_ == 6)
31 (*pitch_arr_p)[i] = p;
33 pitch_arr_p->sort (Musical_pitch::compare);
37 find_pitch_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
39 for (int i = 0; i < pitch_arr_p->size (); i++)
40 if (p == (*pitch_arr_p)[i])
46 find_notename_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
48 int i = find_pitch_i (pitch_arr_p, p);
51 for (int i = 0; i < pitch_arr_p->size (); i++)
53 p.octave_i_ = (*pitch_arr_p)[i].octave_i_;
54 if (p == (*pitch_arr_p)[i])
62 trap_i (Musical_pitch tonic, Musical_pitch p)
64 int i = p.notename_i_ - tonic.notename_i_
65 + (p.octave_i_ - tonic.octave_i_) * 7;
72 static Array<Musical_pitch>
73 missing_triads_pitch_arr (Array<Musical_pitch>const* pitch_arr_p)
75 Array<Musical_pitch> triads;
77 /* is the third c-e, d-f, etc. small or large? */
78 int minormajor_a[] = {0, -1, -1, 0,0,-1,-1};
79 for (int i=0; i < 7; i++)
80 triads.push (Musical_pitch( 2, minormajor_a[i]));
82 Musical_pitch tonic = (*pitch_arr_p)[0];
83 Musical_pitch last = tonic;
84 Array<Musical_pitch> missing_arr;
86 for (int i = 0; i < pitch_arr_p->size ();)
88 Musical_pitch p = (*pitch_arr_p)[i];
89 int trap = trap_i (tonic, p);
90 if (last.notename_i_ == p.notename_i_)
91 last.transpose (triads[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
92 if (trap > trap_i (tonic, last))
94 while (trap > trap_i (tonic, last))
96 if ((last.notename_i_ - tonic.notename_i_ + 7) % 7 == 6)
98 Musical_pitch special_seven = last;
99 Musical_pitch lower (0, -1);
100 special_seven.transpose (lower);
101 missing_arr.push (special_seven);
105 missing_arr.push (last);
107 last.transpose (triads[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
120 construct from parser output
122 Chord::Chord (Musical_pitch tonic, Array<Musical_pitch>* add_arr_p, Array<Musical_pitch>* sub_arr_p, Musical_pitch* inversion_p)
124 rebuild_transpose (tonic, add_arr_p);
125 rebuild_transpose (tonic, sub_arr_p);
127 Musical_pitch fifth = tonic;
128 fifth.transpose (Musical_pitch (2));
129 fifth.transpose (Musical_pitch (2, -1));
132 remove double adds (urg: sus4)
134 for (int i = add_arr_p->size () - 1; i >= 0 ; i--)
136 int j = ::find_pitch_i (add_arr_p, (*add_arr_p)[i]);
137 if ((j != -1) && (i != j))
144 default chord includes upto 5: <1, 3, 5>
146 add_arr_p->insert (tonic, 0);
147 Array<Musical_pitch> tmp = *add_arr_p;
148 int highest_trap = trap_i (tonic, tmp.top ());
149 if (highest_trap < 5)
155 Array<Musical_pitch> missing_arr = missing_triads_pitch_arr (&tmp);
156 if (highest_trap < 5)
157 missing_arr.push (fifth);
160 if additions include some 3, don't add third
162 Musical_pitch third = tonic;
163 third.transpose (Musical_pitch (2));
164 if (::find_notename_i (add_arr_p, third) != -1)
166 int i = ::find_pitch_i (&missing_arr, third);
172 if additions include 4, assume sus4 and don't add third implicitely
173 C-sus (4) = c f g (1 4 5)
175 Musical_pitch sus = tonic;
176 sus.transpose (Musical_pitch (3));
177 if (::find_pitch_i (add_arr_p, sus) != -1)
179 int i = ::find_pitch_i (&missing_arr, third);
185 if additions include some 5, don't add fifth
187 if (::find_notename_i (add_arr_p, fifth) != -1)
189 int i = ::find_pitch_i (&missing_arr, fifth);
196 complete the list of triads to be added
198 add_arr_p->concat (missing_arr);
199 add_arr_p->sort (Musical_pitch::compare);
202 add all that aren't subtracted
204 for (int i = 0; i < add_arr_p->size (); i++)
206 Musical_pitch p = (*add_arr_p)[i];
208 for (; j < sub_arr_p->size (); j++)
209 if (p == (*sub_arr_p)[j])
215 if (j == sub_arr_p->size ())
219 pitch_arr_.sort (Musical_pitch::compare);
221 for (int i = 0; i < sub_arr_p->size (); i++)
222 warning (_f ("invalid subtraction: not part of chord: %s",
223 (*sub_arr_p)[i].str ()));
228 for (; i < pitch_arr_.size (); i++)
230 if ((pitch_arr_[i].notename_i_ == inversion_p->notename_i_)
231 && (pitch_arr_[i].accidental_i_ == inversion_p->accidental_i_))
234 if (i == pitch_arr_.size ())
236 warning (_f ("invalid inversion pitch: not part of chord: %s",
237 inversion_p->str ()));
241 #if INVERSION_ADDED_AS_BASE
242 pitch_arr_.insert (pitch_arr_[i], 0);
243 rebuild_with_bass (0);
245 rebuild_with_bass (i);
254 Chord::find_additions_and_subtractions(Array<Musical_pitch>* add_arr_p, Array<Musical_pitch>* sub_arr_p)
256 Musical_pitch tonic = pitch_arr_[0];
258 all the triads that should be there
260 Array<Musical_pitch> all_arr;
261 all_arr.push (tonic);
262 all_arr.push (pitch_arr_.top ());
263 all_arr.concat (missing_triads_pitch_arr (&all_arr));
264 all_arr.sort (Musical_pitch::compare);
268 while ((i < all_arr.size ()) || (j < pitch_arr_.size ()))
270 i = i <? all_arr.size () - 1;
271 j = j <? pitch_arr_.size () - 1;
272 Musical_pitch a = all_arr[i];
273 Musical_pitch p = pitch_arr_[j];
279 else if ((p < a) || (p.notename_i_ == a.notename_i_))
292 add highest addition, because it names chord
294 if (trap_i (tonic, pitch_arr_.top () > 5))
295 add_arr_p->push (pitch_arr_.top ());
299 Chord::banter_str (Musical_pitch* inversion) const
301 Musical_pitch tonic = pitch_arr_[0];
303 //urg, should do translation in scheme.
304 char const *acc[] = {"\\textflat\\textflat ", "\\textflat ", "", "\\textsharp " , "\\textsharp\\textsharp "};
305 String tonic_str = tonic.str ();
306 tonic_str = tonic_str.left_str (1).upper_str ()
307 + acc[tonic.accidental_i_ + 2];
309 Array<Musical_pitch> add_arr;
310 Array<Musical_pitch> sub_arr;
311 find_additions_and_subtractions (&add_arr, &sub_arr);
314 Array<Musical_pitch> scale;
315 for (int i=0; i < 7; i++)
316 scale.push (Musical_pitch (i));
318 // 7 always means 7-...
319 // scale.push (Musical_pitch (6, -1)); // b
321 rebuild_transpose (tonic, &scale);
323 bool has3m_b = false;
327 for (int i = 0; i < add_arr.size (); i++)
329 Musical_pitch p = add_arr[i];
330 int trap = trap_i (tonic, p);
333 int accidental = p.accidental_i_ - scale[(trap - 1) % 7].accidental_i_;
334 if ((trap == 3) && (accidental == -1))
340 || (!(trap % 2) || ((i + 1 == add_arr.size ()) && (trap > 5))))
343 if ((trap == 7) && (accidental == 1))
347 str += to_str (trap);
349 str += accidental < 0 ? "-" : "+";
355 for (int i = 0; i < sub_arr.size (); i++)
357 Musical_pitch p = sub_arr[i];
358 int trap = trap_i (tonic, p);
360 if chord has 3-, assume minor and don't display 'no3'
361 if additions include 4, assume sus4 and don't display 'no3'
363 if (!((trap == 3) && (has3m_b || has4_b)))
365 str += sep_str + "no" + to_str (trap);
370 String inversion_str;
373 inversion_str = inversion->str ();
374 inversion_str = "/" + inversion_str.left_str (1).upper_str ()
375 + acc[inversion->accidental_i_ + 2];
379 return tonic_str + "$^{" + str + "}$" + inversion_str;
383 Chord::find_notename_i (Musical_pitch p) const
385 return ::find_notename_i (&pitch_arr_, p);
389 Chord::find_pitch_i (Musical_pitch p) const
391 return ::find_pitch_i (&pitch_arr_, p);
395 Chord::find_tonic_i () const
400 first try: base of longest line of triads
404 for (int i = 0; i < pitch_arr_.size (); i++)
407 int last_i = pitch_arr_[i % pitch_arr_.size ()].notename_i_;
409 for (; j < pitch_arr_.size (); j++)
411 int cur_i = pitch_arr_[(i + j + 1) % pitch_arr_.size ()].notename_i_;
412 int gap = cur_i - last_i;
421 if (j - no_triad_i > longest_i)
423 longest_i = j - no_triad_i;
429 second try: note after biggest gap
434 for (int i = 0; i < pitch_arr_.size (); i++)
436 int gap = pitch_arr_[i].notename_i_
437 - pitch_arr_[(i - 1 + pitch_arr_.size ())
438 % pitch_arr_.size ()].notename_i_;
452 Chord::rebuild_from_base (int base_i)
454 assert (base_i >= 0);
455 Musical_pitch last (0, 0, -5);
456 Array<Musical_pitch> new_arr;
457 for (int i = 0; i < pitch_arr_.size (); i++)
459 Musical_pitch p = pitch_arr_[(base_i + i) % pitch_arr_.size ()];
462 p.octave_i_ = last.octave_i_;
469 pitch_arr_ = new_arr;
473 Chord::rebuild_insert_inversion (int tonic_i)
475 assert (tonic_i > 0);
476 #if INVERSION_ADDED_AS_BASE
477 // inversion was added; don't insert
478 Musical_pitch inversion = pitch_arr_.get (0);
481 Musical_pitch inversion = pitch_arr_.get (0);
482 rebuild_from_base (tonic_i - 1);
483 if (pitch_arr_.size ())
485 inversion.octave_i_ = pitch_arr_[0].octave_i_ - 1;
486 while (inversion < pitch_arr_[0])
487 inversion.octave_i_++;
489 for (int i = 0; i < pitch_arr_.size (); i++)
490 if (pitch_arr_[i] > inversion)
492 pitch_arr_.insert (inversion, i);
499 Chord::rebuild_with_bass (int bass_i)
501 assert (bass_i >= 0);
502 Musical_pitch inversion = pitch_arr_.get (bass_i);
503 // is lowering fine, or should others be raised?
504 if (pitch_arr_.size ())
505 while (inversion > pitch_arr_[0])
506 inversion.octave_i_--;
507 pitch_arr_.insert (inversion, 0);