hash_tab

func (*HashTab[T]) Delete ¶

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

Delete an element from the hash_tab. The element needs to have been located with "Search" or as a result of a match using the Walk function. Complexity is O(1)

func (*HashTab[T]) Dump ¶

func (tt *HashTab[T]) Dump(fo *os.File)

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) (rv *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).