23 lines
450 B
Go
23 lines
450 B
Go
package job
|
|
|
|
import (
|
|
"github.com/mibk/dupl/suffixtree"
|
|
"github.com/mibk/dupl/syntax"
|
|
)
|
|
|
|
func BuildTree(schan chan []*syntax.Node) (t *suffixtree.STree, d *[]*syntax.Node, done chan bool) {
|
|
t = suffixtree.New()
|
|
data := make([]*syntax.Node, 0, 100)
|
|
done = make(chan bool)
|
|
go func() {
|
|
for seq := range schan {
|
|
data = append(data, seq...)
|
|
for _, node := range seq {
|
|
t.Update(node)
|
|
}
|
|
}
|
|
done <- true
|
|
}()
|
|
return t, &data, done
|
|
}
|