An error occurred fetching the project authors.
- 30 Sep, 2011 1 commit
-
-
Robert Griesemer authored
Benchmark results (best of 3 runs): old: suffixarray.BenchmarkSaveRestore 1 1931909000 ns/op 28.21 MB/s new: suffixarray.BenchmarkSaveRestore 5 429721800 ns/op 117.14 MB/s R=golang-dev, r CC=golang-dev https://golang.org/cl/5161043
-
- 27 Sep, 2011 1 commit
-
-
Robert Griesemer authored
CL 5040041 (https://golang.org/cl/5040041) changed the use of []int to []int32 internally so that encoding/binary could be used. This is no longer needed (gobs can encode ints), and using []int is more in sync w/ the semantics of the data structure (the index elements are indices which are ints). Changing it back. R=r CC=golang-dev https://golang.org/cl/5141049
-
- 26 Sep, 2011 1 commit
-
-
Russ Cox authored
R=golang-dev, r CC=golang-dev https://golang.org/cl/5127042
-
- 20 Sep, 2011 1 commit
-
-
Robert Griesemer authored
Use gobs to serialize indexes instead of encoding/binary. Even with gobs, serialize data in slices instead of applying gob to the entire data structure at once, to reduce the amount of extra buffer memory needed inside gob. 7x faster Write/Read for new BenchmarkSaveRestore compared to old code; possibly because encoding/binary is more expensive for int32 slice elements (interface call to get little/big endian encoding), while gob's encoding is fixed (unconfirmed). new (using gobs): suffixarray.BenchmarkSaveRestore 1 2153604000 ns/op old (using encoding/binary): suffixarray.BenchmarkSaveRestore 1 15118322000 ns/op The actual serialized data is slightly larger then using the old code for very large indices because full 32bit indices require 5bytes using gobs instead of 4bytes (encoding/binary) in serialized form. R=r CC=golang-dev https://golang.org/cl/5087041
-
- 15 Sep, 2011 1 commit
-
-
Robert Griesemer authored
R=r CC=golang-dev https://golang.org/cl/5040041
-
- 12 Sep, 2011 1 commit
-
-
Robert Griesemer authored
R=rsc CC=golang-dev https://golang.org/cl/4983058
-
- 14 Jul, 2011 1 commit
-
-
Robert Griesemer authored
manual changes in src/pkg/go/printer, src/cmd/gofix/signal_test.go (cd src/cmd/gofix/testdata; gofmt -w *.in *.out) (cd src/pkg/go/printer; gotest -update) gofmt -w misc src runs all tests R=golang-dev, rsc CC=golang-dev https://golang.org/cl/4715041
-
- 08 Jul, 2011 1 commit
-
-
Andrew Gerrand authored
Includes 'sorthelpers' gofix and updates to tree. R=golang-dev, gri CC=golang-dev https://golang.org/cl/4631098
-
- 19 Apr, 2011 1 commit
-
-
Nigel Tao authored
R=rsc CC=golang-dev https://golang.org/cl/4442064
-
- 24 Jan, 2011 1 commit
-
-
Eric Eisner authored
This prevents many unnecessary comparisons when n is large. R=gri, gri1, rsc CC=golang-dev https://golang.org/cl/4068043
-
- 12 Jan, 2011 1 commit
-
-
Eric Eisner authored
This implements the algorithm qsufsort using the sort package as a sorting primitive. Its worst-case performance is O(N*log(N)), and it uses only an additional slice of N ints of memory during creation. Benchmarks (seconds): old new 10k nulls 149 0.044 1M English corpus 32.0 3.6 R=gri, gri1 CC=golang-dev https://golang.org/cl/3752044
-
- 17 Dec, 2010 1 commit
-
-
Robert Griesemer authored
Implementation uses fast suffixarray lookup to find initial matches if the regular expression starts with a suitable prefix without meta characters. R=r, rsc CC=golang-dev https://golang.org/cl/3720042
-
- 14 Dec, 2010 2 commits
-
-
Robert Griesemer authored
R=rsc CC=golang-dev https://golang.org/cl/3540042
-
Robert Griesemer authored
R=r CC=golang-dev https://golang.org/cl/3574044
-
- 09 Dec, 2010 1 commit
-
-
Ryan Hitchman authored
R=golang-dev, gri CC=golang-dev https://golang.org/cl/3529041
-
- 19 Nov, 2010 1 commit
-
-
Russ Cox authored
R=gri CC=golang-dev https://golang.org/cl/3200041
-
- 22 Sep, 2010 2 commits
-
-
Robert Griesemer authored
R=rsc CC=golang-dev https://golang.org/cl/2213045
-
Robert Griesemer authored
This is a replacement for pending CL 2219042. It only contains the raw suffixarray functionality with two methods: - New create a new index from some data - Lookup lookup occurences of a bytes slice in the data Any other functionality (dealing with multiple data sets and the corresponding position lists) is generic and doesn't have to be part of this package. Known performance bug: This implementation works fine for data sets up to several megabytes as long as it doesn't contain very long contiguous sequences of equal bytes. For instance, index creation for all .go files under GOROOT (250KLOCs, approx. 9MB) takes ~50s on 2.66 GHz Intel Xeon as long as test/fixedbugs/257.go is excluded. With that file, index creation times takes several days. 257.go contains a string of 1M smiley faces. There are more sophisticated suffixarray creation algorithms which can handle very long common prefixes. The implementation can be updated w/o the need to change the interface. R=rsc, r, PeterGo CC=golang-dev https://golang.org/cl/2265041
-