|
Implements a dictionary with an indexer which automatically inserts missing keys on reads. In all other ways it
behaves exactly the same as a standard dictionary. |
| Implements a two-level AutoDictionary<TKey, TValue>. |
| Implements a three-level AutoDictionary<TKey, TValue>. |
|
Encapsulates a list which dynamically grows as items are written to non-existent indexes. Any gaps are populated
with default values. The behaviour of this list's indexed getter and setter is indistinguishable from that of an
infinitely long list pre-populated by invoking the initializer function (assuming it is side-effect free). See
Remarks. |
|
Encapsulates a binary value 128 bits long. See Remarks. |
|
Implements a list whose items are always stored in a sorted order. Multiple equal items are allowed, and will
always be added to the end of a run of equal items. Insertion, and removal are O(N); lookups are O(log N); access
by index is supported. |
|
A queue whose queued items can be accessed by index. The item at the head of the queue has index 0 and is the next
item to be dequeued. |
| Wraps an ICollection<T> to allow reading values but prevent setting/removing them. |
|
Wraps an IDictionary<TKey, TValue> to allow reading values but prevent setting/removing them. |