rulegraph

Documentation

Index

• func EmitGraph(g *Graph, w io.Writer)
• func LoadRuleFiles(names ...string) ([]rulefmt.RuleGroup, error)
• func LoadRulefile(filename string) ([]rulefmt.RuleGroup, error)
• type Graph
  • func BuildRuleDiagram(groups []rulefmt.RuleGroup) *Graph
  • func (g *Graph) Visit(node parser.Node, path []parser.Node) (parser.Visitor, error)

Functions

func EmitGraph

func EmitGraph(g *Graph, w io.Writer)

func LoadRuleFiles

func LoadRuleFiles(names ...string) ([]rulefmt.RuleGroup, error)

func LoadRulefile

func LoadRulefile(filename string) ([]rulefmt.RuleGroup, error)

Types

type Graph

type Graph struct {
	// contains filtered or unexported fields
}

Nodes and edges for a graph. This also has some internal data structures to facilitate walking the expression tree(s) of rules.

func BuildRuleDiagram

func BuildRuleDiagram(groups []rulefmt.RuleGroup) *Graph

Build a diagram of the interdependency of all rule files passed in. We expect that these have already been checked for errors and passed that check.

When we have processed these, simply serialise the graph as a DOT graph to w.

func (*Graph) Visit

func (g *Graph) Visit(node parser.Node, path []parser.Node) (parser.Visitor, error)

Method implementing the promql parser Visitor interface.