pub struct LockFreeRingBuffer<T: Copy + Send + 'static> { /* private fields */ }Expand description
Lock-free SPSC ring buffer with power-of-2 capacity.
Internally stores items in a fixed-size boxed slice of
UnsafeCell<MaybeUninit<T>>. Two atomic counters (head for the write
position and tail for the read position) are advanced using
Acquire/Release ordering so that item writes are visible to the reader
thread before the head index update becomes visible.
§Capacity rounding
The requested capacity is rounded up to the next power of two so that
index & mask can replace index % capacity.
§Example
use trustformers_debug::ring_buffer::LockFreeRingBuffer;
let buf = LockFreeRingBuffer::<i32>::new(6);
// Rounded up to the next power of 2 → 8
assert_eq!(buf.capacity(), 8);
assert!(buf.push(1).is_ok());
assert_eq!(buf.pop(), Some(1));
assert_eq!(buf.pop(), None);Implementations§
Source§impl<T: Copy + Send + 'static> LockFreeRingBuffer<T>
impl<T: Copy + Send + 'static> LockFreeRingBuffer<T>
Sourcepub fn push(&self, item: T) -> Result<(), RingBufferError>
pub fn push(&self, item: T) -> Result<(), RingBufferError>
Attempts to push item into the buffer.
Returns Err(RingBufferError::Full { … }) if the buffer is full.
§Example
use trustformers_debug::ring_buffer::{LockFreeRingBuffer, RingBufferError};
let buf = LockFreeRingBuffer::<u8>::new(2);
assert!(buf.push(10).is_ok());
assert!(buf.push(20).is_ok());
let err = buf.push(30).unwrap_err();
assert!(matches!(err, RingBufferError::Full { .. }));Sourcepub fn pop(&self) -> Option<T>
pub fn pop(&self) -> Option<T>
Attempts to pop an item from the buffer.
Returns None if the buffer is empty.
§Example
use trustformers_debug::ring_buffer::LockFreeRingBuffer;
let buf = LockFreeRingBuffer::<u8>::new(4);
assert_eq!(buf.pop(), None);
buf.push(99).unwrap();
assert_eq!(buf.pop(), Some(99));
assert_eq!(buf.pop(), None);Trait Implementations§
impl<T: Copy + Send + 'static> Send for LockFreeRingBuffer<T>
impl<T: Copy + Send + 'static> Sync for LockFreeRingBuffer<T>
Auto Trait Implementations§
impl<T> !Freeze for LockFreeRingBuffer<T>
impl<T> !RefUnwindSafe for LockFreeRingBuffer<T>
impl<T> Unpin for LockFreeRingBuffer<T>
impl<T> UnsafeUnpin for LockFreeRingBuffer<T>
impl<T> UnwindSafe for LockFreeRingBuffer<T>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.