Class RandomAccessQueue<T>

Namespace

Gamelogic.Extensions.Algorithms

Assembly

Gamelogic.Extensions.dll

Represents a queue that allows random access to its elements.

[Version(4, 2, 0)]
public class RandomAccessQueue<T> : IReadOnlyCollection<T>, IEnumerable<T>, ICollection, IEnumerable

Type Parameters

T

The type of elements in the queue.

Inheritance

object

RandomAccessQueue<T>

Implements

IReadOnlyCollection<T>

IEnumerable<T>

ICollection

IEnumerable

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Extension Methods

CollectionExtensions.Aggregate<T>(IEnumerable<T>, Func<T, T, T>, Func<T, T, T>)

CollectionExtensions.AsCountable<T>(IEnumerable<T>)

CollectionExtensions.AsList<T>(IEnumerable<T>)

CollectionExtensions.ButFirst<T>(IEnumerable<T>)

CollectionExtensions.ButLast<T>(IEnumerable<T>)

CollectionExtensions.HasSameElementsAs<T>(IEnumerable<T>, IEnumerable<T>)

CollectionExtensions.HasSingle<T>(IEnumerable<T>)

CollectionExtensions.ListToString<T>(IEnumerable<T>)

CollectionExtensions.MaxBy<TSource, TKey>(IEnumerable<TSource>, Func<TSource, TKey>)

CollectionExtensions.MaxBy<TSource, TKey>(IEnumerable<TSource>, Func<TSource, TKey>, IComparer<TKey>)

CollectionExtensions.MaxItemsBy<T, TComparable>(IEnumerable<T>, Func<T, TComparable>)

CollectionExtensions.MaxItemsBy<T, TComparable>(IEnumerable<T>, Func<T, TComparable>, Comparer<TComparable>)

CollectionExtensions.MinBy<TSource, TKey>(IEnumerable<TSource>, Func<TSource, TKey>)

CollectionExtensions.MinBy<TSource, TKey>(IEnumerable<TSource>, Func<TSource, TKey>, IComparer<TKey>)

CollectionExtensions.MinItemsBy<T, TComparable>(IEnumerable<T>, Func<T, TComparable>)

CollectionExtensions.MinItemsBy<T, TComparable>(IEnumerable<T>, Func<T, TComparable>, Comparer<TComparable>)

CollectionExtensions.RandomItem<T>(IEnumerable<T>)

CollectionExtensions.RandomItem<T>(IEnumerable<T>, IRandom)

CollectionExtensions.RotateLeft<T>(IEnumerable<T>)

CollectionExtensions.RotateRight<T>(IEnumerable<T>)

CollectionExtensions.SampleRandom<T>(IEnumerable<T>, int)

CollectionExtensions.SampleRandom<T>(IEnumerable<T>, int, IRandom)

CollectionExtensions.SlidingWindow<T>(IEnumerable<T>, int)

CollectionExtensions.TakeHalf<T>(IEnumerable<T>)

CollectionExtensions.TakeLast<T>(IEnumerable<T>, int)

CollectionExtensions.TryFirst<T>(IEnumerable<T>, Func<T, bool>, out T)

CollectionExtensions.TryFirst<T>(IEnumerable<T>, out T)

CollectionExtensions.TryLast<T>(IEnumerable<T>, Func<T, bool>, out T)

CollectionExtensions.TryLast<T>(IEnumerable<T>, out T)

CollectionExtensions.TrySingle<T>(IEnumerable<T>, out T)

CollectionExtensions.WithIndices<T>(IEnumerable<T>)

Combinatorial.Combinations<T>(IEnumerable<T>, int)

Combinatorial.Partitions<T>(IEnumerable<T>)

Combinatorial.Permutations<T>(IEnumerable<T>)

Combinatorial.PowerSet<T>(IEnumerable<T>)

Combinatorial.Tuples<T>(IEnumerable<T>)

ThrowHelper.ThrowIfNull(object, string)

Remarks

This RandomAccessQueue<T> follows the design of Queue<T> very closely, and can be used as a drop-in replacement for it.

Constructors

RandomAccessQueue(IEnumerable<T>)

Initializes a new instance of the RandomAccessQueue<T> class that contains elements copied from the specified collection.

RandomAccessQueue(int)

Initializes a new instance of the RandomAccessQueue<T> class that is empty and has the specified capacity.

Properties

Count

IsEmpty

Gets a value indicating whether the queue is empty.

IsFull

Gets a value indicating whether the queue is full, that is, Count is equal to the capapcity.

IsSynchronized

this[int]

Returns the element at the specified index, where the head of the queue is at index 0.

SyncRoot

Methods

Clear()

Contains(T)

CopyTo(Array, int)

Dequeue()

Enqueue(T)

EnsureCapacity(int)

GetEnumerator()

Peek()

ToArray()

TrimExcess()

TryDequeue(out T)

TryPeek(out T)