| | Class | Description |
|---|
 | ArrayExtensions |
Provides some extensions for arrays.
|
| AscendingIntegerCollection |
Stores a number of arbitrary integer values in ascending order.
|
| AscendingIntegerRangeCollection |
Implements a collection of ascending integers, that are stored in a list of ranges.
|
| BoxedT |
Boxes a single value into a class. The value can be get/set by the property Value. Since the value is accessible by a property, this class can be used in collections as data sources for data grids, etc.
For this, it additionally implements both INotifyPropertyChanged and IEditableObject |
| CachedObjectManagerByMaximumNumberOfItemsTKey, TValue |
Manages a bunch of cached objects. The cached objects are accessed by a key. In this instance, more than one object with the same key can be stored, but it is presumed that all objects which
are stored under the same key are considered equal.
Usage: Try to take out a cached object with TryTake(TKey, TValue). If no such object exists, create a new one. After usage of the object, put it back with Add(TKey, TValue).
If after adding an object more than the allowed number of objects exists, the object which is used the least will be removed from that instance.
The methods in this instance are thread safe.
|
| CheckableSelectableListNode |
Represents a SelectableListNode that can additionally be in the checked or unchecked state.
|
| CheckableSelectableListNodeList |
Collection of CheckableSelectableListNodes.
|
| ConcurrentPriorityQueueTKey, TValue |
Implements a heap-based priority queue that holds only keys. The key with the minimum value can then be retrieved from the queue. This class is not thread safe.
|
| ConcurrentTokenizedLinkedListTKey, TValue |
Concurrent linked list with the restriction that its members are unique, i.e. an item identified by a key can appear only once in the list.
|
| ConcurrentTokenizedPriorityQueueTKey, TValue, TToken |
Represents a tokenized concurrent priority queue. Inserted items are associated with a token that can later be used to modify the item in the queue.
There are two function sets to add queue items, depending on whether or not the queue is generating tokens by itself. Use Enqueue... functions if the tokens are generated by the queue itself, or use Add.. functions if you provide the token.
|
| DictionaryWithNullableKeyTKey, TValue |
Provides a dictionary, in which one of the keys (and only one) can be null.
|
| EnumerableExtensions |
Extensions to the IEnumerable interface.
|
| EnumerationExtensions |
Extends the operations for Flag Enumerations with setting and clearing of individual flags.
|
| IndexSelection |
Represents a selection of indices that mimics list selection behavior,
using the CTRL key to select single items and the SHIFT key to select multiple items.
|
| ListDictionaryTKey, TValue |
Dictionary that retains the order of the entries by which they are added, thus effectively combining a list (of its values) with fast access by a key.
The only two methods that can modify this class are Clear and Add(TKey, TValue).
|
| ListExtensions |
Supports movement of selected items up/down in a list.
|
| ListNode |
Represents an item for list controls where display text is shown, but the associated object must also be retained.
|
| ListNodeList |
Observable collection of ListNodes.
|
| MultipleSelectableListNodeList |
A list of selectable items. Multiple selections are allowed. If the selection of one of the items changed, a property changed event
for the property SelectedItems is raised.
|
| NamedItemT |
Associates an item with a display name.
|
| NamedItemListT |
List of INamedItem instances, with support for INotifyCollectionChanged |
| NavigationListT |
Implements a list that can be used to navigate forward or backward using stored navigation points.
|
| NGTreeNode |
Represents a non GUI tree node that can be used for interfacing/communication with Gui components.
|
| NGTreeNodeWithImageIndex |
Adds to NGTreeNode the ability to store ImageIndex and SelectedImageIndex.
|
| ObservableCollectionReversingWrapperT |
Wraps an observable collection, so that the elements appear in reverse order compared to the original collection.
|
| ObservableListT |
Generic list that implements the INotifyCollectionChanged interface to notify changes.
Additionally implements MoveToLowerIndex(Int32), MoveToHigherIndex(Int32), and AddRange(IEnumerableT).
|
| PartialDictionaryTKey, TBaseValue, TDerivValue |
Represents a dictionary view that exposes only entries of a derived value type from a parent dictionary of a base value type.
|
| PartitionableListT |
List of items of class T. From this list partitions can be created, which basically are views inside this list, which have certain selection criteria. See remarks for details.
|
 | PartitionableListTPartialViewM |
