Function OptimizeExpression

pkg/workflow/expression_optimizer.go:38–56

OptimizeExpression applies boolean algebra simplifications to a ConditionNode tree, returning an equivalent but potentially simpler and shorter expression. Rules applied (bottom-up, fixpoint iteration): Constant folding: !true → false, !false → true Double negation: !!A → A Boolean i

(node ConditionNode)

// performed so the optimizer always terminates in O(n * maxOptimizationPasses)
// time relative to the number of nodes in the tree.
func OptimizeExpression(node ConditionNode) ConditionNode {
	if node == nil {
		return nil
	}

	const maxOptimizationPasses = 10

	current := node
	for pass := range maxOptimizationPasses {
		next := optimizeNode(current)
		// Stop early when the rendered form has stabilised (fixed point).
		if next.Render() == current.Render() {
			expressionOptimizerLog.Printf("Expression stabilised after %d pass(es)", pass+1)
			break
		}
		current = next
	}
	return current
}

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