Plan is a directed acyclic graph of operations produced by the reconciler. Nodes are stored in topological order (dependencies before dependents).
| 117 | // Plan is a directed acyclic graph of operations produced by the reconciler. |
| 118 | // Nodes are stored in topological order (dependencies before dependents). |
| 119 | type Plan struct { |
| 120 | Nodes []*PlanNode |
| 121 | nextID int |
| 122 | } |
| 123 | |
| 124 | // addNode appends a new node to the plan and returns it. |
| 125 | func (p *Plan) addNode(op Operation, group string, deps ...*PlanNode) *PlanNode { |
nothing calls this directly
no outgoing calls
no test coverage detected