Lines Matching defs:top_
35 Traversal() : top_(kInvalidId) { }
41 // If |top_| is invalid, this is the first insertion -- easy.
42 if (top_ == kInvalidId) {
43 top_ = child_handle;
48 while (node_to_include != kInvalidId && node_to_include != top_) {
55 // (it would have to be |top_| if it were), start a new expansion
56 // upwards from |top_| to unite the original traversal with the
58 node_to_include = top_;
59 top_ = node.GetMetahandle();
83 int64 top() const { return top_; }
103 // this is kInvalidId. If the traversal contains exactly one member, |top_|
105 int64 top_;
106 // A set of single-level links that compose the traversal below |top_|. The
111 // topmost node, |top_|.
