groups: add graph.IsRoot

graph/ids.go

@@ -48,3 +48,8 @@ func BaseID(id string) string {
 func IsDescendentID(parent, child string) bool {
 	return parent != child && strings.HasPrefix(child, parent)
 }
+
+// IsRoot checks if the ID identifies the root
+func IsRoot(id string) bool {
+	return id == "root"
+}

graph/ids_test.go

@@ -68,3 +68,16 @@ func TestIsDescendentIDNot(t *testing.T) {
 
 	assert.False(t, graph.IsDescendentID("a/b", "a/c"))
 }
+
+// TestIsRoot tests the IsRoot function
+func TestIsRoot(t *testing.T) {
+	t.Parallel()
+
+	t.Run("is root", func(t *testing.T) {
+		assert.True(t, graph.IsRoot("root"))
+	})
+
+	t.Run("is not root", func(t *testing.T) {
+		assert.False(t, graph.IsRoot("root/module.test"))
+	})
+}

graph/merge_duplicates.go

@@ -35,7 +35,7 @@ func MergeDuplicates(ctx context.Context, g *Graph, skip SkipMergeFunc) (*Graph,
 	logger := logging.GetLogger(ctx).WithField("function", "MergeDuplicates")
 
 	return g.RootFirstTransform(ctx, func(meta *node.Node, out *Graph) error {
-		if meta.ID == "root" {
+		if IsRoot(meta.ID) {
 			return nil
 		}
 

load/dependencyresolver.go

@@ -143,7 +143,7 @@ func getXrefs(g *graph.Graph, id string, node *parse.Node) (out []string, err er
 }
 
 func getPeerVertex(src, dst string) (string, bool) {
-	if dst == "." || dst == "root" {
+	if dst == "." || graph.IsRoot(dst) {
 		return "", false
 	}
 	if graph.AreSiblingIDs(src, dst) {
@@ -153,7 +153,7 @@ func getPeerVertex(src, dst string) (string, bool) {
 }
 
 func getNearestAncestor(g *graph.Graph, id, node string) (string, bool) {
-	if id == "root" || id == "" || id == "." {
+	if graph.IsRoot(id) || id == "" || id == "." {
 		return "", false
 	}
 

load/resource.go

@@ -49,7 +49,7 @@ func SetResources(ctx context.Context, g *graph.Graph) (*graph.Graph, error) {
 	logger.Debug("loading resources")
 
 	return g.Transform(ctx, func(meta *node.Node, out *graph.Graph) error {
-		if meta.ID == "root" {
+		if graph.IsRoot(meta.ID) {
 			return nil
 		}
 

render/preprocessor/preprocessor.go

@@ -181,7 +181,7 @@ func VertexSplitTraverse(g *graph.Graph, toFind string, startingNode string, sto
 // VertexSplitTraverse and will cause vertex splitting to propogate upwards
 // until it encounters a module
 func TraverseUntilModule(g *graph.Graph, id string) bool {
-	if id == "root" {
+	if graph.IsRoot(id) {
 		return true
 	}
 	elemMeta, ok := g.Get(id)

render/render.go

@@ -76,7 +76,7 @@ func Pipeline(g *graph.Graph, id string, factory *Factory, top Values) executor.
 // the node is a valide resource.Resource return it.  If it's not root and not a
 // resource.Resource return an error.
 func (p pipelineGen) maybeTransformRoot(idi interface{}) (interface{}, error) {
-	if p.ID == "root" {
+	if graph.IsRoot(p.ID) {
 		return module.NewPreparer(p.Top), nil
 	}
 	if res, ok := idi.(resource.Resource); ok {

render/renderer.go

@@ -74,7 +74,7 @@ func (r *Renderer) Render(name, src string) (string, error) {
 }
 
 func getNearestAncestor(g *graph.Graph, id, node string) (string, bool) {
-	if node == "root" || node == "" {
+	if graph.IsRoot(node) || node == "" {
 		return "", false
 	}
 	siblingID := graph.SiblingID(id, node)