Home
last modified time | relevance | path

Searched refs:ancestors (Results 1 – 25 of 31) sorted by relevance

12

/external/chromium_org/third_party/WebKit/Source/core/editing/
DBreakBlockquoteCommand.cpp131 Vector<RefPtr<Element> > ancestors; in doApply() local
133 ancestors.append(node); in doApply()
144 for (size_t i = ancestors.size(); i != 0; --i) { in doApply()
145 RefPtr<Element> clonedChild = ancestors[i - 1]->cloneElementWithoutChildren(); in doApply()
148 Node* listChildNode = i > 1 ? ancestors[i - 2].get() : startNode; in doApply()
163 if (!ancestors.isEmpty()) { in doApply()
170 for (ancestor = ancestors.first(), clonedParent = clonedAncestor->parentElement(); in doApply()
176 Node* originalParent = ancestors.first().get(); in doApply()
DInsertParagraphSeparatorCommand.cpp122 …orsInsideBlock(const Node* insertionNode, Element* outerBlock, Vector<RefPtr<Element> >& ancestors) in getAncestorsInsideBlock() argument
124 ancestors.clear(); in getAncestorsInsideBlock()
129 ancestors.append(n); in getAncestorsInsideBlock()
133 …torCommand::cloneHierarchyUnderNewBlock(const Vector<RefPtr<Element> >& ancestors, PassRefPtr<Elem… in cloneHierarchyUnderNewBlock() argument
137 for (size_t i = ancestors.size(); i != 0; --i) { in cloneHierarchyUnderNewBlock()
138 RefPtr<Element> child = ancestors[i - 1]->cloneElementWithoutChildren(); in cloneHierarchyUnderNewBlock()
251 Vector<RefPtr<Element> > ancestors; in doApply() local
252 …sideBlock(positionOutsideTabSpan(insertionPosition).deprecatedNode(), startBlock.get(), ancestors); in doApply()
253 RefPtr<Element> parent = cloneHierarchyUnderNewBlock(ancestors, blockToInsert); in doApply()
296 Vector<RefPtr<Element> > ancestors; in doApply() local
[all …]
DInsertParagraphSeparatorCommand.h49 …rsInsideBlock(const Node* insertionNode, Element* outerBlock, Vector<RefPtr<Element> >& ancestors);
50 …PassRefPtr<Element> cloneHierarchyUnderNewBlock(const Vector<RefPtr<Element> >& ancestors, PassRef…
DCompositeEditCommand.cpp1018 Vector<RefPtr<Node> > ancestors; in cloneParagraphUnderNewElement() local
1022 ancestors.append(n); in cloneParagraphUnderNewElement()
1026 for (size_t i = ancestors.size(); i != 0; --i) { in cloneParagraphUnderNewElement()
1027 Node* item = ancestors[i - 1].get(); in cloneParagraphUnderNewElement()
/external/chromium_org/ui/views/corewm/
Dtransient_window_stacking_client.cc18 bool GetAllTransientAncestors(Window* window, Window::Windows* ancestors) { in GetAllTransientAncestors() argument
22 ancestors->push_back(window); in GetAllTransientAncestors()
24 return (!ancestors->empty()); in GetAllTransientAncestors()
/external/chromium_org/third_party/WebKit/Source/core/css/
DSelectorFilter.cpp94 Vector<Element*, 30> ancestors; in setupParentStack() local
96 ancestors.append(ancestor); in setupParentStack()
97 for (size_t n = ancestors.size(); n; --n) in setupParentStack()
98 pushParentStackFrame(*ancestors[n - 1]); in setupParentStack()
/external/chromium_org/ui/accessibility/
Dax_tree_serializer.h189 std::vector<const AXSourceNode*> ancestors; in LeastCommonAncestor() local
191 ancestors.push_back(node); in LeastCommonAncestor()
205 int source_index = static_cast<int>(ancestors.size() - 1); in LeastCommonAncestor()
208 if (tree_->GetId(ancestors[source_index]) != in LeastCommonAncestor()
212 lca = ancestors[source_index]; in LeastCommonAncestor()
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DBaseTree.cs484 List<ITree> ancestors = new List<ITree>(); in GetAncestors()
489 ancestors.Insert( 0, t ); // insert at start in GetAncestors()
492 return ancestors; in GetAncestors()
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DBaseTree.cs404 List<ITree> ancestors = new List<ITree>(); in GetAncestors()
408 ancestors.Insert(0, t); // insert at start in GetAncestors()
411 return ancestors; in GetAncestors()
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
DBaseTree.java331 List ancestors = new ArrayList(); in getAncestors()
335 ancestors.add(0, t); // insert at start in getAncestors()
338 return ancestors; in getAncestors()
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
DBaseTree.as279 /** Return a list of all ancestors of this node. The first node of
282 public function get ancestors():Array {
284 var ancestors:Array = new Array();
288 ancestors.unshift(t); // insert at start
291 return ancestors;
DTree.as30 /** Return a list of all ancestors of this node. The first node of
33 function get ancestors():Array;
/external/chromium_org/tools/code_coverage/
Dcroc.py580 ancestors = [parent]
588 ancestors.append(parent)
593 for a in ancestors:
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/
Dtreeoutline.js297 var ancestors = [];
299 ancestors.push(currentObject);
308 for (var i = ancestors.length - 1; i >= 0; --i) {
309 var treeElement = this.getCachedTreeElement(ancestors[i]);
/external/apache-xml/src/main/java/org/apache/xalan/templates/
DElemNumber.java819 NodeVector ancestors = in getCountString() local
822 int lastIndex = ancestors.size() - 1; in getCountString()
830 int target = ancestors.elementAt(i); in getCountString()
982 NodeSetDTM ancestors = new NodeSetDTM(xctxt.getDTMManager()); in getMatchingAncestors() local
1010 ancestors.addElement(node); in getMatchingAncestors()
1019 return ancestors; in getMatchingAncestors()
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
DANTLRBaseTree.m429 /** Return a list of all ancestors of this node. The first node of
436 AMutableArray *ancestors = [AMutableArray arrayWithCapacity:5];
440 [ancestors insertObject:t atIndex:0]; // insert at start
443 return ancestors;
/external/chromium_org/third_party/WebKit/Source/core/inspector/
DInspectorDOMAgent.cpp886 Vector<Node*> ancestors; in getEventListeners() local
888 ancestors.append(node); in getEventListeners()
891 ancestors.append(ancestor); in getEventListeners()
895 for (size_t i = ancestors.size(); i; --i) { in getEventListeners()
896 Node* ancestor = ancestors[i - 1]; in getEventListeners()
/external/chromium_org/third_party/WebKit/Source/core/dom/
DRange.cpp877 Vector<RefPtr<Node> > ancestors; in processAncestorsAndTheirSiblings() local
879 ancestors.append(n); in processAncestorsAndTheirSiblings()
882 … for (Vector<RefPtr<Node> >::const_iterator it = ancestors.begin(); it != ancestors.end(); it++) { in processAncestorsAndTheirSiblings()
/external/antlr/antlr-3.4/runtime/Python/antlr3/
Dtree.py912 ancestors = []
915 ancestors.insert(0, t) # insert at start
918 return ancestors
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/parse-only/
Dprototype-1.6.0.3.js1698 ancestors: function(element) { method
1741 var ancestors = element.ancestors();
1742 return Object.isNumber(expression) ? ancestors[expression] :
1743 Selector.findElement(ancestors, expression, index);
3868 var elements = [element].concat(element.ancestors());
Dconcat-jquery-mootools-prototype.js10077 ancestors: function(element) { method
10120 var ancestors = element.ancestors();
10121 return Object.isNumber(expression) ? ancestors[expression] :
10122 Selector.findElement(ancestors, expression, index);
12247 var elements = [element].concat(element.ancestors());
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/
Dpylintrc76 # R0901: Too many ancestors (8/7)
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
Dtree.rb277 def ancestors method
/external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/lib/
Dprototype-1.7.js2147 ancestors: function(element) { method
2196 var ancestors = Element.ancestors(element);
2197 return Object.isNumber(expression) ? ancestors[expression] :
2198 Prototype.Selector.find(ancestors, expression, index);
/external/libmtp/
DREADME10 libmtp is based on several ancestors:

12