HashTable

README

HashTable

Integer key/value implementation of a HashTable in go without using built-in data structure

Documentation

Index

• Constants
• type HashMap
  • func NewHashMap() *HashMap
  • func (h *HashMap) Get(key int) (int, bool)
  • func (h *HashMap) Insert(key int, value int)
  • func (h *HashMap) PrintHM()
  • func (h *HashMap) PrintHMbuff()
  • func (h *HashMap) Remove(key int) (int, bool)
• type Node
  • func (n *Node) PrintNode() string

Constants

const MAP_SIZE = 1000

Types

type HashMap

type HashMap struct {
	Data []*Node
}

func NewHashMap

func NewHashMap() *HashMap

*

• Create a new HashMap structure *

func (*HashMap) Get

func (h *HashMap) Get(key int) (int, bool)

*

• Get an element from the HashMap
• @param key
• @param value
• @return (value, true) if element exists
• (-1, false) otherwise *

func (*HashMap) Insert

func (h *HashMap) Insert(key int, value int)

*

• Insert a new element in the HashMap
• @param key
• @param value
• NOTE: collision are handled with linked list *

func (*HashMap) PrintHM

func (h *HashMap) PrintHM()

func (*HashMap) PrintHMbuff

func (h *HashMap) PrintHMbuff()

func (*HashMap) Remove

func (h *HashMap) Remove(key int) (int, bool)

*

• Remove an element from the HashTable
• @param key
• @return (true, val) if elem was removed, (false, -1) if element does not exists

*

type Node

type Node struct {
	// contains filtered or unexported fields
}

func (*Node) PrintNode

func (n *Node) PrintNode() string