refactor: HashTable -> Table, table -> subtable
All checks were successful
CI / Check PR Title (pull_request) Successful in 29s
CI / Go Lint (pull_request) Successful in 39s
CI / Makefile Lint (pull_request) Successful in 48s
CI / Markdown Lint (pull_request) Successful in 31s
CI / Unit Tests (pull_request) Successful in 37s
CI / Fuzz Tests (pull_request) Successful in 1m38s
CI / Mutation Tests (pull_request) Successful in 1m19s
All checks were successful
CI / Check PR Title (pull_request) Successful in 29s
CI / Go Lint (pull_request) Successful in 39s
CI / Makefile Lint (pull_request) Successful in 48s
CI / Markdown Lint (pull_request) Successful in 31s
CI / Unit Tests (pull_request) Successful in 37s
CI / Fuzz Tests (pull_request) Successful in 1m38s
CI / Mutation Tests (pull_request) Successful in 1m19s
This commit is contained in:
4
hash.go
4
hash.go
@@ -7,9 +7,9 @@ import (
|
||||
// A Hash function maps any data to a fixed-length value (in this case, a
|
||||
// [uint64]).
|
||||
//
|
||||
// It is used by the [HashTable] to evenly distribute values
|
||||
// It is used by the [Table] to evenly distribute values
|
||||
// amongst its slots. A good hash function is uniform, [chaotic], and
|
||||
// deterministic. [HashTable] uses [NewDefaultHash] by default, which is built on
|
||||
// deterministic. [Table] uses [NewDefaultHash] by default, which is built on
|
||||
// [maphash.Comparable].
|
||||
//
|
||||
// [chaotic]: https://en.wikipedia.org/wiki/Avalanche_effect
|
||||
|
||||
Reference in New Issue
Block a user