Class QueueWithLinkedListAndNodePool<T>

Namespace

AlgorithmsSW.Queue

Assembly

AlgorithmsSW.dll

Queue implementation using a linked list with a node pool.

public class QueueWithLinkedListAndNodePool<T> : IQueue<T>, IEnumerable<T>, IEnumerable

Type Parameters

T

The type of elements that can be inserted into the queue.

Inheritance

object

QueueWithLinkedListAndNodePool<T>

Implements

IQueue<T>

IEnumerable<T>

IEnumerable

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

Extension Methods

Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>)

Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Interpolate<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Substitute<T, TBuffer>(TBuffer, (T input, T[] output)[])

Comparable.ToComparable<T>(T, IComparer<T>)

Formatter.AsText<T>(T?)

Formatter.Describe<TLabel, TDescription>(TLabel, TDescription, string)

Formatter.Log<T>(T)

Formatter.Pretty<T>(T, params int[])

Algorithms.Buffer2<T>(IEnumerable<T>)

Algorithms.IndexWhere<T>(IEnumerable<T>, Func<T, bool>)

Algorithms.JosephusSequence<T>(IEnumerable<T>, int)

CollectionExtensions.CopyTo<T>(IEnumerable<T>, IRandomAccessList<T>, int)

CollectionExtensions.CopyTo<T>(IEnumerable<T>, T[], int)

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

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

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

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

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

CollectionExtensions.ToSet<T>(IEnumerable<T>, IComparer<T>)

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

ListExtensions.CircularSlidingWindow2<T>(IEnumerable<T?>)

ListExtensions.CircularSlidingWindow<T>(IEnumerable<T>, int)

ListExtensions.SlidingWindow2<T>(IEnumerable<T?>)

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

ListExtensions.ToRandomAccessList<T>(IEnumerable<T>)

StringSort.CountOccurrences<T>(IEnumerable<T>, IComparer<T>)

Formatter.AsText<T>(IEnumerable<T>?, string)

Constructors

QueueWithLinkedListAndNodePool(int)

Initializes a new instance of the QueueWithLinkedListAndNodePool<T> class.

public QueueWithLinkedListAndNodePool(int capacity)

Parameters

capacity int

The capacity of this queue.

Properties

Count

Gets the number of items contained in the IQueue<T>.

public int Count { get; }

Property Value

int

Id

Gets the Id for this instance.

public int Id { get; }

Property Value

int

Remarks

Ids are unique for among instances that share the static IdGenerator.

IsEmpty

Gets a value indicating whether the IQueue<T> is empty.

public bool IsEmpty { get; }

Property Value

bool

Peek

Gets the item at the beginning of the IQueue<T> without removing it.

public T Peek { get; }

Property Value

T

Methods

Clear()

Removes all items from the IQueue<T>.

public void Clear()

Dequeue()

Removes and returns the item at the beginning of the IQueue<T>.

public T Dequeue()

Returns

T

The item at the beginning of the IQueue<T>.

Enqueue(T)

Adds an item to the end of the IQueue<T>.

public void Enqueue(T item)

Parameters

item T

The item to add to the IQueue<T>.

GetEnumerator()

Returns an enumerator that iterates through the collection.

public IEnumerator<T> GetEnumerator()

Returns

IEnumerator<T>

An enumerator that can be used to iterate through the collection.

GetHashCode()

Serves as the default hash function.

public override int GetHashCode()

Returns

int

A hash code for the current object.

ToString()

Returns a string that represents the current object.

public override string ToString()

Returns

string

A string that represents the current object.