balancedTree recursively balances the terms provided to a commutative operator.
(lo, hi int)
| 344 | |
| 345 | // balancedTree recursively balances the terms provided to a commutative operator. |
| 346 | func (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 | |
| 365 | type exprHelper struct { |
| 366 | *parserHelper |