Skip to main content

SharedTreiberStack

Struct SharedTreiberStack 

Source
pub struct SharedTreiberStack<T: Copy + 'static> { /* private fields */ }

Implementations§

Source§

impl<T: Copy + 'static> SharedTreiberStack<T>

Source

pub fn create( path: impl AsRef<Path>, capacity: usize, ) -> Result<Self, StackError>

Obtain the stack at path, initializing an empty one if the path does not yet exist and attaching to it if it does. Attaching leaves pushed entries and the free list in place; a region built with a different capacity or payload type is a LayoutMismatch. reset reinitializes.

Source

pub fn reset( path: impl AsRef<Path>, capacity: usize, ) -> Result<Self, StackError>

Truncate the stack at path and initialize an empty one, discarding every entry live peers share. For a caller that knows it owns the path.

Source

pub fn open( path: impl AsRef<Path>, expected_capacity: usize, ) -> Result<Self, StackError>

Source

pub fn capacity(&self) -> usize

Source

pub fn push(&self, value: T) -> Result<(), StackError>

Push a value onto the stack.

Source

pub fn pop(&self) -> Option<T>

Pop a value off the stack. Returns None if empty.

Source

pub fn peek(&self) -> Option<T>

Peek at the top without popping. Returns None if empty.

Source

pub fn is_empty(&self) -> bool

True when the stack is empty.

Source

pub fn approx_len(&self) -> usize

Approximate len: walks the linked list from head. O(N). Subject to race with concurrent push/pop.

Source

pub fn flush(&self) -> Result<(), StackError>

Source

pub fn flush_async(&self) -> Result<(), StackError>

Trait Implementations§

Source§

impl<T: Copy + Send + Sync + 'static> AdaptiveInstance for SharedTreiberStack<T>

Source§

fn header(&self) -> &HandshakeHeader

Source§

fn ring(&self) -> &ObservationRing

Source§

fn make_policy(&self) -> Box<dyn Policy>

Source§

fn apply_migration(&self, new_tag: u32)

Called by the sidecar when the policy returns a new strategy tag. Default implementation: just set the tag on the header. Primitives that need heavier migration (data-layout swap) override this to perform the swap before (or after) updating the tag.
Source§

impl<T: Copy + Send + 'static> Send for SharedTreiberStack<T>

Source§

impl<T: Copy + Sync + 'static> Sync for SharedTreiberStack<T>

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.