go/task
1
0
Fork 0
mirror of https://github.com/go-task/task.git synced 2025-11-25 22:32:55 +02:00
Code Issues Releases Activity

feat: add support for multiple includes on a graph edge

Browse Source
This commit is contained in:
Pete Davison
2024-04-21 15:28:02 +00:00
parent 6951e5cd0c
commit f19c520f23
10 changed files with 41 additions and 56 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
taskfile/reader.go
View File

@@ -140,17 +140,21 @@ func (r *Reader) include(node Node) error {
}
// Create an edge between the Taskfiles
err = r.graph.AddEdge(node.Location(), includeNode.Location(), graph.EdgeData(include))
if errors.Is(err, graph.ErrEdgeAlreadyExists) {
edge, err := r.graph.Edge(node.Location(), includeNode.Location())
if err != nil {
return err
}
return &errors.TaskfileDuplicateIncludeError{
URI: node.Location(),
IncludedURI: includeNode.Location(),
Namespaces: []string{namespace, edge.Properties.Data.(*ast.Include).Namespace},
}
edge, err := r.graph.Edge(node.Location(), includeNode.Location())
if err == graph.ErrEdgeNotFound {
// If the edge doesn't exist, create it
err = r.graph.AddEdge(
node.Location(),
includeNode.Location(),
graph.EdgeData([]*ast.Include{include}),
)
} else {
// If the edge already exists
err = r.graph.UpdateEdge(
node.Location(),
includeNode.Location(),
graph.EdgeData(append(edge.Properties.Data.([]*ast.Include), include)),
)
}
if errors.Is(err, graph.ErrEdgeCreatesCycle) {
return errors.TaskfileCycleError{