package agl.proto.sampler

Mouse Melon logoGet desktop application:
View/edit binary Protocol Buffers messages

enum ArithmeticOp

sample.proto:32

Used in: Element

message CmpExp

sample.proto:78

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: LogicExps.ExpOrOp

enum CmpOp

sample.proto:13

Used in: CmpExp

message Element

sample.proto:49

Used in: CmpExp

message Element.Number

sample.proto:56

Used in: Element

message Element.Variable

sample.proto:50

Used in: Element

message LogicExps

sample.proto:88

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]

message LogicExps.ExpOrOp

sample.proto:89

Used in: LogicExps

enum LogicOp

sample.proto:25

Used in: LogicExps.ExpOrOp

message SubGraphSpec

sample.proto:99

message SubGraphSpec.EdgeSpec

sample.proto:112

Used in: SubGraphSpec

message SubGraphSpec.FeatureSpec

sample.proto:100

Used in: EdgeSpec, NodeSpec

message SubGraphSpec.NodeSpec

sample.proto:107

Used in: SubGraphSpec

message SubGraphSpec.Seed

sample.proto:119

Used in: SubGraphSpec

enum VariableSource

sample.proto:41

Used in: Element.Variable