Struct AddWinsTree 

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

Add-Wins Tree CRDT implementation

This implementation ensures that nodes are never completely lost. Deleted nodes are marked as deleted but preserved for potential recovery.

Implementations

impl<T: Clone + PartialEq + Eq + Send + Sync> AddWinsTree<T>

pub fn new(replica: ReplicaId) -> Self

Create a new Add-Wins tree

pub fn with_config(replica: ReplicaId, config: TreeConfig) -> Self

Create with custom configuration

pub fn add_root(&mut self, value: T, timestamp: u64) -> NodeId

Add a root node to the tree

pub fn add_child( &mut self, parent_id: &NodeId, value: T, timestamp: u64, ) -> Result<NodeId, TreeError>

Add a child node

pub fn update( &mut self, id: &NodeId, value: T, timestamp: u64, ) -> Result<(), TreeError>

Update an existing node

pub fn remove(&mut self, id: &NodeId, timestamp: u64) -> Result<(), TreeError>

Mark a node as deleted

pub fn move_node( &mut self, id: &NodeId, new_parent_id: &NodeId, ) -> Result<(), TreeError>

Move a node to a new parent

pub fn get(&self, id: &NodeId) -> Option<&TreeNode<T>>

Get a node by ID

pub fn visible_nodes(&self) -> Vec<&TreeNode<T>>

Get all visible nodes (not deleted)

pub fn all_nodes(&self) -> Vec<&TreeNode<T>>

Get all nodes including deleted ones

pub fn roots(&self) -> Vec<&TreeNode<T>>

Get root nodes

pub fn children(&self, id: &NodeId) -> Vec<&TreeNode<T>>

Get children of a node

pub fn descendants(&self, id: &NodeId) -> Vec<&TreeNode<T>>

Get descendants of a node (recursive)

pub fn contains(&self, id: &NodeId) -> bool

Check if the tree contains a node

pub fn len(&self) -> usize

Get the number of visible nodes

pub fn is_empty(&self) -> bool

Check if the tree is empty

pub fn clear(&mut self)

Clear all nodes

Trait Implementations

impl<T: Clone + PartialEq + Eq + Send + Sync> CRDT for AddWinsTree<T>

fn replica_id(&self) -> &ReplicaId

impl<T: Clone> Clone for AddWinsTree<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for AddWinsTree<T>

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for AddWinsTree<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: Clone + PartialEq + Eq + Send + Sync> Mergeable for AddWinsTree<T>

type Error = TreeError

fn merge(&mut self, other: &Self) -> Result<(), Self::Error>

Merge this instance with another instance

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

Check if there’s a conflict with another instance

impl<T: PartialEq> PartialEq for AddWinsTree<T>

fn eq(&self, other: &AddWinsTree<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 AddWinsTree<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: Eq> Eq for AddWinsTree<T>

impl<T> StructuralPartialEq for AddWinsTree<T>