Home | History | Annotate | Download | only in dom

Lines Matching refs:anchorNode

82     Position(PassRefPtrWillBeRawPtr<Node> anchorNode, LegacyEditingOffset);
85 Position(PassRefPtrWillBeRawPtr<Node> anchorNode, AnchorType);
90 Position(PassRefPtrWillBeRawPtr<Node> anchorNode, int offset, AnchorType);
123 Node* anchorNode() const { return m_anchorNode.get(); }
140 void moveToPosition(PassRefPtrWillBeRawPtr<Node> anchorNode, int offset);
208 static AnchorType anchorTypeForLegacyEditingPosition(Node* anchorNode, int offset);
228 return a.anchorNode() == b.anchorNode() && a.deprecatedEditingOffset() == b.deprecatedEditingOffset() && a.anchorType() == b.anchorType();
256 inline Position positionBeforeNode(Node* anchorNode)
258 ASSERT(anchorNode);
259 return Position(anchorNode, Position::PositionIsBeforeAnchor);
262 inline Position positionAfterNode(Node* anchorNode)
264 ASSERT(anchorNode);
265 return Position(anchorNode, Position::PositionIsAfterAnchor);
274 inline Position firstPositionInNode(Node* anchorNode)
276 if (anchorNode->isTextNode())
277 return Position(anchorNode, 0, Position::PositionIsOffsetInAnchor);
278 return Position(anchorNode, Position::PositionIsBeforeChildren);
281 inline Position lastPositionInNode(Node* anchorNode)
283 if (anchorNode->isTextNode())
284 return Position(anchorNode, lastOffsetInNode(anchorNode), Position::PositionIsOffsetInAnchor);
285 return Position(anchorNode, Position::PositionIsAfterChildren);
288 inline int minOffsetForNode(Node* anchorNode, int offset)
290 if (anchorNode->offsetInCharacters())
291 return std::min(offset, anchorNode->maxCharacterOffset());
294 for (Node* node = anchorNode->firstChild(); node && newOffset < offset; node = node->nextSibling())
300 inline bool offsetIsBeforeLastNodeOffset(int offset, Node* anchorNode)
302 if (anchorNode->offsetInCharacters())
303 return offset < anchorNode->maxCharacterOffset();
306 for (Node* node = anchorNode->firstChild(); node && currentOffset < offset; node = node->nextSibling())