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

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/WebKit/Source/core/dom/
NodeTraversal.h 91 if (current.nextSibling())
92 return current.nextSibling();
103 if (current.nextSibling())
104 return current.nextSibling();
110 if (current.nextSibling())
111 return current.nextSibling();
119 if (current.nextSibling())
120 return current.nextSibling();
137 child = child->nextSibling();
ChildNode.h 22 return ElementTraversal::nextSibling(node);
ChildNodeList.cpp 52 for (Node* next = currentNode.nextSibling(); next; next = next->nextSibling()) {
MutationRecord.h 50 static PassRefPtrWillBeRawPtr<MutationRecord> createChildList(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling);
65 virtual Node* nextSibling() { return 0; }
MutationRecord.idl 40 readonly attribute Node nextSibling;
NodeTraversal.cpp 78 ASSERT(!current.nextSibling());
80 if (parent->nextSibling())
81 return parent->nextSibling();
88 ASSERT(!current.nextSibling());
93 if (parent->nextSibling())
94 return parent->nextSibling();
145 if (!current.nextSibling())
147 Node* next = current.nextSibling();
Text.cpp 68 while (Node* nextSibling = this->nextSibling()) {
69 if (nextSibling->nodeType() != TEXT_NODE)
72 RefPtrWillBeRawPtr<Text> nextText = toText(nextSibling);
122 parentNode()->insertBefore(newText.get(), nextSibling(), exceptionState);
151 for (const Node* n = t->nextSibling(); n; n = n->nextSibling()) {
168 Node* onePastEndText = endText->nextSibling();
170 for (const Node* n = startText; n != onePastEndText; n = n->nextSibling()) {
180 for (const Node* n = startText; n != onePastEndText; n = n->nextSibling()) {
    [all...]
ChildFrameDisconnector.cpp 31 for (Node* child = root().firstChild(); child; child = child->nextSibling())
46 for (Node* child = root.firstChild(); child; child = child->nextSibling())
90 for (Node* child = node.firstChild(); child; child = child->nextSibling())
TreeWalker.idl 36 [RaisesException] Node nextSibling();
MutationRecord.cpp 47 ChildListRecord(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling)
52 , m_nextSibling(nextSibling)
72 virtual Node* nextSibling() OVERRIDE { return m_nextSibling.get(); }
164 virtual Node* nextSibling() OVERRIDE { return m_record->nextSibling(); }
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));
TreeWalker.cpp 93 if (node->nextSibling()) {
94 node = node->nextSibling();
176 Node* TreeWalker::nextSibling(ExceptionState& exceptionState)
182 for (RefPtrWillBeRawPtr<Node> sibling = node->nextSibling(); sibling; ) {
200 sibling = sibling->nextSibling();
266 while (Node* nextSibling = NodeTraversal::nextSkippingChildren(*node, root())) {
267 node = nextSibling;
ChildListMutationScope.cpp 89 return isEmpty() || (m_lastAdded == child->previousSibling() && m_nextSibling == child->nextSibling());
103 m_nextSibling = child->nextSibling();
126 m_nextSibling = child->nextSibling();
129 m_nextSibling = child->nextSibling();
  /external/chromium_org/third_party/WebKit/Source/core/frame/
FrameClient.h 23 virtual Frame* nextSibling() const = 0;
  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLTableRowsCollection.cpp 53 if (HTMLTableRowElement* row = Traversal<HTMLTableRowElement>::nextSibling(*previous))
62 child = Traversal<HTMLElement>::nextSibling(*previous->parentNode());
63 for (; child; child = Traversal<HTMLElement>::nextSibling(*child)) {
74 child = Traversal<HTMLElement>::nextSibling(*previous);
76 child = Traversal<HTMLElement>::nextSibling(*previous->parentNode());
77 for (; child; child = Traversal<HTMLElement>::nextSibling(*child)) {
90 child = Traversal<HTMLElement>::nextSibling(*previous->parentNode());
91 for (; child; child = Traversal<HTMLElement>::nextSibling(*child)) {
HTMLPictureElement.cpp 27 for (HTMLImageElement* imageElement = Traversal<HTMLImageElement>::firstChild(*this); imageElement; imageElement = Traversal<HTMLImageElement>::nextSibling(*imageElement)) {
HTMLTableRowElement.cpp 76 for (HTMLTableRowElement* row = Traversal<HTMLTableRowElement>::firstChild(*head); row; row = Traversal<HTMLTableRowElement>::nextSibling(*row)) {
83 for (HTMLElement* tbody = Traversal<HTMLElement>::firstChild(*table, HasHTMLTagName(tbodyTag)); tbody; tbody = Traversal<HTMLElement>::nextSibling(*tbody, HasHTMLTagName(tbodyTag))) {
84 for (HTMLTableRowElement* row = Traversal<HTMLTableRowElement>::firstChild(*tbody); row; row = Traversal<HTMLTableRowElement>::nextSibling(*row)) {
92 for (HTMLTableRowElement* row = Traversal<HTMLTableRowElement>::firstChild(*foot); row; row = Traversal<HTMLTableRowElement>::nextSibling(*row)) {
  /external/chromium_org/third_party/WebKit/Source/web/
RemoteFrameClient.cpp 44 Frame* RemoteFrameClient::nextSibling() const
46 return toCoreFrame(m_webFrame->nextSibling());
RemoteFrameClient.h 25 virtual Frame* nextSibling() const OVERRIDE;
  /external/chromium_org/third_party/WebKit/Source/core/svg/
SVGAltGlyphItemElement.cpp 47 for (SVGGlyphRefElement* glyph = Traversal<SVGGlyphRefElement>::firstChild(*this); glyph; glyph = Traversal<SVGGlyphRefElement>::nextSibling(*glyph)) {
  /external/chromium_org/third_party/WebKit/Source/core/editing/
MergeIdenticalElementsCommand.cpp 42 ASSERT(m_element1->nextSibling() == m_element2);
47 if (m_element1->nextSibling() != m_element2 || !m_element1->hasEditableStyle() || !m_element2->hasEditableStyle())
80 for (Node* child = m_element2->firstChild(); child && child != atChild; child = child->nextSibling())
  /external/chromium_org/chrome/browser/resources/
about_credits.js 8 var licence = o.nextSibling;
12 licence = licence.nextSibling;
  /external/chromium_org/third_party/WebKit/Source/core/page/
FrameTree.cpp 55 for (Frame* child = firstChild(); child; child = child->tree().nextSibling()) {
100 Frame* FrameTree::nextSibling() const
104 return m_thisFrame->client()->nextSibling();
182 for (Frame* result = firstChild(); result; result = result->tree().nextSibling()) {
202 for (Frame* child = firstChild(); child; child = child->tree().nextSibling())
214 for (Frame* result = firstChild(); result; result = result->tree().nextSibling()) {
237 for (Frame* result = firstChild(); result; result = result->tree().nextSibling())
244 for (Frame* child = firstChild(); child; child = child->tree().nextSibling())
323 Frame* sibling = nextSibling();
334 sibling = frame->tree().nextSibling();
    [all...]
  /external/jsilver/src/com/google/clearsilver/jsilver/data/
NestedMapData.java 70 private NestedMapData nextSibling = null;
105 curr = curr.nextSibling;
116 sym.lastChild.nextSibling = data;
136 prevSibling.nextSibling = nextSibling;
138 parent.firstChild = nextSibling;
140 if (nextSibling != null) {
141 nextSibling.prevSibling = prevSibling;
272 return nextSibling == null;
276 return nextSibling;
    [all...]
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/
treeoutline.js 112 previousChild.nextSibling = child;
121 child.nextSibling = nextChild;
123 child.nextSibling = null;
168 else if (child.nextSibling)
169 child.nextSibling.select();
175 child.previousSibling.nextSibling = child.nextSibling;
176 if (child.nextSibling)
177 child.nextSibling.previousSibling = child.previousSibling;
187 child.nextSibling = null
    [all...]
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/components/
Section.js 147 childElement = childElement.nextSibling;
169 get nextSibling()
173 curElement = curElement.nextSibling;

Completed in 700 milliseconds

1 2 3 4 5 6 7 8 91011>>