144 references to BinaryOp
Microsoft.ML.Transforms (144)
Expression\CodeGen.cs (38)
474
case
BinaryOp
.Coalesce:
478
case
BinaryOp
.Or:
479
case
BinaryOp
.And:
483
case
BinaryOp
.Add:
484
case
BinaryOp
.Sub:
485
case
BinaryOp
.Mul:
486
case
BinaryOp
.Div:
487
case
BinaryOp
.Mod:
488
case
BinaryOp
.Power:
492
case
BinaryOp
.Error:
504
Contracts.Assert(node.Op ==
BinaryOp
.Or || node.Op ==
BinaryOp
.And);
519
if (node.Op ==
BinaryOp
.Or)
551
case
BinaryOp
.Add:
554
case
BinaryOp
.Sub:
557
case
BinaryOp
.Mul:
560
case
BinaryOp
.Div:
563
case
BinaryOp
.Mod:
566
case
BinaryOp
.Power:
582
case
BinaryOp
.Add:
585
case
BinaryOp
.Sub:
588
case
BinaryOp
.Mul:
591
case
BinaryOp
.Div:
594
case
BinaryOp
.Mod:
597
case
BinaryOp
.Power:
613
case
BinaryOp
.Add:
616
case
BinaryOp
.Sub:
619
case
BinaryOp
.Mul:
622
case
BinaryOp
.Div:
625
case
BinaryOp
.Mod:
628
case
BinaryOp
.Power:
645
case
BinaryOp
.Add:
648
case
BinaryOp
.Sub:
651
case
BinaryOp
.Mul:
654
case
BinaryOp
.Div:
657
case
BinaryOp
.Mod:
660
case
BinaryOp
.Power:
695
Contracts.Assert(node.Op ==
BinaryOp
.Coalesce);
Expression\LambdaBinder.cs (74)
317
case
BinaryOp
.Coalesce:
327
case
BinaryOp
.Or:
328
case
BinaryOp
.And:
332
case
BinaryOp
.Add:
333
case
BinaryOp
.Sub:
334
case
BinaryOp
.Mul:
335
case
BinaryOp
.Div:
336
case
BinaryOp
.Mod:
337
case
BinaryOp
.Power:
341
case
BinaryOp
.Error:
357
_host.Assert(node.Op ==
BinaryOp
.And || node.Op ==
BinaryOp
.Or || node.Op ==
BinaryOp
.Coalesce);
365
case
BinaryOp
.Or:
376
case
BinaryOp
.And:
387
case
BinaryOp
.Coalesce:
518
case
BinaryOp
.Add:
522
case
BinaryOp
.Mul:
534
case
BinaryOp
.Add:
538
case
BinaryOp
.Mul:
556
case
BinaryOp
.Add:
560
case
BinaryOp
.Mul:
572
case
BinaryOp
.Add:
576
case
BinaryOp
.Mul:
594
case
BinaryOp
.Coalesce:
600
case
BinaryOp
.Add:
606
case
BinaryOp
.Mul:
612
case
BinaryOp
.Sub:
613
case
BinaryOp
.Div:
614
case
BinaryOp
.Mod:
626
case
BinaryOp
.Coalesce:
630
case
BinaryOp
.Add:
636
case
BinaryOp
.Mul:
642
case
BinaryOp
.Sub:
643
case
BinaryOp
.Div:
644
case
BinaryOp
.Mod:
662
case
BinaryOp
.Coalesce:
668
case
BinaryOp
.Add:
674
case
BinaryOp
.Mul:
680
case
BinaryOp
.Sub:
681
case
BinaryOp
.Div:
682
case
BinaryOp
.Mod:
694
case
BinaryOp
.Coalesce:
698
case
BinaryOp
.Add:
704
case
BinaryOp
.Mul:
710
case
BinaryOp
.Sub:
711
case
BinaryOp
.Div:
712
case
BinaryOp
.Mod:
728
case
BinaryOp
.Add:
730
case
BinaryOp
.Sub:
732
case
BinaryOp
.Mul:
734
case
BinaryOp
.Div:
736
case
BinaryOp
.Mod:
738
case
BinaryOp
.Power:
750
case
BinaryOp
.Add:
752
case
BinaryOp
.Sub:
754
case
BinaryOp
.Mul:
756
case
BinaryOp
.Div:
758
case
BinaryOp
.Mod:
760
case
BinaryOp
.Power:
772
case
BinaryOp
.Coalesce:
774
case
BinaryOp
.Add:
776
case
BinaryOp
.Sub:
778
case
BinaryOp
.Mul:
780
case
BinaryOp
.Div:
782
case
BinaryOp
.Mod:
784
case
BinaryOp
.Power:
796
case
BinaryOp
.Coalesce:
798
case
BinaryOp
.Add:
800
case
BinaryOp
.Sub:
802
case
BinaryOp
.Mul:
804
case
BinaryOp
.Div:
806
case
BinaryOp
.Mod:
808
case
BinaryOp
.Power:
Expression\LambdaParser.cs (10)
466
node = new BinaryOpNode(TokMove(),
BinaryOp
.Power, node, ParseExpr(Precedence.PrefixUnary));
472
node = new BinaryOpNode(TokMove(),
BinaryOp
.Mul, node, ParseExpr(Precedence.Mul + 1));
477
node = new BinaryOpNode(TokMove(),
BinaryOp
.Div, node, ParseExpr(Precedence.Mul + 1));
482
node = new BinaryOpNode(TokMove(),
BinaryOp
.Mod, node, ParseExpr(Precedence.Mul + 1));
488
node = new BinaryOpNode(TokMove(),
BinaryOp
.Sub, node, ParseExpr(Precedence.Add + 1));
493
node = new BinaryOpNode(TokMove(),
BinaryOp
.Add, node, ParseExpr(Precedence.Add + 1));
500
node = new BinaryOpNode(TokMove(),
BinaryOp
.And, node, ParseExpr(Precedence.And + 1));
506
node = new BinaryOpNode(TokMove(),
BinaryOp
.Or, node, ParseExpr(Precedence.Or + 1));
514
node = new BinaryOpNode(TokMove(),
BinaryOp
.Coalesce, node, ParseExpr(Precedence.Coalesce));
566
node = new BinaryOpNode(TokCur,
BinaryOp
.Error, node, ParseExpr(Precedence.Error));
Expression\Node.cs (2)
887
public readonly
BinaryOp
Op;
892
public BinaryOpNode(Token tok,
BinaryOp
op, ExprNode left, ExprNode right)
Expression\Printer.cs (20)
105
private Precedence GetPrec(
BinaryOp
op)
109
case
BinaryOp
.Or:
111
case
BinaryOp
.And:
113
case
BinaryOp
.Add:
114
case
BinaryOp
.Sub:
116
case
BinaryOp
.Mul:
117
case
BinaryOp
.Div:
118
case
BinaryOp
.Mod:
120
case
BinaryOp
.Power:
122
case
BinaryOp
.Error:
130
private string GetString(
BinaryOp
op)
134
case
BinaryOp
.Or:
136
case
BinaryOp
.And:
138
case
BinaryOp
.Add:
140
case
BinaryOp
.Sub:
142
case
BinaryOp
.Mul:
144
case
BinaryOp
.Div:
146
case
BinaryOp
.Mod:
148
case
BinaryOp
.Power:
150
case
BinaryOp
.Error: