summaryrefslogtreecommitdiff
path: root/libs/evoral/src
diff options
context:
space:
mode:
authorDavid Robillard <d@drobilla.net>2009-10-23 03:58:11 +0000
committerDavid Robillard <d@drobilla.net>2009-10-23 03:58:11 +0000
commit653a487bbd88d143c59d857be6199d8d634c24c2 (patch)
tree9a5d17d334b8eefb5d935b156cd9c5d89a6476ef /libs/evoral/src
parentf68f8839a508f27ba3a79d525f5b097953369921 (diff)
Fix whitespace.
git-svn-id: svn://localhost/ardour2/branches/3.0@5885 d708f5d6-7413-0410-9779-e7cbd77b26cf
Diffstat (limited to 'libs/evoral/src')
-rw-r--r--libs/evoral/src/Curve.cpp50
1 files changed, 25 insertions, 25 deletions
diff --git a/libs/evoral/src/Curve.cpp b/libs/evoral/src/Curve.cpp
index 92633688ac..b5338f42a9 100644
--- a/libs/evoral/src/Curve.cpp
+++ b/libs/evoral/src/Curve.cpp
@@ -264,42 +264,42 @@ Curve::_get_vector (double x0, double x1, float *vec, int32_t veclen)
return;
}
- if (npoints == 1 ) {
+ if (npoints == 1 ) {
- for (i = 0; i < veclen; ++i) {
- vec[i] = _list.events().front()->value;
- }
- return;
- }
+ for (i = 0; i < veclen; ++i) {
+ vec[i] = _list.events().front()->value;
+ }
+ return;
+ }
- if (npoints == 2) {
+ if (npoints == 2) {
- /* linear interpolation between 2 points */
+ /* linear interpolation between 2 points */
- /* XXX I'm not sure that this is the right thing to
- do here. but its not a common case for the envisaged
- uses.
- */
+ /* XXX I'm not sure that this is the right thing to
+ do here. but its not a common case for the envisaged
+ uses.
+ */
- if (veclen > 1) {
- dx = (hx - lx) / (veclen - 1) ;
- } else {
- dx = 0; // not used
- }
+ if (veclen > 1) {
+ dx = (hx - lx) / (veclen - 1) ;
+ } else {
+ dx = 0; // not used
+ }
- double slope = (_list.events().back()->value - _list.events().front()->value)/
+ double slope = (_list.events().back()->value - _list.events().front()->value)/
(_list.events().back()->when - _list.events().front()->when);
- double yfrac = dx*slope;
+ double yfrac = dx*slope;
- vec[0] = _list.events().front()->value + slope * (lx - _list.events().front()->when);
+ vec[0] = _list.events().front()->value + slope * (lx - _list.events().front()->when);
- for (i = 1; i < veclen; ++i) {
- vec[i] = vec[i-1] + yfrac;
- }
+ for (i = 1; i < veclen; ++i) {
+ vec[i] = vec[i-1] + yfrac;
+ }
- return;
- }
+ return;
+ }
if (_dirty) {
solve ();