utils

Documentation

Index

• func HasOuterAggregation(node *parser.PromQLNode) (aggs []*promParser.AggregateExpr)
• func HasOuterBinaryExpr(node *parser.PromQLNode) *promParser.BinaryExpr
• func HasOuterRate(node *parser.PromQLNode) (calls []*promParser.Call)
• func HasOuterSum(node *parser.PromQLNode) (calls []*promParser.AggregateExpr)
• func HasVectorSelector(node *parser.PromQLNode) (vs []*promParser.VectorSelector)
• func RemoveConditions(source string) promParser.Node
• type Node
  • func Tree(expr parser.Node, parent *Node) Node
  • func WalkDown[T parser.Node](node *Node) (nodes []*Node)
  • func WalkUp[T parser.Node](node *Node) (nodes []*Node)
• type PromQLFragment
  • func HasOuterAbsent(node *parser.PromQLNode) (calls []PromQLFragment)

Functions

func HasOuterAggregation

func HasOuterAggregation(node *parser.PromQLNode) (aggs []*promParser.AggregateExpr)

func HasOuterBinaryExpr

func HasOuterBinaryExpr(node *parser.PromQLNode) *promParser.BinaryExpr

func HasOuterRate

func HasOuterRate(node *parser.PromQLNode) (calls []*promParser.Call)

func HasOuterSum

func HasOuterSum(node *parser.PromQLNode) (calls []*promParser.AggregateExpr)

func HasVectorSelector

func HasVectorSelector(node *parser.PromQLNode) (vs []*promParser.VectorSelector)

func RemoveConditions

func RemoveConditions(source string) promParser.Node

RemoveConditions takes a *valid* PromQL expression and removes any condition from it.

Types

type Node

type Node struct {
	Parent *Node
	Expr   parser.Node
	// contains filtered or unexported fields
}

Node is used to turn the parsed PromQL query expression into a tree. This allows us to walk the tree up & down and look for either parents or children of specific type. Which is useful if you, for example, want to check if all vector selectors are wrapped inside function calls etc.

func Tree

func Tree(expr parser.Node, parent *Node) Node

Tree takes a parsed PromQL node and turns it into a Node instance with parent and children populated.

func WalkDown

func WalkDown[T parser.Node](node *Node) (nodes []*Node)

WalkDown works just like findParents but it walks the tree down, visiting all children. It also starts by checking the node passed to it before walking down the tree.

func WalkUp

func WalkUp[T parser.Node](node *Node) (nodes []*Node)

WalkUp allows to iterate a promQLNode node looking for parents of specific type. Prometheus parser returns interfaces which makes it more difficult to figure out what kind of node we're dealing with, hence this helper takes a type parameter it tries to cast. It starts by checking the node passed to it and then walks up by visiting all parent nodes.

type PromQLFragment

type PromQLFragment struct {
	Fragment *parser.PromQLNode
	BinExpr  *promParser.BinaryExpr
}

func HasOuterAbsent

func HasOuterAbsent(node *parser.PromQLNode) (calls []PromQLFragment)