- Committer: John Arbash Meinel
- Date: 2011-06-11 18:53:39 UTC
- Revision ID: john@arbash-meinel.com-20110611185339-5g4uoj1y13ggonjf
Doing a slice brings us up to 477us. So the bounds checking isn't any faster,
(arguably a compiler could notice that the bounds must never be violated, and optimize
out the checks, but it doesn't do that.) So the cost of slicing is ~34us.
(arguably a compiler could notice that the bounds must never be violated, and optimize
out the checks, but it doesn't do that.) So the cost of slicing is ~34us.
| Filename | Latest Rev | Last Changed | Committer | Comment | Size | ||
|---|---|---|---|---|---|---|---|
 .. |
|||||||
simple_murmur3
|
5 | 13 years ago | John Arbash Meinel | Create a reasonably trivial C program to validate |
|
||
.bzrignore |
11 | 13 years ago | John Arbash Meinel | Add a simple function for timing the C++ version o | 87 bytes |
|
|
|
Makefile |
1 | 13 years ago | John Arbash Meinel | Start a blank project for prototyping the Murmur h | 545 bytes |
|
|
|
murmur3.go |
19 | 13 years ago | John Arbash Meinel | Doing a slice brings us up to 477us. So the bounds | 5.7 KB |
|
|
|
murmur3_test.go |
15 | 13 years ago | John Arbash Meinel | Holy cow. Using unsafe.Pointer dropped us from 611 | 4.4 KB |
|
|
|
README.txt |
1 | 13 years ago | John Arbash Meinel | Start a blank project for prototyping the Murmur h | 281 bytes |
|
|
|
suite_test.go |
2 | 13 years ago | John Arbash Meinel | Start actually implementing the Murmur3 hash. Star | 1.5 KB |
|
|