suffixarray
少于1分钟
suffixarray
https://pkg.go.dev/index/suffixarray@go1.20.1
Package suffixarray implements substring search in logarithmic time using an in-memory suffix array.
Example use:
// create index for some data
index := suffixarray.New(data)
// lookup byte slice s
offsets1 := index.Lookup(s, -1) // the list of all indices where s occurs in data
offsets2 := index.Lookup(s, 3) // the list of at most 3 indices where s occurs in data
常量
This section is empty.
变量
This section is empty.
函数
This section is empty.
类型
type Index
|
|
Index implements a suffix array for fast substring search.
func New
|
|
New creates a new Index for data. Index creation time is O(N) for N = len(data).
(*Index) Bytes
|
|
Bytes returns the data over which the index was created. It must not be modified.
(*Index) FindAllIndex
|
|
FindAllIndex returns a sorted list of non-overlapping matches of the regular expression r, where a match is a pair of indices specifying the matched slice of x.Bytes(). If n < 0, all matches are returned in successive order. Otherwise, at most n matches are returned and they may not be successive. The result is nil if there are no matches, or if n == 0.
(*Index) Lookup
|
|
Lookup returns an unsorted list of at most n indices where the byte string s occurs in the indexed data. If n < 0, all occurrences are returned. The result is nil if s is empty, s is not found, or n == 0. Lookup time is O(log(N)*len(s) + len(result)) where N is the size of the indexed data.
Lookup Example
|
|
(*Index) Read
|
|
Read reads the index from r into x; x must not be nil.
(*Index) Write
|
|
Write writes the index x to w.