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 FIXME: should use SCM iso. arrays and have-to-delete pointers.
23 construct from parser output
26 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
)
28 // urg: catch dim modifier: 3rd, 5th, 7th, .. should be lowered
30 for (int i
=0; i
< add_arr_p
->size (); i
++)
32 Musical_pitch
* p
= &(*add_arr_p
)[i
];
33 if (p
->octave_i_
== -100)
39 Chord::rebuild_transpose (add_arr_p
, tonic
, true);
40 Chord::rebuild_transpose (sub_arr_p
, tonic
, true);
42 Musical_pitch fifth
= Chord::base_arr (tonic
).top ();
45 remove double adds (urg: sus4)
47 for (int i
= add_arr_p
->size () - 1; i
>= 0 ; i
--)
49 int j
= Chord::find_pitch_i (add_arr_p
, (*add_arr_p
)[i
]);
50 if ((j
!= -1) && (i
!= j
))
57 default chord includes upto 5: <1, 3, 5>
59 add_arr_p
->insert (tonic
, 0);
60 Array
<Musical_pitch
> tmp
= *add_arr_p
;
61 int highest_step
= Chord::step_i (tonic
, tmp
.top ());
66 Musical_pitch
* p
= &add_arr_p
->top ();
73 Array
<Musical_pitch
> missing_arr
= Chord::missing_thirds_pitch_arr (&tmp
);
75 missing_arr
.push (fifth
);
78 if dim modifier is given: lower all missing
82 for (int i
=0; i
< missing_arr
.size (); i
++)
84 missing_arr
[i
].accidental_i_
--;
89 if additions include some 3, don't add third
91 Musical_pitch third
= Chord::base_arr (tonic
)[1];
92 if (Chord::find_notename_i (add_arr_p
, third
) != -1)
94 int i
= Chord::find_pitch_i (&missing_arr
, third
);
100 if additions include 4, assume sus4 and don't add third implicitely
101 C-sus (4) = c f g (1 4 5)
103 Musical_pitch sus
= tonic
;
104 sus
.transpose (Musical_pitch (3));
105 if (Chord::find_pitch_i (add_arr_p
, sus
) != -1)
107 int i
= Chord::find_pitch_i (&missing_arr
, third
);
113 if additions include some 5, don't add fifth
115 if (Chord::find_notename_i (add_arr_p
, fifth
) != -1)
117 int i
= Chord::find_pitch_i (&missing_arr
, fifth
);
124 complete the list of thirds to be added
126 add_arr_p
->concat (missing_arr
);
127 add_arr_p
->sort (Musical_pitch::compare
);
129 Array
<Musical_pitch
> pitch_arr
;
131 add all that aren't subtracted
133 for (int i
= 0; i
< add_arr_p
->size (); i
++)
135 Musical_pitch p
= (*add_arr_p
)[i
];
137 for (; j
< sub_arr_p
->size (); j
++)
138 if (p
== (*sub_arr_p
)[j
])
144 if (j
== sub_arr_p
->size ())
148 pitch_arr
.sort (Musical_pitch::compare
);
150 for (int i
= 0; i
< sub_arr_p
->size (); i
++)
151 warning (_f ("invalid subtraction: not part of chord: %s",
152 (*sub_arr_p
)[i
].str ()));
154 return Chord (pitch_arr
, inversion_p
, bass_p
);
158 Construct from list of pitches and requests
161 to_chord (Array
<Musical_pitch
> pitch_arr
, Tonic_req
* tonic_req
, Inversion_req
* inversion_req
, Bass_req
* bass_req
, bool find_inversion_b
)
163 Musical_pitch
* inversion_p
= 0;
164 Musical_pitch
* bass_p
= 0;
168 assert (pitch_arr
[0].notename_i_
== bass_req
->pitch_
.notename_i_
);
169 bass_p
= new Musical_pitch (pitch_arr
.get (0));
174 assert (pitch_arr
[0].notename_i_
== inversion_req
->pitch_
.notename_i_
);
175 inversion_p
= new Musical_pitch (inversion_req
->pitch_
);
177 int tonic_i
= Chord::find_notename_i (&pitch_arr
, tonic_req
->pitch_
);
179 Chord::rebuild_insert_inversion (&pitch_arr
, tonic_i
);
182 if (find_inversion_b
&& !inversion_p
)
184 int tonic_i
= tonic_req
185 ? Chord::find_notename_i (&pitch_arr
, tonic_req
->pitch_
)
186 : Chord::find_tonic_i (&pitch_arr
);
190 inversion_p
= &pitch_arr
[0];
191 Chord::rebuild_insert_inversion (&pitch_arr
, tonic_i
);
197 assert (pitch_arr
[0].notename_i_
== tonic_req
->pitch_
.notename_i_
);
200 return Chord (pitch_arr
, inversion_p
, bass_p
);
205 inversion_b_
= false;
209 Chord::Chord (Array
<Musical_pitch
> pitch_arr
, Musical_pitch
* inversion_p
, Musical_pitch
* bass_p
)
211 pitch_arr_
= pitch_arr
;
212 inversion_b_
= false;
216 inversion_pitch_
= *inversion_p
;
221 bass_pitch_
= *bass_p
;
226 Chord::Chord (Chord
const& chord
)
228 pitch_arr_
= chord
.pitch_arr_
;
229 inversion_b_
= chord
.inversion_b_
;
230 inversion_pitch_
= chord
.inversion_pitch_
;
231 bass_b_
= chord
.bass_b_
;
232 bass_pitch_
= chord
.bass_pitch_
;
238 do something smarter.
241 Chord::base_arr (Musical_pitch p
)
243 Array
<Musical_pitch
> base
;
245 p
.transpose (Musical_pitch (2));
247 p
.transpose (Musical_pitch (2, -1));
253 Chord::rebuild_transpose (Array
<Musical_pitch
>* pitch_arr_p
, Musical_pitch tonic
, bool fix7_b
)
255 for (int i
= 0; i
< pitch_arr_p
->size (); i
++)
257 Musical_pitch p
= tonic
;
258 Musical_pitch q
= (*pitch_arr_p
)[i
];
260 // duh, c7 should mean <c bes>
261 if (fix7_b
&& (step_i (tonic
, p
) == 7))
263 (*pitch_arr_p
)[i
] = p
;
265 pitch_arr_p
->sort (Musical_pitch::compare
);
269 Chord::find_pitch_i (Array
<Musical_pitch
> const* pitch_arr_p
, Musical_pitch p
)
271 for (int i
= 0; i
< pitch_arr_p
->size (); i
++)
272 if (p
== (*pitch_arr_p
)[i
])
278 Chord::find_notename_i (Array
<Musical_pitch
> const* pitch_arr_p
, Musical_pitch p
)
280 int i
= find_pitch_i (pitch_arr_p
, p
);
283 for (int i
= 0; i
< pitch_arr_p
->size (); i
++)
285 p
.octave_i_
= (*pitch_arr_p
)[i
].octave_i_
;
286 if (p
== (*pitch_arr_p
)[i
])
294 Chord::step_i (Musical_pitch tonic
, Musical_pitch p
)
296 int i
= p
.notename_i_
- tonic
.notename_i_
297 + (p
.octave_i_
- tonic
.octave_i_
) * 7;
306 do something smarter.
309 Chord::missing_thirds_pitch_arr (Array
<Musical_pitch
> const* pitch_arr_p
)
311 Array
<Musical_pitch
> thirds
;
313 /* is the third c-e, d-f, etc. small or large? */
314 int minormajor_a
[] = {0, -1, -1, 0,0,-1,-1};
315 for (int i
=0; i
< 7; i
++)
316 thirds
.push (Musical_pitch( 2, minormajor_a
[i
]));
318 Musical_pitch tonic
= (*pitch_arr_p
)[0];
319 Musical_pitch last
= tonic
;
320 Array
<Musical_pitch
> missing_arr
;
322 for (int i
= 0; i
< pitch_arr_p
->size ();)
324 Musical_pitch p
= (*pitch_arr_p
)[i
];
325 int step
= step_i (tonic
, p
);
326 if (last
.notename_i_
== p
.notename_i_
)
327 last
.transpose (thirds
[(last
.notename_i_
- tonic
.notename_i_
+ 7) % 7]);
328 if (step
> step_i (tonic
, last
))
330 while (step
> step_i (tonic
, last
))
332 if ((last
.notename_i_
- tonic
.notename_i_
+ 7) % 7 == 6)
334 Musical_pitch special_seven
= last
;
335 Musical_pitch
lower (0, -1);
336 special_seven
.transpose (lower
);
337 missing_arr
.push (special_seven
);
341 missing_arr
.push (last
);
343 last
.transpose (thirds
[(last
.notename_i_
- tonic
.notename_i_
+ 7) % 7]);
356 Mangle into list of pitches.
357 For normal chord entry, inversion and bass pitches are retained in
361 Chord::to_pitch_arr () const
363 Array
<Musical_pitch
> pitch_arr
= pitch_arr_
;
367 for (; i
< pitch_arr
.size (); i
++)
369 if ((pitch_arr
[i
].notename_i_
== inversion_pitch_
.notename_i_
)
370 && (pitch_arr
[i
].accidental_i_
== inversion_pitch_
.accidental_i_
))
373 if (i
== pitch_arr
.size ())
375 warning (_f ("invalid inversion pitch: not part of chord: %s",
376 inversion_pitch_
.str ()));
379 rebuild_with_bass (&pitch_arr
, i
);
384 pitch_arr
.insert (bass_pitch_
, 0);
385 rebuild_with_bass (&pitch_arr
, 0);
391 This routine tries to guess tonic in a possibly inversed chord, ie
392 <e g c'> should produce: C.
393 This is only used for chords that are entered as simultaneous notes,
394 chords entered in \chord mode are fully defined.
397 Chord::find_tonic_i (Array
<Musical_pitch
> const* pitch_arr_p
)
402 first try: base of longest line of thirds
406 for (int i
= 0; i
< pitch_arr_p
->size (); i
++)
409 int last_i
= (*pitch_arr_p
)[i
% pitch_arr_p
->size ()].notename_i_
;
411 for (; j
< pitch_arr_p
->size (); j
++)
413 int cur_i
= (*pitch_arr_p
)[(i
+ j
+ 1) % pitch_arr_p
->size ()].notename_i_
;
414 int gap
= cur_i
- last_i
;
423 if (j
- no_third_i
> longest_i
)
425 longest_i
= j
- no_third_i
;
431 second try: note after biggest gap
436 for (int i
= 0; i
< pitch_arr_p
->size (); i
++)
438 int gap
= (*pitch_arr_p
)[i
].notename_i_
439 - (*pitch_arr_p
)[(i
- 1 + pitch_arr_p
->size ())
440 % pitch_arr_p
->size ()].notename_i_
;
454 Chord::rebuild_from_base (Array
<Musical_pitch
>* pitch_arr_p
, int base_i
)
456 assert (base_i
>= 0);
457 Musical_pitch
last (0, 0, -5);
458 Array
<Musical_pitch
> new_arr
;
459 for (int i
= 0; i
< pitch_arr_p
->size (); i
++)
461 Musical_pitch p
= (*pitch_arr_p
)[(base_i
+ i
) % pitch_arr_p
->size ()];
464 p
.octave_i_
= last
.octave_i_
;
471 *pitch_arr_p
= new_arr
;
475 Chord::rebuild_insert_inversion (Array
<Musical_pitch
>* pitch_arr_p
, int tonic_i
)
477 assert (tonic_i
> 0);
478 Musical_pitch inversion
= pitch_arr_p
->get (0);
479 rebuild_from_base (pitch_arr_p
, tonic_i
- 1);
480 if (pitch_arr_p
->size ())
482 inversion
.octave_i_
= (*pitch_arr_p
)[0].octave_i_
- 1;
483 while (inversion
< (*pitch_arr_p
)[0])
484 inversion
.octave_i_
++;
486 for (int i
= 0; i
< pitch_arr_p
->size (); i
++)
487 if ((*pitch_arr_p
)[i
] > inversion
)
489 pitch_arr_p
->insert (inversion
, i
);
495 Chord::rebuild_with_bass (Array
<Musical_pitch
>* pitch_arr_p
, int bass_i
)
497 assert (bass_i
>= 0);
498 Musical_pitch bass
= pitch_arr_p
->get (bass_i
);
499 // is lowering fine, or should others be raised?
500 if (pitch_arr_p
->size ())
501 while (bass
> (*pitch_arr_p
)[0])
503 pitch_arr_p
->insert (bass
, 0);