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 construct from parser output
21 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)
23 // urg: catch dim modifier: 3rd, 5th, 7th, .. should be lowered
25 for (int i=0; i < add_arr_p->size (); i++)
27 Musical_pitch* p = &(*add_arr_p)[i];
28 if (p->octave_i_ == -100)
34 Chord::rebuild_transpose (add_arr_p, tonic, true);
35 Chord::rebuild_transpose (sub_arr_p, tonic, true);
37 Musical_pitch fifth = Chord::base_arr (tonic).top ();
40 remove double adds (urg: sus4)
42 for (int i = add_arr_p->size () - 1; i >= 0 ; i--)
44 int j = Chord::find_pitch_i (add_arr_p, (*add_arr_p)[i]);
45 if ((j != -1) && (i != j))
52 default chord includes upto 5: <1, 3, 5>
54 add_arr_p->insert (tonic, 0);
55 Array<Musical_pitch> tmp = *add_arr_p;
56 int highest_step = Chord::step_i (tonic, tmp.top ());
61 Musical_pitch* p = &add_arr_p->top ();
68 Array<Musical_pitch> missing_arr = Chord::missing_thirds_pitch_arr (&tmp);
70 missing_arr.push (fifth);
73 if dim modifier is given: lower all missing
77 for (int i=0; i < missing_arr.size (); i++)
79 missing_arr[i].accidental_i_--;
84 if additions include some 3, don't add third
86 Musical_pitch third = Chord::base_arr (tonic)[1];
87 if (Chord::find_notename_i (add_arr_p, third) != -1)
89 int i = Chord::find_pitch_i (&missing_arr, third);
95 if additions include 4, assume sus4 and don't add third implicitely
96 C-sus (4) = c f g (1 4 5)
98 Musical_pitch sus = tonic;
99 sus.transpose (Musical_pitch (3));
100 if (Chord::find_pitch_i (add_arr_p, sus) != -1)
102 int i = Chord::find_pitch_i (&missing_arr, third);
108 if additions include some 5, don't add fifth
110 if (Chord::find_notename_i (add_arr_p, fifth) != -1)
112 int i = Chord::find_pitch_i (&missing_arr, fifth);
119 complete the list of thirds to be added
121 add_arr_p->concat (missing_arr);
122 add_arr_p->sort (Musical_pitch::compare);
124 Array<Musical_pitch> pitch_arr;
126 add all that aren't subtracted
128 for (int i = 0; i < add_arr_p->size (); i++)
130 Musical_pitch p = (*add_arr_p)[i];
132 for (; j < sub_arr_p->size (); j++)
133 if (p == (*sub_arr_p)[j])
139 if (j == sub_arr_p->size ())
143 pitch_arr.sort (Musical_pitch::compare);
145 for (int i = 0; i < sub_arr_p->size (); i++)
146 warning (_f ("invalid subtraction: not part of chord: %s",
147 (*sub_arr_p)[i].str ()));
149 return Chord (pitch_arr, inversion_p, bass_p);
153 Construct from list of pitches and requests
156 to_chord (Array<Musical_pitch> pitch_arr, Tonic_req* tonic_req, Inversion_req* inversion_req, Bass_req* bass_req, bool find_inversion_b)
158 Musical_pitch* inversion_p = 0;
159 Musical_pitch* bass_p = 0;
163 assert (pitch_arr[0].notename_i_ == bass_req->pitch_.notename_i_);
164 bass_p = new Musical_pitch (pitch_arr.get (0));
169 assert (pitch_arr[0].notename_i_ == inversion_req->pitch_.notename_i_);
170 inversion_p = new Musical_pitch (inversion_req->pitch_);
172 int tonic_i = Chord::find_notename_i (&pitch_arr, tonic_req->pitch_);
174 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
177 if (find_inversion_b && !inversion_p)
179 int tonic_i = tonic_req
180 ? Chord::find_notename_i (&pitch_arr, tonic_req->pitch_)
181 : Chord::find_tonic_i (&pitch_arr);
185 inversion_p = &pitch_arr[0];
186 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
192 assert (pitch_arr[0].notename_i_ == tonic_req->pitch_.notename_i_);
195 return Chord (pitch_arr, inversion_p, bass_p);
200 inversion_b_ = false;
204 Chord::Chord (Array<Musical_pitch> pitch_arr, Musical_pitch* inversion_p, Musical_pitch* bass_p)
206 pitch_arr_ = pitch_arr;
207 inversion_b_ = false;
211 inversion_pitch_ = *inversion_p;
217 bass_pitch_ = *bass_p;
223 Chord::Chord (Chord const& chord)
225 pitch_arr_ = chord.pitch_arr_;
226 inversion_b_ = chord.inversion_b_;
227 inversion_pitch_ = chord.inversion_pitch_;
228 bass_b_ = chord.bass_b_;
229 bass_pitch_ = chord.bass_pitch_;
235 do something smarter.
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;
303 do something smarter.
306 Chord::missing_thirds_pitch_arr (Array<Musical_pitch> const* pitch_arr_p)
308 Array<Musical_pitch> thirds;
310 /* is the third c-e, d-f, etc. small or large? */
311 int minormajor_a[] = {0, -1, -1, 0,0,-1,-1};
312 for (int i=0; i < 7; i++)
313 thirds.push (Musical_pitch( 2, minormajor_a[i]));
315 Musical_pitch tonic = (*pitch_arr_p)[0];
316 Musical_pitch last = tonic;
317 Array<Musical_pitch> missing_arr;
319 for (int i = 0; i < pitch_arr_p->size ();)
321 Musical_pitch p = (*pitch_arr_p)[i];
322 int step = step_i (tonic, p);
323 if (last.notename_i_ == p.notename_i_)
324 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
325 if (step > step_i (tonic, last))
327 while (step > step_i (tonic, last))
329 if ((last.notename_i_ - tonic.notename_i_ + 7) % 7 == 6)
331 Musical_pitch special_seven = last;
332 Musical_pitch lower (0, -1);
333 special_seven.transpose (lower);
334 missing_arr.push (special_seven);
338 missing_arr.push (last);
340 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
353 Mangle into list of pitches.
354 For normal chord entry, inversion and bass pitches are retained in
358 Chord::to_pitch_arr () const
360 Array<Musical_pitch> pitch_arr = pitch_arr_;
364 for (; i < pitch_arr.size (); i++)
366 if ((pitch_arr[i].notename_i_ == inversion_pitch_.notename_i_)
367 && (pitch_arr[i].accidental_i_ == inversion_pitch_.accidental_i_))
370 if (i == pitch_arr.size ())
372 warning (_f ("invalid inversion pitch: not part of chord: %s",
373 inversion_pitch_.str ()));
376 rebuild_with_bass (&pitch_arr, i);
381 pitch_arr.insert (bass_pitch_, 0);
382 rebuild_with_bass (&pitch_arr, 0);
388 This routine tries to guess tonic in a possibly inversed chord, ie
389 <e g c'> should produce: C.
390 This is only used for chords that are entered as simultaneous notes,
391 chords entered in \chord mode are fully defined.
394 Chord::find_tonic_i (Array<Musical_pitch> const* pitch_arr_p)
399 first try: base of longest line of thirds
403 for (int i = 0; i < pitch_arr_p->size (); i++)
406 int last_i = (*pitch_arr_p)[i % pitch_arr_p->size ()].notename_i_;
408 for (; j < pitch_arr_p->size (); j++)
410 int cur_i = (*pitch_arr_p)[(i + j + 1) % pitch_arr_p->size ()].notename_i_;
411 int gap = cur_i - last_i;
420 if (j - no_third_i > longest_i)
422 longest_i = j - no_third_i;
428 second try: note after biggest gap
433 for (int i = 0; i < pitch_arr_p->size (); i++)
435 int gap = (*pitch_arr_p)[i].notename_i_
436 - (*pitch_arr_p)[(i - 1 + pitch_arr_p->size ())
437 % pitch_arr_p->size ()].notename_i_;
451 Chord::rebuild_from_base (Array<Musical_pitch>* pitch_arr_p, int base_i)
453 assert (base_i >= 0);
454 Musical_pitch last (0, 0, -5);
455 Array<Musical_pitch> new_arr;
456 for (int i = 0; i < pitch_arr_p->size (); i++)
458 Musical_pitch p = (*pitch_arr_p)[(base_i + i) % pitch_arr_p->size ()];
461 p.octave_i_ = last.octave_i_;
468 *pitch_arr_p = new_arr;
472 Chord::rebuild_insert_inversion (Array<Musical_pitch>* pitch_arr_p, int tonic_i)
474 assert (tonic_i > 0);
475 Musical_pitch inversion = pitch_arr_p->get (0);
476 rebuild_from_base (pitch_arr_p, tonic_i - 1);
477 if (pitch_arr_p->size ())
479 inversion.octave_i_ = (*pitch_arr_p)[0].octave_i_ - 1;
480 while (inversion < (*pitch_arr_p)[0])
481 inversion.octave_i_++;
483 for (int i = 0; i < pitch_arr_p->size (); i++)
484 if ((*pitch_arr_p)[i] > inversion)
486 pitch_arr_p->insert (inversion, i);
492 Chord::rebuild_with_bass (Array<Musical_pitch>* pitch_arr_p, int bass_i)
494 assert (bass_i >= 0);
495 Musical_pitch bass = pitch_arr_p->get (bass_i);
496 // is lowering fine, or should others be raised?
497 if (pitch_arr_p->size ())
498 while (bass > (*pitch_arr_p)[0])
500 pitch_arr_p->insert (bass, 0);