hashtable

type HashTable ¶

type HashTable[K comparable, V any] struct {
	// contains filtered or unexported fields
}

HashTable stores key/value pairs where the number of hashtable buckets is n number of buckets.

A smaller number of buckets means less buckets will be created, but each key stored in the HashTable has a higher likelihood of having to share a bucket with other keys, thus slowing down lookups.

A larger number of buckets means more buckets will be created, so each key stored in the Table has a lower likelihood of having to share a bucket with other keys, thus speeding up lookups.

func New[K comparable, V any](numberOfBuckets int, hash hash[K]) *HashTable[K, V]

func (ht *HashTable[K, V]) Delete(key K)

func (ht *HashTable[K, V]) Insert(key K, value V)

func (ht *HashTable[K, V]) Keys() array.Array[K]

func (ht *HashTable[K, V]) Search(key K) (V, bool)