cancel
Showing results for 
Search instead for 
Did you mean: 

Short-circuiting in BRF+ Boolean expressions

Ruediger_Plantiko
Active Contributor
0 Kudos
163

In a Boolean expression like " <1> or <2> ", if <1> evaluates to TRUE, the result is true and an evaluation of the second operand is no more necessary. I have the impression that this kind of short circuiting, which improves performance, is not implied in Boolean expressions in BRF+ (it stopped at a break-point in a custom function in part <2>)? If not - can it be activated somehow?

Accepted Solutions (0)

Answers (1)

Answers (1)

Ruediger_Plantiko
Active Contributor
0 Kudos

I answered this for myself. by studying the generated code: Yes, boolean operations are short-circuited. Every AND and OR generates an exit clause if the first operand already gives the result.

My impression that this would be not the case is wrong.