Function optimizeNode

pkg/workflow/expression_optimizer.go:61–77

optimizeNode performs a single bottom-up optimisation pass over the tree. It recurses into children first so that simplifications at lower levels can unlock further simplifications at higher levels in the same pass.

(node ConditionNode)

// It recurses into children first so that simplifications at lower levels can
// unlock further simplifications at higher levels in the same pass.
func optimizeNode(node ConditionNode) ConditionNode {
	switch n := node.(type) {
	case *AndNode:
		return optimizeAndNode(n)
	case *OrNode:
		return optimizeOrNode(n)
	case *NotNode:
		return optimizeNotNode(n)
	case *DisjunctionNode:
		return optimizeDisjunctionNode(n)
	default:
		// Leaf nodes (ExpressionNode, ComparisonNode, FunctionCallNode,
		// PropertyAccessNode, StringLiteralNode, BooleanLiteralNode) are returned
		// unchanged.
		return node
	}
}

// --- helper predicates -------------------------------------------------------