CodePlexProject Hosting for Open Source Software

This namespace contains classes and interfaces that define generic collections which are not present in standard .net framework. The generic collections in this namespace are as follows:

- AbstractTree - Represents an abstract tree data structure.
- Tree - Represents a data structure that emulates a hierarchical tree structure with a set of linked nodes.
- BinaryTree - Represents a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right".
- BinarySearchTree - Represents a node-based binary search tree data structure.
- AATree - Represents a form of balanced binary tree used for storing and retrieving ordered data efficiently.
- AVLTree - Represents a self-balancing BinarySearchTree where the heights of the two child sub-trees of any node differ by at most one.
- RedBlackTree - Represents a self-balancing BinarySearchTree. It can search, insert, and delete in O(log n) time, where n is total number of elements in the tree.
- SplayTree - Represents a self-adjusting BinarySearchTree with the additional property that recently accessed elements are quick to access again.
- Map - Represents a strongly typed list of keys and values where a key can have multiple instances unlike Dictionary<TKey,TValue>.
- HashMap - Represents a serializable generic collection of keys and values.
- Heap - Represents a specialized tree-based data structure that satisfies the heap property.
- Pocket - Represents a strongly typed list with a fixed capacity.
- PriorityQueue - Represents a first-in, first-out collection of objects sorted by their priorities.
- RandomAccessQueue - Represents a first-in, first-out collection of objects, where elements can be accessed from anywhere in the queue.
- SkipList - Represents a data structure for storing a sorted list of items, using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary search trees.
- IAlgorithmAwareCollection – An interface which defines a method to run an algorithm on a generic collection.
- IQueue – An interface which defines methods to manipulate a queue.
- KeyValueComparer - Compares two KeyValuePair<TKey,TValue> objects for equivalence.
- Matrix - Represents a collection of elements arranged into a fixed number of rows and columns.

Last edited Feb 13, 2011 at 6:28 PM by anidotnet, version 3