beads/internal/storage/issueops/dependency_tree.go
2026-06-18 15:44:45 -07:00

64 lines
1.9 KiB
Go

package issueops
import (
"context"
"github.com/steveyegge/beads/internal/types"
)
// GetDependencyTreeInTx returns a flattened dependency tree for visualization.
// It performs a recursive BFS traversal up to maxDepth, using GetIssueInTx and
// GetDependenciesInTx/GetDependentsInTx which handle wisp routing.
func GetDependencyTreeInTx(ctx context.Context, tx DBTX, issueID string, maxDepth int, showAllPaths bool, reverse bool) ([]*types.TreeNode, error) {
visited := make(map[string]bool)
return buildDependencyTreeInTx(ctx, tx, issueID, 0, maxDepth, reverse, visited, "", "")
}
func buildDependencyTreeInTx(ctx context.Context, tx DBTX, issueID string, depth, maxDepth int, reverse bool, visited map[string]bool, parentID string, edgeFromParent types.DependencyType) ([]*types.TreeNode, error) {
if depth >= maxDepth || visited[issueID] {
return nil, nil
}
visited[issueID] = true
issue, err := GetIssueInTx(ctx, tx, issueID)
if err != nil {
return nil, err
}
// Use metadata-aware queries to get dependency type for tree annotation (GH#3565).
var related []*types.IssueWithDependencyMetadata
if reverse {
related, err = GetDependentsWithMetadataInTx(ctx, tx, issueID)
} else {
related, err = GetDependenciesWithMetadataInTx(ctx, tx, issueID)
}
if err != nil {
return nil, err
}
node := &types.TreeNode{
Issue: *issue,
Depth: depth,
ParentID: parentID,
EdgeFromParent: edgeFromParent,
}
// TreeNode doesn't have Children field - return flat list
nodes := []*types.TreeNode{node}
for _, rel := range related {
if !isDependencyTreeEdge(rel.DependencyType) {
continue
}
children, err := buildDependencyTreeInTx(ctx, tx, rel.ID, depth+1, maxDepth, reverse, visited, issueID, rel.DependencyType)
if err != nil {
return nil, err
}
nodes = append(nodes, children...)
}
return nodes, nil
}
func isDependencyTreeEdge(depType types.DependencyType) bool {
return depType != types.DepRelatesTo
}