1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/*
Rosegarden
A sequencer and musical notation editor.
This program is Copyright 2000-2008
Guillaume Laurent <[email protected]>,
Chris Cannam <[email protected]>,
Richard Bown <[email protected]>
This file is Copyright 2002
Randall Farmer <[email protected]>
The moral right of the authors to claim authorship of this work
has been asserted.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version. See the file
COPYING included with this distribution for more information.
*/
#ifndef _ANALYSISTYPES_H_
#define _ANALYSISTYPES_H_
#include <string>
#include <map>
#include <set>
#include <vector>
#include "NotationTypes.h"
namespace Rosegarden
{
class Segment;
class Event;
class CompositionTimeSliceAdapter;
class Quantizer;
///////////////////////////////////////////////////////////////////////////
typedef std::string ChordType;
class ChordLabel;
namespace ChordTypes
{
const ChordType
NoChord = "no-chord",
Major = "",
Minor = "m",
Diminished = "dim",
MajorSeventh = "M7",
DominantSeventh = "7",
MinorSeventh = "m7",
HalfDimSeventh = "7b5",
DimSeventh = "dim7";
}
///////////////////////////////////////////////////////////////////////////
/**
* ChordLabel names chords and identifies them from their masks. See
* ChordLabel::checkMap() for details on what the masks are and
* AnalysisHelper::labelChords() for an example.
*/
class ChordLabel
{
public:
ChordLabel();
ChordLabel(Key key, int mask, int bass);
ChordLabel(ChordType type, int rootPitch, int inversion = 0) :
m_data(type, rootPitch, inversion) { };
int rootPitch();
/**
* Gives the name of the chord in lead-sheet notation: C, Dm,
* G#7b5...
*/
std::string getName(Key key) const;
/**
* Gives the name of the chord in roman-numeral notation: I, ii,
* VMm7...
*/
// std::string getRomanNumeral(Key key);
bool isValid() const;
bool operator<(const ChordLabel& other) const;
// ### I can't believe this is necessary, but the compiler
// is asking for it
bool operator==(const ChordLabel& other) const;
private:
// #### are m_* names appropriate for a struct?
// shouldn't I find a neater way to keep a ChordMap?
struct ChordData
{
ChordData(ChordType type, int rootPitch, int inversion = 0) :
m_type(type),
m_rootPitch(rootPitch),
m_inversion(inversion) { };
ChordData() :
m_type(ChordTypes::NoChord),
m_rootPitch(0),
m_inversion(0) { };
ChordType m_type;
int m_rootPitch;
int m_inversion;
};
ChordData m_data;
void checkMap();
typedef std::multimap<int, ChordData> ChordMap;
static ChordMap m_chordMap;
};
///////////////////////////////////////////////////////////////////////////
class AnalysisHelper
{
public:
AnalysisHelper() {};
/**
* Returns the key in force during a given event.
*/
Key getKeyForEvent(Event *e, Segment &s);
/**
* Inserts in the given Segment labels for all of the chords found in
* the timeslice in the given CompositionTimeSliceAdapter.
*/
void labelChords(CompositionTimeSliceAdapter &c, Segment &s,
const Quantizer *quantizer);
/**
* Returns a time signature that is probably reasonable for the
* given timeslice.
*/
TimeSignature guessTimeSignature(CompositionTimeSliceAdapter &c);
/**
* Returns a guess at the starting key of the given timeslice.
*/
Key guessKey(CompositionTimeSliceAdapter &c);
/**
* Like labelChords, but the algorithm is more complicated. This tries
* to guess the chords that should go under a beat even when all of the
* chord members aren't played at once.
*/
void guessHarmonies(CompositionTimeSliceAdapter &c, Segment &s);
protected:
// ### THESE NAMES ARE AWFUL. MUST GREP THEM OUT OF EXISTENCE.
typedef std::pair<double, ChordLabel> ChordPossibility;
typedef std::vector<ChordPossibility> HarmonyGuess;
typedef std::vector<std::pair<timeT, HarmonyGuess> > HarmonyGuessList;
struct cp_less : public std::binary_function<ChordPossibility, ChordPossibility, bool>
{
bool operator()(ChordPossibility l, ChordPossibility r);
};
/// For use by guessHarmonies
void makeHarmonyGuessList(CompositionTimeSliceAdapter &c,
HarmonyGuessList &l);
/// For use by guessHarmonies
void refineHarmonyGuessList(CompositionTimeSliceAdapter &c,
HarmonyGuessList& l,
Segment &);
/// For use by guessHarmonies (makeHarmonyGuessList)
class PitchProfile
{
public:
PitchProfile();
double& operator[](int i);
const double& operator[](int i) const;
double distance(const PitchProfile &other);
double dotProduct(const PitchProfile &other);
double productScorer(const PitchProfile &other);
PitchProfile normalized();
PitchProfile& operator*=(double d);
PitchProfile& operator+=(const PitchProfile &d);
private:
double m_data[12];
};
/// For use by guessHarmonies (makeHarmonyGuessList)
typedef std::vector<std::pair<PitchProfile, ChordLabel> > HarmonyTable;
static HarmonyTable m_harmonyTable;
/// For use by guessHarmonies (makeHarmonyGuessList)
void checkHarmonyTable();
/// For use by guessHarmonies (refineHarmonyGuessList)
// #### grep ProgressionMap to something else
struct ChordProgression {
ChordProgression(ChordLabel first_,
ChordLabel second_ = ChordLabel(),
Key key_ = Key());
ChordLabel first;
ChordLabel second;
Key homeKey;
// double commonness...
bool operator<(const ChordProgression& other) const;
};
typedef std::set<ChordProgression> ProgressionMap;
static ProgressionMap m_progressionMap;
/// For use by guessHarmonies (refineHarmonyGuessList)
void checkProgressionMap();
/// For use by checkProgressionMap
void addProgressionToMap(Key k,
int firstChordNumber,
int secondChordNumber);
};
}
#endif
|
