Struct Node 

pub struct Node<T, K> { /* private fields */ }

A node of a tree (Node<TObject, TKey>): an item, its key, its parent and its children, as TransformToTree builds them. Nodes are held in Rc.

Deviation (DEVIATIONS.md, DynamicData): a node holds its parent weakly, so that a parent and its children (which it holds) do not keep each other alive; the parent of a node is the node of the tree that is its parent, which the tree keeps.

Implementations

impl<T: Clone + 'static, K: Eq + Hash + Clone + 'static> Node<T, K>

pub fn new(item: T, key: K) -> Rc<Self>

A node without a parent (Node(TObject, TKey)).

pub fn with_parent(item: T, key: K, parent: Option<&Rc<Node<T, K>>>) -> Rc<Self>

A node of parent (Node(TObject, TKey, in Optional<Node<TObject, TKey>>)).

pub fn children(&self) -> &ObservableCache<Rc<Node<T, K>>, K>

The child nodes (Children).

pub fn depth(&self) -> usize

The number of ancestors of the node (Depth).

pub fn is_root(&self) -> bool

Whether the node has no parent (IsRoot).

pub fn item(&self) -> &T

The item (Item).

pub fn key(&self) -> &K

The key of the item (Key).

pub fn parent(&self) -> Option<Rc<Node<T, K>>>

The parent node (Parent).

Trait Implementations

impl<T: Debug, K: Debug> Debug for Node<T, K>

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

Formats the value using the given formatter.

impl<T: Display + Clone + 'static, K: Eq + Hash + Clone + 'static> Display for Node<T, K>

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

ToString: the item, and the number of children when there are any.

impl<T, K: Eq> Eq for Node<T, K>

impl<T, K: Hash> Hash for Node<T, K>

fn hash<H: Hasher>(&self, state: &mut H)

GetHashCode: the hash of the key.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: Clone + 'static, K: Eq + Hash + Clone + 'static> IDisposable for Node<T, K>

fn dispose(&self)

Disposes the children (Dispose).

impl<T, K: PartialEq> PartialEq for Node<T, K>

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

Nodes of the same key are equal (Equals(Node<TObject, TKey>)).

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

Inequality operator !=.