1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2008-2021 The Octave Project Developers
//
// See the file COPYRIGHT.md in the top-level directory of this
// distribution or <https://octave.org/copyright/>.
//
// This file is part of Octave.
//
// Octave is free software: you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// Octave is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Octave; see the file COPYING. If not, see
// <https://www.gnu.org/licenses/>.
//
////////////////////////////////////////////////////////////////////////
#if ! defined (octave_pt_cbinop_h)
#define octave_pt_cbinop_h 1
#include "octave-config.h"
#include <string>
class octave_value;
class octave_value_list;
#include "ov.h"
#include "pt-binop.h"
#include "pt-walk.h"
namespace octave
{
// Binary expressions that can be reduced to compound operations
class tree_compound_binary_expression : public tree_binary_expression
{
public:
tree_compound_binary_expression (tree_expression *a, tree_expression *b,
int l, int c,
octave_value::binary_op t,
tree_expression *ca, tree_expression *cb,
octave_value::compound_binary_op ct)
: tree_binary_expression (a, b, l, c, t), m_lhs (ca), m_rhs (cb),
m_etype (ct)
{ }
octave_value::compound_binary_op cop_type (void) const { return m_etype; }
bool rvalue_ok (void) const { return true; }
tree_expression * clhs (void) { return m_lhs; }
tree_expression * crhs (void) { return m_rhs; }
octave_value evaluate (tree_evaluator&, int nargout = 1);
octave_value_list evaluate_n (tree_evaluator& tw, int nargout = 1)
{
return ovl (evaluate (tw, nargout));
}
void accept (tree_walker& tw)
{
tw.visit_compound_binary_expression (*this);
}
private:
tree_expression *m_lhs;
tree_expression *m_rhs;
octave_value::compound_binary_op m_etype;
// No copying!
tree_compound_binary_expression (const tree_compound_binary_expression&) = delete;
tree_compound_binary_expression&
operator = (const tree_compound_binary_expression&) = delete;
};
// a "virtual constructor"
tree_binary_expression *
maybe_compound_binary_expression (tree_expression *a, tree_expression *b,
int l = -1, int c = -1,
octave_value::binary_op t
= octave_value::unknown_binary_op);
}
#endif
|
