VelocityDb.Collection.BTree Namespace |
The VelocityDb.Collection.BTree namespace contains classes for the VelocityDb BTrees optimized for persistent storage in VelocityDb databases
Classes| Class | Description | |
|---|---|---|
 | AssemblyExtensions | |
| BTreeBaseKey, Value |
Represents a collection of objects that is maintained in sorted order.
|
| BTreeByteArray |
Wrapper object for a byte[] of data for comparing objects within a BTreeSet. Wrapper is used so that this data can be placed on a seperate Page |
| BTreeInternalKey, Value |
Represents a collection of keys that is maintained in sorted order. Each key has an associated value. A persistent BTree references its contained objects by Oid instead of direct object references.
This way, we will only open the referenced objects on demand which reduces memory usage and initial BTree load time. Exceptions are ValueType keys and values.
|
| BTreeInternalBaseKey, Value |
Represents a collection of keys that is maintained in sorted order. Each key has an associated value. A persistent BTree references its contained objects by Oid instead of direct object references.
This way, we will only open the referenced objects on demand which reduces memory usage and initial BTree load time. Exceptions are ValueType keys and values.
|
| BTreeLeafKey, Value |
Creates a leaf level node in the BTree
|
| BTreeLeafBaseKey, Value |
Internal class used with BTreeSet and BTreeMap
|
| BTreeMapKey, Value |
Represents a collection of keys that is maintained in sorted order. Each key has an associated value. A persistent BTree references its contained objects by Oid instead of direct object references.
This way, we will only open the referenced objects on demand which reduces memory usage and initial BTree load time. Exceptions are ValueType keys and values.
|
| BTreeMapBaseKey, Value |
Represents a collection of objects that is maintained in sorted order.
|
| BTreeMapIteratorKey, Value |
Iterates all the elements of a BTreeSet
|
| BTreeMapOidShortKey, Value | Represents a collection of objects that is maintained in sorted order. Collection and all objects must be within a single Database (since references uses OidShort persistently)
|
| BTreeNode |
A BTree consists of a tree of nodes. Each BTree node has this class a base class.
|
| BTreeSetKey |
Represents a collection of objects that is maintained in sorted order. A persistent BTree references its contained objects by Oid instead of direct object references.
This way, we will only open the referenced objects on demand which reduces memory usage and initial BTree load time.
|
| BTreeSetIteratorKey |
Iterates all the elements of a BTreeSet
|
| BTreeSetOidShortKey | Represents a collection of objects that is maintained in sorted order. Collection and all objects must be within a single Database (since references uses OidShort persistently)
|