本文整理汇总了C#中System.Collections.Generic.LinkedListNode<T>.LinkedListNode构造函数的典型用法代码示例。如果您正苦于以下问题：C# LinkedListNode<T>构造函数的具体用法？C# LinkedListNode<T>怎么用？C# LinkedListNode<T>使用的例子？那么恭喜您, 这里精选的构造函数代码示例或许可以为您提供帮助。您也可以进一步了解该构造函数所在类System.Collections.Generic.LinkedListNode<T>的用法示例。
在下文中一共展示了LinkedListNode<T>构造函数的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: Main
//引入命名空间
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();
}
}输出：
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