(int start, int end)
| 130 | } |
| 131 | |
| 132 | public Trie subpath(int start, int end) { |
| 133 | Trie id = Trie.ROOT; |
| 134 | for(int i=start;i!=end;++i) { |
| 135 | // TODO: this could be made more efficient |
| 136 | id = id.append(get(i)); |
| 137 | } |
| 138 | return id; |
| 139 | } |
| 140 | public Trie parent(int depth) { |
| 141 | if(this.depth < depth) { |
| 142 | return this; |