LinkList<T> Class
Public Class LinkList(Of _
T)
Implements IEnumerable
This language is not supported or no code example is available.
public class LinkList<T> : IEnumerable
This language is not supported or no code example is available.
generic<typename T>
public ref class LinkList : public IEnumerable^
This language is not supported or no code example is available.
Type Parameters
- T
Name | Description | |
---|---|---|
LinkList() | Creates a new, empty linked list. |
Name | Description | |
---|---|---|
AddFirst(T) | Adds an object first in the linked list. | |
AddLast(T) | Adds an object last in the linked list. | |
Clear() | Empties the linked list. | |
CutNode(LinkListNode<T>) | Removes a node from the list, keeping it's position pointers. It is then possible to re-insert it with PasteNode(), but use with care because the previous and next node of this one still has to exist! | |
Erase(LinkListNode<T>) | Removes a node from the linked list and returns the new node that is in the same position as the one removed. | |
EraseFirst() | Removes the first node/object from the list. If the list is empty, an exception will be thrown. | |
EraseLast() | Removes the last node/object from the list. If the list is empty, an exception will be thrown. | |
Find(T) | Searches the list for a node containing obj using ==. | |
GetEnumerator() | Returns an iterator that iterates through this LinkList. | |
Insert(LinkListNode<T>, T) | Inserts an object before the another node. The newly created node is returned. If the 'before object' is null, the data object is added last in the list. | |
PasteNode(LinkListNode<T>) | Re-inserts a node previously removed with CutNode(...) | |
Reverse() | Reverses the list in-place. | |
Sort() | Sorts the list using the IComparable interface of the objects. | |
Sort(Comparison<T>) | Sort the list unsing a comparison function. | |
ToList() | Create a List out of this LinkList. Note: only references are added to the list, if T is a reference type! That is, no copies are made! |
IGS.Genamo.LinkList<T>