peek_oldest()

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

const_reference MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::peek_oldest ( ) const

inline

Peek at oldest element without removing.

Returns

Reference to oldest element

Only available for SingleThreadedPolicy (HistoryBufferAccess). Returns element at highest valid index in delay line.

Definition at line 779 of file RingBuffer.hpp.

    {
        const size_t count = size();
        if (count == 0) {
            return m_storage.buffer[m_state.write_index];
        }
 
        const size_t cap = m_storage.capacity();
        size_t oldest_idx = (m_state.write_index + cap - count + 1) % cap;
        return m_storage.buffer[oldest_idx];
    }

References count, 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: