public List < String > getExtendedReport ( int topEntries ) { TreeSet < ReportEntry < V >> topLevelFailed = new TreeSet < ReportEntry < V > > ( ) ; fillReport ( topLevelFailed , rootReport ) ; int count = topEntries ; List < String > result = Lists . newArrayList ( ) ; StringBuilder out = new StringBuilder ( ) ; for ( ReportEntry < V > entry : topLevelFailed ) { if ( count -- == 0 ) return result ; out . setLength ( 0 ) ; fillExtendedReport ( out , 0 , entry ) ; result . add ( out . toString ( ) ) ; } return result ; }
Lists the work done by the most expensive failed rules .