final class · System

LinkedListNode<T>

public final class LinkedListNode<T>

A node of a LinkedList: its value, and its neighbours (null at the ends, and once it has been removed).

Tipo
final class
Espacio de nombres
System
Ensamblado
System.Core
Acceso
public, final
Archivo fuente
LinkedList.ant

Parámetros de tipo

NombreRestricciones
Tcualquier tipo

Herencia

Clases base
Any LinkedListNode<T>

Constructores

new(T value)
#

Propiedades

LinkedListNode<T>? Next { get; }
#

read-only

LinkedListNode<T>? Previous { get; }
#

read-only

LinkedList<T>? List { get; }
#

read-only

The list it is in (null once removed).

Métodos

SetNext(LinkedListNode<T>? node)
#
SetPrevious(LinkedListNode<T>? node)
#

Campos

T Value
#

Miembros privados e internos (3)

LinkedListNode<T>? next
#

private

LinkedListNode<T>? previous
#

private

LinkedList<T>? list
#

private

Miembros heredados (5)

Código fuente

LinkedListNode<T> en Antril, descompilado a partir de su Larva HIR.

System.LinkedListNode.ant
// System.LinkedListNode — System.Core (decompiled from Larva HIR)

into namespace System
{
	/// A node of a LinkedList: its value, and its neighbours (null at the ends, and once it has been removed).
	public final class LinkedListNode<T>
	{
		LinkedListNode<T>? next;
		LinkedListNode<T>? previous;
		LinkedList<T>? list;

		public:
			T Value;

			new(T value)
			{
				Value = value;
			}

			/// The links (for LinkedList).
			Link(LinkedList<T>? owner, LinkedListNode<T>? before, LinkedListNode<T>? after)
			{
				list = owner;
				previous = before;
				next = after;
			}

			SetNext(LinkedListNode<T>? node)
			{
				next = node;
			}

			SetPrevious(LinkedListNode<T>? node)
			{
				previous = node;
			}

			LinkedListNode<T>? Next
			{
				get => next;
			}

			LinkedListNode<T>? Previous
			{
				get => previous;
			}

			/// The list it is in (null once removed).
			LinkedList<T>? List
			{
				get => list;
			}
	}
}
Esc