RadLinkedList<T>
Stores values in a doubly linked sequence and exposes operations that insert, remove, and move node ranges. Several members of the standard collection interfaces are not implemented.
Definition
Namespace:Telerik.WinForms.Documents.DocumentStructure
Assembly:Telerik.WinControls.RichTextEditor.dll
Type Parameters:
T
The type of value stored in each node.
Syntax:
public class RadLinkedList<T> : ICollection, IEnumerable
Inheritance: objectRadLinkedList<T>
Implements:
Constructors
Initializes an empty linked list.
public RadLinkedList()
Properties
Gets the number of values in the list. This operation is not implemented.
public int Count { get; }
Counting list values is not implemented.
Gets the first node in the list.
public RadLinkedListNode<T> First { get; }
Gets whether the list is read-only.
public bool IsReadOnly { get; }
Gets the last node in the list.
public RadLinkedListNode<T> Last { get; }
Methods
Appends the item as a new last node.
public void Add(T item)
The value to append.
Inserts an existing node immediately after another node in the list.
public RadLinkedListNode<T> AddAfter(RadLinkedListNode<T> node, RadLinkedListNode<T> newNode)
The existing node that precedes the inserted node.
newNodeRadLinkedListNode<T>The node to insert.
Returns:The inserted node.
Creates a node for value and inserts it immediately after node.
public RadLinkedListNode<T> AddAfter(RadLinkedListNode<T> node, T value)
The existing node that precedes the inserted node.
valueTThe value stored in the inserted node.
Returns:The newly inserted node.
Inserts an existing node immediately before another node in the list.
public RadLinkedListNode<T> AddBefore(RadLinkedListNode<T> node, RadLinkedListNode<T> newNode)
The existing node that follows the inserted node.
newNodeRadLinkedListNode<T>The node to insert.
Returns:The inserted node.
Creates a node for value and inserts it immediately before node.
public RadLinkedListNode<T> AddBefore(RadLinkedListNode<T> node, T value)
The existing node that follows the inserted node.
valueTThe value stored in the inserted node.
Returns:The newly inserted node.
Inserts an existing node at the beginning of the list.
public RadLinkedListNode<T> AddFirst(RadLinkedListNode<T> node)
The node to insert.
Returns:The inserted node.
Exceptions: ArgumentNullExceptionnode is null.
Creates a node for value and inserts it at the beginning of the list.
public RadLinkedListNode<T> AddFirst(T value)
The value stored in the new first node.
Returns:The inserted node.
Appends an existing node to the end of the list.
public RadLinkedListNode<T> AddLast(RadLinkedListNode<T> node)
The node to append.
Returns:The appended node.
Exceptions: ArgumentNullExceptionnode is null.
Creates a node for value and appends it to the list.
public RadLinkedListNode<T> AddLast(T value)
The value stored in the new last node.
Returns:The inserted node.
Inserts a contiguous node range immediately after the specified node.
public void AddRangeAfter(RadLinkedListNode<T> node, RadLinkedListNode<T> rangeStartNode, RadLinkedListNode<T> rangeEndNode)
The node that precedes the inserted range.
rangeStartNodeRadLinkedListNode<T>The first node in the range.
rangeEndNodeRadLinkedListNode<T>The last node in the range.
Inserts a contiguous node range immediately before the specified node.
public void AddRangeBefore(RadLinkedListNode<T> node, RadLinkedListNode<T> rangeStartNode, RadLinkedListNode<T> rangeEndNode)
The node that follows the inserted range.
rangeStartNodeRadLinkedListNode<T>The first node in the range.
rangeEndNodeRadLinkedListNode<T>The last node in the range.
Removes all values by resetting the list's first and last node references. Existing nodes are not individually invalidated.
public void Clear()
Checks whether the list contains the specified value. This operation is not implemented.
public bool Contains(T item)
The value to locate.
Returns: Exceptions: NotImplementedExceptionContainment checks are not implemented.
Copies the list's values to an array. This operation is not implemented.
public void CopyTo(T[] array, int arrayIndex)
The destination array.
arrayIndexintThe zero-based destination index at which copying begins.
Exceptions: NotImplementedExceptionCopying to an array is not implemented.
Gets an enumerator that visits the list's values in node order.
public IEnumerator<T> GetEnumerator()
IEnumerator<T>
An enumerator for the list.
Moves a contiguous range from another list to the end of this list.
public void MoveNodes(RadLinkedList<T> fromList, RadLinkedListNode<T> fromNode, RadLinkedListNode<T> toNode)
The list from which nodes are removed.
fromNodeRadLinkedListNode<T>The first node in the range to move.
toNodeRadLinkedListNode<T>The last node in the range to move.
Exceptions: ArgumentNullExceptionfromNode or toNode is null.
Moves the range from fromNode through the source list's last node to the end of this list.
public void MoveNodes(RadLinkedList<T> fromList, RadLinkedListNode<T> fromNode)
The list from which nodes are removed.
fromNodeRadLinkedListNode<T>The first node in the range to move.
Removes a node from the list and clears its previous and next links.
public void Remove(RadLinkedListNode<T> node)
The node to remove.
Removes the specified value from the list. This operation is not implemented.
public bool Remove(T item)
The value to remove.
Returns:This method does not return because removal is not implemented.
Exceptions: NotImplementedExceptionRemoving by value is not implemented.
Removes the first node from the list.
Removes the last node from the list.
Removes a contiguous range of nodes from the list.
public void RemoveRange(RadLinkedListNode<T> rangeHead, RadLinkedListNode<T> rangeTail)
The first node to remove.
rangeTailRadLinkedListNode<T>The last node to remove.