tools/go-cuckoo
1
0
Fork 0
Code Issues 2 Pull Requests Actions Releases 4 Wiki Activity

revert: forgot about b -> t
Some checks failed
CI / Check PR Title (pull_request) Successful in 31s
Details
CI / Makefile Lint (pull_request) Successful in 50s
Details
CI / Go Lint (pull_request) Successful in 55s
Details
CI / Markdown Lint (pull_request) Successful in 34s
Details
CI / Unit Tests (pull_request) Successful in 49s
Details
CI / Fuzz Tests (pull_request) Failing after 41s
Details
CI / Mutation Tests (pull_request) Successful in 1m1s
Details

Browse Source
This commit is contained in:
Maxim Hutz
2026-04-16 00:00:37 -04:00
parent 1f7c64366d
commit 78f7d01d5f
1 changed files with 23 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
subtable.go
View File

@@ -20,52 +20,52 @@ type subtable[K, V any] struct {
// location determines where in the bucket a certain key would be placed. If the // location determines where in the bucket a certain key would be placed. If the
// capacity is 0, this will panic. // capacity is 0, this will panic.
func (b *subtable[K, V]) location(key K) uint64 { func (t *subtable[K, V]) location(key K) uint64 {
return b.hash(key) % b.capacity return t.hash(key) % t.capacity
} }
func (b *subtable[K, V]) get(key K) (value V, found bool) { func (t *subtable[K, V]) get(key K) (value V, found bool) {
if b.capacity == 0 { if t.capacity == 0 {
return return
} }
slot := b.slots[b.location(key)] slot := t.slots[t.location(key)]
return slot.Value, slot.occupied && b.compare(slot.Key, key) return slot.Value, slot.occupied && t.compare(slot.Key, key)
} }
func (b *subtable[K, V]) drop(key K) (occupied bool) { func (t *subtable[K, V]) drop(key K) (occupied bool) {
if b.capacity == 0 { if t.capacity == 0 {
return return
} }
slot := &b.slots[b.location(key)] slot := &t.slots[t.location(key)]
if slot.occupied && b.compare(slot.Key, key) { if slot.occupied && t.compare(slot.Key, key) {
slot.occupied = false slot.occupied = false
b.size-- t.size--
return true return true
} }
return false return false
} }
func (b *subtable[K, V]) resized(capacity uint64) *subtable[K, V] { func (t *subtable[K, V]) resized(capacity uint64) *subtable[K, V] {
return &subtable[K, V]{ return &subtable[K, V]{
slots: make([]slot[K, V], capacity), slots: make([]slot[K, V], capacity),
capacity: capacity, capacity: capacity,
hash: b.hash, hash: t.hash,
compare: b.compare, compare: t.compare,
} }
} }
func (b *subtable[K, V]) update(key K, value V) (updated bool) { func (t *subtable[K, V]) update(key K, value V) (updated bool) {
if b.capacity == 0 { if t.capacity == 0 {
return return
} }
slot := &b.slots[b.location(key)] slot := &t.slots[t.location(key)]
if slot.occupied && b.compare(slot.Key, key) { if slot.occupied && t.compare(slot.Key, key) {
slot.Value = value slot.Value = value
return true return true
} }
@@ -73,21 +73,21 @@ func (b *subtable[K, V]) update(key K, value V) (updated bool) {
return false return false
} }
func (b *subtable[K, V]) insert(insertion Entry[K, V]) (evicted Entry[K, V], eviction bool) { func (t *subtable[K, V]) insert(insertion Entry[K, V]) (evicted Entry[K, V], eviction bool) {
if b.capacity == 0 { if t.capacity == 0 {
return insertion, true return insertion, true
} }
slot := &b.slots[b.location(insertion.Key)] slot := &t.slots[t.location(insertion.Key)]
if !slot.occupied { if !slot.occupied {
slot.Entry = insertion slot.Entry = insertion
slot.occupied = true slot.occupied = true
b.size++ t.size++
return return
} }
if b.compare(slot.Key, insertion.Key) { if t.compare(slot.Key, insertion.Key) {
slot.Value = insertion.Value slot.Value = insertion.Value
return return
} }