commit | cb0b562150d5fdb1832f28c1e4b99ff37cc76dbf | [log] [tgz] |
---|---|---|
author | Michael Hendricks <michael@ndrix.org> | Mon Mar 25 20:36:11 2013 |
committer | Michael Hendricks <michael@ndrix.org> | Mon Mar 25 20:36:11 2013 |
tree | 5fc506df22efba2757ca8afbb196d958875312bc | |
parent | aacbf98b78ff126664803427abdc1f6e48a92ca9 [diff] |
Don't allocate memory in hashKey Converting from string to []byte allocates a temporary slice. If we iterate the string's runes directly, we can avoid the extra memory allocations. This dramatically improves hash performance and therefore Set and Delete performance in micro benchmarks.
Persistent data structures for Go. See the full package documentation
Install with
go get github.com/mndrix/ps