C# LinkedList

Struktur data linear untuk menyimpan elemen dalam cara yang tidak bersebelahan dipanggil LinkedList di mana penunjuk digunakan untuk memautkan elemen dalam senarai terpaut antara satu sama lain dan System.Collections. Ruang nama generik terdiri daripada LinkedList< T> kelas dalam C# dari mana unsur-unsur boleh dialih keluar atau boleh dimasukkan ke dalam dengan cara yang sangat cepat melaksanakan senarai pautan klasik dan peruntukan setiap objek adalah berasingan dalam senarai terpaut dan tidak ada keperluan untuk menyalin keseluruhan koleksi untuk melaksanakan operasi tertentu dalam senarai terpaut.

Sintaks:

Sintaks kelas LinkedList dalam C# adalah seperti berikut:

LinkedList<Type> linkedlist_name = new LinkedList <Type>();

Di mana Jenis mewakili jenis senarai terpaut.

Kerja Kelas LinkedList dalam C#

• Terdapat nod hadir dalam senarai terpaut dan setiap nod terdiri daripada dua bahagian iaitu medan data dan pautan ke nod yang datang seterusnya dalam senarai terpaut.
• Jenis setiap nod dalam senarai terpaut ialah LinkedListNode taip.
• Satu nod boleh dialih keluar daripada senarai terpaut dan boleh dimasukkan kembali ke senarai terpaut yang sama atau teksi dimasukkan ke senarai terpaut lain dan oleh itu tiada peruntukan tambahan pada timbunan.
• Memasukkan elemen ke dalam senarai terpaut, mengalih keluar elemen daripada senarai terpaut dan mendapatkan sifat kiraan yang merupakan sifat dalaman yang dikekalkan oleh senarai disukai adalah semua operasi O(1).
• Enumerator disokong oleh kelas senarai terpaut kerana ia adalah senarai terpaut tujuan umum.
• Tiada apa-apa yang membuat senarai terpaut tidak konsisten disokong oleh senarai terpaut.
• Jika senarai terpaut ialah senarai terpaut dua kali, maka setiap nod mempunyai dua penunjuk, satu menunjuk ke nod sebelumnya dalam senarai dan satu lagi menunjuk ke nod seterusnya dalam senarai.

Pembina Kelas LinkedList

Terdapat beberapa pembina dalam kelas LinkedList dalam C#. Mereka ialah:

• LinkedList(): Satu kejadian baharu kelas senarai terpaut dimulakan yang kosong.
• LinkedList(IEnumerable): Satu kejadian baharu kelas senarai terpaut dimulakan yang diambil daripada pelaksanaan IEnumerable yang ditentukan yang kapasitinya cukup untuk mengumpul semua elemen yang disalin.
• LinkedList(SerializationInfo, StreamingContext): Satu kejadian baharu kelas senarai terpaut dimulakan yang boleh disirikan dengan serializationInfo dan StreamingContext ditentukan sebagai parameter.

Kaedah Kelas LinkedList dalam C#

Terdapat beberapa kaedah dalam kelas LinkedList dalam C#. Mereka ialah:

