Method next

Fleece/Tree/MutableHashTree.cc:201–232

            { }

            pair<slice,Value> next() {
                while (unsigned(++current.index) >= current.parent.childCount()) {
                    if (depth > 0) {
                        // Pop the stack:
                        current = stack[--depth];
                    } else {
                        node.reset();      // at end
                        return {};
                    }
                }

                // Get the current node:
                while (true) {
                    node = current.parent.childAtIndex(current.index);
                    if (node.isLeaf())
                        break;

                    // If it's an interior node, recurse into its children:
                    assert(depth < kMaxDepth);
                    stack[depth++] = current;
                    current = {node, 0};
                }

                // Return the current leaf's key/value:
                if (node.isMutable()) {
                    auto leaf = ((MutableLeaf*)node.asMutable());
                    return {leaf->_key, leaf->_value};
                } else {
                    auto &leaf = node.asImmutable()->leaf;
                    return {leaf.keyString(), leaf.value()};
                }
            }
        };

    }