go-suffix-tree

This "suffix" package implements a suffix tree.

As a suffix tree, it allows to lookup a key in O(k) operations. In some cases(for example, some scenes in our production), this can be faster than a hash table because the hash function is an O(n) operation, with poor cache locality.

Plus suffix tree is more memory-effective than a hash table.

Example

A simple use case:

import (
    suffix "github.com/spacewander/go-suffix-tree"
)

var (
    TubeNameTree *suffix.Tree
    TubeNames = []string{
        // ...
    }
)

func init() {
    tree := suffix.NewTree()
    for _, s := range TubeNames {
        tree.Insert([]byte(s), &s)
    }
    TubeNameTree = tree
}

func getTubeName(name []byte) *string {
    res, found := TubeNameTree.Get(name)
    if found {
        return res.(*string)
    }
    return nil
}

For more usage, see the godoc.