An example of an IPointList implementation that stores large datasets, and selectively filters the output data depending on the displayed range.
Constructor to initialize the PointPairList from two arrays of type double.
The Copy Constructor
Deep-copy clone routine
Returns the number of points according to the current state of the filter.
Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.(Inherited from Object.)
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.)
Gets the Type of the current instance.(Inherited from Object.)
Gets or sets a value that determines if the High-Low filtering logic will be applied.
Indexer to access the specified PointPair object by its ordinal position in the list.
Gets the desired number of filtered points to output. You can set this value by calling SetBounds(Double, Double, Int32).
Creates a shallow copy of the current Object.(Inherited from Object.)
|SetBounds(Double, Double, Int32)|
Set the data bounds to the specified minimum, maximum, and point count. Use values of min=double.MinValue and max=double.MaxValue to get the full range of data. Use maxPts=-1 to not limit the number of points. Call this method anytime the zoom range is changed.
This class will refilter the data points each time SetBounds(Double, Double, Int32) is called. The data are filtered down to MaxPts points, within the data bounds of a minimum and maximum data range. The data are filtered by simply skipping points to achieve the desired total number of points. Input arrays are assumed to be monotonically increasing in X, and evenly spaced in X.