MCPcopy Create free account
hub / github.com/cel-expr/cel-go / balancedTree

Method balancedTree

parser/helper.go:346–363  ·  view source on GitHub ↗

balancedTree recursively balances the terms provided to a commutative operator.

(lo, hi int)

Source from the content-addressed store, hash-verified

344
345// balancedTree recursively balances the terms provided to a commutative operator.
346func (l *logicManager) balancedTree(lo, hi int) ast.Expr {
347 mid := (lo + hi + 1) / 2
348
349 var left ast.Expr
350 if mid == lo {
351 left = l.terms[mid]
352 } else {
353 left = l.balancedTree(lo, mid-1)
354 }
355
356 var right ast.Expr
357 if mid == hi {
358 right = l.terms[mid+1]
359 } else {
360 right = l.balancedTree(mid+1, hi)
361 }
362 return l.exprFactory.NewCall(l.ops[mid], l.function, left, right)
363}
364
365type exprHelper struct {
366 *parserHelper

Callers 1

toExprMethod · 0.95

Calls 1

NewCallMethod · 0.65

Tested by

no test coverage detected