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 "music-list.hh"
14 #include "musical-request.hh"
17 compare (Chord* left, Chord* right)
22 return !(left->inversion_b_ == right->inversion_b_
23 && left->bass_b_ == right->bass_b_
24 && !compare (&left->pitch_arr_, &right->pitch_arr_));
28 FIXME: should use SCM iso. arrays and have-to-delete pointers.
30 FIXME: this contains memleaks.
34 construct from parser output
37 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)
39 // urg: catch dim modifier: 3rd, 5th, 7th, .. should be lowered
41 for (int i=0; i < add_arr_p->size (); i++)
43 Musical_pitch* p = &(*add_arr_p)[i];
44 if (p->octave_i_ == -100)
50 Chord::rebuild_transpose (add_arr_p, tonic, true);
51 Chord::rebuild_transpose (sub_arr_p, tonic, true);
53 Musical_pitch fifth = Chord::base_arr (tonic).top ();
56 remove double adds (urg: sus4)
58 for (int i = add_arr_p->size () - 1; i >= 0 ; i--)
60 int j = Chord::find_pitch_i (add_arr_p, (*add_arr_p)[i]);
61 if ((j != -1) && (i != j))
68 default chord includes upto 5: <1, 3, 5>
70 add_arr_p->insert (tonic, 0);
71 Array<Musical_pitch> tmp = *add_arr_p;
72 int highest_step = Chord::step_i (tonic, tmp.top ());
77 Musical_pitch* p = &add_arr_p->top ();
84 Array<Musical_pitch> missing_arr = Chord::missing_thirds_pitch_arr (&tmp);
86 missing_arr.push (fifth);
89 if dim modifier is given: lower all missing
93 for (int i=0; i < missing_arr.size (); i++)
95 missing_arr[i].accidental_i_--;
100 if additions include some 3, don't add third
102 Musical_pitch third = Chord::base_arr (tonic)[1];
103 if (Chord::find_notename_i (add_arr_p, third) != -1)
105 int i = Chord::find_pitch_i (&missing_arr, third);
111 if additions include 4, assume sus4 and don't add third implicitely
112 C-sus (4) = c f g (1 4 5)
114 Musical_pitch sus = tonic;
115 sus.transpose (Musical_pitch (3));
116 if (Chord::find_pitch_i (add_arr_p, sus) != -1)
118 int i = Chord::find_pitch_i (&missing_arr, third);
124 if additions include some 5, don't add fifth
126 if (Chord::find_notename_i (add_arr_p, fifth) != -1)
128 int i = Chord::find_pitch_i (&missing_arr, fifth);
135 complete the list of thirds to be added
137 add_arr_p->concat (missing_arr);
138 add_arr_p->sort (Musical_pitch::compare);
140 Array<Musical_pitch> pitch_arr;
142 add all that aren't subtracted
144 for (int i = 0; i < add_arr_p->size (); i++)
146 Musical_pitch p = (*add_arr_p)[i];
148 for (; j < sub_arr_p->size (); j++)
149 if (p == (*sub_arr_p)[j])
155 if (j == sub_arr_p->size ())
159 pitch_arr.sort (Musical_pitch::compare);
161 for (int i = 0; i < sub_arr_p->size (); i++)
162 warning (_f ("invalid subtraction: not part of chord: %s",
163 (*sub_arr_p)[i].str ()));
165 return Chord (pitch_arr, inversion_p, bass_p);
169 Construct from list of pitches and requests
172 to_chord (Array<Musical_pitch> pitch_arr, Tonic_req* tonic_req, Inversion_req* inversion_req, Bass_req* bass_req, bool find_inversion_b)
174 Musical_pitch* inversion_p = 0;
175 Musical_pitch* bass_p = 0;
179 assert (pitch_arr[0].notename_i_ == bass_req->pitch_.notename_i_);
180 bass_p = new Musical_pitch (pitch_arr.get (0));
185 assert (pitch_arr[0].notename_i_ == inversion_req->pitch_.notename_i_);
186 inversion_p = new Musical_pitch (inversion_req->pitch_);
188 int tonic_i = Chord::find_notename_i (&pitch_arr, tonic_req->pitch_);
190 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
193 if (find_inversion_b && !inversion_p)
195 int tonic_i = tonic_req
196 ? Chord::find_notename_i (&pitch_arr, tonic_req->pitch_)
197 : Chord::find_tonic_i (&pitch_arr);
201 inversion_p = &pitch_arr[0];
202 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
208 assert (pitch_arr[0].notename_i_ == tonic_req->pitch_.notename_i_);
211 return Chord (pitch_arr, inversion_p, bass_p);
216 inversion_b_ = false;
220 Chord::Chord (Array<Musical_pitch> pitch_arr, Musical_pitch* inversion_p, Musical_pitch* bass_p)
222 pitch_arr_ = pitch_arr;
223 inversion_b_ = false;
227 inversion_pitch_ = *inversion_p;
232 bass_pitch_ = *bass_p;
237 Chord::Chord (Chord const& chord)
239 pitch_arr_ = chord.pitch_arr_;
240 inversion_b_ = chord.inversion_b_;
241 inversion_pitch_ = chord.inversion_pitch_;
242 bass_b_ = chord.bass_b_;
243 bass_pitch_ = chord.bass_pitch_;
249 do something smarter.
252 Chord::base_arr (Musical_pitch p)
254 Array<Musical_pitch> base;
256 p.transpose (Musical_pitch (2));
258 p.transpose (Musical_pitch (2, -1));
264 Chord::rebuild_transpose (Array<Musical_pitch>* pitch_arr_p, Musical_pitch tonic, bool fix7_b)
266 for (int i = 0; i < pitch_arr_p->size (); i++)
268 Musical_pitch p = tonic;
269 Musical_pitch q = (*pitch_arr_p)[i];
271 // duh, c7 should mean <c bes>
272 if (fix7_b && (step_i (tonic, p) == 7))
274 (*pitch_arr_p)[i] = p;
276 pitch_arr_p->sort (Musical_pitch::compare);
280 Chord::find_pitch_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
282 for (int i = 0; i < pitch_arr_p->size (); i++)
283 if (p == (*pitch_arr_p)[i])
289 Chord::find_notename_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
291 int i = find_pitch_i (pitch_arr_p, p);
294 for (int i = 0; i < pitch_arr_p->size (); i++)
296 p.octave_i_ = (*pitch_arr_p)[i].octave_i_;
297 if (p == (*pitch_arr_p)[i])
305 Chord::step_i (Musical_pitch tonic, Musical_pitch p)
307 int i = p.notename_i_ - tonic.notename_i_
308 + (p.octave_i_ - tonic.octave_i_) * 7;
317 do something smarter.
320 Chord::missing_thirds_pitch_arr (Array<Musical_pitch> const* pitch_arr_p)
322 Array<Musical_pitch> thirds;
324 /* is the third c-e, d-f, etc. small or large? */
325 int minormajor_a[] = {0, -1, -1, 0,0,-1,-1};
326 for (int i=0; i < 7; i++)
327 thirds.push (Musical_pitch( 2, minormajor_a[i]));
329 Musical_pitch tonic = (*pitch_arr_p)[0];
330 Musical_pitch last = tonic;
331 Array<Musical_pitch> missing_arr;
333 for (int i = 0; i < pitch_arr_p->size ();)
335 Musical_pitch p = (*pitch_arr_p)[i];
336 int step = step_i (tonic, p);
337 if (last.notename_i_ == p.notename_i_)
338 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
339 if (step > step_i (tonic, last))
341 while (step > step_i (tonic, last))
343 if ((last.notename_i_ - tonic.notename_i_ + 7) % 7 == 6)
345 Musical_pitch special_seven = last;
346 Musical_pitch lower (0, -1);
347 special_seven.transpose (lower);
348 missing_arr.push (special_seven);
352 missing_arr.push (last);
354 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
367 Mangle into list of pitches.
368 For normal chord entry, inversion and bass pitches are retained in
372 Chord::to_pitch_arr () const
374 Array<Musical_pitch> pitch_arr = pitch_arr_;
378 for (; i < pitch_arr.size (); i++)
380 if ((pitch_arr[i].notename_i_ == inversion_pitch_.notename_i_)
381 && (pitch_arr[i].accidental_i_ == inversion_pitch_.accidental_i_))
384 if (i == pitch_arr.size ())
386 warning (_f ("invalid inversion pitch: not part of chord: %s",
387 inversion_pitch_.str ()));
390 rebuild_with_bass (&pitch_arr, i);
395 pitch_arr.insert (bass_pitch_, 0);
396 rebuild_with_bass (&pitch_arr, 0);
402 This routine tries to guess tonic in a possibly inversed chord, ie
403 <e g c'> should produce: C.
404 This is only used for chords that are entered as simultaneous notes,
405 chords entered in \chord mode are fully defined.
408 Chord::find_tonic_i (Array<Musical_pitch> const* pitch_arr_p)
413 first try: base of longest line of thirds
417 for (int i = 0; i < pitch_arr_p->size (); i++)
420 int last_i = (*pitch_arr_p)[i % pitch_arr_p->size ()].notename_i_;
422 for (; j < pitch_arr_p->size (); j++)
424 int cur_i = (*pitch_arr_p)[(i + j + 1) % pitch_arr_p->size ()].notename_i_;
425 int gap = cur_i - last_i;
434 if (j - no_third_i > longest_i)
436 longest_i = j - no_third_i;
442 second try: note after biggest gap
447 for (int i = 0; i < pitch_arr_p->size (); i++)
449 int gap = (*pitch_arr_p)[i].notename_i_
450 - (*pitch_arr_p)[(i - 1 + pitch_arr_p->size ())
451 % pitch_arr_p->size ()].notename_i_;
465 Chord::rebuild_from_base (Array<Musical_pitch>* pitch_arr_p, int base_i)
467 assert (base_i >= 0);
468 Musical_pitch last (0, 0, -5);
469 Array<Musical_pitch> new_arr;
470 for (int i = 0; i < pitch_arr_p->size (); i++)
472 Musical_pitch p = (*pitch_arr_p)[(base_i + i) % pitch_arr_p->size ()];
475 p.octave_i_ = last.octave_i_;
482 *pitch_arr_p = new_arr;
486 Chord::rebuild_insert_inversion (Array<Musical_pitch>* pitch_arr_p, int tonic_i)
488 assert (tonic_i > 0);
489 Musical_pitch inversion = pitch_arr_p->get (0);
490 rebuild_from_base (pitch_arr_p, tonic_i - 1);
491 if (pitch_arr_p->size ())
493 inversion.octave_i_ = (*pitch_arr_p)[0].octave_i_ - 1;
494 while (inversion < (*pitch_arr_p)[0])
495 inversion.octave_i_++;
497 for (int i = 0; i < pitch_arr_p->size (); i++)
498 if ((*pitch_arr_p)[i] > inversion)
500 pitch_arr_p->insert (inversion, i);
506 Chord::rebuild_with_bass (Array<Musical_pitch>* pitch_arr_p, int bass_i)
508 assert (bass_i >= 0);
509 Musical_pitch bass = pitch_arr_p->get (bass_i);
510 // is lowering fine, or should others be raised?
511 if (pitch_arr_p->size ())
512 while (bass > (*pitch_arr_p)[0])
514 pitch_arr_p->insert (bass, 0);
520 get_chord (Musical_pitch tonic,
521 Array<Musical_pitch>* add_arr_p,
522 Array<Musical_pitch>* sub_arr_p,
523 Musical_pitch* inversion_p,
524 Musical_pitch* bass_p,
529 UARGAUGRAGRUAUGRUINAGRAUGIRNA
533 Chord chord = to_chord (tonic, add_arr_p, sub_arr_p, inversion_p, bass_p);
537 Tonic_req* t = new Tonic_req;
539 SCM l = gh_cons (t->self_scm (), SCM_EOL);
542 if (chord.inversion_b_
543 && Chord::find_notename_i (&chord.pitch_arr_, chord.inversion_pitch_) > 0)
545 Inversion_req* i = new Inversion_req;
546 i->pitch_ = chord.inversion_pitch_;
547 l = gh_cons (i->self_scm (), l);
552 Bass_req* b = new Bass_req;
553 b->pitch_ = chord.bass_pitch_;
554 l = gh_cons (b->self_scm (), l);
557 Array<Musical_pitch> pitch_arr = chord.to_pitch_arr ();
558 for (int i = pitch_arr.size (); --i >= 0;)
560 Musical_pitch p = pitch_arr[i];
561 Note_req* n = new Note_req;
564 l = gh_cons (n->self_scm (), l);
567 Simultaneous_music*v = new Request_chord (l);