MayaFlux::Memory::QueueAccess Struct Reference

FIFO queue semantics (oldest data first) More...

#include <RingBuffer.hpp>

Collaboration diagram for MayaFlux::Memory::QueueAccess:

Static Public Attributes
static constexpr bool	push_front = false
static constexpr bool	pop_front = true
static constexpr const char *	name = "Queue (FIFO)"

Detailed Description

FIFO queue semantics (oldest data first)

Traditional queue behavior: enqueue at back, dequeue from front. Data ordering: [0] = oldest inserted, [N-1] = newest inserted.

Operations:

• push(): Add to back of queue
• pop(): Remove from front of queue
• linearized_view(): [oldest → newest]

Use Cases:

• Event queues (input, MIDI, OSC)
• Message passing between threads
• Task queues
• Logging buffers

LockFreeQueue<InputEvent, 2048> event_queue;
 
// Producer: add events as they arrive
event_queue.push(event);
 
// Consumer: process in arrival order
while (auto event = event_queue.pop()) {
    process(*event);  // Oldest event first
}

Definition at line 263 of file RingBuffer.hpp.

---

The documentation for this struct was generated from the following file:

• RingBuffer.hpp