| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| D | HTMLTableRowsCollection.cpp | 62 for (child = previous->nextSibling(); child; child = child->nextSibling()) { in rowAfter()
72 child = previous->parentNode()->nextSibling(); in rowAfter()
73 for (; child; child = child->nextSibling()) { in rowAfter()
75 … for (Node* grandchild = child->firstChild(); grandchild; grandchild = grandchild->nextSibling()) { in rowAfter()
86 child = previous->nextSibling(); in rowAfter()
88 child = previous->parentNode()->nextSibling(); in rowAfter()
89 for (; child; child = child->nextSibling()) { in rowAfter()
93 … for (Node* grandchild = child->firstChild(); grandchild; grandchild = grandchild->nextSibling()) { in rowAfter()
104 child = previous->parentNode()->nextSibling(); in rowAfter()
105 for (; child; child = child->nextSibling()) { in rowAfter()
[all …]
|
| D | HTMLTableRowElement.cpp | 68 for (Node *row = head->firstChild(); row; row = row->nextSibling()) { in rowIndex()
76 for (Node *node = table->firstChild(); node; node = node->nextSibling()) { in rowIndex()
79 for (Node* row = section->firstChild(); row; row = row->nextSibling()) { in rowIndex()
89 for (Node *row = foot->firstChild(); row; row = row->nextSibling()) { in rowIndex()
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| D | NodeTraversal.h | 75 if (current.nextSibling()) in traverseNextTemplate()
76 return current.nextSibling(); in traverseNextTemplate()
89 if (current.nextSibling()) in traverseNextTemplate()
90 return current.nextSibling(); in traverseNextTemplate()
99 if (current.nextSibling()) in traverseNextSkippingChildrenTemplate()
100 return current.nextSibling(); in traverseNextSkippingChildrenTemplate()
111 if (current.nextSibling()) in traverseNextSkippingChildrenTemplate()
112 return current.nextSibling(); in traverseNextSkippingChildrenTemplate()
|
| D | Text.cpp | 68 while (Node* nextSibling = this->nextSibling()) { in mergeNextSiblingNodesIfPossible() local
69 if (nextSibling->nodeType() != TEXT_NODE) in mergeNextSiblingNodesIfPossible()
72 RefPtr<Text> nextText = toText(nextSibling); in mergeNextSiblingNodesIfPossible()
122 parentNode()->insertBefore(newText.get(), nextSibling(), exceptionState); in splitText()
153 while ((n = n->nextSibling())) { in latestLogicallyAdjacentTextNode()
170 Node* onePastEndText = endText->nextSibling(); in wholeText()
172 for (const Node* n = startText; n != onePastEndText; n = n->nextSibling()) { in wholeText()
182 for (const Node* n = startText; n != onePastEndText; n = n->nextSibling()) { in wholeText()
204 n = nodeToRemove->nextSibling(); in replaceWholeText()
209 Node* onePastEndText = endText->nextSibling(); in replaceWholeText()
[all …]
|
| D | NodeTraversal.cpp | 79 ASSERT(!current.nextSibling()); in nextAncestorSibling()
81 if (parent->nextSibling()) in nextAncestorSibling()
82 return parent->nextSibling(); in nextAncestorSibling()
89 ASSERT(!current.nextSibling()); in nextAncestorSibling()
94 if (parent->nextSibling()) in nextAncestorSibling()
95 return parent->nextSibling(); in nextAncestorSibling()
132 if (!current.nextSibling()) in nextPostOrder()
134 Node* next = current.nextSibling(); in nextPostOrder()
|
| D | MutationRecord.cpp | 47 …dded, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node> nextSibling) in ChildListRecord() argument
52 , m_nextSibling(nextSibling) in ChildListRecord()
62 virtual Node* nextSibling() OVERRIDE { return m_nextSibling.get(); } in nextSibling() function in WebCore::__anon614f87eb0111::ChildListRecord
140 virtual Node* nextSibling() OVERRIDE { return m_record->nextSibling(); } in nextSibling() function in WebCore::__anon614f87eb0111::MutationRecordWithNullOldValue
169 …dded, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node> nextSibling) in createChildList() argument
171 return adoptRef(new ChildListRecord(target, added, removed, previousSibling, nextSibling)); in createChildList()
|
| D | TreeWalker.cpp | 94 if (node->nextSibling()) { in firstChild()
95 node = node->nextSibling(); in firstChild()
177 Node* TreeWalker::nextSibling(ScriptState* state) in nextSibling() function in WebCore::TreeWalker
183 for (RefPtr<Node> sibling = node->nextSibling(); sibling; ) { in nextSibling()
201 sibling = sibling->nextSibling(); in nextSibling()
267 while (Node* nextSibling = NodeTraversal::nextSkippingChildren(*node, root())) { in nextNode() local
268 node = nextSibling; in nextNode()
|
| D | ContainerNode.cpp | 73 for (Node* child = firstChild(); child; child = child->nextSibling()) in removeDetachedChildren()
100 for (Node* node = child.firstChild(); node; node = node->nextSibling()) { in isChildTypeAllowed()
240 ASSERT(!newChild.nextSibling()); in insertBeforeCommon()
249 ASSERT(prev->nextSibling() == nextChild); in insertBeforeCommon()
312 RefPtr<Node> next = oldChild->nextSibling(); in replaceChild()
441 Node* next = child->nextSibling(); in removeChild()
480 Node* next = oldChild.nextSibling(); in parserRemoveChild()
534 removeBetween(0, m_firstChild->nextSibling(), *m_firstChild); in removeChildren()
658 for (Node* n = firstChild(); n && !exceptionState.hadException(); n = n->nextSibling()) in cloneChildNodes()
681 } else if (o->nextSibling()) { in getUpperLeftCorner()
[all …]
|
| D | ChildListMutationScope.cpp | 78 …rn isEmpty() || (m_lastAdded == child->previousSibling() && m_nextSibling == child->nextSibling()); in isAddedNodeInOrder()
92 m_nextSibling = child->nextSibling(); in childAdded()
115 m_nextSibling = child->nextSibling(); in willRemoveChild()
118 m_nextSibling = child->nextSibling(); in willRemoveChild()
|
| D | ContainerNode.h | 87 bool hasOneChild() const { return m_firstChild && !m_firstChild->nextSibling(); } in hasOneChild()
188 for (Node* child = firstChild(); child; child = child->nextSibling()) { in attachChildren()
200 for (Node* child = firstChild(); child; child = child->nextSibling()) in detachChildren()
250 for (Node* child = node.firstChild(); child; child = child->nextSibling()) in getChildNodes()
277 m_currentNode = node->nextSibling(); in nextNode()
294 node = node->nextSibling(); in takeSnapshot()
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| D | treeoutline.js | 111 previousChild.nextSibling = child;
120 child.nextSibling = nextChild;
122 child.nextSibling = null;
167 else if (child.nextSibling)
168 child.nextSibling.select();
174 child.previousSibling.nextSibling = child.nextSibling;
175 if (child.nextSibling)
176 child.nextSibling.previousSibling = child.previousSibling;
186 child.nextSibling = null;
219 child.nextSibling = null;
[all …]
|
| D | TimelineGrid.js | 150 divider = divider.nextSibling;
151 dividerLabelBar = dividerLabelBar.nextSibling;
156 var nextDivider = divider.nextSibling;
161 var nextDivider = dividerLabelBar.nextSibling;
|
| D | Section.js | 147 childElement = childElement.nextSibling;
169 get nextSibling() getter in WebInspector.Section
173 curElement = curElement.nextSibling;
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| D | LinkedListMultimap.java | 112 Node<K, V> nextSibling; // the next node with the same key field in LinkedListMultimap.Node
186 @Nullable K key, @Nullable V value, @Nullable Node<K, V> nextSibling) { in addNode() argument
192 } else if (nextSibling == null) { // non-empty list, add to tail in addNode()
199 keyTail.nextSibling = node; in addNode()
205 node.previous = nextSibling.previous; in addNode()
206 node.previousSibling = nextSibling.previousSibling; in addNode()
207 node.next = nextSibling; in addNode()
208 node.nextSibling = nextSibling; in addNode()
209 if (nextSibling.previousSibling == null) { // nextSibling was key head in addNode()
212 nextSibling.previousSibling.nextSibling = node; in addNode()
[all …]
|
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| D | NestedMapData.java | 70 private NestedMapData nextSibling = null; field in NestedMapData
105 curr = curr.nextSibling; in createChildNode()
116 sym.lastChild.nextSibling = data; in createChildNode()
136 prevSibling.nextSibling = nextSibling; in severNode()
138 parent.firstChild = nextSibling; in severNode()
140 if (nextSibling != null) { in severNode()
141 nextSibling.prevSibling = prevSibling; in severNode()
272 return nextSibling == null; in isLastSibling()
276 return nextSibling; in getNextSibling()
353 curr = curr.nextSibling; in getChildNode()
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | LinkedListMultimap.java | 116 Node<K, V> nextSibling; // the next node with the same key field in LinkedListMultimap.Node
190 @Nullable K key, @Nullable V value, @Nullable Node<K, V> nextSibling) { in addNode() argument
196 } else if (nextSibling == null) { // non-empty list, add to tail in addNode()
203 keyTail.nextSibling = node; in addNode()
209 node.previous = nextSibling.previous; in addNode()
210 node.previousSibling = nextSibling.previousSibling; in addNode()
211 node.next = nextSibling; in addNode()
212 node.nextSibling = nextSibling; in addNode()
213 if (nextSibling.previousSibling == null) { // nextSibling was key head in addNode()
216 nextSibling.previousSibling.nextSibling = node; in addNode()
[all …]
|
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| D | MergeIdenticalElementsCommand.cpp | 42 ASSERT(m_element1->nextSibling() == m_element2); in MergeIdenticalElementsCommand()
47 …if (m_element1->nextSibling() != m_element2 || !m_element1->rendererIsEditable() || !m_element2->r… in doApply()
53 for (Node* child = m_element1->firstChild(); child; child = child->nextSibling()) in doApply()
81 …r (Node* child = m_element2->firstChild(); child && child != atChild; child = child->nextSibling()) in doUnapply()
|
| D | ModifySelectionListLevel.cpp | 81 RenderObject* r = endListChild->renderer()->nextSibling(); in getStartEndListChildren()
95 Node* next = node->nextSibling(); in insertSiblingNodeRangeBefore()
110 Node* next = node->nextSibling(); in insertSiblingNodeRangeAfter()
126 Node* next = node->nextSibling(); in appendSiblingNodeRange()
261 …Node* nextItem = endListChild->renderer()->nextSibling() ? endListChild->renderer()->nextSibling()… in doApply()
|
| D | ApplyStyleCommand.cpp | 436 next = node->nextSibling(); in cleanupUnstyledAppleStyleSpans()
484 if (before ? currentNode->previousSibling() : currentNode->nextSibling()) in splitAncestorsWithUnicodeBidi()
485 splitElement(parent, before ? currentNode : currentNode->nextSibling()); in splitAncestorsWithUnicodeBidi()
787 Node* sibling = node->nextSibling(); in applyInlineStyleToNodeRange()
792 sibling = runEnd->nextSibling(); in applyInlineStyleToNodeRange()
860 RefPtr<Node> nextSibling = node->nextSibling(); in removeConflictingInlineStyleFromRun() local
866 runStart = previousSibling ? previousSibling->nextSibling() : parent->firstChild(); in removeConflictingInlineStyleFromRun()
868 runEnd = nextSibling ? nextSibling->previousSibling() : parent->lastChild(); in removeConflictingInlineStyleFromRun()
1145 for (; childNode; childNode = childNode->nextSibling()) in removeInlineStyle()
1308 if (end.deprecatedNode()->nextSibling()) in mergeEndWithNextIfIdentical()
[all …]
|
| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| D | FrameTree.cpp | 39 for (Frame* child = firstChild(); child; child = child->tree().nextSibling()) in ~FrameTree()
147 for (Frame* result = firstChild(); result; result = result->tree().nextSibling()) { in scopedChild()
164 for (Frame* child = firstChild(); child; child = child->tree().nextSibling()) in scopedChild()
176 for (Frame* result = firstChild(); result; result = result->tree().nextSibling()) { in scopedChildCount()
194 for (Frame* result = firstChild(); result; result = result->tree().nextSibling()) in childCount()
201 for (Frame* child = firstChild(); child; child = child->tree().nextSibling()) in child()
280 Frame* sibling = nextSibling(); in traverseNext()
291 sibling = frame->tree().nextSibling(); in traverseNext()
376 …or (WebCore::Frame* child = frame->tree().firstChild(); child; child = child->tree().nextSibling()) in printFrames()
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| D | RenderObjectChildList.cpp | 90 oldChild->previousSibling()->setNextSibling(oldChild->nextSibling()); in removeChildNode()
91 if (oldChild->nextSibling()) in removeChildNode()
92 oldChild->nextSibling()->setPreviousSibling(oldChild->previousSibling()); in removeChildNode()
95 setFirstChild(oldChild->nextSibling()); in removeChildNode()
|
| D | RenderTableCol.cpp | 120 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) in clearPreferredLogicalWidthsDirtyBits()
150 RenderObject* next = nextSibling(); in nextColumn()
154 next = parent()->nextSibling(); in nextColumn()
156 for (; next && !next->isRenderTableCol(); next = next->nextSibling()) { } in nextColumn()
|
| /external/chromium_org/third_party/WebKit/Source/core/svg/ |
| D | SVGUseElement.cpp | 318 …entInstance* instance = targetInstance->firstChild(); instance; instance = instance->nextSibling()) in dumpInstanceTree()
371 for (Node* cur = start->firstChild(); cur; cur = cur->nextSibling()) { in subtreeContainsDisallowedElement()
607 for (Node* node = target->firstChild(); node; node = node->nextSibling()) { in buildInstanceTree()
750 … for (RefPtr<Node> sibling = element->nextSibling(); sibling; sibling = sibling->nextSibling()) in expandUseElementsInShadowTree()
754 for (RefPtr<Node> child = element->firstChild(); child; child = child->nextSibling()) in expandUseElementsInShadowTree()
774 for (Node* child = element->firstChild(); child; child = child->nextSibling()) { in expandSymbolElementsInShadowTree()
795 … for (RefPtr<Node> sibling = element->nextSibling(); sibling; sibling = sibling->nextSibling()) in expandSymbolElementsInShadowTree()
799 for (RefPtr<Node> child = element->firstChild(); child; child = child->nextSibling()) in expandSymbolElementsInShadowTree()
816 …(SVGElementInstance* instance = target->firstChild(); instance; instance = instance->nextSibling()) in transferEventListenersToShadowTree()
845 …e* instance = targetInstance->firstChild(); node && instance; instance = instance->nextSibling()) { in associateInstancesWithShadowTreeElements()
[all …]
|
| D | SVGElementInstanceList.cpp | 37 …entInstance* instance = m_rootInstance->firstChild(); instance; instance = instance->nextSibling()) in length()
47 instance = instance->nextSibling(); in item()
|
| /external/chromium_org/chrome/browser/resources/ |
| D | about_credits.js | 8 var licence = o.nextSibling;
12 licence = licence.nextSibling;
|