Struct SharedLinkedList 

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

Implementations

impl<T: Copy + Default + 'static> SharedLinkedList<T>

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

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

pub fn capacity(&self) -> usize

pub fn len(&self) -> usize

Approximate node count (excludes the sentinel head).

pub fn is_empty(&self) -> bool

pub fn region(&self) -> &SharedRegion<Node<T>>

Access the underlying region (advanced use; e.g., to wrap writes in a SharedSemaphore for cross-process serialisation).

pub fn push_front(&self, value: T) -> Result<NodeHandle<T>, LinkedListError>

Push to the front of the list. Returns a stable NodeHandle.

pub fn push_back(&self, value: T) -> Result<NodeHandle<T>, LinkedListError>

Push to the back of the list. Returns a stable NodeHandle.

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

Remove and return the first element.

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

Remove and return the last element.

pub fn remove(&self, handle: NodeHandle<T>) -> Option<T>

Remove the node referenced by handle in O(1) (splice + free the slot). Returns the removed value or None when the handle is the sentinel head OR was already freed.

pub fn get(&self, handle: NodeHandle<T>) -> Option<T>

Read the value at handle. Returns None for nil or stale handle (after remove).

pub fn set( &self, handle: NodeHandle<T>, value: T, ) -> Result<(), LinkedListError>

Overwrite the value at handle (keeping the node’s position in the list).

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

First node’s value (None if empty).

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

Last node’s value (None if empty).

pub fn iter_forward(&self) -> Vec<T>

Snapshot of all values in forward order.

pub fn iter_backward(&self) -> Vec<T>

Snapshot of all values in reverse order (back to front).

pub fn iter_forward_with_handles(&self) -> Vec<(NodeHandle<T>, T)>

Snapshot of all (handle, value) pairs in forward order. Useful for finding a handle by predicate, then removing it.

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

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

Trait Implementations

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

fn header(&self) -> &HandshakeHeader

fn ring(&self) -> &ObservationRing

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

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.