NewYour coding agent can read the release notes before it upgrades.Set up the MCP server →
Go modules
Go modules, #1838 by repository stars
Latest stable
v1.4.1
Last release 2 years ago
no release in 18 months
Ships unpredictably
gaps range from 8 days to 10 months
Nearly every release is documented
notes for 14 of 15 stable releases
Nothing withdrawn
no release was ever pulled
4 years old
40 releases · first in 2022
Drag across the ruler to compare, or tap a release to open it.
add go 1.23 iterator support https://github.com/alphadose/haxmap/pull/52 @semihbkgr
add go 1.23 iterator support https://github.com/alphadose/haxmap/pull/52 @semihbkgr
Nothing published for this version
add Clear() function to haxmap https://github.com/alphadose/haxmap/pull/47 @semihbkgr
add Clear() function to haxmap https://github.com/alphadose/haxmap/pull/47 @semihbkgr
Your coding agent can read these notes before it upgrades. Set up the MCP server →
Nothing published for this version
handle edge case to prevent panic during map initialization https://github.com/alphadose/haxmap/pull/44 @semihbkgr
handle edge case to prevent panic during map initialization https://github.com/alphadose/haxmap/pull/44 @semihbkgr
Nothing published for this version
This release is all thanks to @semihbkgr 🙏
This release is all thanks to @semihbkgr 🙏
GetAndDel function similar to golang concurrent map's LoadAndDelete https://github.com/alphadose/haxmap/pull/31Set operation after Delete https://github.com/alphadose/haxmap/pull/34Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Add atomic CompareAndSwap and Swap APIs https://github.com/alphadose/haxmap/issues/18
CompareAndSwap and Swap APIs https://github.com/alphadose/haxmap/issues/18GetOrCompute API which works similar to GetOrSet but the value is computed from a constructor which is called only once https://github.com/alphadose/haxmap/issues/16Nothing published for this version
Add GetOrSet() API same as golang's sync.Map.LoadOrStore https://github.com/alphadose/haxmap/issues/15
Add GetOrSet() API same as golang's sync.Map.LoadOrStore https://github.com/alphadose/haxmap/issues/15
Nothing published for this version
Nothing published for this version
Fix deadlock when multiple goroutines are trying to delete the same linked-list node https://github.com/alphadose/haxmap/commit/f4885e7522f138036dabe1
Fix deadlock when multiple goroutines are trying to delete the same linked-list node https://github.com/alphadose/haxmap/commit/f4885e7522f138036dabe14c8eec0e5b7b66d0a6
Support go 1.18 and above @StandoffVenus https://github.com/alphadose/haxmap/pull/13
map.Del(keyA, keyB, keyC...)Fix bug in delete operation https://github.com/alphadose/haxmap/issues/11
Set() https://github.com/alphadose/haxmap/issues/7 https://github.com/alphadose/haxmap/issues/8ForEach() API to match golang's sync.Map.Range() https://github.com/alphadose/haxmap/issues/10Nothing published for this version
Nothing published for this version
Nothing published for this version
Improve hashing performance by switching to pure arithmetic and bitmasking for known key sizes
Benchmarks were performed against golang sync.Map and the latest cornelk-hashmap
All results were computed from benchstat of 20 runs
name time/op
HaxMapReadsOnly-8 7.13µs ± 5%
GoSyncMapReadsOnly-8 22.4µs ± 2%
CornelkMapReadsOnly-8 8.28µs ± 1%
name time/op
HaxMapReadsWithWrites-8 8.44µs ± 5%
GoSyncMapReadsWithWrites-8 26.1µs ± 2%
CornelkMapReadsWithWrites-8 9.55µs ± 2%
name alloc/op
HaxMapReadsWithWrites-8 1.22kB ± 6%
GoSyncMapReadsWithWrites-8 6.06kB ± 6%
CornelkMapReadsWithWrites-8 1.56kB ± 5%
name allocs/op
HaxMapReadsWithWrites-8 152 ± 6%
GoSyncMapReadsWithWrites-8 562 ± 6%
CornelkMapReadsWithWrites-8 195 ± 5%
Nothing published for this version
Nothing published for this version
Hashing performance improvement by type-casting keys to arrays instead of slices as seen in this commit https://github.com/alphadose/haxmap/commit/eee
Benchmarks were performed against golang sync.Map and cornelk-hashmap-v1.0.6 for sample 20 cases
name time/op
HaxMapReadsOnly-8 8.75µs ± 9%
GoSyncMapReadsOnly-8 22.0µs ±11%
CornelkMapReadsOnly-8 9.20µs ±10%
name time/op
HaxMapReadsWithWrites-8 10.0µs ± 9%
GoSyncMapReadsWithWrites-8 24.8µs ±11%
CornelkMapReadsWithWrites-8 10.5µs ± 9%
name alloc/op
HaxMapReadsWithWrites-8 1.29kB ± 6%
GoSyncMapReadsWithWrites-8 6.20kB ± 5%
CornelkMapReadsWithWrites-8 1.59kB ±10%
name allocs/op
HaxMapReadsWithWrites-8 161 ± 4%
GoSyncMapReadsWithWrites-8 574 ± 5%
CornelkMapReadsWithWrites-8 198 ±10%
Nothing published for this version
Performance gain obtained by inlining hash function assignments
Performance gain obtained by inlining hash function assignments
Benchmarks were performed against golang sync.Map and the latest cornelk-hashmap
All results were computed from benchstat of 20 runs (code available here)
name time/op
HaxMapReadsOnly-8 9.18µs ±12%
GoSyncMapReadsOnly-8 22.5µs ± 5%
CornelkMapReadsOnly-8 10.4µs ± 4%
name alloc/op
HaxMapReadsOnly-8 0.00B
GoSyncMapReadsOnly-8 0.00B
CornelkMapReadsOnly-8 0.00B
name allocs/op
HaxMapReadsOnly-8 0.00
GoSyncMapReadsOnly-8 0.00
CornelkMapReadsOnly-8 0.00
name time/op
HaxMapReadsWithWrites-8 10.5µs ± 7%
GoSyncMapReadsWithWrites-8 25.6µs ± 7%
CornelkMapReadsWithWrites-8 12.3µs ± 6%
name alloc/op
HaxMapReadsWithWrites-8 1.28kB ± 5%
GoSyncMapReadsWithWrites-8 6.23kB ± 6%
CornelkMapReadsWithWrites-8 5.89kB ± 7%
name allocs/op
HaxMapReadsWithWrites-8 159 ± 5%
GoSyncMapReadsWithWrites-8 577 ± 6%
CornelkMapReadsWithWrites-8 210 ± 8%
From the above results it is evident that haxmap takes the least time, memory and allocations in all cases
Nothing published for this version
Improved hashing performance leading to greater efficiency overall
func TestHash0Collision(t *testing.T) {
m := haxmap.New[string, int]()
staticHasher := func(key string) uintptr {
return 0
}
m.SetHasher(staticHasher)
m.Set("1", 1)
m.Set("2", 2)
_, ok := m.Get("1")
if !ok {
t.Error("1 not found")
}
_, ok = m.Get("2")
if !ok {
t.Error("2 not found")
}
}
Benchmarks were performed against golang sync.Map and the latest cornelk-hashmap
All results were computed from benchstat of 20 runs (code available here)
name time/op
HaxMapReadsOnly-8 9.90µs ±13%
GoSyncMapReadsOnly-8 22.2µs ±14%
CornelkMapReadsOnly-8 10.4µs ±16%
name alloc/op
HaxMapReadsOnly-8 0.00B
GoSyncMapReadsOnly-8 0.00B
CornelkMapReadsOnly-8 0.00B
name allocs/op
HaxMapReadsOnly-8 0.00
GoSyncMapReadsOnly-8 0.00
CornelkMapReadsOnly-8 0.00
name time/op
HaxMapReadsWithWrites-8 11.2µs ±16%
GoSyncMapReadsWithWrites-8 25.6µs ±14%
CornelkMapReadsWithWrites-8 12.1µs ±12%
name alloc/op
HaxMapReadsWithWrites-8 1.35kB ± 8%
GoSyncMapReadsWithWrites-8 6.07kB ± 8%
CornelkMapReadsWithWrites-8 5.80kB ±10%
name allocs/op
HaxMapReadsWithWrites-8 168 ± 8%
GoSyncMapReadsWithWrites-8 562 ± 8%
CornelkMapReadsWithWrites-8 207 ±10%
From the above results it is evident that haxmap takes the least time, memory and allocations in all cases
Nothing published for this version
Huge performance gain obtained by switching bucket implementation to Harris lock-free list followed by additional optimizations from this paper
Benchmarks were performed against golang sync.Map and the latest generics-enabled cornelk-hashmap
All results were computed from benchstat of 20 runs (code available here)
name time/op
HaxMapReadsOnly-8 10.9µs ±11%
GoSyncMapReadsOnly-8 23.0µs ± 7%
CornelkMapReadsOnly-8 12.3µs ±11%
name alloc/op
HaxMapReadsOnly-8 0.00B
GoSyncMapReadsOnly-8 0.00B
CornelkMapReadsOnly-8 0.00B
name allocs/op
HaxMapReadsOnly-8 0.00
GoSyncMapReadsOnly-8 0.00
CornelkMapReadsOnly-8 0.00
name time/op
HaxMapReadsWithWrites-8 12.6µs ±11%
GoSyncMapReadsWithWrites-8 25.6µs ±10%
CornelkMapReadsWithWrites-8 14.3µs ±13%
name alloc/op
HaxMapReadsWithWrites-8 1.46kB ± 3%
GoSyncMapReadsWithWrites-8 6.19kB ± 6%
CornelkMapReadsWithWrites-8 6.70kB ± 9%
name allocs/op
HaxMapReadsOnly-8 0.00
HaxMapReadsWithWrites-8 183 ± 3%
GoSyncMapReadsOnly-8 0.00
GoSyncMapReadsWithWrites-8 573 ± 7%
CornelkMapReadsOnly-8 0.00
CornelkMapReadsWithWrites-8 239 ± 9%
From the above results it is evident that haxmap takes the least time, memory and allocations in all cases
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
One column per quarter.