@Override
public TreeElement addInternal(TreeElement first, ASTNode last, ASTNode anchor, Boolean before) {
boolean needToAddNewline = false;
if (first == last && first.getElementType() == DOC_TAG) {
if (anchor == null) {
anchor = getLastChildNode(); // this is a '*/'
final ASTNode prevBeforeWS =
TreeUtil.skipElementsBack(anchor.getTreePrev(), ElementType.JAVA_WHITESPACE_BIT_SET);
if (prevBeforeWS != null) {
anchor = prevBeforeWS;
before = Boolean.FALSE;
} else {
before = Boolean.TRUE;
}
needToAddNewline = true;
}
if (anchor.getElementType() != DOC_TAG) {
final CharTable charTable = SharedImplUtil.findCharTableByTree(this);
final TreeElement newLine =
Factory.createSingleLeafElement(DOC_COMMENT_DATA, "\n", 0, 1, charTable, getManager());
final TreeElement leadingAsterisk =
Factory.createSingleLeafElement(
DOC_COMMENT_LEADING_ASTERISKS, "*", 0, 1, charTable, getManager());
final TreeElement commentData =
Factory.createSingleLeafElement(DOC_COMMENT_DATA, " ", 0, 1, charTable, getManager());
final TreeElement indentWS =
Factory.createSingleLeafElement(DOC_COMMENT_DATA, " ", 0, 1, charTable, getManager());
newLine.getTreeParent().addChild(indentWS);
newLine.getTreeParent().addChild(leadingAsterisk);
newLine.getTreeParent().addChild(commentData);
super.addInternal(newLine, commentData, anchor, Boolean.FALSE);
anchor = commentData;
before = Boolean.FALSE;
} else {
needToAddNewline = true;
}
}
if (before) anchor.getTreeParent().addChildren(first, last.getTreeNext(), anchor);
else anchor.getTreeParent().addChildren(first, last.getTreeNext(), anchor.getTreeNext());
if (needToAddNewline) {
if (first.getTreePrev() != null && first.getTreePrev().getElementType() == DOC_TAG) {
addNewLineToTag((CompositeElement) first.getTreePrev(), getProject());
}
if (first.getTreeNext() != null && first.getTreeNext().getElementType() == DOC_TAG) {
addNewLineToTag((CompositeElement) first, getProject());
} else {
removeEndingAsterisksFromTag((CompositeElement) first);
}
}
return first;
}
public final int getStartOffsetInParent() {
if (myParent == null) return -1;
int offsetInParent = myStartOffsetInParent;
if (offsetInParent != -1) return offsetInParent;
synchronized (START_OFFSET_LOCK) {
TreeElement cur = this;
offsetInParent = myStartOffsetInParent;
if (offsetInParent != -1) return offsetInParent;
ApplicationManager.getApplication().assertReadAccessAllowed();
while (true) {
TreeElement prev = cur.getTreePrev();
if (prev == null) break;
cur = prev;
offsetInParent = cur.myStartOffsetInParent;
if (offsetInParent != -1) break;
}
if (offsetInParent == -1) {
cur.myStartOffsetInParent = offsetInParent = 0;
}
while (cur != this) {
TreeElement next = cur.getTreeNext();
offsetInParent += cur.getTextLength();
next.myStartOffsetInParent = offsetInParent;
cur = next;
}
return offsetInParent;
}
}
// remove nodes from this[including] to end[excluding] from the parent
protected final void rawRemoveUpToWithoutNotifications(TreeElement end, boolean invalidate) {
if (this == end) return;
final CompositeElement parent = getTreeParent();
final TreeElement startPrev = getTreePrev();
final TreeElement endPrev = end != null ? end.getTreePrev() : null;
assert end == null || end.getTreeParent() == parent : "Trying to remove non-child";
if (end != null) {
TreeElement element;
for (element = this; element != end && element != null; element = element.getTreeNext()) ;
assert element == end : end + " is not successor of " + this + " in the .getTreeNext() chain";
}
if (parent != null) {
if (this == parent.getFirstChildNode()) {
parent.setFirstChildNode(end);
}
if (end == null) {
parent.setLastChildNode(startPrev);
}
}
if (startPrev != null) {
startPrev.setTreeNext(end);
}
if (end != null) {
end.setTreePrev(startPrev);
}
setTreePrev(null);
if (endPrev != null) {
endPrev.setTreeNext(null);
}
if (parent != null) {
for (TreeElement element = this; element != null; element = element.getTreeNext()) {
element.setTreeParent(null);
if (invalidate) {
element.onInvalidated();
}
}
}
DebugUtil.checkTreeStructure(parent);
DebugUtil.checkTreeStructure(this);
}