Classes
| Class | Description | |
|---|---|---|
 | DisposingList | Disposes of each element in the collection when the collection is disposed. |
| DisposingList<T> | Disposes of each element in the collection when the collection is disposed. |
| LListNode | The basic Linked-list node, untyped, use LListNode<T> for strong typed nodes and lists. |
| LListNode<T> | A typed node, used similiarly to LinkedListNode<T>. Can belong to single list at a time, the type of list is usually LListNode<T>.LList |
| LListNode.LList<T> | Provides a linked list of nodes of type T |
| LListNode.LList | Provides a linked list of nodes of type T |
| LListNode.LList<TNode> | Provides a linked list of nodes of type T |
| OrdinalList | An ordinal list is a list optimized to store lists of integer data that can then be manipulated as a set with intersect/union etc. Each integer stored is translated to a bit offset and thus cann't be stored more than once or in any particular order. Note: adding the value int.Max will allocate int.Max/8 bytes of memory, so this is best used with ordinal indexes into a list that is smaller than 8,388,608 (one megabyte of bits). Pre-allocate with Ceiling = max for better performance, or add the integers in reverse order (highest to lowest). |
| ReadOnlyList<T> | A readonly list of T |
| SetList<T> | Represents an immutable collection of unique items that can be manipulated as a set, intersect/union/etc. |
| SynchronizedDictionary<TKey,TValue> | Represents a thread-safe generic collection of key/value pairs. |
| SynchronizedList<T> | Represents a collection of objects that can be individually accessed by index. |
Interfaces
| Interface | Description | |
|---|---|---|
 | IReadOnlyCollection<T> | Provides common interface members for the implementation of a Set |