OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:NodeIterator
(Results
1 - 5
of
5
) sorted by null
/external/webkit/WebCore/dom/
NodeIterator.cpp
26
#include "
NodeIterator
.h"
35
NodeIterator
::NodePointer::NodePointer()
39
NodeIterator
::NodePointer::NodePointer(PassRefPtr<Node> n, bool b)
45
void
NodeIterator
::NodePointer::clear()
50
bool
NodeIterator
::NodePointer::moveToNext(Node* root)
62
bool
NodeIterator
::NodePointer::moveToPrevious(Node* root)
74
NodeIterator
::
NodeIterator
(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences)
82
NodeIterator
::~
NodeIterator
()
[
all
...]
NodeIterator.h
37
class
NodeIterator
: public RefCounted<
NodeIterator
>, public Traversal {
39
static PassRefPtr<
NodeIterator
> create(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences)
41
return adoptRef(new
NodeIterator
(rootNode, whatToShow, filter, expandEntityReferences));
43
~
NodeIterator
();
61
NodeIterator
(PassRefPtr<Node>, unsigned whatToShow, PassRefPtr<NodeFilter>, bool expandEntityReferences);
/libcore/luni/src/main/java/org/w3c/dom/traversal/
NodeIterator.java
23
* the implementation of the <code>
NodeIterator
</code>. DOM Level 2
24
* specifies a single <code>
NodeIterator
</code> implementation for
33
public interface
NodeIterator
{
35
* The root node of the <code>
NodeIterator
</code>, as specified when it
42
* <code>
NodeIterator
</code>. The available set of constants is defined
57
* reference nodes are visible to the <code>
NodeIterator
</code>. If
68
* <code>
NodeIterator
</code>. To produce a view of the document that has
77
* <code>
NodeIterator
</code> in the set. After a
78
* <code>
NodeIterator
</code> is created, the first call to
91
* <code>
NodeIterator
</code> backwards in the set
[
all
...]
/external/guava/src/com/google/common/collect/
LinkedListMultimap.java
273
private class
NodeIterator
implements Iterator<Node<K, V>> {
432
for (Iterator<Node<K, V>> i = new
NodeIterator
(); i.hasNext();) {
617
final Iterator<Node<K, V>> nodes = new
NodeIterator
();
731
final Iterator<Node<K, V>> nodes = new
NodeIterator
();
775
final Iterator<Node<K, V>> nodes = new
NodeIterator
();
/prebuilt/common/groovy/
groovy-all-1.7.0.jar
Completed in 52 milliseconds