4 * Created on: May 17, 2010
18 std::map
<T
, Node
> edge_list_
;
19 int InsertPath(const std::vector
<T
>& p
, int start
, int end
);
20 const Node
* Extend(const T
& e
) const {
21 typename
std::map
<T
, Node
>::const_iterator it
= edge_list_
.find(e
);
22 if (it
== edge_list_
.end()) return NULL
;
30 int Node
<T
>::InsertPath(const std::vector
<T
>& p
, int start
, int end
){
31 Node
* currNode
= this;
32 for(int i
=start
;i
<= end
; i
++ ) {
33 currNode
= &(currNode
->edge_list_
)[p
[i
]];
38 #endif /* SUFFIX_TRIE_H_ */