Struct rustc_ast_pretty::pp::ring::RingBuffer
source · pub struct RingBuffer<T> {
data: VecDeque<T>,
offset: usize,
}
Expand description
A view onto a finite range of an infinitely long sequence of T.
The Ts are indexed 0..infinity. A RingBuffer begins as a view of elements 0..0 (i.e. nothing). The user of the RingBuffer advances its left and right position independently, although only in the positive direction, and only with left <= right at all times.
Holding a RingBuffer whose view is elements left..right gives the ability to use Index and IndexMut to access elements i in the infinitely long queue for which left <= i < right.
Fields§
§data: VecDeque<T>
§offset: usize
Implementations§
source§impl<T> RingBuffer<T>
impl<T> RingBuffer<T>
pub fn new() -> Self
pub fn is_empty(&self) -> bool
pub fn push(&mut self, value: T) -> usize
pub fn clear(&mut self)
pub fn index_of_first(&self) -> usize
pub fn first(&self) -> Option<&T>
pub fn first_mut(&mut self) -> Option<&mut T>
pub fn pop_first(&mut self) -> Option<T>
pub fn last(&self) -> Option<&T>
pub fn last_mut(&mut self) -> Option<&mut T>
Trait Implementations§
source§impl<T> Index<usize> for RingBuffer<T>
impl<T> Index<usize> for RingBuffer<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for RingBuffer<T>where T: RefUnwindSafe,
impl<T> Send for RingBuffer<T>where T: Send,
impl<T> Sync for RingBuffer<T>where T: Sync,
impl<T> Unpin for RingBuffer<T>where T: Unpin,
impl<T> UnwindSafe for RingBuffer<T>where T: UnwindSafe,
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
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 40 bytes