Searched refs:previousSibling (Results 1 - 25 of 164) sorted by relevance

1234567

/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DNodeTraversal.cpp117 if (current.previousSibling()) {
118 Node* previous = current.previousSibling();
130 if (current.previousSibling())
131 return current.previousSibling();
135 if (parent->previousSibling())
136 return parent->previousSibling();
155 ASSERT(!current.previousSibling());
159 if (parent->previousSibling())
160 return parent->previousSibling();
171 if (current.previousSibling())
[all...]
H A DChildNode.h17 return ElementTraversal::previousSibling(node);
H A DChildNodeList.cpp62 for (Node* previous = currentNode.previousSibling(); previous; previous = previous->previousSibling()) {
H A DMutationRecord.idl39 readonly attribute Node previousSibling;
H A DMutationRecord.h50 static PassRefPtrWillBeRawPtr<MutationRecord> createChildList(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling);
64 virtual Node* previousSibling() { return 0; } function in class:blink::MutationRecord
H A DTreeWalker.cpp126 if (node->previousSibling()) {
127 node = node->previousSibling();
139 Node* TreeWalker::previousSibling(ExceptionState& exceptionState) function in class:blink::TreeWalker
145 for (RefPtrWillBeRawPtr<Node> sibling = node->previousSibling(); sibling; ) {
163 sibling = sibling->previousSibling();
217 while (Node* previousSibling = node->previousSibling()) {
218 node = previousSibling;
H A DTreeWalker.idl35 [RaisesException] Node previousSibling();
H A DMutationRecord.cpp47 ChildListRecord(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling) argument
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) argument
195 return adoptRefWillBeNoop(new ChildListRecord(target, added, removed, previousSibling, nextSibling));
H A DPositionIterator.cpp79 m_anchorNode = m_nodeAfterPositionInAnchor->previousSibling();
110 return (!m_anchorNode->hasChildren() && !m_offsetInAnchor) || (m_nodeAfterPositionInAnchor && !m_nodeAfterPositionInAnchor->previousSibling());
128 return !m_nodeAfterPositionInAnchor->previousSibling();
H A DChildListMutationScope.cpp89 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();
H A DNodeRenderingTraversal.h61 Node* previousSibling(const Node*);
H A DTreeWalker.h54 Node* previousSibling(ExceptionState&);
H A DNodeRenderingTraversal.cpp94 Node* previousSibling(const Node* node) function in namespace:blink::NodeRenderingTraversal
101 walker.previousSibling();
122 Node* previousNode = previousSibling(node);
234 for (Node* sibling = NodeRenderingTraversal::previousSibling(node); sibling; sibling = NodeRenderingTraversal::previousSibling(sibling)) {
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DRenderObjectChildList.cpp97 if (oldChild->previousSibling())
98 oldChild->previousSibling()->setNextSibling(oldChild->nextSibling());
100 oldChild->nextSibling()->setPreviousSibling(oldChild->previousSibling());
105 setLastChild(oldChild->previousSibling());
144 RenderObject* previousSibling = beforeChild->previousSibling(); local
145 if (previousSibling)
146 previousSibling->setNextSibling(newChild);
147 newChild->setPreviousSibling(previousSibling);
H A DRenderTableRow.h127 void previousSibling() const WTF_DELETED_FUNCTION;
137 return toRenderTableRow(RenderObject::previousSibling());
/external/chromium_org/third_party/WebKit/Source/web/
H A DRemoteFrameClient.cpp39 Frame* RemoteFrameClient::previousSibling() const function in class:blink::RemoteFrameClient
41 return toCoreFrame(m_webFrame->previousSibling());
H A DRemoteFrameClient.h24 virtual Frame* previousSibling() const OVERRIDE;
/external/chromium_org/third_party/WebKit/Source/core/editing/
H A DApplyBlockElementCommand.cpp234 start = firstPositionInOrBeforeNode(endContainer->previousSibling());
237 m_endOfLastParagraph = lastPositionInOrAfterNode(endContainer->previousSibling());
241 end = lastPositionInNode(endContainer->previousSibling());
263 if (text == start.containerNode() && text->previousSibling() && text->previousSibling()->isTextNode()) {
265 start = Position(toText(text->previousSibling()), start.offsetInContainerNode());
267 if (text == end.containerNode() && text->previousSibling() && text->previousSibling()->isTextNode()) {
269 end = Position(toText(text->previousSibling()), end.offsetInContainerNode());
274 if (text->previousSibling()
[all...]
/external/chromium_org/third_party/WebKit/Source/core/frame/
H A DFrameClient.h22 virtual Frame* previousSibling() const = 0;
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/components/
H A DSection.js163 childElement = childElement.previousSibling;
179 get previousSibling()
183 curElement = curElement.previousSibling;
/external/chromium_org/third_party/WebKit/Source/core/rendering/svg/
H A DRenderSVGTransformableContainer.cpp43 for (node = node->previousSibling(); node; node = node->previousSibling()) {
/external/chromium_org/third_party/WebKit/Source/core/css/
H A DSiblingTraversalStrategies.h62 return !ElementTraversal::previousSibling(element);
72 return !ElementTraversal::previousSibling(element, HasTagName(type));
83 for (const Element* sibling = ElementTraversal::previousSibling(element); sibling; sibling = ElementTraversal::previousSibling(*sibling))
92 for (const Element* sibling = ElementTraversal::previousSibling(element, HasTagName(type)); sibling; sibling = ElementTraversal::previousSibling(*sibling, HasTagName(type)))
/external/chromium_org/third_party/WebKit/Source/core/html/
H A DHTMLTableRowsCollection.cpp103 for (HTMLElement* tfoot = Traversal<HTMLElement>::lastChild(table, HasHTMLTagName(tfootTag)); tfoot; tfoot = Traversal<HTMLElement>::previousSibling(*tfoot, HasHTMLTagName(tfootTag))) {
108 for (HTMLElement* child = Traversal<HTMLElement>::lastChild(table); child; child = Traversal<HTMLElement>::previousSibling(*child)) {
117 for (HTMLElement* thead = Traversal<HTMLElement>::lastChild(table, HasHTMLTagName(theadTag)); thead; thead = Traversal<HTMLElement>::previousSibling(*thead, HasHTMLTagName(theadTag))) {
/external/chromium_org/chrome/common/extensions/docs/examples/api/downloads/download_filename_controller/
H A Doptions.js34 var sib = rule.node.previousSibling;
62 this.getElement('move-up').disabled = !this.node.previousSibling;
/external/chromium_org/third_party/WebKit/Source/core/page/
H A DFrameTree.h46 Frame* previousSibling() const;

Completed in 382 milliseconds

1234567