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"
19 should compare SCM lists.
22 compare (Chord* left, Chord* right)
27 return !(left->inversion_b_ == right->inversion_b_
28 && left->bass_b_ == right->bass_b_
29 && !compare (&left->pitch_arr_, &right->pitch_arr_));
33 FIXME: should use SCM iso. arrays and have-to-delete pointers.
35 FIXME: a real function looks like
38 Return_value func (Input_value),
42 void func (Input_value *);
46 pitch is really a tuple, hence an immutable object. We
47 should remove all mutating operations.
52 construct from parser output
55 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)
57 // urg: catch dim modifier: 3rd, 5th, 7th, .. should be lowered
59 for (int i=0; i < add_arr_p->size (); i++)
61 Musical_pitch* p = &(*add_arr_p)[i];
62 if (p->octave_i () == -100)
68 Chord::rebuild_transpose (add_arr_p, tonic, true);
69 Chord::rebuild_transpose (sub_arr_p, tonic, true);
71 Musical_pitch fifth = Chord::base_arr (tonic).top ();
74 remove double adds (urg: sus4)
76 for (int i = add_arr_p->size () - 1; i >= 0 ; i--)
78 int j = Chord::find_pitch_i (add_arr_p, (*add_arr_p)[i]);
79 if ((j != -1) && (i != j))
86 default chord includes upto 5: <1, 3, 5>
88 add_arr_p->insert (tonic, 0);
89 Array<Musical_pitch> tmp = *add_arr_p;
90 int highest_step = Chord::step_i (tonic, tmp.top ());
95 Musical_pitch* p = &add_arr_p->top ();
102 Array<Musical_pitch> missing_arr = Chord::missing_thirds_pitch_arr (&tmp);
103 if (highest_step < 5)
104 missing_arr.push (fifth);
107 if dim modifier is given: lower all missing
111 for (int i=0; i < missing_arr.size (); i++)
113 missing_arr[i].alteration_i_--;
118 if additions include some 3, don't add third
120 Musical_pitch third = Chord::base_arr (tonic)[1];
121 if (Chord::find_notename_i (add_arr_p, third) != -1)
123 int i = Chord::find_pitch_i (&missing_arr, third);
129 if additions include 4, assume sus4 and don't add third implicitely
130 C-sus (4) = c f g (1 4 5)
132 Musical_pitch sus = tonic;
133 sus.transpose (Musical_pitch (0,3,0));
134 if (Chord::find_pitch_i (add_arr_p, sus) != -1)
136 int i = Chord::find_pitch_i (&missing_arr, third);
142 if additions include some 5, don't add fifth
144 if (Chord::find_notename_i (add_arr_p, fifth) != -1)
146 int i = Chord::find_pitch_i (&missing_arr, fifth);
153 complete the list of thirds to be added
155 add_arr_p->concat (missing_arr);
156 add_arr_p->sort (Musical_pitch::compare);
158 Array<Musical_pitch> pitch_arr;
160 add all that aren't subtracted
162 for (int i = 0; i < add_arr_p->size (); i++)
164 Musical_pitch p = (*add_arr_p)[i];
166 for (; j < sub_arr_p->size (); j++)
167 if (p == (*sub_arr_p)[j])
173 if (j == sub_arr_p->size ())
177 pitch_arr.sort (Musical_pitch::compare);
179 for (int i = 0; i < sub_arr_p->size (); i++)
180 warning (_f ("invalid subtraction: not part of chord: %s",
181 (*sub_arr_p)[i].str ()));
183 return Chord (pitch_arr, inversion_p, bass_p);
187 Construct from list of pitches and requests
190 to_chord (Array<Musical_pitch> pitch_arr, Tonic_req* tonic_req, Inversion_req* inversion_req, Bass_req* bass_req, bool find_inversion_b)
192 Musical_pitch* inversion_p = 0;
193 Musical_pitch* bass_p = 0;
197 assert (pitch_arr[0].notename_i_ == unsmob_pitch (bass_req->get_mus_property ("pitch"))->notename_i_);
198 bass_p = new Musical_pitch (pitch_arr.get (0));
203 assert (pitch_arr[0].notename_i_ == unsmob_pitch (inversion_req->get_mus_property ("pitch"))->notename_i_);
204 inversion_p = new Musical_pitch (* unsmob_pitch (inversion_req->get_mus_property ("pitch")));
206 int tonic_i = Chord::find_notename_i (&pitch_arr,
207 *unsmob_pitch (tonic_req->get_mus_property ("pitch")));
209 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
212 if (find_inversion_b && !inversion_p)
214 int tonic_i = tonic_req
215 ? Chord::find_notename_i (&pitch_arr, *unsmob_pitch (tonic_req->get_mus_property ("pitch")))
216 : Chord::find_tonic_i (&pitch_arr);
220 inversion_p = &pitch_arr[0];
221 Chord::rebuild_insert_inversion (&pitch_arr, tonic_i);
227 assert (pitch_arr[0].notename_i_ == unsmob_pitch (tonic_req->get_mus_property ("pitch"))->notename_i_);
230 return Chord (pitch_arr, inversion_p, bass_p);
235 inversion_b_ = false;
239 Chord::Chord (Array<Musical_pitch> pitch_arr, Musical_pitch* inversion_p, Musical_pitch* bass_p)
241 pitch_arr_ = pitch_arr;
242 inversion_b_ = false;
246 inversion_pitch_ = *inversion_p;
251 bass_pitch_ = *bass_p;
256 Chord::Chord (Chord const& chord)
258 pitch_arr_ = chord.pitch_arr_;
259 inversion_b_ = chord.inversion_b_;
260 inversion_pitch_ = chord.inversion_pitch_;
261 bass_b_ = chord.bass_b_;
262 bass_pitch_ = chord.bass_pitch_;
268 do something smarter.
271 Chord::base_arr (Musical_pitch p)
273 Array<Musical_pitch> base;
275 p.transpose (Musical_pitch (0,2,0));
277 p.transpose (Musical_pitch (0, 2, -1));
283 Chord::rebuild_transpose (Array<Musical_pitch>* pitch_arr_p, Musical_pitch tonic, bool fix7_b)
285 for (int i = 0; i < pitch_arr_p->size (); i++)
287 Musical_pitch p = tonic;
288 Musical_pitch q = (*pitch_arr_p)[i];
290 // duh, c7 should mean <c bes>
291 if (fix7_b && (step_i (tonic, p) == 7))
293 (*pitch_arr_p)[i] = p;
295 pitch_arr_p->sort (Musical_pitch::compare);
299 Chord::find_pitch_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
301 for (int i = 0; i < pitch_arr_p->size (); i++)
302 if (p == (*pitch_arr_p)[i])
308 Chord::find_notename_i (Array<Musical_pitch> const* pitch_arr_p, Musical_pitch p)
310 int i = find_pitch_i (pitch_arr_p, p);
313 for (int i = 0; i < pitch_arr_p->size (); i++)
315 p.octave_i_ = (*pitch_arr_p)[i].octave_i () ;
316 if (p == (*pitch_arr_p)[i])
324 Chord::step_i (Musical_pitch tonic, Musical_pitch p)
326 int i = p.notename_i_ - tonic.notename_i_
327 + (p.octave_i () - tonic.octave_i () ) * 7;
336 do something smarter.
339 Chord::missing_thirds_pitch_arr (Array<Musical_pitch> const* pitch_arr_p)
341 Array<Musical_pitch> thirds;
343 /* is the third c-e, d-f, etc. small or large? */
344 int minormajor_a[] = {0, -1, -1, 0,0,-1,-1};
345 for (int i=0; i < 7; i++)
346 thirds.push (Musical_pitch( 0, 2, minormajor_a[i]));
348 Musical_pitch tonic = (*pitch_arr_p)[0];
349 Musical_pitch last = tonic;
350 Array<Musical_pitch> missing_arr;
352 for (int i = 0; i < pitch_arr_p->size ();)
354 Musical_pitch p = (*pitch_arr_p)[i];
355 int step = step_i (tonic, p);
356 if (last.notename_i_ == p.notename_i_)
357 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
358 if (step > step_i (tonic, last))
360 while (step > step_i (tonic, last))
362 if ((last.notename_i_ - tonic.notename_i_ + 7) % 7 == 6)
364 Musical_pitch special_seven = last;
365 Musical_pitch lower (0, 0, -1);
366 special_seven.transpose (lower);
367 missing_arr.push (special_seven);
371 missing_arr.push (last);
373 last.transpose (thirds[(last.notename_i_ - tonic.notename_i_ + 7) % 7]);
386 Mangle into list of pitches.
387 For normal chord entry, inversion and bass pitches are retained in
391 Chord::to_pitch_arr () const
393 Array<Musical_pitch> pitch_arr = pitch_arr_;
397 for (; i < pitch_arr.size (); i++)
399 if ((pitch_arr[i].notename_i_ == inversion_pitch_.notename_i_)
400 && (pitch_arr[i].alteration_i_ == inversion_pitch_.alteration_i_))
403 if (i == pitch_arr.size ())
405 warning (_f ("invalid inversion pitch: not part of chord: %s",
406 inversion_pitch_.str ()));
409 rebuild_with_bass (&pitch_arr, i);
414 pitch_arr.insert (bass_pitch_, 0);
415 rebuild_with_bass (&pitch_arr, 0);
421 This routine tries to guess tonic in a possibly inversed chord, ie
422 <e g c'> should produce: C.
423 This is only used for chords that are entered as simultaneous notes,
424 chords entered in \chord mode are fully defined.
427 Chord::find_tonic_i (Array<Musical_pitch> const* pitch_arr_p)
432 first try: base of longest line of thirds
436 for (int i = 0; i < pitch_arr_p->size (); i++)
439 int last_i = (*pitch_arr_p)[i % pitch_arr_p->size ()].notename_i_;
441 for (; j < pitch_arr_p->size (); j++)
443 int cur_i = (*pitch_arr_p)[(i + j + 1) % pitch_arr_p->size ()].notename_i_;
444 int gap = cur_i - last_i;
453 if (j - no_third_i > longest_i)
455 longest_i = j - no_third_i;
461 second try: note after biggest gap
466 for (int i = 0; i < pitch_arr_p->size (); i++)
468 int gap = (*pitch_arr_p)[i].notename_i_
469 - (*pitch_arr_p)[(i - 1 + pitch_arr_p->size ())
470 % pitch_arr_p->size ()].notename_i_;
484 Chord::rebuild_from_base (Array<Musical_pitch>* pitch_arr_p, int base_i)
486 assert (base_i >= 0);
487 Musical_pitch last (0, 0, -5);
488 Array<Musical_pitch> new_arr;
489 for (int i = 0; i < pitch_arr_p->size (); i++)
491 Musical_pitch p = (*pitch_arr_p)[(base_i + i) % pitch_arr_p->size ()];
494 p.octave_i_ = last.octave_i () ;
501 *pitch_arr_p = new_arr;
505 Chord::rebuild_insert_inversion (Array<Musical_pitch>* pitch_arr_p, int tonic_i)
507 assert (tonic_i > 0);
508 Musical_pitch inversion = pitch_arr_p->get (0);
509 rebuild_from_base (pitch_arr_p, tonic_i - 1);
510 if (pitch_arr_p->size ())
512 inversion.octave_i_ = (*pitch_arr_p)[0].octave_i () - 1;
513 while (inversion < (*pitch_arr_p)[0])
514 inversion.octave_i_++;
516 for (int i = 0; i < pitch_arr_p->size (); i++)
517 if ((*pitch_arr_p)[i] > inversion)
519 pitch_arr_p->insert (inversion, i);
525 Chord::rebuild_with_bass (Array<Musical_pitch>* pitch_arr_p, int bass_i)
527 assert (bass_i >= 0);
528 Musical_pitch bass = pitch_arr_p->get (bass_i);
529 // is lowering fine, or should others be raised?
530 if (pitch_arr_p->size ())
531 while (bass > (*pitch_arr_p)[0])
533 pitch_arr_p->insert (bass, 0);
539 get_chord (SCM stonic,
546 Musical_pitch tonic = *unsmob_pitch (stonic);
548 Musical_pitch *inversion_p = unsmob_pitch( sinversion_p);
549 Musical_pitch *bass_p = unsmob_pitch (sbass_p);
551 Array<Musical_pitch> add_arr_p;
552 Array<Musical_pitch> sub_arr_p;
554 for (SCM s = sadd_arr_p ; gh_pair_p (s); s = gh_cdr (s))
555 add_arr_p.push (*unsmob_pitch (gh_car (s)));
556 for (SCM s = ssub_arr_p ; gh_pair_p (s); s = gh_cdr (s))
557 sub_arr_p.push (*unsmob_pitch (gh_car (s)));
559 sub_arr_p.reverse ();
560 add_arr_p.reverse ();
563 UARGAUGRAGRUAUGRUINAGRAUGIRNA
567 Chord chord = to_chord (tonic, &add_arr_p, &sub_arr_p, inversion_p, bass_p);
571 Tonic_req* t = new Tonic_req;
572 t->set_mus_property ("pitch", tonic.smobbed_copy ());
573 SCM l = gh_cons (t->self_scm (), SCM_EOL);
576 if (chord.inversion_b_
577 && Chord::find_notename_i (&chord.pitch_arr_, chord.inversion_pitch_) > 0)
579 Inversion_req* i = new Inversion_req;
580 i->set_mus_property ("pitch", chord.inversion_pitch_.smobbed_copy ());
581 l = gh_cons (i->self_scm (), l);
582 scm_unprotect_object (i->self_scm ());
587 Bass_req* b = new Bass_req;
588 b->set_mus_property ("pitch", chord.bass_pitch_.smobbed_copy ());
590 l = gh_cons (b->self_scm (), l);
591 scm_unprotect_object (b->self_scm ());
594 Array<Musical_pitch> pitch_arr = chord.to_pitch_arr ();
595 for (int i = pitch_arr.size (); --i >= 0;)
597 Note_req* n = new Note_req;
598 n->set_mus_property ("pitch", pitch_arr[i].smobbed_copy ());
599 n->set_mus_property ("duration", dur);
600 l = gh_cons (n->self_scm (), l);
602 scm_unprotect_object (n->self_scm ());
605 Simultaneous_music*v = new Request_chord (l);