Struct OptimisticFineGrainedListSet

pub struct OptimisticFineGrainedListSet<T> {
    head: SeqLock<Atomic<Node<T>>>,
}

Concurrent sorted singly linked list using fine-grained optimistic locking.

Fields

head: SeqLock<Atomic<Node<T>>>

Implementations

impl<T> OptimisticFineGrainedListSet<T>

pub fn new() -> Self

Creates a new list.

fn head<'g>(&'g self, guard: &'g Guard) -> Cursor<'g, T>

impl<T: Ord> OptimisticFineGrainedListSet<T>

fn find<'g>( &'g self, key: &T, guard: &'g Guard, ) -> Result<(bool, Cursor<'g, T>), ()>

impl<T> OptimisticFineGrainedListSet<T>

pub fn iter<'g>(&'g self, guard: &'g Guard) -> Iter<'g, T>

An iterator visiting all elements. next() returns Some(Err(())) when validation fails. In that case, the user must restart the iteration.

Trait Implementations

impl<T: Ord> ConcurrentSet<T> for OptimisticFineGrainedListSet<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 OptimisticFineGrainedListSet<T>

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

Formats the value using the given formatter.

impl<T> Default for OptimisticFineGrainedListSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for OptimisticFineGrainedListSet<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T: Send> Send for OptimisticFineGrainedListSet<T>

impl<T: Sync> Sync for OptimisticFineGrainedListSet<T>