• AddAfter: A value or new node is added after an already present node in the linked list using the AddAfter method.
• AddFirst: A value or new node is added at the beginning of the linked list using the AddFirst method.
• AddBefore: A value or new node is added before an already present node in the linked list using the AddBefore method.
• AddLast: A value or new node is added at the end of the linked list using the AddLast method.
• Remove(LinkedListNode): A node specified as a parameter will be removed from the linked list using Remove(LinkedListNode) method.
• RemoveFirst(): A node at the beginning of the linked list will be removed from the linked list using RemoveFirst() method.
• Remove(T): The first occurrence of the value specified as a parameter in the linked list will be removed from the linked list using the Remove(T) method.
• RemoveLast(): A node at the end of the linked list will be removed from the linked list using the RemoveLast() method.
• Clear(): All the nodes from the linked list will be removed using the Clear() method.
• Find(T): The value specified as the parameter present in the very first node will be identified by using the Find(T) method.
• Contains(T): We can use the Contains(T) method to find out if a value is present in the linked list or not.
• ToString(): A string representing the current object is returned by using the ToString() method.
• CopyTo(T[], Int32): The whole linked list is copied to an array which is one dimensional and is compatible with the linked list and the linked list begins at the index specified in the array to be copied to using CopyTo(T[], Int32) method.
• OnDeserialization(Object): After the completion of deserialization, an event of deserialization is raised and the ISerializable interface is implemented using OnDeserialization(Object) method.
• Equals(Object): If the object specified as the parameter is equal to the current object or not is identified using Equals(Object) method.
• FindLast(T): The value specified as the parameter present in the last node will be identified by using FindLast(T) method.
• MemberwiseClone(): A shallow copy of the current object is created using MemeberwiseClone() method.
• GetEnumerator(): An enumerator is returned using GetEnumerator() method and the returned enumerator loops through the linked list.
• GetType(): The type of the current instance is returned using GetType() method.
• GetHashCode(): The GetHashCode() method is the hash function by default.
• GetObjectData(SerializationInfo, StreamingContext): The data which is necessary to make the linked list serializable is returned by using GetObjectData(SerializationInfo, StreamingContext) method along with implementing the ISerializable interface.

Example of LinkedList Class in C#

C# program to demonstrate AddLast() method, Remove(LinkedListNode) method, Remove(T) method, RemoveFirst() method, RemoveLast() method and Clear() method in Linked List class:

Code:

using System;
using System.Collections.Generic;
//a class called program is defined
public class program
{
// Main Method is called
static public void Main()
{
//a new linked list is created
LinkedList<String> list = new LinkedList<String>();
//AddLast() method is used to add the elements to the newly created linked list
list.AddLast("Karnataka");
list.AddLast("Mumbai");
list.AddLast("Pune");
list.AddLast("Hyderabad");
list.AddLast("Chennai");
list.AddLast("Delhi");
Console.WriteLine("The states in India are:");
//Using foreach loop to display the elements of the newly created linked list
foreach(string places in list)
{
Console.WriteLine(places);
}
Console.WriteLine("The places after using Remove(LinkedListNode) method are:");
//using Remove(LinkedListNode) method to remove a node from the linked list
list.Remove(list.First);
foreach(string place in list)
{
Console.WriteLine(place);
}
Console.WriteLine("The places after using Remove(T) method are:");
//using Remove(T) method to remove a node from the linked list
list.Remove("Chennai");
foreach(string plac in list)
{
Console.WriteLine(plac);
}
Console.WriteLine("The places after using RemoveFirst() method are:");
//using RemoveFirst() method to remove the first node from the linked list
list.RemoveFirst();
foreach(string pla in list)
{
Console.WriteLine(pla);
}
Console.WriteLine("The places after using RemoveLast() method are:");
//using RemoveLast() method to remove the last node from the linked list
list.RemoveLast();
foreach(string pl in list)
{
Console.WriteLine(pl);
}
//using Clear() method to remove all the nodes from the linked list
list.Clear();
Console.WriteLine("The count of places after using Clear() method is: {0}",
list.Count);
}
}

The output of the above program is as shown in the snapshot below:

In the above program, a class called program is defined. Then the main method is called. Then a new linked list is created. Then AddLast() method is used to add the elements to the newly created linked list. Then foreach loop is used to display the elements of the newly created linked list. Then Remove(LinkedListNode) method is used to remove a node from the linked list. Then Remove(T) method is used to remove a node from the linked list. Then RemoveFirst() method is used to remove the first node from the linked list. Then RemoveLast() method is used to remove the last node from the linked list. Then Clear() method is used to remove all the nodes from the linked list. The output of the program is shown in the snapshot above.

Atas ialah kandungan terperinci C# LinkedList. Untuk maklumat lanjut, sila ikut artikel berkaitan lain di laman web China PHP!