TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Benchmarking Bloom Filters and Hash Functions in Go

3 pointsby zhenjlover 11 years ago

2 comments

aapplebyover 11 years ago
Looks like your Murmur implementation may be broken?<p>-Austin (Murmur author)
评论 #6330723 未加载
bradfitzover 11 years ago
Why are you allocating in your standard implementation&#x27;s Check function? That can&#x27;t be good for performance.
评论 #6363507 未加载
评论 #6351056 未加载