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).

Kind
final class
Namespace
System
Assembly
System.Core
Access
public, final
Source file
LinkedList.ant

Type parameters

NameConstraints
Tany type

Inheritance

Base classes
Any LinkedListNode<T>

Constructors

new(T value)
#

Properties

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).

Methods

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

Fields

T Value
#

Private and internal members (3)

LinkedListNode<T>? next
#

private

LinkedListNode<T>? previous
#

private

LinkedList<T>? list
#

private

Inherited members (5)

Source

LinkedListNode<T> as Antril, decompiled from its 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