|
Class |
Description |
|
AsyncDoubleBufferedQueueT
|
Combines AsyncQueueT and DoubleBufferedQueueT to provide
a low-contention, double-buffered queue suitable for multiple-producer, single-consumer
scenarios.
|
|
AsyncQueueT
|
Creates a fast, light-weight asynchronous processing queue with very low contention.
|
|
CollectionExtensions
|
Defines extension functions related to manipulation of arrays and collections.
|
|
ConcurrentIsolatedQueueT
|
Provides a buffer of point data where reads are isolated from writes.
This class differs from IsolatedQueueT because writes can be concurrent.
Reads on the other hand have to be externally synchronized.
|
|
DictionaryListTKey, TValue
|
Represents a sorted dictionary style list that supports IList.
|
|
DoubleBufferedQueueT
|
A thread-safe double-buffered queue that allows for low-contention
item processing in single-producer, single-consumer scenarios.
|
|
DoubleBufferedQueueManagerT
|
Manages queues to reduce contention for a multithreaded, multiple-producer, single-consumer scenario.
|
|
DoubleBufferedQueueProducerT
|
A producer for a DoubleBufferedQueueT which can
only be used to provide items to the queue for consumption.
|
|
DynamicObjectPoolT
|
Provides a thread safe queue that acts as a buffer pool.
|
|
FileBackedDictionaryTKey, TValue
|
Represents a lookup table of key/value pairs backed by a file, with very little memory overhead.
|
|
FileBackedHashSetT
|
Represents a lookup table backed by a file, with very little memory overhead.
|
|
IndexedArrayT
|
A self growing array of items. This class is thread safe.
|
|
IsolatedQueueT
|
Provides a buffer of point data where reads are isolated from writes.
However, reads must be synchronized with other reads and writes must be synchronized with other writes.
|
|
ListCollectionT
|
A faster and functionally equivalent implementation of CollectionT |
|
ListExtensions
|
Extensions for ListT |
|
NullableArrayT
|
Creates an array of a struct type that uses bitmask for designating a null value.
|
|
OrderedDictionaryTKey, TValue
|
Represents an ordered collection of keys and values with the same performance as DictionaryTKey, TValue with O(1) lookups and adds but with O(n) inserts and removes.
|
|
OrderedDictionaryTKey, TValueKeyCollection
|
Represents the collection of keys in a OrderedDictionaryTKey, TValue. This class cannot be inherited.
|
|
OrderedDictionaryTKey, TValueValueCollection
|
Represents the collection of values in a OrderedDictionaryTKey, TValue. This class cannot be inherited.
|
|
PagedListT
|
Defines a paged list for an enumeration.
|
|
PriorityQueueT
|
Represents a queue of items to which priority can be assigned.
|
|
ProcessDictionaryTKey, TValue
|
Represents a thread-safe (via locking) keyed collection of items, based on DictionaryListTKey, TValue, that get processed on independent threads with a consumer provided function.
|
|
ProcessQueueT
|
Represents a thread-safe (via locking) list of items, based on ListT, that get processed on independent threads with a consumer provided function.
|
|
RollingWindowT
|
Represents a rolling window of data with FIFO semantics that will
automatically truncate the data when the window size is exceeded.
|
|
SettingsCollection
|
A collection of settings that can be represented as a string of key-value pairs for easy persistence and also provide built-in validation support for the settings.
|
|
SortedQueueTKey, TValue
|
Creates a SortedQueueTKey, TValue.
This class allows adding items in random order, but dequeuing based upon the sorting of |