Adds the specified item.

Adds all.

Adds an item listener for this collection.

Removes all items from the ICollectionT.

Determines whether the ICollectionT contains a specific value.

Determines whether this collection contains all of the elements in the specified collection.

Copies the elements of the ICollectionT to an Array, starting at a particular Array index.

Destroys this object cluster-wide.

Removes all available elements from this queue and adds them to the given collection. This operation may be more efficient than repeatedly polling this queue. A failure encountered while attempting to add elements to collection c may result in elements being in neither, either or both collections when the associated exception is thrown. Attempts to drain a queue to itself result in IllegalArgumentException. Further, the behavior of this operation is undefined if the specified collection is modified while the operation is in progress.

Removes at most the given number of available elements from this queue and adds them to the given collection. A failure encountered while attempting to add elements to collection c may result in elements being in neither, either or both collections when the associated exception is thrown. Attempts to drain a queue to itself result in IllegalArgumentException. Further, the behavior of this operation is undefined if the specified collection is modified while the operation is in progress.

Retrieves, but does not remove, the head of this queue. This method differs from Peek only in that it throws an exception if this queue is empty.

Returns an enumerator that iterates through the collection.

Returns the unique name for this IDistributedObject.

Returns the key of partition this IDistributedObject is assigned to.

Returns the service name for this object.

Determines whether this instance is empty.

Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and false if no space is currently available.

Inserts the specified element into this queue, waiting up to the specified wait time if necessary for space to become available.

Retrieves and removes the head of this queue, or returns null if this queue is empty.

Retrieves and removes the head of this queue, waiting up to the specified wait time if necessary for an element to become available.

Inserts the specified element into this queue, waiting if necessary for space to become available.

Returns the number of additional elements that this queue can ideally (in the absence of memory or resource constraints) accept without blocking, or Int64.MaxValue if there is no intrinsic limit.

Note that you cannot always tell if an attempt to insert an element will succeed by inspecting remainingCapacity because it may be the case that another thread is about to insert or remove an element.

Retrieves and removes the head of this queue. This method differs from Poll only in that it throws an exception if this queue is empty.

Removes the first occurrence of a specific object from the ICollectionT.

Removes a single instance of the specified element from this queue, if it is present

Removes all of the elements in the specified collection from this collection.

Removes the specified item listener.

Retains only the elements in this collection that are contained in the specified collection (optional operation).

Gets the number of elements contained in the collection.

Retrieves and removes the head of this queue, waiting if necessary until an element becomes available.

Returns an array containing all of the elements in this collection.

Returns an array containing all of the elements in this collection the runtime type of the returned array is that of the specified array