Searched refs:previousNode (Results 1 - 25 of 28) sorted by relevance

12

/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRUnbufferedCommonTreeNodeStreamState.h32 ANTLRCommonTree *previousNode; variable
45 - (ANTLRCommonTree *) previousNode;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRUnbufferedCommonTreeNodeStreamState.h32 ANTLRCommonTree *previousNode; variable
45 - (ANTLRCommonTree *) previousNode;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRUnbufferedCommonTreeNodeStreamState.h32 ANTLRCommonTree *previousNode; variable
45 - (ANTLRCommonTree *) previousNode;
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRUnbufferedCommonTreeNodeStreamState.h32 ANTLRCommonTree *previousNode; variable
45 - (ANTLRCommonTree *) previousNode;
H A DANTLRUnbufferedCommonTreeNodeStream.h40 ANTLRCommonTree *previousNode; variable
61 @property (retain, getter=getPreviousNode, setter=setPreviousNode:) ANTLRCommonTree *previousNode; variable
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DNodeIterator.idl34 [RaisesException] Node previousNode();
H A DTreeWalker.idl37 [RaisesException] Node previousNode();
H A DNodeRenderingTraversal.cpp122 Node* previousNode = previousSibling(node); local
125 if (parentNode && parentNode->isElementNode() && !previousNode) {
133 return previousNode;
158 if (Node* previousNode = pseudoAwarePreviousSibling(node)) {
159 while (Node* previousLastChild = pseudoAwareLastChild(previousNode))
160 previousNode = previousLastChild;
161 return previousNode;
H A DTreeWalker.h56 Node* previousNode(ExceptionState&);
H A DNodeIterator.h53 PassRefPtrWillBeRawPtr<Node> previousNode(ExceptionState&);
H A DNodeIterator.cpp112 PassRefPtrWillBeRawPtr<Node> NodeIterator::previousNode(ExceptionState& exceptionState) function in class:blink::NodeIterator
H A DTreeWalker.cpp213 Node* TreeWalker::previousNode(ExceptionState& exceptionState) function in class:blink::TreeWalker
/external/apache-xml/src/main/java/org/apache/xml/dtm/
H A DDTMIterator.java183 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 DDTMNodeIterator.java176 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 Dnavigation_history.js69 var previousNode = this.history_[0];
72 if (newNode && newNode != previousNode) {
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3commontreenodestream.h228 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 DNodeSequence.java370 * @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 DLocPathIterator.java44 * 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 DVisibleUnits.cpp85 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 Dhtmlediting.cpp645 Node* previousNode = 0; local
649 if (!renderer->canHaveChildren() || hasARenderedDescendant(node, previousNode) || rootEditableElement == node || excludeNode == node)
650 return previousNode;
652 previousNode = node;
/external/chromium_org/third_party/WebKit/Source/core/html/
H A DHTMLTextFormControlElement.cpp853 Node* previousNode = NodeTraversal::previous(node, innerEditor); local
854 if (!previousNode)
857 if (isHTMLBRElement(previousNode))
858 return Position(previousNode, Position::PositionIsAfterAnchor);
860 if (previousNode->isTextNode())
861 return Position(toText(previousNode), toText(previousNode)->length());
/external/apache-xml/src/main/java/org/apache/xpath/
H A DNodeSetDTM.java411 public int previousNode() method in class:NodeSetDTM
432 * <code>nextNode</code> or<code>previousNode</code> will raise the
H A DNodeSet.java267 public Node previousNode() throws DOMException method in class:NodeSet
288 * <code>nextNode</code> or<code>previousNode</code> will raise the
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/
H A DDataGrid.js1706 var previousNode = this.traversePreviousNode(true, true);
1707 var previousElement = previousNode ? previousNode.element() : this.dataGrid._topFillerRow;
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Ddom_util.js1226 * compared to the previousNode. Having such an array is useful in generating
1230 * @param {Node} previousNode The previous node.
1233 * where node's ancestors is a subset of previousNode's ancestors.
1238 previousNode, currentNode, opt_fallback) {
1239 var prevAncestors = cvox.DomUtil.getAncestors(previousNode);

Completed in 595 milliseconds

12