 | Condensed Namespace |
[This is preliminary documentation and is subject to change.]
The Condensed namespace contains the primary classes that are available in the Condensed library.
Classes| Class | Description | |
|---|---|---|
 | BitCollection |
A bit vector implementation with IList semantics. Behaves like a ListT
of booleans but with more efficient storage.
|
| CondensedCollectionT |
An IListT implementation that uses interning (deduplication) for efficient storage of large
numbers of immutable elements. Interning items makes the collection more memory-efficient and can often improve performance for
certain compute-intensive tasks.
|
| InternalCorruptionException |
An exception that is thrown when the internal state of a CondensedCollectionT is
irrevocably corrupted, typically caused by unsynchronized multithreaded accesses.
|
| InternReclaimableEventArgs |
Event args provided to a InternedValueReclaimable event handler, intended
to help decide whether a cleanup operation should be performed.
|
| StandardCutoverPredicates |
Contains cutover predicates that implement reasonable heuristics that can be used for common types
when deciding whether a CondensedCollection should stop performing deduplication and just store values
in an ordinary ListT.
|
Structures| Structure | Description | |
|---|---|---|
 | CondensedStats |
Statistics provided to a cutover predicate.
|
Enumerations| Enumeration | Description | |
|---|---|---|
 | IndexType |
Specifies the width of the internal index currently used by a CondensedCollectionT.
|