call this before for k, v := range map

call this after for k, v := range map

memhash computes the hash of 'size' bytes of memory at addr

v, ok := map[key]

remove an item from the queue

length of stack

length of queue

remove an item from the stack

map[key] = value

len(map)

NewHashMap creates a new hashmap

64-bit hash provides 2^32 collision-resistance, which suffices for most use-case

delete(map, key)

add an item to the queue

returns next <k, v> in the map

add an item to the stack

last return the last node in the bucket

pivot returns the node with hash < input, and number of such nodes

search finds the position to insert or update the key

New creates a new hashmap

NewQueue creates a new queue

NewQueue creates a new queue

NewStack creates a new stack

NewStack creates a new stack

return (but not remove) the top item on the stack

split breaks the bucket at the given hash, and returns the new bucket

BucketSizeOption sets the average size of bucket

merge merges 2 buckets into 1