You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
29 lines
1.1 KiB
29 lines
1.1 KiB
// Copyright 2015, Joe Tsai. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE.md file.
|
|
|
|
// Package sais implements a linear time suffix array algorithm.
|
|
package sais
|
|
|
|
//go:generate go run sais_gen.go byte sais_byte.go
|
|
//go:generate go run sais_gen.go int sais_int.go
|
|
|
|
// This package ports the C sais implementation by Yuta Mori. The ports are
|
|
// located in sais_byte.go and sais_int.go, which are identical to each other
|
|
// except for the types. Since Go does not support generics, we use generators to
|
|
// create the two files.
|
|
//
|
|
// References:
|
|
// https://sites.google.com/site/yuta256/sais
|
|
// https://www.researchgate.net/publication/221313676_Linear_Time_Suffix_Array_Construction_Using_D-Critical_Substrings
|
|
// https://www.researchgate.net/publication/224176324_Two_Efficient_Algorithms_for_Linear_Time_Suffix_Array_Construction
|
|
|
|
// ComputeSA computes the suffix array of t and places the result in sa.
|
|
// Both t and sa must be the same length.
|
|
func ComputeSA(t []byte, sa []int) {
|
|
if len(sa) != len(t) {
|
|
panic("mismatching sizes")
|
|
}
|
|
computeSA_byte(t, sa, 0, len(t), 256)
|
|
}
|