Add adds the items (one or more) to the set. Note that insertion-order is not affected if an element is re-inserted into the set.

AddPlace method

AddToHead method of LinkedList

AddToHead method of LinkedList class, AddToHead method adds the node to the start of the linked list.

Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.

CreateHash method

Difference returns the difference between two sets. The new set consists of all elements that are in "set" but not in "another". Ref: https://proofwik

Difference returns the difference between two sets. The new set consists of all elements that are in "set" but not in "another". Ref: https://proofwik

Empty returns true if queue does not contain any elements.

End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.

Equal method

Floor finds the floor key-value pair for the input key. In case that no floor is found, then both returned values will be nil. It's generally enough t

GenerateNumbers - random number generation

GenerateNumbers - random number generation

Index returns the current element's index. Does not modify the state of the iterator.

Index returns the current element's index. Does not modify the state of the iterator.

Index returns the current element's index. Does not modify the state of the iterator.

Index returns the current element's index. Does not modify the state of the iterator.

Index returns the current element's index. Does not modify the state of the iterator.

Index returns the current element's index. Does not modify the state of the iterator.

Index returns the current element's index. Does not modify the state of the iterator.

Index returns the current element's index. Does not modify the state of the iterator.

Intersection returns the intersection between two sets. The new set consists of all elements that are both in "set" and "another". The two sets should

Intersection returns the intersection between two sets. The new set consists of all elements that are both in "set" and "another". Ref: https://en.wik

Intersection returns the intersection between two sets. The new set consists of all elements that are both in "set" and "another". Ref: https://en.wik

IsDenser - compare density of two objects

Iterator returns `next()` to detect when the iteration ends, and a `cur()` to return the current result. iterator iterates sorted by domains.

Key returns the current element's key. Does not modify the state of the iterator.

Key returns the current element's key. Does not modify the state of the iterator.

Key returns the current element's key. Does not modify the state of the iterator.

Key returns the current element's key. Does not modify the state of the iterator.

Key returns the current element's key. Does not modify the state of the iterator.

Key returns the current element's key. Does not modify the state of the iterator.

LeftKey returns the left-most (min) key or nil if tree is empty.

LeftValue returns the left-most value or nil if tree is empty.

Less Than method

Map invokes the given function once for each element and returns a container containing the values returned by the given function as key/value pairs.

Map invokes the given function once for each element and returns a container containing the values returned by the given function as key/value pairs.

Map invokes the given function once for each element and returns a container containing the values returned by the given function.

Map invokes the given function once for each element and returns a container containing the values returned by the given function.

Map invokes the given function once for each element and returns a container containing the values returned by the given function.

Min returns the minimum key and its value from the tree map. Returns nil, nil if map is empty.

Type method Multiply()

New method initialises with Order with priority, quantity, product, customerName

NewKnowledgeGraph method

NewMapLayout method

NewSocialGraph method

NewWith instantiates a B-tree with the order (maximum number of children) and a custom key comparator.

NewWithStringComparator instantiates a B-tree with the order (maximum number of children) and the StringComparator, i.e. keys are of type string.

NewWithStringComparator instantiates a red-black tree with the StringComparator, i.e. keys are of type string.

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's

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 next element and returns true if there was a previous element in the container. If Prev() returns true, then next eleme

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