Function collectOrTerms

pkg/workflow/expression_optimizer.go:151–163

collectOrTerms recursively flattens a chain of OrNode / DisjunctionNode into a flat slice of leaf terms. This allows the DisjunctionNode optimiser (which already performs dedup, false-filtering and true short-circuit) to operate on the entire or-chain in a single pass.

(node ConditionNode)

// already performs dedup, false-filtering and true short-circuit) to operate on
// the entire or-chain in a single pass.
func collectOrTerms(node ConditionNode) []ConditionNode {
	switch n := node.(type) {
	case *OrNode:
		return append(collectOrTerms(n.Left), collectOrTerms(n.Right)...)
	case *DisjunctionNode:
		terms := make([]ConditionNode, 0, len(n.Terms))
		for _, t := range n.Terms {
			terms = append(terms, collectOrTerms(t)...)
		}
		return terms
	}
	return []ConditionNode{node}
}

// collectAndTerms recursively flattens a chain of AndNode into a flat slice of
// leaf terms so that cross-chain deduplication can be performed in a single pass.