private void fillExtendedReport(StringBuilder out, int spaces, ReportEntry<V> report) { for (int i = 0; i < spaces; i++) out.append(" "); out.append(formatReport(report, true)); for (ReportEntry<V> child : report.getChildren()) { fillExtendedReport(out, spaces + 1, child); } }
/** * Returns a string describing, in order of 'expensiveness', the top-level failed rule chains in the parse run. */ public String getOverviewReport() { TreeSet<ReportEntry<V>> topLevelFailed = new TreeSet<ReportEntry<V>>(); fillReport(topLevelFailed, rootReport); StringBuilder out = new StringBuilder(); for (ReportEntry<V> entry : topLevelFailed) { if (entry.getSubSteps() < 100) break; out.append(formatReport(entry, false)); } return out.toString(); }
/** * Returns a string describing, in order of 'expensiveness', the top-level failed rule chains in the parse run. */ public String getOverviewReport() { TreeSet<ReportEntry<V>> topLevelFailed = new TreeSet<ReportEntry<V>>(); fillReport(topLevelFailed, rootReport); StringBuilder out = new StringBuilder(); for (ReportEntry<V> entry : topLevelFailed) { if (entry.getSubSteps() < 100) break; out.append(formatReport(entry, false)); } return out.toString(); }
@Override public int compareTo(ReportEntry<V> o) { if (o.getSubSteps() < getSubSteps()) return -1; else if (o.getSubSteps() > getSubSteps()) return +1; if (System.identityHashCode(o) < System.identityHashCode(this)) return -1; if (System.identityHashCode(o) > System.identityHashCode(this)) return +1; return 0; } }
@Override public int compareTo(ReportEntry<V> o) { if (o.getSubSteps() < getSubSteps()) return -1; else if (o.getSubSteps() > getSubSteps()) return +1; if (System.identityHashCode(o) < System.identityHashCode(this)) return -1; if (System.identityHashCode(o) > System.identityHashCode(this)) return +1; return 0; } }
private static int countInnerNodes(ReportEntry<?> entry) { int count = 1; for (ReportEntry<?> child : entry.getChildren()) count += countInnerNodes(child); return count; }
private static String formatReport(ReportEntry<?> report, boolean withSuccess) { return String.format("%s[%07d] %s\n", withSuccess ? (report.isSucceeded() ? "!" : " ") : "", report.getSubSteps(), report.getPath()); }
private static String formatReport(ReportEntry<?> report, boolean withSuccess) { return String.format("%s[%07d] %s\n", withSuccess ? (report.isSucceeded() ? "!" : " ") : "", report.getSubSteps(), report.getPath()); }
private static int countInnerNodes(ReportEntry<?> entry) { int count = 1; for (ReportEntry<?> child : entry.getChildren()) count += countInnerNodes(child); return count; }
@Override public int compareTo(ReportEntry<V> o) { if (o.getSubSteps() < getSubSteps()) return -1; else if (o.getSubSteps() > getSubSteps()) return +1; if (System.identityHashCode(o) < System.identityHashCode(this)) return -1; if (System.identityHashCode(o) > System.identityHashCode(this)) return +1; return 0; } }
private void fillReport(Collection<ReportEntry<V>> failed, ReportEntry<V> report) { if (!report.isSucceeded()) { failed.add(report); } else { for (ReportEntry<V> child : report.getChildren()) { fillReport(failed, child); } } }
private void fillReport(Collection<ReportEntry<V>> failed, ReportEntry<V> report) { if (!report.isSucceeded()) { failed.add(report); } else { for (ReportEntry<V> child : report.getChildren()) { fillReport(failed, child); } } }
private void fillExtendedReport(StringBuilder out, int spaces, ReportEntry<V> report) { for (int i = 0; i < spaces; i++) out.append(" "); out.append(formatReport(report, true)); for (ReportEntry<V> child : report.getChildren()) { fillExtendedReport(out, spaces + 1, child); } }
private void fillExtendedReport(StringBuilder out, int spaces, ReportEntry<V> report) { for (int i = 0; i < spaces; i++) out.append(" "); out.append(formatReport(report, true)); for (ReportEntry<V> child : report.getChildren()) { fillExtendedReport(out, spaces + 1, child); } }
/** * Returns a string describing, in order of 'expensiveness', the top-level failed rule chains in the parse run. */ public String getOverviewReport() { TreeSet<ReportEntry<V>> topLevelFailed = new TreeSet<ReportEntry<V>>(); fillReport(topLevelFailed, rootReport); StringBuilder out = new StringBuilder(); for (ReportEntry<V> entry : topLevelFailed) { if (entry.getSubSteps() < 100) break; out.append(formatReport(entry, false)); } return out.toString(); }
private static String formatReport(ReportEntry<?> report, boolean withSuccess) { return String.format("%s[%07d] %s\n", withSuccess ? (report.isSucceeded() ? "!" : " ") : "", report.getSubSteps(), report.getPath()); }
private static int countInnerNodes(ReportEntry<?> entry) { int count = 1; for (ReportEntry<?> child : entry.getChildren()) count += countInnerNodes(child); return count; }
private void fillReport(Collection<ReportEntry<V>> failed, ReportEntry<V> report) { if (!report.isSucceeded()) { failed.add(report); } else { for (ReportEntry<V> child : report.getChildren()) { fillReport(failed, child); } } }