Lines Matching defs:level
137 // (bit==kRight) child of the node on the path of {tree} at tree level
138 // {level}.
139 static const FocusedTree* GetChild(const FocusedTree* tree, int level,
142 // Find the leftmost path in the tree, starting at the node at tree level
143 // {level} on the path of {start}. Output the level of the leaf to {level} and
146 const FocusedTree* start, int* level,
170 // focused node of another {FocusedTree} always references to one tree level
414 int level = 0;
416 while ((hash ^ tree->key_hash)[level] == 0) {
417 ++level;
419 tree = level < tree->length ? tree->path(level) : nullptr;
420 ++level;
431 int level = 0;
434 while ((hash ^ tree->key_hash)[level] == 0) {
435 (*path)[level] = level < map_length ? tree->path(level) : nullptr;
436 ++level;
438 (*path)[level] = tree;
439 tree = level < tree->length ? tree->path(level) : nullptr;
440 ++level;
443 while (level < tree->length) {
444 (*path)[level] = tree->path(level);
445 ++level;
448 *length = level;
475 PersistentMap<Key, Value, Hasher>::GetChild(const FocusedTree* tree, int level,
477 if (tree->key_hash[level] == bit) {
479 } else if (level < tree->length) {
480 return tree->path(level);
489 const FocusedTree* start, int* level,
492 while (*level < current->length) {
493 if (const FocusedTree* left_child = GetChild(current, *level, kLeft)) {
494 (*path)[*level] = GetChild(current, *level, kRight);
496 ++*level;
498 GetChild(current, *level, kRight)) {
499 (*path)[*level] = GetChild(current, *level, kLeft);
501 ++*level;