HomeSort by relevance Sort by last modified time
    Searched refs:previousSibling (Results 1 - 25 of 200) sorted by null

1 2 3 4 5 6 7 8

  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderObjectChildList.cpp 94 if (oldChild->previousSibling())
95 oldChild->previousSibling()->setNextSibling(oldChild->nextSibling());
97 oldChild->nextSibling()->setPreviousSibling(oldChild->previousSibling());
102 setLastChild(oldChild->previousSibling());
141 RenderObject* previousSibling = beforeChild->previousSibling();
142 if (previousSibling)
143 previousSibling->setNextSibling(newChild);
144 newChild->setPreviousSibling(previousSibling);
RenderTableRow.h 127 void previousSibling() const WTF_DELETED_FUNCTION;
137 return toRenderTableRow(RenderObject::previousSibling());
CounterNode.h 59 CounterNode* previousSibling() const { return m_previousSibling; }
  /external/chromium_org/third_party/WebKit/Source/core/dom/
NodeTraversal.cpp 111 if (current.previousSibling()) {
112 Node* previous = current.previousSibling();
124 if (current.previousSibling())
125 return current.previousSibling();
129 if (parent->previousSibling())
130 return parent->previousSibling();
149 ASSERT(!current.previousSibling());
153 if (parent->previousSibling())
154 return parent->previousSibling();
165 if (current.previousSibling())
    [all...]
ChildNode.h 17 return ElementTraversal::previousSibling(node);
MutationRecord.h 48 static PassRefPtrWillBeRawPtr<MutationRecord> createChildList(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling);
65 virtual Node* previousSibling() { return 0; }
MutationRecord.idl 39 readonly attribute Node previousSibling;
TreeWalker.cpp 127 if (node->previousSibling()) {
128 node = node->previousSibling();
140 Node* TreeWalker::previousSibling(ExceptionState& exceptionState)
146 for (RefPtrWillBeRawPtr<Node> sibling = node->previousSibling(); sibling; ) {
164 sibling = sibling->previousSibling();
218 while (Node* previousSibling = node->previousSibling()) {
219 node = previousSibling;
TreeWalker.idl 35 [RaisesException] Node previousSibling();
MutationRecord.cpp 47 ChildListRecord(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling)
51 , m_previousSibling(previousSibling)
71 virtual Node* previousSibling() OVERRIDE { return m_previousSibling.get(); }
163 virtual Node* previousSibling() OVERRIDE { return m_record->previousSibling(); }
193 PassRefPtrWillBeRawPtr<MutationRecord> MutationRecord::createChildList(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling)
195 return adoptRefWillBeNoop(new ChildListRecord(target, added, removed, previousSibling, nextSibling));
PositionIterator.cpp 79 m_anchorNode = m_nodeAfterPositionInAnchor->previousSibling();
110 return (!m_anchorNode->hasChildren() && !m_offsetInAnchor) || (m_nodeAfterPositionInAnchor && !m_nodeAfterPositionInAnchor->previousSibling());
128 return !m_nodeAfterPositionInAnchor->previousSibling();
ChildListMutationScope.cpp 89 return isEmpty() || (m_lastAdded == child->previousSibling() && m_nextSibling == child->nextSibling());
102 m_previousSibling = child->previousSibling();
125 m_previousSibling = child->previousSibling();
127 m_lastAdded = child->previousSibling();
ChildNodeList.cpp 64 while ((previous = previous->previousSibling())) {
NodeRenderingTraversal.h 62 Node* previousSibling(const Node*);
TreeWalker.h 53 Node* previousSibling(ExceptionState&);
NodeRenderingTraversal.cpp 96 Node* previousSibling(const Node* node)
103 walker.previousSibling();
124 Node* previousNode = previousSibling(node);
236 for (Node* sibling = NodeRenderingTraversal::previousSibling(node); sibling; sibling = NodeRenderingTraversal::previousSibling(sibling)) {
  /external/chromium_org/third_party/WebKit/Source/core/frame/
FrameClient.h 19 virtual Frame* previousSibling() const = 0;
  /external/chromium_org/third_party/WebKit/Source/web/
RemoteFrameClient.cpp 37 WebCore::Frame* RemoteFrameClient::previousSibling() const
39 return toWebCoreFrame(m_webFrame->previousSibling());
RemoteFrameClient.h 24 virtual WebCore::Frame* previousSibling() const OVERRIDE;
  /external/chromium_org/third_party/WebKit/Source/core/editing/
ApplyBlockElementCommand.cpp 233 start = firstPositionInOrBeforeNode(endContainer->previousSibling());
236 m_endOfLastParagraph = lastPositionInOrAfterNode(endContainer->previousSibling());
240 end = lastPositionInNode(endContainer->previousSibling());
262 if (text == start.containerNode() && text->previousSibling() && text->previousSibling()->isTextNode()) {
264 start = Position(toText(text->previousSibling()), start.offsetInContainerNode());
266 if (text == end.containerNode() && text->previousSibling() && text->previousSibling()->isTextNode()) {
268 end = Position(toText(text->previousSibling()), end.offsetInContainerNode());
273 if (text->previousSibling()->isTextNode(
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/css/
SiblingTraversalStrategies.h 52 return !ElementTraversal::previousSibling(element);
62 for (const Element* sibling = ElementTraversal::previousSibling(element); sibling; sibling = ElementTraversal::previousSibling(*sibling)) {
81 for (const Element* sibling = ElementTraversal::previousSibling(element); sibling; sibling = ElementTraversal::previousSibling(*sibling))
90 for (const Element* sibling = ElementTraversal::previousSibling(element); sibling; sibling = ElementTraversal::previousSibling(*sibling)) {
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/components/
Section.js 163 childElement = childElement.previousSibling;
179 get previousSibling()
183 curElement = curElement.previousSibling;
  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLTableRowsCollection.cpp 111 for (HTMLElement* child = Traversal<HTMLElement>::lastChild(table); child; child = Traversal<HTMLElement>::previousSibling(*child)) {
118 for (HTMLElement* child = Traversal<HTMLElement>::lastChild(table); child; child = Traversal<HTMLElement>::previousSibling(*child)) {
127 for (HTMLElement* child = Traversal<HTMLElement>::lastChild(table); child; child = Traversal<HTMLElement>::previousSibling(*child)) {
  /external/chromium_org/third_party/WebKit/Source/core/page/
FrameTree.h 44 Frame* previousSibling() const;
  /external/chromium_org/third_party/WebKit/Source/core/rendering/svg/
RenderSVGTransformableContainer.cpp 43 while ((node = node->previousSibling())) {

Completed in 317 milliseconds

1 2 3 4 5 6 7 8