| /external/webkit/Source/WebCore/editing/ |
| SplitElementCommand.cpp | 51 for (Node* node = m_element2->firstChild(); node != m_atChild; node = node->nextSibling())
85 for (Node* node = m_element1->firstChild(); node; node = node->nextSibling())
|
| ModifySelectionListLevel.cpp | 81 RenderObject* r = endListChild->renderer()->nextSibling();
95 Node* next = node->nextSibling();
110 Node* next = node->nextSibling();
126 Node* next = node->nextSibling();
262 Node* nextItem = endListChild->renderer()->nextSibling() ? endListChild->renderer()->nextSibling()->node() : 0;
|
| ApplyStyleCommand.cpp | 423 next = node->nextSibling();
472 if (before ? n->previousSibling() : n->nextSibling())
473 splitElement(parent, before ? n : n->nextSibling());
745 Node* sibling = node->nextSibling();
750 sibling = runEnd->nextSibling();
791 RefPtr<Node> nextSibling = node->nextSibling()
[all...] |
| ReplaceNodeWithSpanCommand.cpp | 61 nextChild = child->nextSibling();
|
| /external/guava/guava/src/com/google/common/collect/ |
| LinkedListMultimap.java | 116 Node<K, V> nextSibling; // the next node with the same key
185 * {@code nextSibling} element, or at the end of the list if {@code
186 * nextSibling} is null. Note: if {@code nextSibling} is specified, it MUST be
190 @Nullable K key, @Nullable V value, @Nullable Node<K, V> nextSibling) {
196 } else if (nextSibling == null) { // non-empty list, add to tail
203 keyTail.nextSibling = node;
208 } else { // non-empty list, insert before nextSibling
209 node.previous = nextSibling.previous;
210 node.previousSibling = nextSibling.previousSibling
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| LinkedListMultimap.java | 112 Node<K, V> nextSibling; // the next node with the same key
181 * {@code nextSibling} element, or at the end of the list if {@code
182 * nextSibling} is null. Note: if {@code nextSibling} is specified, it MUST be
186 @Nullable K key, @Nullable V value, @Nullable Node<K, V> nextSibling) {
192 } else if (nextSibling == null) { // non-empty list, add to tail
199 keyTail.nextSibling = node;
204 } else { // non-empty list, insert before nextSibling
205 node.previous = nextSibling.previous;
206 node.previousSibling = nextSibling.previousSibling
[all...] |
| /external/webkit/Source/WebCore/rendering/mathml/ |
| RenderMathMLUnderOver.cpp | 70 current = current->nextSibling();
130 base = base->nextSibling();
164 base = over->nextSibling();
215 base = over->nextSibling();
257 current = current->nextSibling();
284 for (RenderObject* current = firstChild(); current; current = current->nextSibling()) {
|
| RenderMathMLFraction.cpp | 73 RenderObject* denominator = numerator->nextSibling();
177 else if (nextSibling())
178 refStyle = nextSibling()->style();
|
| /external/webkit/LayoutTests/dom/xhtml/level3/core/ |
| canonicalform09.js | 133 node = node.nextSibling;
142 node = node.nextSibling;
147 node = node.nextSibling;
156 node = node.nextSibling;
164 node = node.nextSibling;
|
| /external/webkit/Source/WebCore/dom/ |
| ContainerNode.cpp | 61 for (Node* child = node->firstChild(); child; child = child->nextSibling())
193 ASSERT(!newChild->nextSibling());
202 ASSERT(prev->nextSibling() == nextChild);
267 RefPtr<Node> next = oldChild->nextSibling();
290 RefPtr<Node> nextChild = isFragment ? child->nextSibling() : 0;
307 ASSERT(!child->nextSibling());
320 next = prev->nextSibling();
445 Node* next = child->nextSibling();
493 Node* next = oldChild->nextSibling();
525 Node* next = n->nextSibling();
[all...] |
| /external/libvpx/libvpx/examples/includes/ASCIIMathPHP-2.0/ |
| htmlMathML.js | 55 while (node.nodeName!="/MATH" && node.nextSibling) {
74 node = node.nextSibling;
|
| /external/webkit/Source/WebCore/inspector/front-end/ |
| Section.js | 127 get nextSibling()
131 curElement = curElement.nextSibling;
|
| /external/webkit/Source/WebCore/rendering/ |
| RenderDetails.cpp | 105 Node* element = object->node()->nextSibling();
108 element = element->nextSibling();
|
| RenderTable.cpp | 354 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
414 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
498 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
508 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
559 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
581 for (RenderObject* child = firstChild(); child; child = child->nextSibling())
674 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
692 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
705 next = current->nextSibling();
707 next = current->parent()->nextSibling();
[all...] |
| CounterNode.h | 60 CounterNode* nextSibling() const { return m_nextSibling; }
|
| RenderApplet.cpp | 70 for (Node* child = element->firstChild(); child; child = child->nextSibling()) {
|
| RenderTableCol.cpp | 95 for (RenderObject* child = firstChild(); child; child = child->nextSibling())
|
| RenderTableRow.cpp | 129 if (beforeChild || nextSibling())
142 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
161 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
216 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
|
| /external/webkit/Source/WebKit/chromium/src/ |
| WebNode.cpp | 123 WebNode WebNode::nextSibling() const
125 return WebNode(m_private->nextSibling());
|
| /external/webkit/Source/WebCore/svg/ |
| SVGUseElement.cpp | 245 for (SVGElementInstance* instance = targetInstance->firstChild(); instance; instance = instance->nextSibling())
298 for (SVGElementInstance* instance = targetInstance->firstChild(); instance; instance = instance->nextSibling())
421 for (SVGElementInstance* instance = targetInstance->firstChild(); instance; instance = instance->nextSibling())
448 for (Node* cur = start->firstChild(); cur; cur = cur->nextSibling()) {
725 for (Node* node = target->firstChild(); node; node = node->nextSibling()) {
[all...] |
| SVGFEMergeElement.cpp | 47 for (Node* node = firstChild(); node; node = node->nextSibling()) {
|
| /external/webkit/LayoutTests/fast/dom/TreeWalker/script-tests/ |
| traversal-reject.js | 36 debug("<br>Testing nextSibling")
40 shouldBe("walker.nextSibling(); walker.currentNode.id", "'B3'");
|
| traversal-skip.js | 37 debug("<br>Testing nextSibling")
41 shouldBe("walker.nextSibling(); walker.currentNode.id", "'B3'");
|
| /external/webkit/Source/WebCore/page/ |
| FrameTree.h | 49 Frame* nextSibling() const { return m_nextSibling.get(); }
|
| /external/webkit/Source/WebCore/rendering/svg/ |
| RenderSVGShadowTreeRootContainer.cpp | 85 for (Node* child = m_shadowRoot->firstChild(); child; child = child->nextSibling())
|
