[Properties (by Name)] [Methods (by Name)] [Events (by Name)]
Internally used class for binary operations with left and right operands
Source position: fpexprpars.pp line 133
type TFPBinaryOperation = class(TFPExprNode) |
||
public |
||
constructor Create(); |
|
Create binary operation with left and right operands |
destructor Destroy; override; |
|
Destroy binary operation and free resources |
procedure InitAggregate; override; |
|
Initialize aggregate processing for binary operation |
procedure UpdateAggregate; override; |
|
Update aggregate calculations for binary operation |
function HasAggregate; override; |
|
Check if binary operation contains aggregates |
procedure Check; override; |
|
Validate the binary operation for correctness |
property left: TFPExprNode; [r] |
|
Left operand of the binary operation |
property Right: TFPExprNode; [r] |
|
Right operand of the binary operation |
end; |
|
Internally used class for binary operations with left and right operands |
|
| | | ||
|
Class for representing nodes in expression trees |
|
| | | ||
This TFPBinaryOperation is the base class for all binary operations in the expression parser. Binary operations take two operands (left and right) and perform some operation to produce a result. It extends TFPExprNode to provide the foundation for all two-operand operations.
The class manages the operand nodes and provides common functionality such as aggregate handling, validation, and resource management that is shared by all binary operations.
Derived classes implement specific operations such as arithmetic operations (+, -, *, /), comparison operations (=, <, >), and logical operations (and, or, xor). Each operation defines its own evaluation logic while leveraging the common binary operation infrastructure.
This class is used internally by the TFPExpressionParser class to construct an AST (Abstract Syntax Tree). There is normally no need for you to use or instantiate this class directly.
|
Class for representing nodes in expression trees |