关于自然语言中Trie树修改版 请大家帮我填个注释吧 尤其是treeset

Question

 package MyTrie;
import java.util.TreeSet;

public class MyTrieUnit implements Comparable {
    int ch; // 某字符的ASCII码值
    int val; // 标记是否为词的最后一位，并记录词对应的编号
    TreeSet<MyTrieUnit> sons;

    public MyTrieUnit(int v) {
        ch = v;
        val = 0;
        sons = new TreeSet<MyTrieUnit>();
    }

    public int compareTo(Object arg0) {
        MyTrieUnit e = (MyTrieUnit) arg0;
        return ch - e.ch;
    }

    public boolean equals(MyTrieUnit e) {
        return ch == e.getCh();
    }

    public MyTrieUnit findChar(int v) {
        MyTrieUnit ret = sons.floor(new MyTrieUnit(v));

        if( ret == null ) return null;
        if (ret.getCh() == v)
            return ret;
        else
            return null;
    }

    /**
     * 向其中添加一个字
     */
    public void add(MyTrieUnit v) {
        sons.add(v);
    }

    public void setV(int v) {
        val = v;
    }

    public int getCh() {
        return ch;
    }

    public int getVal() {
        return val;
    }
}

Answer 1

http://www.52nlp.cn/