[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]
Sorted, reference-counting set based on a SortedDictionary implementation that stores keys and a
reference counter for each unique key value. Each time the same key is added, the reference
counter increases. Each time a key is removed, the reference counter decreases.
The following tables list the members exposed by the SortedDoubleVector type.
Public Methods
Name | Description | |
---|---|---|
![]() | Add | Add a value to the collection. |
![]() | Equals | (Inherited from Object.) |
![]() | FindInsertIndex | Returns the index into which to insert to.
Proptected access level for convenient testing.
|
![]() | GetHashCode | Serves as a hash function for a particular type. GetHashCode() is suitable for use in hashing algorithms and data structures like a hash table. (Inherited from Object.) |
![]() | GetType | Gets the Type of the current instance. (Inherited from Object.) |
![]() | Remove | Remove a value from the collection. |
![]() | ToString | (Inherited from Object.) |
Protected Methods
Name | Description | |
---|---|---|
![]() | Finalize | Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. (Inherited from Object.) |
![]() | MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) |
Public Constructors
Name | Description | |
---|---|---|
![]() | SortedDoubleVectorNew |
Constructor.
|