HomeSort by relevance Sort by last modified time
    Searched refs:nextSibling (Results 26 - 50 of 331) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/WebKit/Source/core/svg/
SVGAltGlyphDefElement.cpp 92 for (Node* child = firstChild(); child; child = child->nextSibling()) {
SVGAltGlyphItemElement.cpp 52 for (Node* child = firstChild(); child; child = child->nextSibling()) {
SVGFEMergeElement.cpp 48 for (Node* node = firstChild(); node; node = node->nextSibling()) {
SVGSwitchElement.cpp 59 for (Node* node = firstChild(); node; node = node->nextSibling()) {
SVGFontFaceSrcElement.cpp 51 for (Node* child = firstChild(); child; child = child->nextSibling()) {
SVGUseElement.cpp 315 for (SVGElementInstance* instance = targetInstance->firstChild(); instance; instance = instance->nextSibling())
369 for (Node* cur = start->firstChild(); cur; cur = cur->nextSibling()) {
607 for (Node* node = target->firstChild(); node; node = node->nextSibling()) {
747 for (RefPtr<Node> sibling = element->nextSibling(); sibling; sibling = sibling->nextSibling())
751 for (RefPtr<Node> child = element->firstChild(); child; child = child->nextSibling())
770 for (Node* child = element->firstChild(); child; child = child->nextSibling()) {
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/dom/
NodeRenderingTraversal.cpp 58 Node* nextSibling(const Node* node)
65 walker.nextSibling();
ContainerNode.h 200 for (Node* child = firstChild(); child; child = child->nextSibling()) {
212 for (Node* child = firstChild(); child; child = child->nextSibling())
262 for (Node* child = node->firstChild(); child; child = child->nextSibling())
289 m_currentNode = node->nextSibling();
306 node = node->nextSibling();
ContainerNode.cpp 80 for (Node* child = firstChild(); child; child = child->nextSibling())
130 for (Node* node = child->firstChild(); node; node = node->nextSibling()) {
291 ASSERT(!newChild->nextSibling());
300 ASSERT(prev->nextSibling() == nextChild);
363 RefPtr<Node> next = oldChild->nextSibling();
492 Node* next = child->nextSibling();
534 Node* next = oldChild->nextSibling();
586 removeBetween(0, m_firstChild->nextSibling(), m_firstChild);
743 for (Node* n = firstChild(); n && !es.hadException(); n = n->nextSibling())
766 } else if (o->nextSibling()) {
    [all...]
ContainerNodeAlgorithms.h 93 next = n->nextSibling();
163 next = n->nextSibling();
175 // Reuse the nextSibling pointer for this purpose.
294 for (Node* child = root->firstChild(); child; child = child->nextSibling())
329 for (Node* child = m_root->firstChild(); child; child = child->nextSibling())
NodeRenderingTraversal.h 69 Node* nextSibling(const Node*);
  /external/chromium_org/third_party/WebKit/Source/core/editing/
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;
SplitElementCommand.cpp 53 for (Node* node = m_element2->firstChild(); node != m_atChild; node = node->nextSibling())
86 for (Node* node = m_element1->firstChild(); node; node = node->nextSibling())
RemoveNodeCommand.cpp 53 m_refChild = m_node->nextSibling();
ApplyStyleCommand.cpp 434 next = node->nextSibling();
483 if (before ? currentNode->previousSibling() : currentNode->nextSibling())
484 splitElement(parent, before ? currentNode : currentNode->nextSibling());
783 Node* sibling = node->nextSibling();
788 sibling = runEnd->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/chromium_org/third_party/WebKit/Source/core/page/
FrameTree.cpp 39 for (Frame* child = firstChild(); child; child = child->tree()->nextSibling())
177 for (Frame* result = firstChild(); result; result = result->tree()->nextSibling()) {
193 for (Frame* child = firstChild(); child; child = child->tree()->nextSibling())
205 for (Frame* result = firstChild(); result; result = result->tree()->nextSibling()) {
233 for (Frame* result = firstChild(); result; result = result->tree()->nextSibling())
242 result = result->tree()->nextSibling();
248 for (Frame* child = firstChild(); child; child = child->tree()->nextSibling())
327 Frame* sibling = nextSibling();
338 sibling = frame->tree()->nextSibling();
423 for (WebCore::Frame* child = frame->tree()->firstChild(); child; child = child->tree()->nextSibling())
    [all...]
  /external/libvpx/libvpx/examples/includes/ASCIIMathPHP-2.0/
htmlMathML.js 55 while (node.nodeName!="/MATH" && node.nextSibling) {
74 node = node.nextSibling;
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
CounterNode.h 60 CounterNode* nextSibling() const { return m_nextSibling; }
RenderTableRow.cpp 152 if (beforeChild || nextSibling())
166 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
185 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
249 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) {
CounterNode.cpp 75 CounterNode* nextSibling = 0;
78 nextSibling = oldPreviousSibling->m_nextSibling;
81 child->m_nextSibling = nextSibling;
82 nextSibling->m_previousSibling = child;
367 current->nextSibling(), current->owner());
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/
TimelineGrid.js 143 divider = divider.nextSibling;
144 dividerLabelBar = dividerLabelBar.nextSibling;
149 var nextDivider = divider.nextSibling;
154 var nextDivider = dividerLabelBar.nextSibling;
  /build/tools/droiddoc/templates-ds/assets/js/
prettify.js 6 {b:8,t:9,n:10,v:11,f:12,r:13},n=[],p=0,d=a.length;p<d;++p){g=a[p];if(g.global||g.multiline)throw Error(""+g);n.push("(?:"+y(g)+")")}return RegExp(n.join("|"),l?"gi":"g")}function M(a){function m(a){switch(a.nodeType){case 1:if(e.test(a.className))break;for(var g=a.firstChild;g;g=g.nextSibling)m(g);g=a.nodeName;if("BR"===g||"LI"===g)h[s]="\n",t[s<<1]=y++,t[s++<<1|1]=a;break;case 3:case 4:g=a.nodeValue,g.length&&(g=p?g.replace(/\r\n?/g,"\n"):g.replace(/[\t\n\r ]+/g," "),h[s]=g,t[s<<1]=y,y+=g.length,
13 a.parentNode&&a.parentNode.removeChild(a);else for(a=a.firstChild;a;a=a.nextSibling)e(a);break;case 3:case 4:if(p){var b=a.nodeValue,d=b.match(t);if(d){var c=b.substring(0,d.index);a.nodeValue=c;(b=b.substring(d.index+d[0].length))&&a.parentNode.insertBefore(s.createTextNode(b),a.nextSibling);h(a);c||a.parentNode.removeChild(a)}}}}function h(a){function b(a,d){var e=d?a.cloneNode(!1):a,f=a.parentNode;if(f){var f=b(f,1),g=a.nextSibling;f.appendChild(e);for(var h=g;h;h=g)g=h.nextSibling,f.appendChild(h)}return e}
14 for(;!a.nextSibling;)if(a=a.parentNode,!a)return;for(var a=b(a.nextSibling,0),e;(e=a.parentNode)&&e.nodeType===1;)a=e;d.push(a)}var k=/(?:^|\s)nocode(?:\s|$)/,t=/\r\n?|\n/,s=a.ownerDocument,l;a.currentStyle?l=a.currentStyle.whiteSpace:window.getComputedStyle&&(l=s.defaultView.getComputedStyle(a,q).getPropertyValue("white-space"));var p=l&&"pre"===l.substring(0,3);for(l=s.createElement("LI");a.firstChild;)l.appendChild(a.firstChild);for(var d=[l],g=0;g<d.length;++g)e(d[g]);m===(m|0)&&d[0].setAttribute("value",
17 j;var u=i.ownerDocument,v=u.createElement("SPAN");v.className=d[a+1];var x=i.parentNode;x.replaceChild(v,i);v.appendChild(i);e<o&&(l[h+1]=i=u.createTextNode(t.substring(b,o)),x.insertBefore(i,v.nextSibling))}e=b;e>=o&&(h+=2);e>=c&&(a+=2)}}catch(w){"console"in window&&console.log(w&&w.stack?w.stack:w)}}var v=["break,continue,do,else,for,if,return,while"],w=[[v,"auto,case,char,const,default,double,enum,extern,float,goto,int,long,register,short,signed,sizeof,static,struct,switch,typedef,union,unsigned,void,volatile"],
26 !k){b=n;for(var o=void 0,c=b.firstChild;c;c=c.nextSibling)var i=c.nodeType,o=i===1?o?b:c:i===3?N.test(c.nodeValue)?b:o:o;b=(f=o===b?void 0:o)&&"CODE"===f.tagName}b&&(k=f.className.match(g));k&&(k=k[1]);b=!1;for(o=n.parentNode;o;o=o.parentNode)if((o.tagName==="pre"||o.tagName==="code"||o.tagName==="xmp")&&o.className&&o.className.indexOf("prettyprint")>=0){b=!0;break}b||((b=(b=n.className.match(/\blinenums\b(?::(\d+))?/))?b[1]&&b[1].length?+b[1]:!0:!1)&&D(n,b),d={g:k,h:n,i:b},E(d))}}p<h.length?setTimeout(m,
  /build/tools/droiddoc/templates-sac/assets/js/
prettify.js 6 {b:8,t:9,n:10,v:11,f:12,r:13},n=[],p=0,d=a.length;p<d;++p){g=a[p];if(g.global||g.multiline)throw Error(""+g);n.push("(?:"+y(g)+")")}return RegExp(n.join("|"),l?"gi":"g")}function M(a){function m(a){switch(a.nodeType){case 1:if(e.test(a.className))break;for(var g=a.firstChild;g;g=g.nextSibling)m(g);g=a.nodeName;if("BR"===g||"LI"===g)h[s]="\n",t[s<<1]=y++,t[s++<<1|1]=a;break;case 3:case 4:g=a.nodeValue,g.length&&(g=p?g.replace(/\r\n?/g,"\n"):g.replace(/[\t\n\r ]+/g," "),h[s]=g,t[s<<1]=y,y+=g.length,
13 a.parentNode&&a.parentNode.removeChild(a);else for(a=a.firstChild;a;a=a.nextSibling)e(a);break;case 3:case 4:if(p){var b=a.nodeValue,d=b.match(t);if(d){var c=b.substring(0,d.index);a.nodeValue=c;(b=b.substring(d.index+d[0].length))&&a.parentNode.insertBefore(s.createTextNode(b),a.nextSibling);h(a);c||a.parentNode.removeChild(a)}}}}function h(a){function b(a,d){var e=d?a.cloneNode(!1):a,f=a.parentNode;if(f){var f=b(f,1),g=a.nextSibling;f.appendChild(e);for(var h=g;h;h=g)g=h.nextSibling,f.appendChild(h)}return e}
14 for(;!a.nextSibling;)if(a=a.parentNode,!a)return;for(var a=b(a.nextSibling,0),e;(e=a.parentNode)&&e.nodeType===1;)a=e;d.push(a)}var k=/(?:^|\s)nocode(?:\s|$)/,t=/\r\n?|\n/,s=a.ownerDocument,l;a.currentStyle?l=a.currentStyle.whiteSpace:window.getComputedStyle&&(l=s.defaultView.getComputedStyle(a,q).getPropertyValue("white-space"));var p=l&&"pre"===l.substring(0,3);for(l=s.createElement("LI");a.firstChild;)l.appendChild(a.firstChild);for(var d=[l],g=0;g<d.length;++g)e(d[g]);m===(m|0)&&d[0].setAttribute("value",
17 j;var u=i.ownerDocument,v=u.createElement("SPAN");v.className=d[a+1];var x=i.parentNode;x.replaceChild(v,i);v.appendChild(i);e<o&&(l[h+1]=i=u.createTextNode(t.substring(b,o)),x.insertBefore(i,v.nextSibling))}e=b;e>=o&&(h+=2);e>=c&&(a+=2)}}catch(w){"console"in window&&console.log(w&&w.stack?w.stack:w)}}var v=["break,continue,do,else,for,if,return,while"],w=[[v,"auto,case,char,const,default,double,enum,extern,float,goto,int,long,register,short,signed,sizeof,static,struct,switch,typedef,union,unsigned,void,volatile"],
26 !k){b=n;for(var o=void 0,c=b.firstChild;c;c=c.nextSibling)var i=c.nodeType,o=i===1?o?b:c:i===3?N.test(c.nodeValue)?b:o:o;b=(f=o===b?void 0:o)&&"CODE"===f.tagName}b&&(k=f.className.match(g));k&&(k=k[1]);b=!1;for(o=n.parentNode;o;o=o.parentNode)if((o.tagName==="pre"||o.tagName==="code"||o.tagName==="xmp")&&o.className&&o.className.indexOf("prettyprint")>=0){b=!0;break}b||((b=(b=n.className.match(/\blinenums\b(?::(\d+))?/))?b[1]&&b[1].length?+b[1]:!0:!1)&&D(n,b),d={g:k,h:n,i:b},E(d))}}p<h.length?setTimeout(m,

Completed in 877 milliseconds

12 3 4 5 6 7 8 91011>>