A simple hashmap implementation written in Go. Written for educational purpose, but still useable nonetheless. It uses the FNV-1a hash function for faster and more well distributed hashes than the more traditional polynmial hashes. It uses bitwise operators to derive bucket indexes which is more efficient than division operations like modulo.
-
Notifications
You must be signed in to change notification settings - Fork 0
cnrmurphy/go-hashmap
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Latest commit | ||||
Repository files navigation
About
Simple hashmap implementation written in Go
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published