hash_tab

Documentation

Index

• type HashTab
  • func NewHashTab[T comparable.Equality](n int) *HashTab[T]
  • func (tt *HashTab[T]) Delete(find *T) (found bool)
  • func (tt *HashTab[T]) Dump(fo io.Writer)
  • func (tt *HashTab[T]) Insert(item *T)
  • func (tt HashTab[T]) IsEmpty() bool
  • func (tt *HashTab[T]) Len() int
  • func (tt *HashTab[T]) Length() int
  • func (tt *HashTab[T]) Search(find *T) (item *T)
  • func (tt *HashTab[T]) Truncate()
• type Hashable

Types

type HashTab

type HashTab[T comparable.Equality] struct {
	// contains filtered or unexported fields
}

HashTab is a generic binary tree

func NewHashTab

func NewHashTab[T comparable.Equality](n int) *HashTab[T]

Complexity is O(1).

func (*HashTab[T]) Delete

func (tt *HashTab[T]) Delete(find *T) (found bool)

Complexity is O(log n)/k.

func (*HashTab[T]) Dump

func (tt *HashTab[T]) Dump(fo io.Writer)

Dump will print out the hash table to the file `fo`. Complexity is O(n).

func (*HashTab[T]) Insert

func (tt *HashTab[T]) Insert(item *T)

Insert will add a new item to the tree. If it is a duplicate of an exiting item the new item will replace the existing one. Complexity is O(log n)/k.

func (HashTab[T]) IsEmpty

func (tt HashTab[T]) IsEmpty() bool

IsEmpty will return true if the binary-tree is empty Complexity is O(1).

func (*HashTab[T]) Len

func (tt *HashTab[T]) Len() int

Length returns the number of elements in the list. Complexity is O(1).

func (*HashTab[T]) Length

func (tt *HashTab[T]) Length() int

func (*HashTab[T]) Search

func (tt *HashTab[T]) Search(find *T) (item *T)

Search will walk the tree looking for `find` and retrn the found item if it is in the tree. If it is not found then `nil` will be returned. Complexity is O(log n)/k.

func (*HashTab[T]) Truncate

func (tt *HashTab[T]) Truncate()

Truncate removes all data from the tree. Complexity is O(1).

type Hashable

type Hashable interface {
	HashKey(x interface{}) int
}