Struct Node

pub struct Node<T: Eq + Hash + Clone> {
    pub node: HashMap<T, Rc<RefCell<Node<T>>>>,
    pub leaf: Leaf<T>,
}

Adds one to the number given.

Examples

Trie is the basic trait to implement for a trie tree

let node = Node::new();
let seq = vec!["你".to_string(), "我".to_string(), "他".to_string()];
let seq1 = vec!["你".to_string(), "我".to_string()];
Node::insert_seq(node.clone(), &seq, Leaf::End("intention".to_string()));
let leaf = Node::get_leaf(node.clone(), &seq1);
assert_ne!(leaf, Leaf::End("intention".to_string()));

Fields

node: HashMap<T, Rc<RefCell<Node<T>>>>

leaf: Leaf<T>

Implementations

impl<T: Eq + Hash + Clone> Node<T>

pub fn new() -> Rc<RefCell<Node<T>>>

Trait Implementations

impl<T: Debug + Eq + Hash + Clone> Debug for Node<T>

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

Formats the value using the given formatter.

impl<T: Eq + Hash + Clone> Trie<T> for Node<T>

fn insert_seq(node: Rc<RefCell<Node<T>>>, words: &[T], leaf: Leaf<T>)

add node chars and leaf chars to Node.

fn get_leaf(node: Rc<RefCell<Node<T>>>, words: &[T]) -> Leaf<T>

get the corresponding leaf from the char seq.

fn find_node( node: Rc<RefCell<Node<T>>>, word: &T, ) -> (bool, Rc<RefCell<Node<T>>>)

get the node correspongding to char.

fn find_last_node( node: Rc<RefCell<Node<T>>>, words: &[T], ) -> (usize, Rc<RefCell<Node<T>>>)

get the last node correspongding to chars.

fn add_leaf(node: Rc<RefCell<Node<T>>>, leaf: Leaf<T>) -> bool

add leaf to the node

fn add_node(node: Rc<RefCell<Node<T>>>, node_data: T) -> Rc<RefCell<Node<T>>>

add node to the node