LinkedListNode<T>.Next 屬性
定義
重要
部分資訊涉及發行前產品,在發行之前可能會有大幅修改。 Microsoft 對此處提供的資訊,不做任何明確或隱含的瑕疵擔保。
取得 LinkedList<T> 中的下一個節點。
public:
property System::Collections::Generic::LinkedListNode<T> ^ Next { System::Collections::Generic::LinkedListNode<T> ^ get(); };
public System.Collections.Generic.LinkedListNode<T> Next { get; }
public System.Collections.Generic.LinkedListNode<T>? Next { get; }
member this.Next : System.Collections.Generic.LinkedListNode<'T>
Public ReadOnly Property Next As LinkedListNode(Of T)
屬性值
LinkedList<T> 中下一個節點的參考,如果目前節點是 Last 的最後一個項目 (LinkedList<T>),則為 null
。
範例
下列程式代碼範例會 LinkedListNode<T>建立 、將其新增至 LinkedList<T>,並在變更時 LinkedList<T> 追蹤其屬性的值。
#using <System.dll>
using namespace System;
using namespace System::Collections::Generic;
public ref class GenericCollection {
public:
static void Main() {
// Create a new LinkedListNode of type String and displays its properties.
LinkedListNode<String^>^ lln = gcnew LinkedListNode<String^>( "orange" );
Console::WriteLine( "After creating the node ...." );
DisplayProperties( lln );
// Create a new LinkedList.
LinkedList<String^>^ ll = gcnew LinkedList<String^>();
// Add the "orange" node and display its properties.
ll->AddLast( lln );
Console::WriteLine( "After adding the node to the empty LinkedList ...." );
DisplayProperties( lln );
// Add nodes before and after the "orange" node and display the "orange" node's properties.
ll->AddFirst( "red" );
ll->AddLast( "yellow" );
Console::WriteLine( "After adding red and yellow ...." );
DisplayProperties( lln );
}
static void DisplayProperties( LinkedListNode<String^>^ lln ) {
if ( lln->List == nullptr )
Console::WriteLine( " Node is not linked." );
else
Console::WriteLine( " Node belongs to a linked list with {0} elements.", lln->List->Count );
if ( lln->Previous == nullptr )
Console::WriteLine( " Previous node is null." );
else
Console::WriteLine( " Value of previous node: {0}", lln->Previous->Value );
Console::WriteLine( " Value of current node: {0}", lln->Value );
if ( lln->Next == nullptr )
Console::WriteLine( " Next node is null." );
else
Console::WriteLine( " Value of next node: {0}", lln->Next->Value );
Console::WriteLine();
}
};
int main()
{
GenericCollection::Main();
}
/*
This code produces the following output.
After creating the node ....
Node is not linked.
Previous node is null.
Value of current node: orange
Next node is null.
After adding the node to the empty LinkedList ....
Node belongs to a linked list with 1 elements.
Previous node is null.
Value of current node: orange
Next node is null.
After adding red and yellow ....
Node belongs to a linked list with 3 elements.
Value of previous node: red
Value of current node: orange
Value of next node: yellow
*/
using System;
using System.Collections.Generic;
public class GenericCollection {
public static void Main() {
// Create a new LinkedListNode of type String and displays its properties.
LinkedListNode<String> lln = new LinkedListNode<String>( "orange" );
Console.WriteLine( "After creating the node ...." );
DisplayProperties( lln );
// Create a new LinkedList.
LinkedList<String> ll = new LinkedList<String>();
// Add the "orange" node and display its properties.
ll.AddLast( lln );
Console.WriteLine( "After adding the node to the empty LinkedList ...." );
DisplayProperties( lln );
// Add nodes before and after the "orange" node and display the "orange" node's properties.
ll.AddFirst( "red" );
ll.AddLast( "yellow" );
Console.WriteLine( "After adding red and yellow ...." );
DisplayProperties( lln );
}
public static void DisplayProperties( LinkedListNode<String> lln ) {
if ( lln.List == null )
Console.WriteLine( " Node is not linked." );
else
Console.WriteLine( " Node belongs to a linked list with {0} elements.", lln.List.Count );
if ( lln.Previous == null )
Console.WriteLine( " Previous node is null." );
else
Console.WriteLine( " Value of previous node: {0}", lln.Previous.Value );
Console.WriteLine( " Value of current node: {0}", lln.Value );
if ( lln.Next == null )
Console.WriteLine( " Next node is null." );
else
Console.WriteLine( " Value of next node: {0}", lln.Next.Value );
Console.WriteLine();
}
}
/*
This code produces the following output.
After creating the node ....
Node is not linked.
Previous node is null.
Value of current node: orange
Next node is null.
After adding the node to the empty LinkedList ....
Node belongs to a linked list with 1 elements.
Previous node is null.
Value of current node: orange
Next node is null.
After adding red and yellow ....
Node belongs to a linked list with 3 elements.
Value of previous node: red
Value of current node: orange
Value of next node: yellow
*/
Imports System.Collections.Generic
Public Class GenericCollection
Public Shared Sub Main()
' Create a new LinkedListNode of type String and displays its properties.
Dim lln As New LinkedListNode(Of String)("orange")
Console.WriteLine("After creating the node ....")
DisplayProperties(lln)
' Create a new LinkedList.
Dim ll As New LinkedList(Of String)
' Add the "orange" node and display its properties.
ll.AddLast(lln)
Console.WriteLine("After adding the node to the empty LinkedList ....")
DisplayProperties(lln)
' Add nodes before and after the "orange" node and display the "orange" node's properties.
ll.AddFirst("red")
ll.AddLast("yellow")
Console.WriteLine("After adding red and yellow ....")
DisplayProperties(lln)
End Sub
Public Shared Sub DisplayProperties(lln As LinkedListNode(Of String))
If lln.List Is Nothing Then
Console.WriteLine(" Node is not linked.")
Else
Console.WriteLine(" Node belongs to a linked list with {0} elements.", lln.List.Count)
End If
If lln.Previous Is Nothing Then
Console.WriteLine(" Previous node is null.")
Else
Console.WriteLine(" Value of previous node: {0}", lln.Previous.Value)
End If
Console.WriteLine(" Value of current node: {0}", lln.Value)
If lln.Next Is Nothing Then
Console.WriteLine(" Next node is null.")
Else
Console.WriteLine(" Value of next node: {0}", lln.Next.Value)
End If
Console.WriteLine()
End Sub
End Class
'This code produces the following output.
'
'After creating the node ....
' Node is not linked.
' Previous node is null.
' Value of current node: orange
' Next node is null.
'
'After adding the node to the empty LinkedList ....
' Node belongs to a linked list with 1 elements.
' Previous node is null.
' Value of current node: orange
' Next node is null.
'
'After adding red and yellow ....
' Node belongs to a linked list with 3 elements.
' Value of previous node: red
' Value of current node: orange
' Value of next node: yellow