-- Reorganize functions in RecalDatum so that error rate can be computed indepentently. Added unit tests. Removed equals() method, which is a buggy without it's associated implementation for hashcode -- New class RecalDatumTree based on QualIntervals that inherits from RecalDatum but includes the concept of sub data -- VisualizeContextTree now uses RecalDatumTree and can trivially compute the penalty function for merging nodes, which it displays in the graph |
||
|---|---|---|
| licensing | ||
| protected/java | ||
| public | ||
| settings | ||
| .gitignore | ||
| build.xml | ||
| ivy.xml | ||