116 lines
2.5 KiB
C++
116 lines
2.5 KiB
C++
/*
|
|
* jayDSP, A cross-platform Digital Signal Processing library written in modern C++.
|
|
* Copyright (C) 2025 Jens Ahrensfeld, All rights reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy of
|
|
* this software and associated documentation files (the "Software"), to deal in
|
|
* the Software without restriction, including without limitation the rights to
|
|
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
|
* the Software, and to permit persons to whom the Software is furnished to do so,
|
|
* subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in all
|
|
* copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
|
|
* FOR A PARTICULAR PURPOSE AND NON INFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
|
|
* COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
|
|
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
* File: dsp_ringbuffer.hpp
|
|
* Author Jens Ahrensfeld on 26.10.2025.
|
|
*/
|
|
|
|
#ifndef DSP_RINGBUFFER_H
|
|
#define DSP_RINGBUFFER_H
|
|
|
|
#include <cstddef>
|
|
#include <cstdint>
|
|
#include <math.h>
|
|
#include <stdint.h>
|
|
#include <sys/types.h>
|
|
#include "../../dsp_types.hpp"
|
|
|
|
namespace dsp {
|
|
|
|
template <typename T>
|
|
class RingBuffer
|
|
{
|
|
uint m_index;
|
|
uint m_mask;
|
|
size_t m_capacity;
|
|
vector<T> m_buffer;
|
|
|
|
public:
|
|
RingBuffer(size_t capacity)
|
|
: m_index(0)
|
|
, m_mask(0)
|
|
, m_capacity(0)
|
|
{
|
|
resize(capacity);
|
|
}
|
|
|
|
size_t capacity()
|
|
{
|
|
return m_buffer.capacity();
|
|
}
|
|
|
|
void reset()
|
|
{
|
|
m_index = 0;
|
|
}
|
|
|
|
void resize(int capacity, T value=T())
|
|
{
|
|
m_capacity = 1;
|
|
while (m_capacity < capacity)
|
|
{
|
|
m_capacity *= 2;
|
|
}
|
|
|
|
m_buffer.assign(m_capacity, value);
|
|
m_mask = unsigned(m_capacity - 1);
|
|
m_index = 0;
|
|
}
|
|
|
|
T & operator[](int offset)
|
|
{
|
|
return m_buffer[(m_index + (uint)offset) & m_mask];
|
|
}
|
|
|
|
const T & operator[](int offset) const
|
|
{
|
|
return m_buffer[(m_index + (uint)offset) & m_mask];
|
|
}
|
|
|
|
RingBuffer & operator ++()
|
|
{
|
|
++m_index;
|
|
return *this;
|
|
}
|
|
|
|
RingBuffer & operator +=(int i)
|
|
{
|
|
m_index += (uint)i;
|
|
return *this;
|
|
}
|
|
|
|
RingBuffer & operator --()
|
|
{
|
|
--m_index;
|
|
return *this;
|
|
}
|
|
|
|
RingBuffer & operator -=(int i)
|
|
{
|
|
m_index -= (uint)i;
|
|
return *this;
|
|
}
|
|
|
|
};
|
|
}
|
|
|
|
#endif
|