PBL - The program base library
C# AvlDictionary and Priority Queue implementation
 All Classes Namespaces Files Functions Properties
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 123456]
\NCom
 \NMission_Base
  \NPbl
   oCAvlDictionary< TKey, TValue >AvlDictionary<TKey,TValue> is an implementation of the generic IDictionary<TKey,TValue> interface based on an AVL-tree. The AvlDictionary<TKey,TValue> represents a collection of key/value pairs that are sorted on the key.
   |oCAvlDictionaryBaseEnumeratorProvides the common base functionality of all Enumerators used with an AvlDictionary<TKey,TValue>.
   |oCEnumeratorEnumerates the elements of an AvlDictionary<TKey,TValue>.
   |oCKeyCollectionRepresents the collection of keys in an AvlDictionary<TKey,TValue>. This class cannot be inherited.
   ||\CCollectionEnumeratorEnumerates the elements of an AvlDictionary<TKey,TValue>.KeyCollection. This class cannot be inherited.
   |\CValueCollectionRepresents the collection of values in an AvlDictionary<TKey,TValue>. This class cannot be inherited.
   | \CCollectionEnumeratorEnumerates the elements of an AvlDictionary<TKey,TValue>.ValueCollection. This class cannot be inherited.
   \CPriorityQueue< T >PriorityQueue<T> is a C# implementation of a generic priority queue based on a binary min-heap. This C# implementation provides O(log(n)) time for insertion methods; O(log(n)) time for removal methods; and constant time for retrieval methods. The implementation is derived from the List<T> class, therefore most List<T> methods can also be applied to a PriorityQueue<T>, however, List<T> methods that would destroy the heap condition of the priority queue will throw an InvalidOperationException, e.g. Reverse().