search searches only within the single node among its entries

Add method

Add appends a value at the end of the list

Append appends a value (one or more) at the end of the list (same as Add())

Difference returns the difference between two sets. The two sets should have the same comparators, otherwise the result is empty set. The new set cons

GetNode searches the node in the tree by key and returns its node or nil if key is not found in tree. Key should adhere to the comparator's type asser

InsertElement method

Int returns an int field. Panics when the field doesn't exist.

OrderedBy Method

Size returns number of elements within the queue.

Sort sorts values (in-place) with respect to the given comparator. Uses Go's sort (hybrid of quicksort for large and then insertion sort for smaller

ToString method

Value returns the last parsed record by a call to Parse.

print method for printing a Tree

AddLink method

AddToHead method of UnOrderedList class

Empty returns true if tree does not contain any nodes

GetNode searches the node in the tree by key and returns its node or nil if key is not found in tree. Key should adhere to the comparator's type asser

GetNode searches the node in the tree by key and returns its node or nil if key is not found in tree. Key should adhere to the comparator's type asser

GetSortedValues returns sorted container's elements with respect to the passed comparator. Does not affect the ordering of elements within the contain

IndexOf returns index of provided element

IndexOf returns index of provided element

Left returns the minimum element of the AVL tree or nil if the tree is empty.

Left returns the left-most (min) node or nil if tree is empty.

IntegerHeap method - gets the length of integerHeap

Plug a device to draw power from the `Socket`

Pop removes and returns a node from the stack in last to first order.

Pop method

Prepend prepends a values (or more)

Push adds a node to the stack.

Push method

Put method

Right returns the maximum element of the AVL tree or nil if the tree is empty.

Right returns the right-most (max) node or nil if tree is empty.

Run the pipeline.

Summarize summarizes the parsing results. Only use it after the parsing is done.