Provides bit array with automatic resizing

Provides an efficient access to a square 2D bit matrix accessible as boolean values

Provides base implementation for some evented collections

Represents a dictionary that rises events

Represents list that rises change events

Represents a two deminsional matrix of T. This class uses jagged arrays for internal implementation ensuring proper array sizing per matrix structure

Provides base for various matrices

Provides functionality similar to the Interlocked class executed over a named slot. All operations are THREAD-SAFE for calling concurrently. The name comparison is that of Registry's which is OrdinalIgnoreCase. This class was designed to better organize named counters incremented from different threads, i.e. this is needed to keep a count of calls to remote host identified by their names. This class is NOT designed for frequent additions/deletions of named slots, nor was it designed to keep millions of slots. Use it in cases when there are thousands at most slots and new slots appear infrequently. You must delete un-needed slots

Adds context to NamedInterlocked

Efficeintly maps string -> string for serialization. Compared to Dictionary[string,string] this class yields 20%-50% better Slim serialization speed improvement and 5%-10% space improvement

Event handler for list changes

Describes changes in evented list

Describes changes in evented list

Specifies the phase of the event i.e. before/after