Click or drag to resize

IndexPartitionT Class

Represents a collection of non empty, mutually exclusive subsets of a range of zero-based indexes.
Inheritance Hierarchy
SystemObject
  Novacta.AnalyticsIndexPartitionT

Namespace:  Novacta.Analytics
Assembly:  Novacta.Analytics (in Novacta.Analytics.dll) Version: 2.0.0
Syntax
public sealed class IndexPartition<T>

Type Parameters

T
The type of part identifiers.

The IndexPartitionT type exposes the following members.

Properties
  NameDescription
Public propertyCount
Gets the count of the parts.
Public propertyIdentifiers
Gets the collection of part identifiers.
Public propertyItem
Gets the IndexCollection part corresponding to the specified identifier.
Top
Methods
  NameDescription
Public methodEquals
Determines whether the specified object is equal to the current object.
(Inherited from Object.)
Protected methodFinalize
Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.
(Inherited from Object.)
Public methodGetHashCode
Serves as the default hash function.
(Inherited from Object.)
Public methodGetType
Gets the Type of the current instance.
(Inherited from Object.)
Protected methodMemberwiseClone
Creates a shallow copy of the current Object.
(Inherited from Object.)
Public methodToString
Returns a String that represents this instance.
(Overrides ObjectToString.)
Public methodTryGetPart
Tries the get part associated with the specified identifier.
Top
Remarks

An index partition is a data structure that has a specific number of parts. Each part is a collection of zero-based indexes represented by an instance of type IndexCollection, and has an identifier whose type is the generic parameter T.

Index partitions are useful when a collection of elements is inspected and its range must be partitioned by grouping those positions which share the same element. The resulting groups, referred to as parts, have no common indexes, and their union includes all the available positions in the collection of elements. Let us consider an array of doubles: an example of index partition is a data structure with two parts, in which the first part is used to store the array positions which correspond to positive entries, and a second part stores the non positive ones.

Index partition instances can be created by calling methods provided by the IndexPartition static class.

See Also