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

1 2

  /external/chromium_org/third_party/WebKit/Source/core/dom/
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; }
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;
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)
377 Node* node = current.nextSibling();
379 node = node->nextSibling();
385 inline ElementType* Traversal<ElementType>::nextSibling(const Node& current, MatchFunc isMatch)
387 ElementType* element = Traversal<ElementType>::nextSibling(current);
389 element = Traversal<ElementType>::nextSibling(*element)
    [all...]
NodeRenderingTraversal.cpp 75 Node* nextSibling(const Node* node)
82 walker.nextSibling();
176 Node* nextNode = nextSibling(node);
224 for (Node* sibling = NodeRenderingTraversal::nextSibling(node); sibling; sibling = NodeRenderingTraversal::nextSibling(sibling)) {
Node.h 189 Node* nextSibling() const { return m_next; }
    [all...]
  /external/chromium_org/third_party/WebKit/Source/web/
RemoteFrameClient.cpp 44 Frame* RemoteFrameClient::nextSibling() const
46 return toCoreFrame(m_webFrame->nextSibling());
WebFrame.cpp 174 WebFrame* WebFrame::nextSibling() const
240 child = child->nextSibling();
WebNode.cpp 121 WebNode WebNode::nextSibling() const
123 return WebNode(m_private->nextSibling());
FrameLoaderClientImpl.cpp 278 Frame* FrameLoaderClientImpl::nextSibling() const
280 return toCoreFrame(m_webFrame->nextSibling());
  /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
ComposedTreeWalker.h 57 void nextSibling();
131 inline void ComposedTreeWalker::nextSibling()
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
CounterNode.h 60 CounterNode* nextSibling() const { return m_nextSibling; }
CounterNode.cpp 78 CounterNode* nextSibling = 0;
81 nextSibling = oldPreviousSibling->m_nextSibling;
84 child->m_nextSibling = nextSibling;
85 nextSibling->m_previousSibling = child;
370 current->nextSibling(), &current->owner());
RenderBoxModelObject.cpp 676 RenderObject* nextSibling = child->nextSibling();
678 child = nextSibling;
RenderLayer.h 102 RenderLayer* nextSibling() const { return m_next; }
    [all...]
RenderTable.cpp 447 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
577 for (RenderObject* section = firstChild(); section; section = section->nextSibling()) {
717 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
    [all...]
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
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/
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/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/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/apache-xml/src/main/java/org/apache/xalan/transformer/
TransformerIdentityImpl.java 201 Node nextSibling = domResult.getNextSibling();
248 if (nextSibling != null)
249 domBuilder.setNextSibling(nextSibling);
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/accessibility/
AXNodeObject.cpp 387 for (Element* sibling = ElementTraversal::firstChild(*parent); sibling; sibling = ElementTraversal::nextSibling(*sibling)) {
1109 for (AXObject* child = firstChild(); child; child = child->nextSibling()) {
    [all...]
AXRenderObject.cpp     [all...]
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
DTMDefaultBase.java 745 int nextSibling = _nextsib(index);
747 if (DTM.NULL == nextSibling)
749 else if (NOTPROCESSED == nextSibling)
752 ps.println("Next sibling: " + nextSibling);
    [all...]

Completed in 943 milliseconds

1 2