Package gpl.whiten
Class InfiniteSortGroup
java.lang.Object
gpl.whiten.InfiniteSortGroup
Wraps multiple Infinitesorts to provide something akin to
Matrix sorting.
- Author:
- Doug Gillespie
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptiondouble[]
addData
(double[] newData) Add a row of data to an array of individual InfiniteSorts.double[]
Get an array of the central means of all sorters in the group.void
setAutoInitialise
(int autoInitialise) Tell the sorters to automatically fill themselves with repeated data at startup when autoInitialise input datas have arrived.
-
Constructor Details
-
InfiniteSortGroup
public InfiniteSortGroup(int nRows, int nTimeBins)
-
-
Method Details
-
addData
public double[] addData(double[] newData) Add a row of data to an array of individual InfiniteSorts.- Parameters:
newData
- array of new data. Must be equal to the number of rows.- Returns:
- array of removed data.
-
getCentralMean
public double[] getCentralMean()Get an array of the central means of all sorters in the group.- Returns:
- array of central means.
-
setAutoInitialise
public void setAutoInitialise(int autoInitialise) Tell the sorters to automatically fill themselves with repeated data at startup when autoInitialise input datas have arrived. This can speed up algorithm settling at detector startup.- Parameters:
autoInitialise
-
-