LinkedTransferQueue Class
Definition
Important
Some information relates to prerelease product that may be substantially modified before it’s released. Microsoft makes no warranties, express or implied, with respect to the information provided here.
An unbounded TransferQueue based on linked nodes.
[Android.Runtime.Register("java/util/concurrent/LinkedTransferQueue", DoNotGenerateAcw=true)]
[Java.Interop.JavaTypeParameters(new System.String[] { "E" })]
public class LinkedTransferQueue : Java.Util.AbstractQueue, IDisposable, Java.Interop.IJavaPeerable, Java.IO.ISerializable, Java.Util.Concurrent.ITransferQueue[<Android.Runtime.Register("java/util/concurrent/LinkedTransferQueue", DoNotGenerateAcw=true)>]
[<Java.Interop.JavaTypeParameters(new System.String[] { "E" })>]
type LinkedTransferQueue = class
inherit AbstractQueue
interface ISerializable
interface IJavaObject
interface IDisposable
interface IJavaPeerable
interface ITransferQueue
interface IBlockingQueue
interface IQueue
interface ICollection
interface IIterable- Inheritance
- Attributes
- Implements
Remarks
An unbounded TransferQueue based on linked nodes. This queue orders elements FIFO (first-in-first-out) with respect to any given producer. The <em>head</em> of the queue is that element that has been on the queue the longest time for some producer. The <em>tail</em> of the queue is that element that has been on the queue the shortest time for some producer.
Beware that, unlike in most collections, the size method is <em>NOT</em> a constant-time operation. Because of the asynchronous nature of these queues, determining the current number of elements requires a traversal of the elements, and so may report inaccurate results if this collection is modified during traversal.
Bulk operations that add, remove, or examine multiple elements, such as #addAll, #removeIf or #forEach, are <em>not</em> guaranteed to be performed atomically. For example, a forEach traversal concurrent with an addAll operation might observe only some of the added elements.
This class and its iterator implement all of the <em>optional</em> methods of the Collection and Iterator interfaces.
Memory consistency effects: As with other concurrent collections, actions in a thread prior to placing an object into a LinkedTransferQueue<i>happen-before</i> actions subsequent to the access or removal of that element from the LinkedTransferQueue in another thread.
This class is a member of the Java Collections Framework.
Added in 1.7.
Java documentation for java.util.concurrent.LinkedTransferQueue.
Portions of this page are modifications based on work created and shared by the Android Open Source Project and used according to terms described in the Creative Commons 2.5 Attribution License.
Constructors
| LinkedTransferQueue() |
Creates an initially empty |
| LinkedTransferQueue(ICollection) |
Creates a |
| LinkedTransferQueue(IntPtr, JniHandleOwnership) |
A constructor used when creating managed representations of JNI objects; called by the runtime. |
Properties
| Class |
Returns the runtime class of this |
| Handle |
The handle to the underlying Android instance. (Inherited from Object) |
| HasWaitingConsumer |
Returns |
| IsEmpty |
To be added (Inherited from AbstractCollection) |
| JniIdentityHashCode | (Inherited from Object) |
| JniPeerMembers | |
| PeerReference | (Inherited from Object) |
| ThresholdClass |
This API supports the Mono for Android infrastructure and is not intended to be used directly from your code. |
| ThresholdType |
This API supports the Mono for Android infrastructure and is not intended to be used directly from your code. |
| WaitingConsumerCount |
Returns an estimate of the number of consumers waiting to receive elements via Take() or timed Poll(Int64, TimeUnit). |
Methods
| Add(Object) |
To be added (Inherited from AbstractCollection) |
| AddAll(ICollection) |
To be added (Inherited from AbstractCollection) |
| Clear() |
To be added (Inherited from AbstractCollection) |
| Clone() |
Creates and returns a copy of this object. (Inherited from Object) |
| Contains(Object) |
To be added (Inherited from AbstractCollection) |
| ContainsAll(ICollection) |
To be added (Inherited from AbstractCollection) |
| Dispose() | (Inherited from Object) |
| Dispose(Boolean) | (Inherited from Object) |
| DrainTo(ICollection, Int32) | |
| DrainTo(ICollection) | |
| Element() |
Retrieves, but does not remove, the head of this queue. (Inherited from AbstractQueue) |
| Equals(Object) |
Indicates whether some other object is "equal to" this one. (Inherited from Object) |
| ForEach(IConsumer) | |
| GetHashCode() |
Returns a hash code value for the object. (Inherited from Object) |
| Iterator() |
Returns an iterator over the elements in this queue in proper sequence. |
| JavaFinalize() |
Called by the garbage collector on an object when garbage collection determines that there are no more references to the object. (Inherited from Object) |
| Notify() |
Wakes up a single thread that is waiting on this object's monitor. (Inherited from Object) |
| NotifyAll() |
Wakes up all threads that are waiting on this object's monitor. (Inherited from Object) |
| Offer(Object, Int64, TimeUnit) |
Inserts the specified element at the tail of this queue. |
| Offer(Object) |
Inserts the specified element at the tail of this queue. |
| Peek() |
Retrieves, but does not remove, the head of this queue,
or returns |
| Poll() |
Retrieves and removes the head of this queue,
or returns |
| Poll(Int64, TimeUnit) |
Retrieves and removes the head of this queue, waiting up to the specified wait time if necessary for an element to become available. |
| Put(Object) |
Inserts the specified element at the tail of this queue. |
| RemainingCapacity() |
Always returns |
| Remove() |
Retrieves and removes the head of this queue. (Inherited from AbstractQueue) |
| Remove(Object) |
To be added (Inherited from AbstractCollection) |
| RemoveAll(ICollection) |
To be added (Inherited from AbstractCollection) |
| RemoveIf(IPredicate) | |
| RetainAll(ICollection) |
To be added (Inherited from AbstractCollection) |
| SetHandle(IntPtr, JniHandleOwnership) |
Sets the Handle property. (Inherited from Object) |
| Size() |
Returns the number of elements in this queue. |
| Spliterator() |
Returns a |
| Take() |
Retrieves and removes the head of this queue, waiting if necessary until an element becomes available. |
| ToArray() |
To be added (Inherited from AbstractCollection) |
| ToArray(Object[]) |
To be added (Inherited from AbstractCollection) |
| ToArray<T>() | (Inherited from Object) |
| ToString() |
Returns a string representation of the object. (Inherited from Object) |
| Transfer(Object) |
Transfers the element to a consumer, waiting if necessary to do so. |
| TryTransfer(Object, Int64, TimeUnit) |
Transfers the element to a consumer if it is possible to do so before the timeout elapses. |
| TryTransfer(Object) |
Transfers the element to a waiting consumer immediately, if possible. |
| UnregisterFromRuntime() | (Inherited from Object) |
| Wait() |
Causes the current thread to wait until it is awakened, typically by being <em>notified</em> or <em>interrupted</em>. (Inherited from Object) |
| Wait(Int64, Int32) |
Causes the current thread to wait until it is awakened, typically by being <em>notified</em> or <em>interrupted</em>, or until a certain amount of real time has elapsed. (Inherited from Object) |
| Wait(Int64) |
Causes the current thread to wait until it is awakened, typically by being <em>notified</em> or <em>interrupted</em>, or until a certain amount of real time has elapsed. (Inherited from Object) |
Explicit Interface Implementations
| IJavaPeerable.Disposed() | (Inherited from Object) |
| IJavaPeerable.DisposeUnlessReferenced() | (Inherited from Object) |
| IJavaPeerable.Finalized() | (Inherited from Object) |
| IJavaPeerable.JniManagedPeerState | (Inherited from Object) |
| IJavaPeerable.SetJniIdentityHashCode(Int32) | (Inherited from Object) |
| IJavaPeerable.SetJniManagedPeerState(JniManagedPeerStates) | (Inherited from Object) |
| IJavaPeerable.SetPeerReference(JniObjectReference) | (Inherited from Object) |