OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:previousNode
(Results
1 - 25
of
38
) sorted by null
1
2
/libcore/luni/src/main/java/org/w3c/dom/traversal/
NodeIterator.java
98
public Node
previousNode
()
106
* or <code>
previousNode
</code> will raise the exception
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
ANTLRUnbufferedCommonTreeNodeStreamState.h
32
ANTLRCommonTree *
previousNode
;
45
- (ANTLRCommonTree *)
previousNode
;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
ANTLRUnbufferedCommonTreeNodeStreamState.h
32
ANTLRCommonTree *
previousNode
;
45
- (ANTLRCommonTree *)
previousNode
;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
ANTLRUnbufferedCommonTreeNodeStreamState.h
32
ANTLRCommonTree *
previousNode
;
45
- (ANTLRCommonTree *)
previousNode
;
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRUnbufferedCommonTreeNodeStreamState.h
32
ANTLRCommonTree *
previousNode
;
45
- (ANTLRCommonTree *)
previousNode
;
ANTLRUnbufferedCommonTreeNodeStream.h
40
ANTLRCommonTree *
previousNode
;
61
@property (retain, getter=getPreviousNode, setter=setPreviousNode:) ANTLRCommonTree *
previousNode
;
/external/chromium_org/third_party/WebKit/Source/core/dom/
NodeIterator.idl
34
[RaisesException] Node
previousNode
();
TreeWalker.idl
37
[RaisesException] Node
previousNode
();
NodeRenderingTraversal.cpp
124
Node*
previousNode
= previousSibling(node);
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
;
TreeWalker.h
55
Node*
previousNode
(ExceptionState&);
NodeIterator.h
50
PassRefPtrWillBeRawPtr<Node>
previousNode
(ExceptionState&);
NodeIterator.cpp
113
PassRefPtrWillBeRawPtr<Node> NodeIterator::
previousNode
(ExceptionState& exceptionState)
TreeWalker.cpp
214
Node* TreeWalker::
previousNode
(ExceptionState& exceptionState)
/external/apache-xml/src/main/java/org/apache/xml/dtm/
DTMIterator.java
183
public int
previousNode
();
189
* calls to <code>nextNode</code> or <code>
previousNode
</code> will
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
DTMNodeIterator.java
176
public Node
previousNode
()
181
int handle=dtm_iter.
previousNode
();
/external/antlr/antlr-3.4/runtime/C/include/
antlr3commontreenodestream.h
228
pANTLR3_BASE_TREE
previousNode
;
323
pANTLR3_BASE_TREE
previousNode
;
/external/apache-xml/src/main/java/org/apache/xpath/axes/
NodeSequence.java
370
* @see DTMIterator#
previousNode
()
372
public int
previousNode
()
386
int n = m_iter.
previousNode
();
507
while ((m_next >= index) && DTM.NULL != (n =
previousNode
()));
LocPathIterator.java
44
* in the NodeVector, so that
previousNode
() can easily be done, except in
585
public int
previousNode
()
673
* <code>nextNode</code> or<code>
previousNode
</code> will raise the
/external/chromium_org/third_party/WebKit/Source/core/editing/
VisibleUnits.cpp
85
Node*
previousNode
= previousLeafWithSameEditability(node, editableType);
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
) ? positionBeforeNode(previousNode)
[
all
...]
htmlediting.cpp
623
Node*
previousNode
= 0;
627
if (!renderer->canHaveChildren() || hasARenderedDescendant(node,
previousNode
) || rootEditableElement == node || excludeNode == node)
628
return
previousNode
;
630
previousNode
= node;
[
all
...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/
navigation_history.js
69
var
previousNode
= this.history_[0];
72
if (newNode && newNode !=
previousNode
) {
/external/apache-xml/src/main/java/org/apache/xpath/
NodeSetDTM.java
411
public int
previousNode
()
432
* <code>nextNode</code> or<code>
previousNode
</code> will raise the
[
all
...]
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/uimodel/
UiElementNode.java
[
all
...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/
DataGrid.js
[
all
...]
/prebuilts/tools/common/m2/repository/org/apache/maven/shared/maven-dependency-tree/1.2/
maven-dependency-tree-1.2.jar
Completed in 1937 milliseconds
1
2