Struct ListNode 

pub struct ListNode<T> {
    pub id: ListId,
    pub value: Option<T>,
    pub origin: ListId,
    pub deleted: bool,
}

A node in the RGA list.

Fields

id: ListId

The unique ID of this node.

value: Option<T>

The value stored (None if deleted - tombstone).

origin: ListId

The ID of the element this was inserted after.

deleted: bool

Whether this node is deleted (tombstone).

Implementations

impl<T> ListNode<T>

pub fn new(id: ListId, value: T, origin: ListId) -> Self

Trait Implementations

impl<T: Clone> Clone for ListNode<T>

fn clone(&self) -> ListNode<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for ListNode<T>

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for ListNode<T>

where T: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: PartialEq> PartialEq for ListNode<T>

fn eq(&self, other: &ListNode<T>) -> 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> Serialize for ListNode<T>

where T: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> StructuralPartialEq for ListNode<T>