HomeSort by relevance Sort by last modified time
    Searched defs:NodeIterator (Results 1 - 9 of 9) sorted by null

  /external/webkit/Source/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)
85 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/guava/src/com/google/common/collect/
LinkedListMultimap.java 279 private class NodeIterator implements ListIterator<Node<K, V>> {
285 NodeIterator() {
288 NodeIterator(int index) {
518 for (Iterator<Node<K, V>> i = new NodeIterator(); i.hasNext();) {
718 final Iterator<Node<K, V>> nodes = new NodeIterator();
852 final NodeIterator nodes = new NodeIterator(index);
943 final ListIterator<Node<K, V>> nodes = new NodeIterator(index);
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
LinkedListMultimap.java 275 private class NodeIterator implements ListIterator<Node<K, V>> {
281 NodeIterator() {
284 NodeIterator(int index) {
514 for (Iterator<Node<K, V>> i = new NodeIterator(); i.hasNext();) {
714 final Iterator<Node<K, V>> nodes = new NodeIterator();
848 final NodeIterator nodes = new NodeIterator(index);
939 final ListIterator<Node<K, V>> nodes = new NodeIterator(index);
  /external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
FlexAntTasks.jar 
  /prebuilt/common/groovy/
groovy-all-1.7.0.jar 
  /prebuilts/tools/common/guava-tools/
guava-10.0.1.jar 
  /prebuilt/common/tradefed/
tradefed-prebuilt.jar 

Completed in 106 milliseconds