forked from ibsh/libKeyFinder
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsegarbitrary.cpp
45 lines (34 loc) · 1.65 KB
/
segarbitrary.cpp
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
/*************************************************************************
Copyright 2011-2013 Ibrahim Sha'ath
This file is part of LibKeyFinder.
LibKeyFinder 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 3 of the License, or
(at your option) any later version.
LibKeyFinder is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with LibKeyFinder. If not, see <http://www.gnu.org/licenses/>.
*************************************************************************/
#include "segarbitrary.h"
namespace KeyFinder{
std::vector<float> ArbitrarySeg::getRateOfChange(const Chromagram& ch, const Parameters& /*params*/) const{
std::vector<float> NoChange(ch.getHops());
return NoChange;
}
std::vector<unsigned int> ArbitrarySeg::getSegments(const std::vector<float>& rateOfChange, const Parameters& params) const{
// Divide by arbitrary number of segments
unsigned int segments = params.getArbitrarySegments();
std::vector<unsigned int> changes(1); // start vector with a 0 to enable first classification
if(rateOfChange.size() <= segments){
return changes;
}
float interval = rateOfChange.size() / segments;
for (unsigned int i = 1; i < segments; i++){
changes.push_back((unsigned int)(interval * i + 0.5));
}
return changes;
}
}