Tree function ( Tree arg0 , Predicate < Tree > arg1 ) { if ( arg1 . test ( arg0 ) ) return arg0 ; int loc0 = arg0 . getChildCount ( ) ; for ( int loc1 = 0 ; loc1 < loc0 ; loc1 ++ ) { Tree loc2 = findNodeSuchThat ( arg0 . getChild ( loc1 ) , arg1 ) ; if ( loc2 != null ) return loc2 ; } return null ; }
return first node satisfying the pred concode_field_sep PlaceHolder placeHolder concode_field_sep List<? extends Tree> getAncestors concode_elem_sep Collection<ParseTree> findAllTokenNodes concode_elem_sep ParserRuleContext getRootOfSubtreeEnclosingRegion concode_elem_sep List<ParseTree> descendants concode_elem_sep String getNodeText concode_elem_sep String getNodeText concode_elem_sep boolean isAncestorOf concode_elem_sep List<Tree> getChildren concode_elem_sep List<ParseTree> getDescendants concode_elem_sep Collection<ParseTree> findAllRuleNodes concode_elem_sep void stripChildrenOutOfRange concode_elem_sep String toStringTree concode_elem_sep String toStringTree concode_elem_sep String toStringTree concode_elem_sep List<ParseTree> findAllNodes concode_elem_sep void _findAllNodes