Searched refs:highestRoot (Results 1 – 4 of 4) sorted by relevance
396 Node* highestRoot = highestEditableRoot(deepEquivalent()); in honorEditableBoundaryAtOrBefore() local399 if (highestRoot && !pos.deepEquivalent().node()->isDescendantOf(highestRoot)) in honorEditableBoundaryAtOrBefore()405 if (highestEditableRoot(pos.deepEquivalent()) == highestRoot) in honorEditableBoundaryAtOrBefore()410 if (!highestRoot) in honorEditableBoundaryAtOrBefore()414 return lastEditablePositionBeforePositionInRoot(pos.deepEquivalent(), highestRoot); in honorEditableBoundaryAtOrBefore()422 Node* highestRoot = highestEditableRoot(deepEquivalent()); in honorEditableBoundaryAtOrAfter() local425 if (highestRoot && !pos.deepEquivalent().node()->isDescendantOf(highestRoot)) in honorEditableBoundaryAtOrAfter()431 if (highestEditableRoot(pos.deepEquivalent()) == highestRoot) in honorEditableBoundaryAtOrAfter()436 if (!highestRoot) in honorEditableBoundaryAtOrAfter()440 return firstEditablePositionAfterPositionInRoot(pos.deepEquivalent(), highestRoot); in honorEditableBoundaryAtOrAfter()
141 Node* highestRoot = editableRootForPosition(position); in highestEditableRoot() local142 if (!highestRoot) in highestEditableRoot()145 node = highestRoot; in highestEditableRoot()148 highestRoot = node; in highestEditableRoot()154 return highestRoot; in highestEditableRoot()277 …siblePosition firstEditablePositionAfterPositionInRoot(const Position& position, Node* highestRoot) in firstEditablePositionAfterPositionInRoot() argument280 …comparePositions(position, firstDeepEditingPositionForNode(highestRoot)) == -1 && highestRoot->isC… in firstEditablePositionAfterPositionInRoot()281 return firstDeepEditingPositionForNode(highestRoot); in firstEditablePositionAfterPositionInRoot()289 while (p.node() && !isEditablePosition(p) && p.node()->isDescendantOf(highestRoot)) in firstEditablePositionAfterPositionInRoot()292 if (p.node() && p.node() != highestRoot && !p.node()->isDescendantOf(highestRoot)) in firstEditablePositionAfterPositionInRoot()[all …]
555 Node* highestRoot = highestEditableRoot(p); in previousLinePosition() local585 if (highestEditableRoot(Position(n, 0)) != highestRoot) in previousLinePosition()657 Node* highestRoot = highestEditableRoot(p); in nextLinePosition() local687 if (highestEditableRoot(Position(n, 0)) != highestRoot) in nextLinePosition()1044 Node* highestRoot = highestEditableRoot(visiblePosition.deepEquivalent()); in startOfEditableContent() local1045 if (!highestRoot) in startOfEditableContent()1048 return firstDeepEditingPositionForNode(highestRoot); in startOfEditableContent()1053 Node* highestRoot = highestEditableRoot(visiblePosition.deepEquivalent()); in endOfEditableContent() local1054 if (!highestRoot) in endOfEditableContent()1057 return lastDeepEditingPositionForNode(highestRoot); in endOfEditableContent()
27374 this function moves out of highestRoot. Re-wrote so as to not duplicate code inside