quick-structures-npm/trie.js at master · Techie-TM/quick-structures-npm · GitHub

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
50
51
52
53
54
55
56
57
class trie{
    constructor(){
        this.children=[];
        this.isWord=false;
    }
    insert(word){
        let pointer=this;
        for(let i=0;i<word.length;i++){
            if(pointer.children[word[i].toLowerCase()-'a']==undefined){
                pointer.children[word[i].toLowerCase()-'a']=new trie();
            }
            pointer=pointer.children[word[i].toLowerCase()-'a'];
        }
        pointer.isWord=true;
    }
    strictinsert(word){
        let pointer=this;
        for(let i=0;i<word.length;i++){
            if(pointer.children[word[i]]==undefined){
                pointer.children[word[i]]=new trie();
            }
            pointer=pointer.children[word[i]];
        }
        pointer.isWord=true;
    }
    search(word){
        let pointer=this;
        for(let i=0;i<word.length;i++){
            if(pointer.children[word[i].toLowerCase()-'a']==undefined){
                return false;
            }
            pointer=pointer.children[word[i].toLowerCase()-'a'];
        }
        return pointer.isWord;
    }
    strictsearch(word){
        let pointer=this;
        for(let i=0;i<word.length;i++){
            if(pointer.children[word[i]]==undefined){
                return false;
            }
            pointer=pointer.children[word[i]];
        }
        return pointer.isWord;
    }
    partialsearch(word){
        let pointer=this;
        for(let i=0;i<word.length;i++){
            if(pointer.children[word[i].toLowerCase()-'a']==undefined){
                return false;
            }
            pointer=pointer.children[word[i].toLowerCase()-'a'];
        }
        return true;
    }
}
module.exports=trie;