HomeSort by relevance Sort by last modified time
    Searched refs:ancestors (Results 1 - 25 of 32) sorted by null

1 2

  /external/webkit/Source/WebCore/editing/
InsertParagraphSeparatorCommand.h 49 void getAncestorsInsideBlock(const Node* insertionNode, Element* outerBlock, Vector<Element*>& ancestors);
50 PassRefPtr<Element> cloneHierarchyUnderNewBlock(const Vector<Element*>& ancestors, PassRefPtr<Element> blockToInsert);
BreakBlockquoteCommand.cpp 128 // Build up list of ancestors in between the start node and the top blockquote.
129 Vector<Element*> ancestors; local
131 ancestors.append(node);
137 // Clone startNode's ancestors into the cloned blockquote.
139 // that was cloned (i.e. the clone of either ancestors.last()
140 // or clonedBlockquote if ancestors is empty).
142 for (size_t i = ancestors.size(); i != 0; --i) {
143 RefPtr<Element> clonedChild = ancestors[i - 1]->cloneElementWithoutChildren();
146 Node* listChildNode = i > 1 ? ancestors[i - 2] : startNode;
168 if (!ancestors.isEmpty())
    [all...]
InsertParagraphSeparatorCommand.cpp 122 void InsertParagraphSeparatorCommand::getAncestorsInsideBlock(const Node* insertionNode, Element* outerBlock, Vector<Element*>& ancestors)
124 ancestors.clear();
126 // Build up list of ancestors elements between the insertion node and the outer block.
129 ancestors.append(n);
133 PassRefPtr<Element> InsertParagraphSeparatorCommand::cloneHierarchyUnderNewBlock(const Vector<Element*>& ancestors, PassRefPtr<Element> blockToInsert)
135 // Make clones of ancestors in between the start node and the start block.
137 for (size_t i = ancestors.size(); i != 0; --i) {
138 RefPtr<Element> child = ancestors[i - 1]->cloneElementWithoutChildren();
241 Vector<Element*> ancestors; local
242 getAncestorsInsideBlock(positionOutsideTabSpan(insertionPosition).deprecatedNode(), startBlock, ancestors);
275 Vector<Element*> ancestors; local
    [all...]
CompositeEditCommand.cpp 785 Vector<RefPtr<Node> > ancestors; local
789 ancestors.append(n);
793 for (size_t i = ancestors.size(); i != 0; --i) {
794 Node* item = ancestors[i - 1].get();
    [all...]
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
BaseTree.as 279 /** 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;
  /external/webkit/Source/WebCore/dom/
EventDispatcher.cpp 170 // Since ancestors does not contain target itself, we must account
177 // Trim ancestors to lowestCommonBoundary to keep events inside of the common shadow DOM subtree.
184 inline static bool ancestorsCrossShadowBoundaries(const Vector<EventContext>& ancestors)
186 return ancestors.isEmpty() || ancestors.first().node() == ancestors.last().node();
207 // ancestors size and if the retargeting has occured (indicating the presence of shadow DOM boundaries).
Range.cpp 863 Vector<RefPtr<Node> > ancestors; local
865 ancestors.append(n);
868 for (Vector<RefPtr<Node> >::const_iterator it = ancestors.begin(); it != ancestors.end(); it++) {
    [all...]
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
BaseTree.java 326 /** Return a list of all ancestors of this node. The first node of
331 List ancestors = new ArrayList();
335 ancestors.add(0, t); // insert at start
338 return ancestors;
  /libcore/luni/src/main/java/java/util/prefs/
XMLParser.java 168 StringTokenizer ancestors = new StringTokenizer(prefs.absolutePath(), "/"); local
169 exportNode(ancestors, prefs, withSubTree, out);
177 private static void exportNode(StringTokenizer ancestors,
180 if (ancestors.hasMoreTokens()) {
181 String name = ancestors.nextToken();
183 if (ancestors.hasMoreTokens()) {
185 exportNode(ancestors, prefs, withSubTree, out);
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
BaseTree.cs 396 * Return a list of all ancestors of this node. The first node of
404 List<ITree> ancestors = new List<ITree>();
408 ancestors.Insert(0, t); // insert at start
411 return ancestors;
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
BaseTree.cs 475 * Return a list of all ancestors of this node. The first node of
484 List<ITree> ancestors = new List<ITree>();
489 ancestors.Insert( 0, t ); // insert at start
492 return ancestors;
  /external/webkit/LayoutTests/dom/html/level1/core/
hc_nodeinsertbeforenodeancestor.js 80 inserted is one of this nodes ancestors.
83 node that is one of its ancestors(root node). An
hc_nodeappendchildnodeancestor.js 80 append is one of this node's ancestors.
hc_nodereplacechildnodeancestor.js 80 in is one of this node's ancestors.
  /external/webkit/LayoutTests/dom/xhtml/level1/core/
hc_nodeinsertbeforenodeancestor.js 80 inserted is one of this nodes ancestors.
83 node that is one of its ancestors(root node). An
hc_nodeappendchildnodeancestor.js 80 append is one of this node's ancestors.
hc_nodereplacechildnodeancestor.js 80 in is one of this node's ancestors.
  /external/webkit/Source/WebCore/inspector/
InspectorInstrumentation.cpp 77 static bool eventHasListeners(const AtomicString& eventType, DOMWindow* window, Node* node, const Vector<EventContext>& ancestors)
85 for (size_t i = 0; i < ancestors.size(); i++) {
86 Node* ancestor = ancestors[i].node();
243 InspectorInstrumentationCookie InspectorInstrumentation::willDispatchEventImpl(InspectorAgent* inspectorAgent, const Event& event, DOMWindow* window, Node* node, const Vector<EventContext>& ancestors)
249 if (timelineAgent && eventHasListeners(event.type(), window, node, ancestors)) {
    [all...]
InspectorInstrumentation.h 96 static InspectorInstrumentationCookie willDispatchEvent(Document*, const Event& event, DOMWindow* window, Node* node, const Vector<EventContext>& ancestors);
215 static InspectorInstrumentationCookie willDispatchEventImpl(InspectorAgent*, const Event& event, DOMWindow* window, Node* node, const Vector<EventContext>& ancestors);
475 inline InspectorInstrumentationCookie InspectorInstrumentation::willDispatchEvent(Document* document, const Event& event, DOMWindow* window, Node* node, const Vector<EventContext>& ancestors)
479 return willDispatchEventImpl(inspectorAgent, event, window, node, ancestors);
    [all...]
InspectorDOMAgent.cpp 735 // The Node's Ancestors (not including self)
736 Vector<ContainerNode*> ancestors;
738 ancestors.append(ancestor);
742 for (size_t i = ancestors.size(); i; --i) {
743 ContainerNode* ancestor = ancestors[i - 1];
    [all...]
  /external/webkit/Source/WebCore/inspector/front-end/
treeoutline.js 291 // tree element that represents representedObject or one of its ancestors.
306 // Build up a list of representedObject's ancestors that aren't already in our tree.
307 var ancestors = [];
310 ancestors.unshift(currentObject);
316 // For each of those ancestors we populate them to fill in the tree.
317 for (var i = 0; i < ancestors.length; ++i) {
320 if (ancestors[i] === representedObject)
324 item = this.findTreeElement(ancestors[i], isAncestor, getParent);
  /external/apache-xml/src/main/java/org/apache/xalan/templates/
ElemNumber.java 173 * Only ancestors that are searched are
186 * Only ancestors that are searched are
203 * Only ancestors that are searched are
222 * attribute is specified, then the only ancestors that are searched are those
226 * When level="multiple", it constructs a list of all ancestors of the current node
230 * If the from attribute is specified, then the only ancestors that are searched are
819 NodeVector ancestors = local
822 int lastIndex = ancestors.size() - 1;
830 int target = ancestors.elementAt(i);
965 * Get the ancestors, up to the root, that match th
982 NodeSetDTM ancestors = new NodeSetDTM(xctxt.getDTMManager()); local
    [all...]
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
tree.rb 215 [ancestors] the list of successive parents from a tree node to the root node
277 def ancestors method in class:ANTLR3.AST
    [all...]
  /external/antlr/antlr-3.4/runtime/Python/antlr3/
tree.py 144 """Return a list of all ancestors of this node.
904 """Return a list of all ancestors of this node.
912 ancestors = []
915 ancestors.insert(0, t) # insert at start
918 return ancestors
    [all...]
  /external/webkit/PerformanceTests/SunSpider/tests/parse-only/
prototype-1.6.0.3.js     [all...]

Completed in 1843 milliseconds

1 2