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

  /libcore/luni/src/main/java/org/w3c/dom/traversal/
NodeIterator.java 13 package org.w3c.dom.traversal;
25 * document-order traversal of a document subtree. Instances of these
28 * <p>See also the <a href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>Document Object Model (DOM) Level 2 Traversal and Range Specification</a>.
NodeFilter.java 13 package org.w3c.dom.traversal;
21 * node. If the filter says to accept the node, the traversal logic returns
22 * it; otherwise, traversal looks for the next node and pretends that the
32 * <p>See also the <a href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>Document Object Model (DOM) Level 2 Traversal and Range Specification</a>.
76 * or traversal. Since attributes are never children of other nodes,
97 * position of the traversal. Since entities are not part of the
127 * position of the traversal. Since notations are not part of the
  /external/chromium/chrome/browser/sync/engine/
change_reorder_buffer.cc 23 // Traversal provides a way to collect a set of nodes from the syncable
26 // Traversal starts out empty and is grown by means of the ExpandToInclude
29 class ChangeReorderBuffer::Traversal {
34 Traversal() : top_(kInvalidId) { }
36 // Expand the traversal so that it includes the node indicated by
55 // upwards from |top_| to unite the original traversal with the
80 // Return the top node of the traversal. Use this as a starting point
84 // Return an iterator corresponding to the first child (in the traversal)
93 // Return an iterator corresponding to the last child in the traversal
100 // The topmost point in the directory hierarchy that is in the traversal,
132 Traversal traversal; local
    [all...]

Completed in 284 milliseconds