/** * Scan a list of nodes. */ public R scan(Iterable<? extends DocTree> nodes, P p) { R r = null; if (nodes != null) { boolean first = true; for (DocTree node : nodes) { r = (first ? scan(node, p) : scanAndReduce(node, p, r)); first = false; } } return r; }
/** * Scan a list of nodes. */ public R scan(Iterable<? extends DocTree> nodes, P p) { R r = null; if (nodes != null) { boolean first = true; for (DocTree node : nodes) { r = (first ? scan(node, p) : scanAndReduce(node, p, r)); first = false; } } return r; }
@Override public R visitSerialField(SerialFieldTree node, P p) { R r = scan(node.getName(), p); r = scanAndReduce(node.getType(), p, r); r = scanAndReduce(node.getDescription(), p, r); return r; }
@Override public R visitDocComment(DocCommentTree node, P p) { R r = scan(node.getFirstSentence(), p); r = scanAndReduce(node.getBody(), p, r); r = scanAndReduce(node.getBlockTags(), p, r); return r; }
@Override public R visitDocComment(DocCommentTree node, P p) { R r = scan(node.getFirstSentence(), p); r = scanAndReduce(node.getBody(), p, r); r = scanAndReduce(node.getBlockTags(), p, r); return r; }
@Override public R visitSerialField(SerialFieldTree node, P p) { R r = scan(node.getName(), p); r = scanAndReduce(node.getType(), p, r); r = scanAndReduce(node.getDescription(), p, r); return r; }
@Override public R visitParam(ParamTree node, P p) { R r = scan(node.getName(), p); r = scanAndReduce(node.getDescription(), p, r); return r; }
@Override public R visitParam(ParamTree node, P p) { R r = scan(node.getName(), p); r = scanAndReduce(node.getDescription(), p, r); return r; }
@Override public R visitLink(LinkTree node, P p) { R r = scan(node.getReference(), p); r = scanAndReduce(node.getLabel(), p, r); return r; }
@Override public R visitLink(LinkTree node, P p) { R r = scan(node.getReference(), p); r = scanAndReduce(node.getLabel(), p, r); return r; }
@Override public R visitThrows(ThrowsTree node, P p) { R r = scan(node.getExceptionName(), p); r = scanAndReduce(node.getDescription(), p, r); return r; }
@Override public R visitThrows(ThrowsTree node, P p) { R r = scan(node.getExceptionName(), p); r = scanAndReduce(node.getDescription(), p, r); return r; }