Sealed class: RT.Util.Collections.QueueViewable<T>

• Assembly: RT.Util.Core, Version=1.0.0.9999, Culture=neutral, PublicKeyToken=null
• Namespace: RT.Util.Collections
• Show inherited types...
  Inherits from:

  • object
• Show implemented interfaces...
  Implements:

  • System.Collections.Generic.ICollection<T> (directly)
  • System.Collections.IEnumerable (directly)
  • System.Collections.Generic.IEnumerable<T> (directly)
  • System.Collections.Generic.IList<T> (directly)

Summary

A queue whose queued items can be accessed by index. The item at the head of the queue has index 0 and is the next item to be dequeued.

Generic type parameters

T	The type of the elements stored in the queue.

Constructors

QueueViewable<T>()	Constructor.
QueueViewable<T>(int initialCapacity)	Constructor.
QueueViewable<T>(IEnumerable<T> items)

Instance methods

ICollection<T>	AsReadOnly()	Returns a read-only wrapper for this collection. Any changes to this collection will be immediately visible through the wrapper.
void	Clear() Implements: ICollection<T>.Clear()	Empties the queue.
bool	Contains(T item) Implements: ICollection<T>.Contains(T)	Not implemented.
void	CopyTo(T[] array, int arrayIndex) Implements: ICollection<T>.CopyTo(T[], int)	Copies all elements to an array, in the order in which they would be dequeued. The destination array must have enough space for all items.
T	Dequeue()	Removes and returns the item at the head of the queue.
void	Enqueue(T item)	Adds an item at the tail of the queue.
IEnumerator<T>	GetEnumerator() Implements: IEnumerable<T>.GetEnumerator()	Enumerates all items in the queue in the order in which they would be dequeued.
int	IndexOf(T item) Implements: IList<T>.IndexOf(T)	Not implemented.
void	Insert(int index, T item) Implements: IList<T>.Insert(int, T)	Always throws a NotSupportedException.
bool	Remove(T item) Implements: ICollection<T>.Remove(T)
void	RemoveAt(int index) Implements: IList<T>.RemoveAt(int)

Instance properties

int	Capacity	Gets the current capacity of the queue (that is, the maximum number of items it can store before the internal store needs to be resized).
int	Count Implements: ICollection<T>.Count	Returns the number of elements in the queue.
bool	IsReadOnly Implements: ICollection<T>.IsReadOnly	Always returns false.
T	this[int index] Implements: IList<T>.this[int]	Accesses the Nth queued item. The next item to be dequeued always has the index 0. The existing items can be both read and assigned. No new items can be added using this indexer.