linearized_view_mut()

template<typename T , typename StoragePolicy , typename ConcurrencyPolicy = SingleThreadedPolicy, typename AccessPattern = QueueAccess>

std::span< T > MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::linearized_view_mut ( )

inline

Get mutable linearized view for modification.

Returns

Mutable span ordered by AccessPattern

Same as linearized_view() but returns mutable references. Changes to span elements affect underlying buffer.

auto history = delay.linearized_view_mut();
for (auto& sample : history) {
    sample *= 0.9;  // Apply gain reduction
}

Definition at line 873 of file RingBuffer.hpp.

    {
        const size_t cap = m_storage.capacity();
        const size_t count = size();
 
        if constexpr (AccessPattern::push_front) {
            for (size_t i = 0; i < count; ++i) {
                size_t idx = (m_state.write_index + cap - i) % cap;
                m_linearized[i] = m_storage.buffer[idx];
            }
        } else {
            for (size_t i = 0; i < count; ++i) {
                size_t idx = (m_state.read_index + i) % cap;
                m_linearized[i] = m_storage.buffer[idx];
            }
        }
 
        return { m_linearized.data(), count };
    }

References count, MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::m_linearized, MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::m_state, MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::m_storage, and MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::size().

Here is the call graph for this function: