/external/eigen/Eigen/src/Core/ |
CwiseBinaryOp.h | 42 typedef typename remove_all<Lhs>::type Ancestor; 43 typedef typename traits<Ancestor>::XprKind XprKind; 45 RowsAtCompileTime = traits<Ancestor>::RowsAtCompileTime, 46 ColsAtCompileTime = traits<Ancestor>::ColsAtCompileTime, 47 MaxRowsAtCompileTime = traits<Ancestor>::MaxRowsAtCompileTime, 48 MaxColsAtCompileTime = traits<Ancestor>::MaxColsAtCompileTime
|
/external/webkit/Source/WebCore/html/ |
HTMLImageElement.cpp | 240 for (ContainerNode* ancestor = parentNode(); ancestor; ancestor = ancestor->parentNode()) { 241 if (ancestor->hasTagName(formTag)) { 242 m_form = static_cast<HTMLFormElement*>(ancestor);
|
/external/chromium/chrome/browser/accessibility/ |
browser_accessibility_cocoa.h | 35 // Invalidate children for a non-ignored ancestor (including self).
|
browser_accessibility.cc | 91 BrowserAccessibility* ancestor) { 92 if (this == ancestor) { 95 return parent_->IsDescendantOf(ancestor);
|
/external/clang/test/CXX/dcl.dcl/basic.namespace/namespace.udir/ |
p1.cpp | 15 // Test that names appear as if in deepest common ancestor.
|
/external/webkit/Source/WebKit2/UIProcess/ |
WebFrameProxy.cpp | 221 bool WebFrameProxy::isDescendantOf(const WebFrameProxy* ancestor) const 223 if (!ancestor) 226 if (m_page != ancestor->m_page) 230 if (frame == ancestor)
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
CheckObjCInstMethSignature.cpp | 29 static bool AreTypesCompatible(QualType Derived, QualType Ancestor, 34 if (Derived->isAnyPointerType() && Ancestor->isAnyPointerType()) 37 return C.typesAreCompatible(Derived, Ancestor);
|
/external/webkit/Source/WebCore/xml/ |
XPathNodeSet.cpp | 54 // Find the common ancestor. 76 // One of the nodes is the common ancestor => it is the first in document order. 106 // Children nodes of the common ancestor induce a subdivision of our node-set.
|
/external/webkit/Source/WebCore/editing/ |
markup.cpp | 365 Node* ancestor = ancestorsToClose.last(); local 366 if (next != pastEnd && next->isDescendantOf(ancestor)) 369 appendEndTag(ancestor); 370 lastClosed = ancestor; 490 // Retain the Mail quote level by including all ancestor mail block quotes. 595 // Also include all of the ancestors of lastClosed up to this special ancestor. 596 for (ContainerNode* ancestor = lastClosed->parentNode(); ancestor; ancestor = ancestor->parentNode()) [all...] |
htmlediting.cpp | 571 Node* ancestor = range->commonAncestorContainer(ec);// find the cloeset common ancestor local 574 while (ancestor && ancestor->rendererIsEditable() && isNodeVisiblyContainedWithin(ancestor, maximumRange) && ancestor != rootNode) { 575 highestNode = ancestor; 576 ancestor = ancestor->parentNode(); 892 Node* ancestor = node->shadowAncestorNode() [all...] |
/external/webkit/Source/WebCore/dom/ |
ScriptElement.cpp | 202 Node* ancestor = m_element->parentNode(); 203 while (ancestor) { 204 if (ancestor->isSVGShadowRoot()) 206 ancestor = ancestor->parentNode();
|
/external/webkit/Source/WebCore/loader/ |
NavigationScheduler.cpp | 299 // Navigation of a subframe during loading of an ancestor frame does not create a new back/forward item. 302 for (Frame* ancestor = targetFrame->tree()->parent(); ancestor; ancestor = ancestor->tree()->parent()) { 303 Document* document = ancestor->document(); 304 if (!ancestor->loader()->isComplete() || (document && document->processingLoadEvent()))
|
/external/libvpx/libvpx/examples/includes/HTML-Toc-0.91/ |
TocUpdator.pm | 218 # Call ancestor 251 # Call ancestor to set anchor name 307 # Call ancestor 321 # Call ancestor 343 # Call ancestor 370 # Call ancestor 397 # Call ancestor 403 # Call ancestor 417 # Call ancestor 474 # Call ancestor [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
DTMDefaultBaseTraversers.java | 121 case Axis.ANCESTOR : 198 * Implements traversal of the Ancestor access, in reverse document order. 242 * Implements traversal of the Ancestor access, in reverse document order. 328 * Implements traversal of the Ancestor access, in reverse document order. 579 * Implements traversal of the Ancestor access, in reverse document order. 653 // (next-sib or ancestor's-next-sib). Probably shallower search. 758 * Implements traversal of the Ancestor access, in reverse document order. 981 * Implements traversal of the Ancestor access, in reverse document order. 1023 * Implements traversal of the Ancestor access, in reverse document order. [all...] |
/prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
ipa-prop.h | 49 getting addresses of of ancestor fields in C++ 51 NULL, ancestor jump function must behave like a simple pass-through. 74 IPA_JF_ANCESTOR /* represented by field ancestor */ 93 /* Structure holding data required to describe an ancestor pass-through 98 /* Offset of the field representing the ancestor. */ 129 struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; member in union:jump_func_value
|
/prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
ipa-prop.h | 49 getting addresses of of ancestor fields in C++ 51 NULL, ancestor jump function must behave like a simple pass-through. 74 IPA_JF_ANCESTOR /* represented by field ancestor */ 93 /* Structure holding data required to describe an ancestor pass-through 98 /* Offset of the field representing the ancestor. */ 129 struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; member in union:jump_func_value
|
/prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
ipa-prop.h | 49 getting addresses of of ancestor fields in C++ 51 NULL, ancestor jump function must behave like a simple pass-through. 74 IPA_JF_ANCESTOR /* represented by field ancestor */ 93 /* Structure holding data required to describe an ancestor pass-through 98 /* Offset of the field representing the ancestor. */ 129 struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; member in union:jump_func_value
|
/prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
ipa-prop.h | 49 getting addresses of of ancestor fields in C++ 51 NULL, ancestor jump function must behave like a simple pass-through. 74 IPA_JF_ANCESTOR /* represented by field ancestor */ 93 /* Structure holding data required to describe an ancestor pass-through 98 /* Offset of the field representing the ancestor. */ 129 struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; member in union:jump_func_value
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
DOMHelper.java | 236 // ancestor chains, reconcile the lengths, and look for 237 // the lowest common ancestor. If that ancestor is one of 241 // NOTE: If no common ancestor is found, ordering is undefined 244 // Count parents in each ancestor chain 261 // Initially assume scan for common ancestor starts with 265 // If one ancestor chain is longer, adjust its start point 290 // Loop up the ancestor chain looking for common parent 298 // Edge condition: one is the ancestor of the other. 507 * nearest Element ancestor. [all...] |
/external/chromium/chrome/browser/userfeedback/proto/ |
dom.proto | 92 // ancestor-descendant relationship.
|
/external/webkit/LayoutTests/dom/xhtml/level3/core/ |
nodereplacechild26.js | 79 node that is an ancestor of this Element node and verify if a HIERARCHY_REQUEST_ERR gets thrown.
|
typeinfoisderivedfrom65.js | 79 The isDerivedFrom method checks if this TypeInfo derives from the specified ancestor type.
|
typeinfoisderivedfrom67.js | 83 ancestor type.
|
typeinfoisderivedfrom68.js | 83 ancestor type.
|
typeinfoisderivedfrom69.js | 83 ancestor type.
|