TheCodingMonkey.Collections assembly

TheCodingMonkey.Collections namespace

public type	description
class CmdArguments	Class for performing verbose parsing of command line arguments. Accepts command line parameters in a variety of patterns, and puts the keys and values in a StringDictionary for easy use later.
interface IBiDirEnumerator<T>	Defines an enumerator that go go forward and backwards.

public type	description
class AVLException	Exception thrown if an AVL Search Tree fails validation.
class AVLNode<TKey,TValue>	AVL Binary Search Tree Node.
class AVLTree<TKey,TValue>	Implementation of a Balanced AVL Binary Search Tree.
class BinarySearchTree<TKey,TValue>	Basic Unbalanced Binary Search Tree Implementation.
class BSTException	Exception thrown if a Binary Search Tree fails validation.
abstract class FlatEnumerator<TKey,TValue>	Abstract base class for all BinarySearchTree enumerators. Implements an Enumerator for a Binary Search Tree by traversing the entire tree at Construction and flattening it according to the rules of the enumerator.
class InOrderFlatEnumerator<TKey,TValue>	In Order Traversal Enumerator. The BinarySearchTree is enumerated in the order of Left Node, Current Value, Right Node.
class LevelOrderFlatEnumerator<TKey,TValue>	Level Order Flat Enumerator. The Binary Search Tree is enumerated breadth first at time of Enumerator construction.
class Node<TKey,TValue>	Binary Search Tree Node.
class PostOrderFlatEnumerator<TKey,TValue>	Post Order Traversal Enumerator. The BinarySearchTree is enumerated in the order of Left Node, Right Node, Current Value.
class PreOrderFlatEnumerator<TKey,TValue>	Pre Order Traversal Enumerator. The BinarySearchTree is enumerated in the order of Current Value, Left Node, Right Node.
class RedBlackNode<TKey,TValue>	Red-Black Binary Search Tree Node.
class RedBlackTree<TKey,TValue>	Implementation of a Balanced Red-Black Binary Search Tree.

public type	description
class ForwardEnumerator<T>	Forward Linked List Enumerator.
class LinkedList<T>	Implements a doubly linked list.
abstract class ListEnumerator<T>	Base class for all LinkedList Enumerators.
class Node<T>	Encapsulates a Linked List Node
class ReverseEnumerator<T>	Reverse Linked List Enumerator.

public type	description
class Enumerator<TKey,TValue>	SkipList Enumerator.
class Node<TKey,TValue>	SkipList Node.
class SkipList<TKey,TValue>	Implementation for a Skip List.

public type	description
class BitonicMergeSort<T>	Implementation of a Bitonic Merge Sort (partition-exchange sort) for IList
class BubbleSort<T>	Implementation of a Bubble sort (sinking sort) for IList
class CombSort<T>	Implementation of a Comb Sort for IList
enum Direction	Defines the direction of a sort
class HeapSort<T>	Implementation of a Bubble sort (sinking sort) for IList
interface IInPlaceSort<T>	Generic interface for all algorithms in this collection that perform an in-place sort of an IList
class InsertionSort<T>	Implementation of an Insertion sort (sinking sort) for IList
interface IOutOfPlaceSort<T>	Generic interface for all algorithms in this collection that perform an out of place sort of an IList
class MergeSort<T>	Implementation of an Out of Place Merge Sort (partition-exchange sort) for IList
class OddEvenSort<T>	Implementation of an Odd Even sort (brick sort) for IList
class QuickSort<T>	Implementation of a Quicksort (partition-exchange sort) for IList
class SelectionSort<T>	Implementation of a Selection sort for IList
class ShellSort<T>	Implementation of a Shell Sort for IList