| Tipic Instant Messaging Platform - Programmer's Reference Guide |
|
bedrock.collections Namespace
Namespace hierarchy
Classes
| Class |
Description |
|
BlockingQueue
|
BlockingQueue is a wrapper of the Queue class's queueing methods, with two maior improvements: - It is thread save - The dequeue waits until an object is put in the queue An exception could be raised in case a thead is waiting for dequeuing an object and the "dispose" method is colled. |
|
ByteStack
|
A type-safe stack for bytes, implemented as a growable buffer. |
|
GraphNode
|
A node in a Graph, such as a Tree |
|
IndexedTrie
|
A Trie that is searchable for substrings. Uses a separate set of indexes to allow entry into the Trie at any point. Yes, this |
|
LinkedList
|
A doubly-linked list implementation, with a sentinal wrap-around m_header. Yes, it does seem like this should have been included in System.Collections. This may be a nicer implementation of Queue than the one in System.Collections, which uses an array. YMMV. |
|
Set
|
Set backed into a Tree. |
|
SkipList
|
Summary description for SkipList. |
|
Tree
|
A basic balanced tree implementation. Yes, it seems like this might have been something nice to have been in System.Collections. Not yet complete, but the algorithmic stuff is here. |
|
Trie
|
A trie is a tree structure that implements a radix search. Each node of the tree has a sub-node for each possible next byte. |
|
TrieNode
|
A node in a Trie. This class is public to support traversal via Trie.Traverse(). |
Interfaces
| Interface |
Description |
|
ISet
|
Set operations. |
Delegates
| Delegate |
Description |
|
TrieKeyWalker
|
A method to get called for each key in the trie |
|
TrieWalker
|
A method to get called for each node in the tree |
Enumerations
| Enumeration |
Description |
|
SetImplementation
|
The different ways a set can be implemented. |