tiny.arrange.IndexedInput

1pub const IndexedInput = struct {2    context: ?*anyopaque,3    count: u32,4    get: *const fn (?*anyopaque, u32) Node,5    descendants: *const fn (?*anyopaque, u32) u32,6    is_leaf: ?*const fn (?*anyopaque, u32) bool = null,7    rects: []Rect,89    pub const flat = true;1011    fn node(self: IndexedInput, index: usize) Node {12        std.debug.assert(index < self.count);13        return self.get(self.context, @intCast(index));14    }1516    fn children(self: IndexedInput, index: usize) IndexedChildren {17        const end = index + self.descendants(self.context, @intCast(index)) + 1;18        std.debug.assert(end <= self.count);19        return .{ .source = self, .cursor = index + 1, .end = end };20    }2122    fn childCount(self: IndexedInput, index: usize) usize {23        if (self.is_leaf) |is_leaf| {24            if (is_leaf(self.context, @intCast(index))) return 0;25        }26        var iter = self.children(index);27        var count: usize = 0;28        while (iter.next()) |_| count += 1;29        return count;30    }3132    fn recordRect(self: IndexedInput, index: usize, rect: Rect) void {33        self.rects[index] = rect;34    }35};

1pub const IndexedInput = compute.IndexedInput;