diff options
author | Carl Hetherington <carl@carlh.net> | 2010-12-03 22:27:30 +0000 |
---|---|---|
committer | Carl Hetherington <carl@carlh.net> | 2010-12-03 22:27:30 +0000 |
commit | c04e57125baa174158448cfe6b1f72a5f6cee251 (patch) | |
tree | f3eb5bc24367785ab80446921acb20170a124191 /libs/ardour/ardour/interpolation.h | |
parent | 73192bc1a7ea55fa1864dc3826845b15c00dd2ec (diff) |
No-op: reformat and add GPL boilerplate.
git-svn-id: svn://localhost/ardour2/branches/3.0@8167 d708f5d6-7413-0410-9779-e7cbd77b26cf
Diffstat (limited to 'libs/ardour/ardour/interpolation.h')
-rw-r--r-- | libs/ardour/ardour/interpolation.h | 67 |
1 files changed, 43 insertions, 24 deletions
diff --git a/libs/ardour/ardour/interpolation.h b/libs/ardour/ardour/interpolation.h index 0d79b01d14..5bcb7925cb 100644 --- a/libs/ardour/ardour/interpolation.h +++ b/libs/ardour/ardour/interpolation.h @@ -1,3 +1,22 @@ +/* + Copyright (C) 1999-2010 Paul Davis + + 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. + + This program 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 this program; if not, write to the Free Software + Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + +*/ + #include <math.h> #include <samplerate.h> @@ -9,33 +28,33 @@ namespace ARDOUR { class Interpolation { - protected: - double _speed, _target_speed; +protected: + double _speed; + double _target_speed; - // the idea is that when the speed is not 1.0, we have to - // interpolate between samples and then we have to store where we thought we were. - // rather than being at sample N or N+1, we were at N+0.8792922 - std::vector<double> phase; + // the idea is that when the speed is not 1.0, we have to + // interpolate between samples and then we have to store where we thought we were. + // rather than being at sample N or N+1, we were at N+0.8792922 + std::vector<double> phase; +public: + Interpolation () { _speed = 1.0; _target_speed = 1.0; } + ~Interpolation () { phase.clear(); } - public: - Interpolation () { _speed = 1.0; _target_speed = 1.0; } - ~Interpolation () { phase.clear(); } - - void set_speed (double new_speed) { _speed = new_speed; _target_speed = new_speed; } - void set_target_speed (double new_speed) { _target_speed = new_speed; } - - double target_speed() const { return _target_speed; } - double speed() const { return _speed; } - - void add_channel_to (int /*input_buffer_size*/, int /*output_buffer_size*/) { phase.push_back (0.0); } - void remove_channel_from () { phase.pop_back (); } - - void reset () { - for (size_t i = 0; i < phase.size(); i++) { - phase[i] = 0.0; - } - } + void set_speed (double new_speed) { _speed = new_speed; _target_speed = new_speed; } + void set_target_speed (double new_speed) { _target_speed = new_speed; } + + double target_speed() const { return _target_speed; } + double speed() const { return _speed; } + + void add_channel_to (int /*input_buffer_size*/, int /*output_buffer_size*/) { phase.push_back (0.0); } + void remove_channel_from () { phase.pop_back (); } + + void reset () { + for (size_t i = 0; i < phase.size(); i++) { + phase[i] = 0.0; + } + } }; class LinearInterpolation : public Interpolation { |