| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| H A D | ANTLRUnbufferedCommonTreeNodeStreamState.h | 32 ANTLRCommonTree *previousNode; variable
45 - (ANTLRCommonTree *) previousNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| H A D | ANTLRUnbufferedCommonTreeNodeStreamState.h | 32 ANTLRCommonTree *previousNode; variable
45 - (ANTLRCommonTree *) previousNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| H A D | ANTLRUnbufferedCommonTreeNodeStreamState.h | 32 ANTLRCommonTree *previousNode; variable
45 - (ANTLRCommonTree *) previousNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| H A D | ANTLRUnbufferedCommonTreeNodeStreamState.h | 32 ANTLRCommonTree *previousNode; variable
45 - (ANTLRCommonTree *) previousNode;
|
| H A D | ANTLRUnbufferedCommonTreeNodeStream.h | 40 ANTLRCommonTree *previousNode; variable
61 @property (retain, getter=getPreviousNode, setter=setPreviousNode:) ANTLRCommonTree *previousNode; variable
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| H A D | NodeIterator.idl | 34 [RaisesException] Node previousNode();
|
| H A D | TreeWalker.idl | 37 [RaisesException] Node previousNode();
|
| H A D | NodeRenderingTraversal.cpp | 124 Node* previousNode = previousSibling(node); local
127 if (parentNode && parentNode->isElementNode() && !previousNode) {
135 return previousNode;
160 if (Node* previousNode = pseudoAwarePreviousSibling(node)) {
161 while (Node* previousLastChild = pseudoAwareLastChild(previousNode))
162 previousNode = previousLastChild;
163 return previousNode;
|
| H A D | TreeWalker.h | 55 Node* previousNode(ExceptionState&);
|
| H A D | NodeIterator.h | 50 PassRefPtrWillBeRawPtr<Node> previousNode(ExceptionState&);
|
| H A D | NodeIterator.cpp | 113 PassRefPtrWillBeRawPtr<Node> NodeIterator::previousNode(ExceptionState& exceptionState) function in class:WebCore::NodeIterator
|
| H A D | TreeWalker.cpp | 214 Node* TreeWalker::previousNode(ExceptionState& exceptionState) function in class:WebCore::TreeWalker
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| H A D | DTMIterator.java | 183 public int previousNode(); method in interface:DTMIterator
189 * calls to <code>nextNode</code> or <code>previousNode</code> will
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| H A D | DTMNodeIterator.java | 176 public Node previousNode() method in class:DTMNodeIterator
181 int handle=dtm_iter.previousNode();
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/ |
| H A D | navigation_history.js | 69 var previousNode = this.history_[0];
72 if (newNode && newNode != previousNode) {
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| H A D | antlr3commontreenodestream.h | 228 pANTLR3_BASE_TREE previousNode; member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
323 pANTLR3_BASE_TREE previousNode; member in struct:ANTLR3_TREE_WALK_STATE_struct
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| H A D | NodeSequence.java | 370 * @see DTMIterator#previousNode()
372 public int previousNode() method in class:NodeSequence
386 int n = m_iter.previousNode();
507 while ((m_next >= index) && DTM.NULL != (n = previousNode()));
|
| H A D | LocPathIterator.java | 44 * in the NodeVector, so that previousNode() can easily be done, except in
585 public int previousNode() method in class:LocPathIterator
673 * <code>nextNode</code> or<code>previousNode</code> will raise the
|
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| H A D | VisibleUnits.cpp | 85 Node* previousNode = previousLeafWithSameEditability(node, editableType); local
87 while (previousNode && (!previousNode->renderer() || inSameLine(VisiblePosition(firstPositionInOrBeforeNode(previousNode)), visiblePosition)))
88 previousNode = previousLeafWithSameEditability(previousNode, editableType);
90 while (previousNode && !previousNode->isShadowRoot()) {
91 if (highestEditableRoot(firstPositionInOrBeforeNode(previousNode), editableType) != highestRoot)
94 Position pos = isHTMLBRElement(*previousNode)
[all...] |
| H A D | htmlediting.cpp | 623 Node* previousNode = 0; local
627 if (!renderer->canHaveChildren() || hasARenderedDescendant(node, previousNode) || rootEditableElement == node || excludeNode == node)
628 return previousNode;
630 previousNode = node;
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/ |
| H A D | DataGrid.js | 1760 var previousNode = this.traversePreviousNode(true, true);
1761 if (previousNode && previousNode.element.parentNode && previousNode.element.nextSibling)
1762 nextNode = previousNode.element.nextSibling;
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| H A D | NodeSetDTM.java | 411 public int previousNode() method in class:NodeSetDTM
432 * <code>nextNode</code> or<code>previousNode</code> will raise the
|
| H A D | NodeSet.java | 267 public Node previousNode() throws DOMException method in class:NodeSet
288 * <code>nextNode</code> or<code>previousNode</code> will raise the
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| H A D | dom_util.js | 1176 * compared to the previousNode. Having such an array is useful in generating
1180 * @param {Node} previousNode The previous node.
1183 * where node's ancestors is a subset of previousNode's ancestors.
1188 previousNode, currentNode, opt_fallback) {
1189 var prevAncestors = cvox.DomUtil.getAncestors(previousNode);
|
| /external/jdiff/ |
| H A D | xerces.jar | META-INF/ META-INF/MANIFEST.MF META-INF/services/ org/ org/apache/ org/apache/html/ ... |