Struct cordyceps::list::Links

pub struct Links<T: ?Sized> { /* private fields */ }

Links to other nodes in a List.

In order to be part of a List, a type must contain an instance of this type, and must implement the Linked trait for Links<Self>.

Implementations

impl<T: ?Sized> Links<T>

pub const fn new() -> Self

Returns new links for a doubly-linked intrusive list.

pub fn is_linked(&self) -> bool

Returns true if this node is currently linked to a List.

Trait Implementations

impl<T: ?Sized> Debug for Links<T>

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

Formats the value using the given formatter.

impl<T: ?Sized> Default for Links<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: ?Sized> PartialEq for Links<T>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Send> Send for Links<T>

Safety

Types containing Links may be Send: the pointers within the Links may mutably alias another value, but the links can only be accessed by the owner of the List itself, because the pointers are private. As long as List upholds its own invariants, Links should not make a type !Send.

impl<T: Sync> Sync for Links<T>

Safety

Types containing Links may be Sync: the pointers within the Links may mutably alias another value, but the links can only be accessed by the owner of the List itself, because the pointers are private. As long as List upholds its own invariants, Links should not make a type !Sync.