Lines Matching refs:m_end
57 , m_end(m_ownerDocument)
74 , m_end(m_ownerDocument)
118 m_end.setToStartOfNode(document);
149 return m_end.container();
159 return m_end.offset();
169 return commonAncestorContainer(m_start.container(), m_end.container());
190 return m_start == m_end;
218 Node* endRootContainer = m_end.container();
227 else if (compareBoundaryPoints(m_start, m_end, ec) > 0) {
255 m_end.set(refNode, offset, childNode);
258 Node* endRootContainer = m_end.container();
267 if (compareBoundaryPoints(m_start, m_end, ec) > 0) {
281 m_end = m_start;
283 m_start = m_end;
314 && compareBoundaryPoints(refNode, offset, m_end.container(), m_end.offset(), ec) <= 0 && !ec;
351 if (compareBoundaryPoints(refNode, offset, m_end.container(), m_end.offset(), ec) > 0 && !ec)
445 return compareBoundaryPoints(m_end, sourceRange->m_start, ec);
447 return compareBoundaryPoints(m_end, sourceRange->m_end, ec);
449 return compareBoundaryPoints(m_start, sourceRange->m_end, ec);
557 return m_start.container() && compareBoundaryPoints(m_start, m_end, ec) <= 0 && !ec;
682 if (m_start.container() == m_end.container()) {
683 processContentsBetweenOffsets(action, fragment, m_start.container(), m_start.offset(), m_end.offset(), ec);
689 Node* partialEnd = highestAncestorUnderCommonRoot(m_end.container(), commonRoot);
715 if (m_end.container() != commonRoot) {
716 rightContents = processContentsBetweenOffsets(action, 0, m_end.container(), 0, m_end.offset(), ec);
717 rightContents = processAncestorsAndTheirSiblings(action, m_end.container(), ProcessContentsBackward, rightContents, commonRoot, ec);
724 Node* processEnd = childOfCommonRootBeforeOffset(m_end.container(), m_end.offset(), commonRoot);
734 m_end = m_start;
997 bool collapsed = m_start == m_end;
1009 m_end.setToBeforeChild(newText.get());
1023 m_end.set(m_start.container(), startOffset + numNewChildren, lastChild.get());
1042 int end = (n == m_end.container()) ? min(max(start, m_end.offset()), length) : length;
1104 m_end.clear();
1201 return Range::create(m_ownerDocument, m_start.container(), m_start.offset(), m_end.container(), m_end.offset());
1384 m_end.setToEndOfNode(refNode);
1454 Node* endNonTextContainer = m_end.container();
1540 for (Node* n = m_end.container(); n; n = n->parentNode()) {
1593 if (!m_start.container() || !m_end.container())
1595 if (m_end.container()->offsetInCharacters())
1596 return m_end.container()->traverseNextSibling();
1597 if (Node* child = m_end.container()->childNode(m_end.offset()))
1599 return m_end.container()->traverseNextSibling();
1616 Node* endContainer = m_end.container();
1628 int endOffset = node == endContainer ? m_end.offset() : numeric_limits<int>::max();
1636 Node* endContainer = m_end.container();
1648 int endOffset = node == endContainer ? m_end.offset() : numeric_limits<int>::max();
1660 if (!m_start.container() || !m_end.container())
1670 result += String::number(m_end.offset());
1672 m_end.container()->formatForDebugger(s, FormatBufferSize);
1710 if (!m_end.container())
1712 if (!m_end.container()->offsetInCharacters())
1713 return m_end.container()->childNodeCount();
1714 return m_end.container()->maxCharacterOffset();
1731 boundaryNodeChildrenChanged(m_end, container);
1756 boundaryNodeChildrenWillBeRemoved(m_end, container);
1781 boundaryNodeWillBeRemoved(m_end, node);
1799 boundaryTextInserted(m_end, text, offset, length);
1820 boundaryTextRemoved(m_end, text, offset, length);
1840 boundaryTextNodesMerged(m_end, oldNode, offset);
1862 boundaryTextNodesSplit(m_end, oldNode);
1930 Node* endContainer = m_end.container();
1954 int endOffset = (node == endContainer) ? m_end.offset() : INT_MAX;
