public class FriedmanTest extends QSortAlgorithm
Modifier and Type | Field and Description |
---|---|
protected boolean |
stopRequested
When true stop sorting.
|
FLIGNER_KILLEEN_NORMAL
Constructor and Description |
---|
FriedmanTest(DataCase[][] groups,
java.lang.String[] groupNames) |
Modifier and Type | Method and Description |
---|---|
java.util.HashMap[] |
getCompleteArray() |
boolean[] |
getHasTie() |
int[] |
getMaxNumebrTie() |
DataCase[][] |
getRankedArray() |
double |
getRankGrandAverage() |
double[] |
getRankGroupAverage() |
double[] |
getRankGroupSum() |
DataCase[][] |
getResultTable() |
double |
getSingleGroupSize() |
java.util.HashMap[] |
getTieArray() |
void |
init()
Initialize
|
protected void |
pause()
Pause for a while.
|
protected void |
pause(int H1)
Pause for a while and mark item 1.
|
protected void |
pause(int H1,
int H2)
Pause for a while and mark item 1 & 2.
|
void |
setParent(SortItem p)
Set the parent.
|
void |
stop()
Stop sorting.
|
getCompleteMap, getMaxNumberTies, getTieMap, getTotalCount, hasTie, main, max, min, rankCombinedLists, rankCombinedLists, rankCombinedLists, rankCombinedListsAssignQuantile, rankList, rankListAssignQuantile, sort, sort
public FriedmanTest(DataCase[][] groups, java.lang.String[] groupNames)
public DataCase[][] getResultTable()
public double[] getRankGroupAverage()
public double[] getRankGroupSum()
public double getSingleGroupSize()
public double getRankGrandAverage()
public DataCase[][] getRankedArray()
public java.util.HashMap[] getTieArray()
public java.util.HashMap[] getCompleteArray()
public boolean[] getHasTie()
public int[] getMaxNumebrTie()
public void setParent(SortItem p)
protected void pause() throws java.lang.Exception
java.lang.Exception
protected void pause(int H1) throws java.lang.Exception
java.lang.Exception
protected void pause(int H1, int H2) throws java.lang.Exception
java.lang.Exception
public void stop()
public void init()