refactor!: shorter constructors, bucket → subtable
#22
@@ -1,12 +1,21 @@
|
|||||||
package cuckoo
|
package cuckoo
|
||||||
|
|
||||||
import (
|
import (
|
||||||
|
"errors"
|
||||||
"fmt"
|
"fmt"
|
||||||
"iter"
|
"iter"
|
||||||
"math/bits"
|
"math/bits"
|
||||||
"strings"
|
"strings"
|
||||||
)
|
)
|
||||||
|
|
||||||
|
// ErrBadHash occurs when the hashes given to a [Table] cause too many key
|
||||||
|
// collisions. Try rebuilding the table using:
|
||||||
|
//
|
||||||
|
// 1. Different hash seeds. Equal seeds produce equal hash functions, which
|
||||||
|
// always cycle.
|
||||||
|
// 2. A different [Hash] algorithm.
|
||||||
|
var ErrBadHash = errors.New("bad hash")
|
||||||
|
|
||||||
// A HashTable which uses cuckoo hashing to resolve collision. Create
|
// A HashTable which uses cuckoo hashing to resolve collision. Create
|
||||||
// one with [New]. Or if you want more granularity, use [NewBy] or
|
// one with [New]. Or if you want more granularity, use [NewBy] or
|
||||||
// [NewCustom].
|
// [NewCustom].
|
||||||
@@ -128,7 +137,7 @@ func (t *HashTable[K, V]) Put(key K, value V) (err error) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
if t.load() < t.minLoadFactor {
|
if t.load() < t.minLoadFactor {
|
||||||
return fmt.Errorf("bad hash: resize on load %d/%d = %f", t.Size(), t.TotalCapacity(), t.load())
|
return fmt.Errorf("hash functions produced a cycle at load %d/%d: %w", t.Size(), t.TotalCapacity(), ErrBadHash)
|
||||||
}
|
}
|
||||||
|
|
||||||
if err := t.grow(); err != nil {
|
if err := t.grow(); err != nil {
|
||||||
|
|||||||
Reference in New Issue
Block a user