M.V. Hutz
717408239b
Moved the implementation of this hash table from `tools/dsa` #1. Reviewed-on: #1 Co-authored-by: M.V. Hutz <git@maximhutz.me> Co-committed-by: M.V. Hutz <git@maximhutz.me>
18 lines
644 B
Go
18 lines
644 B
Go
package cuckoo
|
|
|
|
// An EqualFunc determines whethers two keys are 'equal'. Keys that are 'equal'
|
|
// are teated as the same by the [Table]. A good EqualFunc is pure,
|
|
// deterministic, and fast. By default, [NewTable] uses [DefaultEqualFunc].
|
|
//
|
|
// This function MUST NOT return true if the [Hash] digest of two keys
|
|
// are different: the [Table] will not work.
|
|
type EqualFunc[K any] = func(a, b K) bool
|
|
|
|
// DefaultEqualFunc compares two keys by strict equality. Returns true if the
|
|
// keys have [equal values].
|
|
//
|
|
// [equal values]: https://go.dev/ref/spec#Comparison_operators
|
|
func DefaultEqualFunc[K comparable](a, b K) bool {
|
|
return a == b
|
|
}
|