/usr/include/octave-3.8.2/octave/pt-cbinop.h is in liboctave-dev 3.8.2-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*
Copyright (C) 2008-2013 Jaroslav Hajek
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
<http://www.gnu.org/licenses/>.
*/
#if !defined (octave_pt_cbinop_h)
#define octave_pt_cbinop_h 1
#include <string>
class tree_walker;
class octave_value;
class octave_value_list;
class octave_lvalue;
#include "ov.h"
#include "pt-binop.h"
#include "symtab.h"
// 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), op_lhs (ca), op_rhs (cb),
etype (ct) { }
octave_value::compound_binary_op cop_type (void) const { return etype; }
private:
tree_expression *op_lhs;
tree_expression *op_rhs;
octave_value::compound_binary_op etype;
// No copying!
tree_compound_binary_expression (const tree_compound_binary_expression&);
tree_compound_binary_expression& operator =
(const tree_compound_binary_expression&);
};
// 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
|