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
|
/* string_container.h - contains a collection of strings
*
* Copyright (c) 2006 Danny McRae <khjklujn/at/yahoo/com>
*
* This file is part of LMMS - https://lmms.io
*
* 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 (see COPYING); if not, write to the
* Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301 USA.
*
*/
#ifndef _STRING_CONTAINER_H
#define _STRING_CONTAINER_H
#include <QVector>
#include "vibrating_string.h"
#include "MemoryManager.h"
class stringContainer
{
MM_OPERATORS
public:
stringContainer(const float _pitch,
const sample_rate_t _sample_rate,
const int _buffer_length,
const int _strings = 9 );
void addString( int _harm,
const float _pick,
const float _pickup,
const float * _impluse,
const float _randomize,
const float _string_loss,
const float _detune,
const int _oversample,
const bool _state,
const int _id );
bool exists( int _id ) const
{
return m_exists[_id];
}
~stringContainer()
{
int strings = m_strings.count();
for( int i = 0; i < strings; i++ )
{
delete m_strings[i];
}
}
float getStringSample( int _string )
{
return m_strings[_string]->nextSample();
}
private:
QVector<vibratingString *> m_strings;
const float m_pitch;
const sample_rate_t m_sampleRate;
const int m_bufferLength;
QVector<bool> m_exists;
} ;
#endif
|