Lines Matching defs:startContainer
309 Node* startContainer = start.containerNode();
310 if (!startContainer)
319 m_startContainer = startContainer;
324 // Figure out the initial value of m_shadowDepth: the depth of startContainer's tree scope from
326 const TreeScope* commonAncestorTreeScope = startContainer->treeScope().commonAncestorTreeScope(endContainer->treeScope());
329 for (const TreeScope* treeScope = &startContainer->treeScope(); treeScope != commonAncestorTreeScope; treeScope = treeScope->parentTreeScope())
333 if (startContainer->offsetInCharacters())
334 m_node = startContainer;
335 else if (Node* child = NodeTraversal::childAt(*startContainer, startOffset))
338 m_node = startContainer;
340 m_node = NodeTraversal::nextSkippingChildren(*startContainer);
1217 Node* node = startContainer();
1245 Node* TextIterator::startContainer() const
1256 return startContainer();
1261 return createLegacyEditingPosition(startContainer(), startOffset());
1299 Node* startNode = r->startContainer();
1592 Node* SimplifiedBackwardsTextIterator::startContainer() const
1653 Node* n = r->startContainer();
1668 Node* CharacterIterator::startContainer() const
1670 return m_textIterator.startContainer();
1702 Node* n = m_textIterator.startContainer();
1715 Node* n = m_textIterator.startContainer();
1803 Node* n = m_textIterator.startContainer();
2343 beforeStartRange->setEnd(it.startContainer(), it.startOffset(), IGNORE_EXCEPTION);
