height returned the level of the tree the node exists in. Level 1 is at the last layer of the tree. #7 -- height = 3 \ #3 #6 -- he

Do calls fn on each key/value. If fn return false stops the iteration.

balRatio provides information about the balance ratio of the node.

Len return the number of elements in the hash. This function currently uses a linear traversal but could be improved with meta-data.

Enqueue inserts data into the queue if there is available capacity.

generateList is for generate a random list of numbers.

generateList is for generate a random list of numbers.

generateList is for generate a random list of numbers.

generateList is for generate a random list of numbers.

Static

============================================================================= max returns the larger of the two values.

Count returns the number of items in the stack.

New returns a queue with a set capacity.

Dequeue removes data into the queue if data exists.

inspectSlice exposes the slice header for review.

Add places a client in the list for receiving messages.

AddFront places a new node at the front of the list.

NewClient builds a Client value. It needs the root url for the API. Use the const API for github.com or pass your own url for tests or an enterprise i

Peek provides the data stored on the stack based on the level from the bottom. A value of 0 would return the top piece of data.

Retrieve extracts a value from the hash table based on the key.

assembleInputStream appends all the input slices together to allow for consistent testing across all benchmarks.

============================================================================= fireEvent1 uses an anonymous function type.

fireEvent2 uses a function type.

inspectSlice exposes the slice header for review.

merge performs the merging to the two lists in proper order.

============================================================================== This function is a convenience function for getting the address for a l

rssSearch is used against any RSS feeds.

Add places a new node at the end of the list.

Delete deletes an entry from the hash table.

Enqueue adds a developer to the devlist.

Find traverses the list looking for the specified data.

Find traverses the tree looking for the specified tree.

Push adds data into the top of the stack.