dltree 0.1.5

Doubly linked tree with leaf-considering typing
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

use crate::internal::leaf_impl::LeafImpl;
use crate::internal::node_impl::NodeImpl;
use crate::tree::Value;
use std::cell::RefCell;
use std::rc::{Rc, Weak};

#[derive(Debug)]
pub enum TreeElementImpl<IT, LT> {
    Node(Rc<RefCell<NodeImpl<IT, LT>>>),
    Leaf(Rc<RefCell<LeafImpl<IT, LT>>>),
}

impl<IT, LT> TreeElementImpl<IT, LT> {
    pub fn new(value: Value<IT, LT>, parent: Option<Weak<RefCell<NodeImpl<IT, LT>>>>) -> Self {
        match value {
            Value::Node(n) => Self::Node(Rc::new(RefCell::new(NodeImpl::new(n, parent)))),
            Value::Leaf(l) => Self::Leaf(Rc::new(RefCell::new(LeafImpl::new(l, parent)))),
        }
    }
}

impl<IT, LT> Clone for TreeElementImpl<IT, LT> {
    fn clone(&self) -> Self {
        match &self {
            TreeElementImpl::Node(n) => TreeElementImpl::Node(n.clone()),
            TreeElementImpl::Leaf(l) => TreeElementImpl::Leaf(l.clone()),
        }
    }
}