Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo

Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo

Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo

Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo

Put inserts key-value pair into the map. Key should adhere to the comparator's type assertion, otherwise method panics.

RemoveMax removes the max value and flag if found

RemoveMin removes the min value and flag if found

RemoveNode method

Reset all the fields of this record.

RightKey returns the right-most (max) key or nil if tree is empty.

RightValue returns the right-most value or nil if tree is empty.

Select returns a new container containing all elements for which the given function returns a true value.

Select returns a new container containing all elements for which the given function returns a true value.

Select returns a new container containing all elements for which the given function returns a true value.

Select returns a new container containing all elements for which the given function returns a true value.

Select returns a new container containing all elements for which the given function returns a true value.

SetValue method

Stringify List method

Union returns the union of two sets. The new set consists of all elements that are in "set" or "another" (possibly both). The two sets should have the

Union returns the union of two sets. The new set consists of all elements that are in "set" or "another" (possibly both). Ref: https://en.wikipedia.or

Union returns the union of two sets. The new set consists of all elements that are in "set" or "another" (possibly both). Ref: https://en.wikipedia.or

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Value returns the current element's value. Does not modify the state of the iterator.

Branch class method add leaflet

add adds the metrics of another Result to itself and returns a new Result

add adds the metrics of another result

* Register a popup menu

adjust balance method

Performs the "bubble down" operation. This is to place the element that is at the index of the heap in its correct place so that the heap maintains th

Custom error message with errors.New()

The client is ignorant to the algorithm

double rotation method

dummy function for a source

dummy function for a source

findElement method given array and k element