word-trie 0.1.0

A simple trie for word validation.
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49



use std::collections::HashMap;

#[derive(Default,Debug)]
pub struct TrieNode{
    pub nodes:HashMap<char, TrieNode>,
    pub is_word:bool,
}

#[derive(Debug)]
pub struct Trie{
    pub root:TrieNode,
}

impl Default for Trie {
    fn default() -> Self {
        Self {
            root: TrieNode::default(),
        }
    }
}

pub trait Dictionary {
    fn add_word(&mut self, word: &str);
    fn is_word(&self, word: &str) -> bool;
}

impl Dictionary for Trie{
    fn add_word(&mut self, word:&str){
        let mut node = &mut self.root;
        for ch in word.chars(){
            node = node.nodes.entry(ch).or_default();
        }
        node.is_word=true;
    }

    fn is_word(&self, word:&str)->bool{
        let mut node = &self.root;
        for ch in word.chars(){
            match node.nodes.get(&ch){
                Some(nd) => node = nd,
                None => return false,
            }
        }
        node.is_word
    }
}