Struct FineGrainedListSet

pub struct FineGrainedListSet<T> {
    head: Mutex<*mut Node<T>>,
}

Concurrent sorted singly linked list using fine-grained lock-coupling.

Fields

head: Mutex<*mut Node<T>>

Implementations

impl<T> FineGrainedListSet<T>

pub fn new() -> Self

Creates a new list.

impl<T: Ord> FineGrainedListSet<T>

fn find(&self, key: &T) -> (bool, Cursor<'_, T>)

impl<T> FineGrainedListSet<T>

pub fn iter(&self) -> Iter<'_, T>

An iterator visiting all elements.

Trait Implementations

impl<T: Ord> ConcurrentSet<T> for FineGrainedListSet<T>

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

Returns true iff the set contains the value.

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

Adds the value to the set. Returns whether the value was newly inserted.

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

Removes the value from the set. Returns whether the value was present in the set.

impl<T: Debug> Debug for FineGrainedListSet<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Default for FineGrainedListSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for FineGrainedListSet<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T: Send> Send for FineGrainedListSet<T>

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