Generalized suffix tree implemented in suffix array

gst.go

package main

import (
	"fmt"
	"index/suffixarray"
	"regexp"
	"strings"
)

func main() {
	words := []string{
		"aardvark",
		"happy",
		"hello",
		"hero",
		"he",
		"hotel",
		"hello world",
	}
	// use \x00 to start each string
	joinedStrings := strings.Join(words, "\x00") + "\x00"
	sa := suffixarray.New([]byte(joinedStrings))

	// User has typed in "he"
	match, err := regexp.Compile("[^\x00]*ell[^\x00]*")
	if err != nil {
		panic(err)
	}
	ms := sa.FindAllIndex(match, -1)

	for _, m := range ms {
		start, end := m[0], m[1]
		fmt.Printf("match = %q\n", joinedStrings[start:end])
	}
}