@Override public Void visitStartElement(StartElementTree startElementTree, Void unused) { if (CODE_TAGS.contains(startElementTree.getName().toString())) { codeTagNestedDepth++; } return super.visitStartElement(startElementTree, null); }
@Override public Void visitStartElement(StartElementTree startTree, Void unused) { if (PRE_TAGS.contains(startTree.getName().toString())) { startPosStack.offerLast(getEndPosition(startTree, state)); containsAnotherTag = false; } return super.visitStartElement(startTree, null); }
@Override public Void visitStartElement(StartElementTree startElementTree, Void aVoid) { if (startElementTree.getName().toString().equalsIgnoreCase("p")) { DCStartElement node = (DCStartElement) startElementTree; DocTreePath path = getCurrentPath(); int start = (int) node.getSourcePosition((DCDocComment) path.getDocComment()) + node.pos; int end = node.getEndPos((DCDocComment) getCurrentPath().getDocComment()); fixes.add(Optional.of(SuggestedFix.replace(start, end, ""))); // int endPos = startPos + node.getSignature().length(); // String oldName = node.getSignature(); // int idx = oldName.indexOf('#'); // if (idx != -1) { // startPos += idx + 1; // } // state.reportMatch( // describeMatch( // state.getPath().getLeaf(), SuggestedFix.replace(startPos, endPos, with))); // int start = element.pos; // fixes.add(Optional.of(SuggestedFix.replace(start, element.getEndPos()))); } return super.visitStartElement(startElementTree, aVoid); }
@Override public Void visitStartElement(StartElementTree startElementTree, Void unused) { if (CODE_TAGS.contains(startElementTree.getName().toString())) { withinCodeTag = true; } return super.visitStartElement(startElementTree, null); }
tagStack.push(top); super.visitStartElement(tree, ignore);
tagStack.push(top); super.visitStartElement(tree, ignore);