/usr/include/octave-3.8.1/octave/pt-colon.h is in liboctave-dev 3.8.1-1ubuntu1.
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 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 | /*
Copyright (C) 1996-2013 John W. Eaton
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_colon_h)
#define octave_tree_colon 1
#include <string>
class tree_walker;
class octave_value;
class octave_value_list;
class octave_lvalue;
#include "pt-exp.h"
#include "symtab.h"
// Colon expressions.
class
tree_colon_expression : public tree_expression
{
public:
tree_colon_expression (int l = -1, int c = -1)
: tree_expression (l, c), op_base (0), op_limit (0),
op_increment (0), save_base (false) { }
tree_colon_expression (tree_expression *e, int l = -1, int c = -1)
: tree_expression (l, c), op_base (e), op_limit (0),
op_increment (0), save_base (false) { }
tree_colon_expression (tree_expression *bas, tree_expression *lim,
tree_expression *inc, int l = -1, int c = -1)
: tree_expression (l, c), op_base (bas), op_limit (lim),
op_increment (inc), save_base (false) { }
~tree_colon_expression (void)
{
if (! save_base)
delete op_base;
delete op_limit;
delete op_increment;
}
bool has_magic_end (void) const
{
return ((op_base && op_base->has_magic_end ())
|| (op_limit && op_limit->has_magic_end ())
|| (op_increment && op_increment->has_magic_end ()));
}
void preserve_base (void) { save_base = true; }
tree_colon_expression *append (tree_expression *t);
bool rvalue_ok (void) const { return true; }
octave_value rvalue1 (int nargout = 1);
octave_value_list rvalue (int nargout);
void eval_error (const std::string& s) const;
tree_expression *base (void) { return op_base; }
tree_expression *limit (void) { return op_limit; }
tree_expression *increment (void) { return op_increment; }
int line (void) const;
int column (void) const;
tree_expression *dup (symbol_table::scope_id scope,
symbol_table::context_id context) const;
void accept (tree_walker& tw);
private:
// The components of the expression.
tree_expression *op_base;
tree_expression *op_limit;
tree_expression *op_increment;
bool save_base;
octave_value
make_range (const Matrix& m_base, const Matrix& m_limit,
const Matrix& m_increment, bool result_is_str,
bool dq_str) const;
octave_value
make_range (const octave_value& ov_base, const octave_value& ov_limit,
const octave_value& ov_increment) const;
// No copying!
tree_colon_expression (const tree_colon_expression&);
tree_colon_expression& operator = (const tree_colon_expression&);
};
#endif
|