6f42e1134b
This change introduces object monikers. These are unique, serializable names that refer to resources created during the execution of a MuIL program. They are pretty darned ugly at the moment, but at least they serve their desired purpose. I suspect we will eventually want to use more information (like edge "labels" (variable names and what not)), but this should suffice for the time being. The names right now are particularly sensitive to simple refactorings. This is enough for marapongo/mu#69 during the current sprint, although I will keep the work item (in a later sprint) to think more about how to make these more stable. I'd prefer to do that with a bit of experience under our belts first.
36 lines
1.8 KiB
Go
36 lines
1.8 KiB
Go
// Copyright 2016 Marapongo, Inc. All rights reserved.
|
|
|
|
// Package graph defines MuGL graphs. Each graph is directed and acyclic, and the nodes have been topologically
|
|
// sorted based on dependencies (edges) between them. Each node in the graph has a type and a set of properties.
|
|
//
|
|
// There are two forms of graph: complete and incomplete. A complete graph is one in which all nodes and their property
|
|
// values are known. An incomplete graph is one where two uncertainties may arise: (1) an edge might be "conditional",
|
|
// indicating that its presence or absence is dependent on a piece of information not yet available (like an output
|
|
// property from a resource), and/or (2) a property may either be similarly conditional or computed as an output value.
|
|
//
|
|
// In general, Mu blueprints may be compiled into graphs. These graphs may then be compared to other graphs to produce
|
|
// and/or carry out deployment plans. This package therefore also exposes operations necessary for diffing graphs.
|
|
package graph
|
|
|
|
import (
|
|
"github.com/marapongo/mu/pkg/eval/rt"
|
|
)
|
|
|
|
// Graph is an instance of a MuGL graph. Each is associated with a single blueprint MuPackage as its input, along with
|
|
// a set of optional arguments used to evaluate it, along with the output DAG with node types and properties.
|
|
type Graph interface {
|
|
Roots() []Edge // the root edges.
|
|
}
|
|
|
|
// Vertex is a single vertex within an overall MuGL graph.
|
|
type Vertex interface {
|
|
Obj() *rt.Object // the vertex's object.
|
|
Ins() []Edge // incoming edges from other vertices within the graph to this vertex.
|
|
Outs() []Edge // outgoing edges from this vertex to other vertices within the graph.
|
|
}
|
|
|
|
// Edge is a directed edge from one vertex to another.
|
|
type Edge interface {
|
|
To() Vertex // the vertex this edge connects to.
|
|
From() Vertex // the vertex this edge connects from.
|
|
}
|