Class LinkedListWithPooledNodes<T>

Namespace

AlgorithmsSW.List

Assembly

AlgorithmsSW.dll

public class LinkedListWithPooledNodes<T> : IEnumerable<T?>, IEnumerable

Type Parameters

T

Inheritance

object

LinkedListWithPooledNodes<T>

Implements

IEnumerable<T>

IEnumerable

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

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

LinkedListWithPooledNodes(int)

public LinkedListWithPooledNodes(int capacity)

Parameters

capacity int

Properties

Count

public int Count { get; }

Property Value

int

First

public LinkedListWithPooledNodes<T>.Node First { get; }

Property Value

LinkedListWithPooledNodes<T>.Node

IsEmpty

public bool IsEmpty { get; }

Property Value

bool

IsSingleton

public bool IsSingleton { get; }

Property Value

bool

Last

public LinkedListWithPooledNodes<T>.Node Last { get; }

Property Value

LinkedListWithPooledNodes<T>.Node

Nodes

public IEnumerable<LinkedListWithPooledNodes<T>.Node> Nodes { get; }

Property Value

IEnumerable<LinkedListWithPooledNodes<T>.Node>

Methods

Clear()

public void Clear()

Concat(LinkedListWithPooledNodes<T>)

Concatenates the other list to the end of this list.

public void Concat(LinkedListWithPooledNodes<T> other)

Parameters

other LinkedListWithPooledNodes<T>

The list to concatenate to this list.

Remarks

The other list is cleared after this operation.

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.

InsertAfter(Node, T)

public LinkedListWithPooledNodes<T>.Node InsertAfter(LinkedListWithPooledNodes<T>.Node node, T item)

Parameters

node LinkedListWithPooledNodes<T>.Node

item T

Returns

LinkedListWithPooledNodes<T>.Node

InsertAtBack(T)

public LinkedListWithPooledNodes<T>.Node InsertAtBack(T item)

Parameters

item T

Returns

LinkedListWithPooledNodes<T>.Node

InsertAtFront(T)

public LinkedListWithPooledNodes<T>.Node InsertAtFront(T item)

Parameters

item T

Returns

LinkedListWithPooledNodes<T>.Node

RemoveAfter(Node)

Removes the node after the specified node.

public void RemoveAfter(LinkedListWithPooledNodes<T>.Node node)

Parameters

node LinkedListWithPooledNodes<T>.Node

The node whose successor is to be removed.

Exceptions

ArgumentNullException

Thrown when the input node is null.

InvalidOperationException

Thrown when the input node does not have a successor to remove.

RemoveFromFront()

public void RemoveFromFront()

Reverse()

public void Reverse()

ToString()

Returns a string that represents the current object.

public override string ToString()

Returns

string

A string that represents the current object.