Lines Matching refs:traversal
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,
101 // and thus the first node to be traversed. If the traversal is empty,
102 // this is kInvalidId. If the traversal contains exactly one member, |top_|
105 // A set of single-level links that compose the traversal below |top_|. The
107 // given the parent handle, which is used for top-down traversal. |links_|
113 DISALLOW_COPY_AND_ASSIGN(Traversal);
129 // (b) Construct a traversal spanning all non-deleted items.
132 Traversal traversal;
146 traversal.ExpandToInclude(trans, i->first);
159 // Step 2: Breadth-first expansion of the traversal, enumerating children in
162 to_visit.push(traversal.top());
187 // in the traversal (and not in sibling order).
188 Traversal::LinkSet::const_iterator j = traversal.begin_children(next);
189 Traversal::LinkSet::const_iterator end = traversal.end_children(next);
