Lists

DotNet.AdvancedCollections provides several list implementations with special features.

DoublyLinkedList<T>

A doubly linked list that allows efficient bidirectional navigation.

Features

• O(1) insertion/deletion at both ends
• Forward and backward navigation
• Support for concurrent synchronization

Usage Example

using DotNet.AdvancedCollections.List.DoublyLinkedList;

var list = new DoublyLinkedList<int>();

// Add elements (adds to the end)
list.Add(1);
list.Add(2);
list.Add(3);

// Add to the end explicitly
list.AddLast(4);

// Access elements by index
Console.WriteLine(list[0]); // 1
Console.WriteLine(list[1]); // 2

// Iterate
for (int i = 0; i < list.Count; i++)
{
    Console.WriteLine(list[i]);
}

// Or use foreach
foreach (var item in list)
{
    Console.WriteLine(item);
}

// Get first and last elements
var first = list.GetFirst();
var last = list.GetLast();

SortedList<T>

A list that maintains its elements sorted automatically.

Features

• Maintains order automatically
• Supports ascending and descending sort criteria
• Efficient element search

Usage Example

using DotNet.AdvancedCollections.List.SortedList;

// Ascending sorted list
var sortedList = new SortedList<int>(Criterion.Ascending);
sortedList.Add(3);
sortedList.Add(1);
sortedList.Add(2);
// The list is sorted: [1, 2, 3]

// Descending sorted list
var descList = new SortedList<string>(Criterion.Descending);
descList.Add("Charlie");
descList.Add("Alice");
descList.Add("Bob");
// The list is sorted: ["Charlie", "Bob", "Alice"]

Synchronization

Both lists implement ISynchronized for thread-safe operations:

var list = new DoublyLinkedList<int>();

// Synchronize operations
lock (list.SyncRoot)
{
    list.Add(1);
    list.Add(2);
}