tiny.sql.TreeRoot

1pub const Root = struct {2    allocator: Allocator,3    summary: Summary,4    hash: Hash,5    subtree: Hash,6    nodes: []Node,7    edges: []usize,89    pub fn deinit(self: *Root) void {10        for (self.nodes) |node| {11            self.allocator.free(node.lower);12            if (node.upper) |upper| self.allocator.free(upper);13        }14        self.allocator.free(self.nodes);15        self.allocator.free(self.edges);16        self.* = undefined;17    }1819    pub fn clone(self: *const Root, allocator: Allocator) Allocator.Error!Root {20        const nodes = try allocator.alloc(Node, self.nodes.len);21        var node_count: usize = 0;22        errdefer {23            for (nodes[0..node_count]) |node| {24                allocator.free(node.lower);25                if (node.upper) |upper| allocator.free(upper);26            }27            allocator.free(nodes);28        }29        for (self.nodes, nodes) |node, *target| {30            const lower = try allocator.dupe(u8, node.lower);31            errdefer allocator.free(lower);32            const upper = if (node.upper) |bytes| try allocator.dupe(u8, bytes) else null;33            errdefer if (upper) |bytes| allocator.free(bytes);34            target.* = .{35                .kind = node.kind,36                .lower = lower,37                .upper = upper,38                .depth = node.depth,39                .summary = node.summary,40                .hash = node.hash,41                .children_start = node.children_start,42                .children_len = node.children_len,43            };44            node_count += 1;45        }4647        const edges = try allocator.dupe(usize, self.edges);48        errdefer allocator.free(edges);49        return .{50            .allocator = allocator,51            .summary = self.summary,52            .hash = self.hash,53            .subtree = self.subtree,54            .nodes = nodes,55            .edges = edges,56        };57    }5859    pub fn rootNode(self: *const Root) *const Node {60        return &self.nodes[0];61    }6263    pub fn childIndexes(self: *const Root, node: *const Node) []const usize {64        return self.edges[node.children_start..][0..node.children_len];65    }6667    pub fn child(self: *const Root, node: *const Node, index: usize) ?*const Node {68        if (index >= node.children_len) return null;69        return &self.nodes[self.edges[node.children_start + index]];70    }71};

1pub const TreeRoot = tree.Root;