• Russ Cox's avatar
    exp/html/atom: faster Lookup with smaller tables · 19255059
    Russ Cox authored
    Use perfect cuckoo hash, to avoid binary search.
    Define Atom bits as offset+len in long string instead
    of enumeration, to avoid string headers.
    
    Before: 1909 string bytes + 6060 tables = 7969 total data
    After: 1406 string bytes + 2048 tables = 3454 total data
    
    benchmark          old ns/op    new ns/op    delta
    BenchmarkLookup        83878        64681  -22.89%
    
    R=nigeltao, r
    CC=golang-dev
    https://golang.org/cl/6262051
    19255059
Name
Last commit
Last update
..
archive Loading commit data...
bufio Loading commit data...
builtin Loading commit data...
bytes Loading commit data...
compress Loading commit data...
container Loading commit data...
crypto Loading commit data...
database/sql Loading commit data...
debug Loading commit data...
encoding Loading commit data...
errors Loading commit data...
exp Loading commit data...
expvar Loading commit data...
flag Loading commit data...
fmt Loading commit data...
go Loading commit data...
hash Loading commit data...
html Loading commit data...
image Loading commit data...
index/suffixarray Loading commit data...
io Loading commit data...
log Loading commit data...
math Loading commit data...
mime Loading commit data...
net Loading commit data...
old/netchan Loading commit data...
os Loading commit data...
path Loading commit data...
reflect Loading commit data...
regexp Loading commit data...
runtime Loading commit data...
sort Loading commit data...
strconv Loading commit data...
strings Loading commit data...
sync Loading commit data...
syscall Loading commit data...
testing Loading commit data...
text Loading commit data...
time Loading commit data...
unicode Loading commit data...
unsafe Loading commit data...