/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | 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; } function in class:blink::MutationRecord
|
H A D | ChildNodeList.cpp | 52 for (Node* next = currentNode.nextSibling(); next; next = next->nextSibling()) { function
|
H A D | TreeWalker.cpp | 93 if (node->nextSibling()) { 94 node = node->nextSibling(); 176 Node* TreeWalker::nextSibling(ExceptionState& exceptionState) function in class:blink::TreeWalker 182 for (RefPtrWillBeRawPtr<Node> sibling = node->nextSibling(); sibling; ) { 200 sibling = sibling->nextSibling(); 266 while (Node* nextSibling = NodeTraversal::nextSkippingChildren(*node, root())) { 267 node = nextSibling;
|
H A D | ElementTraversal.h | 93 static ElementType* nextSibling(const Node&); 95 static ElementType* nextSibling(const Node&, MatchFunc); 151 node = node->nextSibling(); 161 element = Traversal<ElementType>::nextSibling(*element); 375 inline ElementType* Traversal<ElementType>::nextSibling(const Node& current) function in class:blink::Traversal 377 Node* node = current.nextSibling(); 379 node = node->nextSibling(); 385 inline ElementType* Traversal<ElementType>::nextSibling(const Node& current, MatchFunc isMatch) function in class:blink::Traversal 387 ElementType* element = Traversal<ElementType>::nextSibling(current); 389 element = Traversal<ElementType>::nextSibling(*elemen [all...] |
H A D | MutationRecord.cpp | 47 ChildListRecord(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling) argument 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) argument 195 return adoptRefWillBeNoop(new ChildListRecord(target, added, removed, previousSibling, nextSibling));
|
H A D | NodeRenderingTraversal.cpp | 75 Node* nextSibling(const Node* node) function in namespace:blink::NodeRenderingTraversal 82 walker.nextSibling(); 176 Node* nextNode = nextSibling(node); 224 for (Node* sibling = NodeRenderingTraversal::nextSibling(node); sibling; sibling = NodeRenderingTraversal::nextSibling(sibling)) {
|
H A D | ContainerNode.h | 72 bool hasOneChild() const { return m_firstChild && !m_firstChild->nextSibling(); } 168 node.nextSibling(), 174 static ChildrenChange forRemoval(Node& node, Node* previousSibling, Node* nextSibling, ChildrenChangeSource byParser) argument 179 nextSibling, 270 child = child->nextSibling(); 288 for (Node* child = firstChild(); child; child = child->nextSibling()) { 300 for (Node* child = firstChild(); child; child = child->nextSibling()) 345 for (Node* child = node.firstChild(); child; child = child->nextSibling())
|
H A D | Node.h | 189 Node* nextSibling() const { return m_next; } function in class:blink::Node
|
/external/chromium_org/third_party/WebKit/Source/web/ |
H A D | RemoteFrameClient.cpp | 44 Frame* RemoteFrameClient::nextSibling() const function in class:blink::RemoteFrameClient 46 return toCoreFrame(m_webFrame->nextSibling());
|
H A D | WebFrame.cpp | 174 WebFrame* WebFrame::nextSibling() const function in class:blink::WebFrame 240 child = child->nextSibling();
|
H A D | WebNode.cpp | 121 WebNode WebNode::nextSibling() const function in class:blink::WebNode 123 return WebNode(m_private->nextSibling());
|
H A D | FrameLoaderClientImpl.cpp | 278 Frame* FrameLoaderClientImpl::nextSibling() const function in class:blink::FrameLoaderClientImpl 280 return toCoreFrame(m_webFrame->nextSibling());
|
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
H A D | ComposedTreeWalker.h | 57 void nextSibling(); 131 inline void ComposedTreeWalker::nextSibling() function in class:blink::ComposedTreeWalker
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | CounterNode.h | 60 CounterNode* nextSibling() const { return m_nextSibling; } function in class:blink::CounterNode
|
H A D | CounterNode.cpp | 78 CounterNode* nextSibling = 0; local 81 nextSibling = oldPreviousSibling->m_nextSibling; 84 child->m_nextSibling = nextSibling; 85 nextSibling->m_previousSibling = child; 370 current->nextSibling(), ¤t->owner());
|
H A D | RenderBoxModelObject.cpp | 676 RenderObject* nextSibling = child->nextSibling(); local 678 child = nextSibling;
|
H A D | RenderLayer.h | 102 RenderLayer* nextSibling() const { return m_next; } function in class:blink::RenderLayer
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | DOMBuilder.java | 143 * @param nextSibling the next sibling node. 145 public void setNextSibling(Node nextSibling) argument 147 m_nextSibling = nextSibling;
|
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
H A D | traverse_math.js | 301 cvox.TraverseMath.prototype.nextSibling = function(r) { 306 node = r ? node.previousSibling : node.nextSibling;
|
/external/chromium_org/third_party/WebKit/Source/core/page/ |
H A D | FrameTree.cpp | 55 for (Frame* child = firstChild(); child; child = child->tree().nextSibling()) { 100 Frame* FrameTree::nextSibling() const function in class:blink::FrameTree 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/guava/guava/src/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 116 Node<K, V> nextSibling; // the next node with the same key field in class:LinkedListMultimap.Node 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 189 addNode( @ullable K key, @Nullable V value, @Nullable Node<K, V> nextSibling) argument [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 112 Node<K, V> nextSibling; // the next node with the same key field in class:LinkedListMultimap.Node 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 185 addNode( @ullable K key, @Nullable V value, @Nullable Node<K, V> nextSibling) argument [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/data/ |
H A D | NestedMapData.java | 70 private NestedMapData nextSibling = null; field in class:NestedMapData 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/core/accessibility/ |
H A D | AXNodeObject.cpp | 387 for (Element* sibling = ElementTraversal::firstChild(*parent); sibling; sibling = ElementTraversal::nextSibling(*sibling)) { 1109 for (AXObject* child = firstChild(); child; child = child->nextSibling()) { 1262 for (Node* child = node()->firstChild(); child; child = child->nextSibling()) { 1325 AXObject* AXNodeObject::nextSibling() const function in class:blink::AXNodeObject 1330 Node* nextSibling = node()->nextSibling(); 1331 if (!nextSibling) 1334 return axObjectCache()->getOrCreate(nextSibling); 1352 for (Node* child = m_node->firstChild(); child; child = child->nextSibling())
|
H A D | AXRenderObject.cpp | 1259 for (AXObject* child = firstChild(); child; child = child->nextSibling()) 1392 AXObject* AXRenderObject::nextSibling() const function in class:blink::AXRenderObject 1397 RenderObject* nextSibling = 0; 1402 nextSibling = firstChildConsideringContinuation(inlineContinuation); 1409 nextSibling = lastParent->nextSibling(); 1410 } else if (RenderObject* ns = m_renderer->nextSibling()) { 1412 nextSibling = ns; 1416 nextSibling = endOfContinuations(m_renderer)->nextSibling(); [all...] |