Generic partial view class for a partitionable list, supporting selection criteria and insertion behavior.
|
| PartitionableListTPartialViewBase |
Non-generic base class for partial views, allowing safe casting and management of views of different types.
|
| PartitionableListTTemporaryDisabler |
Helper class to temporarily disable something, e.g. some events. By calling Disable one gets a disposable token, that,
when disposed, enables again, which fires then the action that is given as parameter to the constructor. It is possible to make nested calls to Disable. In this case all tokens
must be disposed before the IsEnabled is again true and the re-enabling action is fired.
|
| PriorityQueueTKey |
Implements a heap-based priority queue that holds only keys. The key with the minimum value can then be retrieved from the queue. This class is not thread safe.
|
| RenameableItemListT |
Represents a list of renameable items and keeps its name index synchronized with rename operations.
|
| RingBufferT |
Represents a generic ring buffer. This class is not thread safe.
Note that there is no automatic overflow handling; adding an item to a full buffer throws an exception.
|
| RingBufferEnqueueableOnlyT |
Ring buffer that stores elements in a ring-buffer like fashion.
Elements can only be enqueued, but not dequeued.
The oldest element will be overwritten, if a new element is enqueued and the capacity is reached.
Elements can be accessed by index; the newest element is accessed by index 0.
|
| SelectableListNode |
Represents a ListNode that can be either selected or unselected.
|
| SelectableListNodeList |
Collection of SelectableListNodes.
|
| SelectableListNodeListHelper |
Extension methods for SelectableListNodeList.
|
| SelectableListNodeWithParent |
A list node that is used by SingleSelectableListNodeList in order to make sure that
only one of the elements is selected.
|
| SetListT |
Class which holds unique items in the order in which they are added (like a List, but with the difference that only unique items can be contained).
|
| SingleSelectableListNodeList |
A list of selectable items. It is ensured, that either none or maximal one of the items is selected.
If one item is selected, the other item that was selected before will be deselected.
|
| SingleSelectableListNodeListTValue |
Represents a SingleSelectableListNodeList with a strongly typed selected value.
|
| StringRow |
Represents a row of string values.
|
| SystemCollectionsArrayListXmlSerializationSurrogate0 |
XML serialization surrogate for ArrayList.
|
| SystemCollectionsListOfObjectListXmlSerializationSurrogate0 |
XML serialization surrogate for ListT.
|
| ThreeStringRow |
Represents a StringRow with three columns.
|
| TreeNodeExtensions |
Implements algorithms common for all trees.
|
| TwoStringRow |
Represents a StringRow with two columns.
|
| WeakCollectionT |
A collection that allows its elements to be garbage-collected unless there are other references to the elements. Elements will disappear from the collection when they are garbage-collected.
The WeakCollection is not thread-safe, not even for read-only access. No methods may be called on the WeakCollection while it is enumerated, not even a Contains or creating a second enumerator.
The WeakCollection does not preserve any order among its contents; the ordering may be different each time the collection is enumerated.
Since items may disappear at any time when they are garbage collected, this class cannot provide a useful implementation for Count and thus cannot implement the ICollection interface.
|
| WeakDictionaryTKey, TValue |
Represents a dictionary that holds weak references to its keys, allowing keys to be garbage collected when no longer referenced elsewhere.
|
| WeakDictionaryTKey, TValueWeakKeyT |
Represents a weak reference to a key, storing its hash code for dictionary operations.
|
Classes
