Struct SimpleList 

pub struct SimpleList<T> { /* private fields */ }

Original O(n) linked list - only use for small collections (<100 items) A lock-free ordered linked list implementation.

Implementations

impl<T: Ord> List<T>

pub fn new() -> Self

Creates a new empty list.

pub fn insert(&self, data: T) -> bool

Inserts an element into the list, returning false if it already exists.

pub fn contains(&self, key: &T) -> bool

Returns true if the list contains the given key.

pub fn is_empty(&self) -> bool

Returns true if the list is empty.

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

Removes an element from the list, returning it if found. Note: This implementation leaks memory for simplicity. In production, use a memory reclamation scheme like hazard pointers.

Trait Implementations

impl<T: Ord> Default for List<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for List<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T: Send> Send for List<T>

impl<T: Send> Sync for List<T>