Get desktop application:
View/edit binary Protocol Buffers messages
Used in:
The left and right lists could contain variables, constants, and operators, arranged in reverse polish notation(RPN). The comparison operator determines how the two lists are compared. The original formula is converted into reverse polish notation, where the operands follow their operators. For example, the original inequation is index.time - seed.1 / index.time2 + seed.3 >= 10 * seed.2, the converted leftRPN is [index.time, seed.1, seed.2, /, -, seed.3, +] the converted rightRPN is [10, seed.2, *] the op is GE
Used in:
Used in:
Used in:
Used in:
Used in:
Similar to CmpExp, LogicExps represents logic expressions in reverse polish notation manner, where operands follow their logic sub-expressions. For example, the original logic expressions are: CmpExp1 OR CmpExp2 AND CmpExp3, the converted list is [CmpExp1, CmpExp2, CmpExp3, AND, OR]
Used in:
Used in:
Used in:
Used in: ,
Used in:
Used in:
Used in: