StructForge 1.1.0

StructForge

StructForge is a lightweight, educational, and practical C# library for learning and experimenting with fundamental data structures and algorithms. It provides a range of generic collections, sorting algorithms, and interfaces for building your own high-level structures.

Features

Collections

• Lists: SfList<T>, SfLinkedList<T>
• Stacks & Queues: SfStack<T>, SfQueue<T>
• Heaps & Priority Queues: SfBinaryHeap<T>, SfMaxHeap<T>, SfMinHeap<T>, SfPriorityQueue<TItem, TPriority>
• Binary Search Trees: SfBinarySearchTree<T>
• Trees: SfBinarySearchTree<T>, SfAvlTree<T>
• Sets & Dictionaries: SfSortedSet<T>, SfSortedDictionary<TKey, TValue>

Sorting Algorithms

• QuickSort
• TreeSort

Interfaces

• ISfDataStructure<T>: Base interface for all collections
• ISfList<T>: List interface
• ISfLinkedList<T>: Doubly-linked list interface
• ISfStack<T>: Stack interface
• ISfQueue<T>: Queue interface
• ISfHeap<T>: Generic heap interface
• ISfTree<T>: Tree interface
• ISfDictionary<T>: Dictionary interface

Algorithms & Utilities

• Sorting

SfSorting.QuickSort(...)

SfSorting.TreeSort(...)

SfSorting.HeapSort(...)

• Searching

SfAlgorithms.BinarySearch(...)

• Randomization

SfAlgorithms.Shuffle(...)

• Comparers

SfComparers<T> – default comparer access

SfComparerUtils – helper utilities for key/value and custom comparers

Key Capabilities

• Fully generic implementations
• Iteration and enumeration support
• Custom comparers for heaps, priority queues, and sorting
• Educational and practical reference for learning C# data structures

Installation

You can install the latest version via NuGet:

dotnet add package StructForge

Or clone the repository and include the StructForge project in your solution:

git clone https://github.com/FurkanKirat/StructForge.git

Usage Examples

Sorted Dictionary

var dict = new SfSortedDictionary<string, int>();
dict.Add("apple", 3);
dict.Add("banana", 1);
dict.Add("cherry", 2);

foreach (var kv in dict)
Console.WriteLine($"{kv.Key}: {kv.Value}");
// Output:
// banana: 1
// cherry: 2
// apple: 3

Shuffle and Binary Search

int[] data = { 1, 2, 3, 4, 5, 6 };
SfShuffleExtensions.Shuffle(data);
int index = SfSearching.BinarySearch(data, 4);

AVL Tree

var avl = new SfAvlTree<int>();
avl.Add(10);
avl.Add(5);
avl.Add(15);
avl.Add(7);

Console.WriteLine($"Min: {avl.Min}, Max: {avl.Max}, Count: {avl.Count}");

Linked List

var list = new SfLinkedList<int>();
list.AddLast(1);
list.AddLast(2);
list.AddFirst(0);

foreach (var item in list)
    Console.WriteLine(item); // 0, 1, 2

Priority Queue

var pq = new SfPriorityQueue<string, int>();
pq.Enqueue("low", 5);
pq.Enqueue("high", 1);
pq.Enqueue("medium", 3);

foreach (var item in pq.EnumerateByPriority())
    Console.WriteLine(item); // "high", "medium", "low"

QuickSort

int[] arr = { 5, 2, 9, 1, 5, 6 };
SfSorting.Quicksort(arr);
Console.WriteLine(string.Join(", ", arr)); // 1, 2, 5, 5, 6, 9

Contribution

Contributions are welcome! Feel free to open issues, add features, or improve existing code. Keep in mind that this library is primarily educational.

📦 Installation

You can install the latest version via NuGet:

dotnet add package StructForge

---

## License

MIT License – see [LICENSE](LICENSE) for details.