Mercurial > octave
view libinterp/parse-tree/pt-assign.cc @ 22327:d0562b3159c7
move more classes inside octave namespace
* ov-complex.cc, quit.h, lo-array-errwarn.h, lo-array-errwarn.cc,
lo-array-gripes.cc: Move classes inside octave namespace.
* NEWS, file-editor-tab.cc, Cell.cc, __qp__.cc, cellfun.cc, daspk.cc,
dasrt.cc, dassl.cc, data.cc, error.cc, error.h, errwarn.cc, errwarn.h,
file-io.cc, gcd.cc, graphics.cc, graphics.in.h, gripes.cc, gripes.h,
input.cc, interpreter.cc, interpreter.h, inv.cc, jit-typeinfo.cc,
load-path.cc, ls-mat-ascii.cc, ls-mat5.cc, lsode.cc, mex.cc,
oct-handle.h, oct-map.cc, oct-stream.cc, quad.cc, rand.cc,
sparse-xdiv.cc, sparse-xpow.cc, sparse.cc, sub2ind.cc, toplev.cc,
utils.cc, variables.cc, xdiv.cc, xpow.cc, __eigs__.cc,
__init_gnuplot__.cc, ov-base-diag.cc, ov-base-mat.cc,
ov-base-scalar.cc, ov-base-sparse.cc, ov-base.cc, ov-class.cc,
ov-classdef.cc, ov-complex.h, ov-complex.cc, ov-cx-mat.cc,
ov-cx-sparse.cc, ov-fcn-handle.cc, ov-float.cc, ov-float.h,
ov-flt-complex.h, ov-flt-cx-mat.cc, ov-flt-re-mat.cc, ov-java.cc,
ov-oncleanup.cc, ov-perm.cc, ov-range.cc, ov-re-diag.cc, ov-re-mat.cc,
ov-re-sparse.cc, ov-scalar.cc, ov-scalar.h, ov-str-mat.cc, ov.cc,
op-cs-cs.cc, op-fcs-fcs.cc, op-fs-fs.cc, op-int.h, op-s-s.cc, ops.h,
oct-parse.in.yy, pt-assign.cc, pt-eval.cc, pt-idx.cc, pt.cc,
Array-util.cc, Array.cc, CColVector.cc, CDiagMatrix.cc, CMatrix.cc,
CNDArray.cc, CRowVector.cc, CSparse.cc, DiagArray2.cc, MDiagArray2.cc,
MSparse.cc, PermMatrix.cc, Range.cc, Sparse.cc, dColVector.cc,
dDiagMatrix.cc, dMatrix.cc, dNDArray.cc, dRowVector.cc, dSparse.cc,
fCColVector.cc, fCDiagMatrix.cc, fCMatrix.cc, fCNDArray.cc,
fCRowVector.cc, fColVector.cc, fDiagMatrix.cc, fMatrix.cc,
fNDArray.cc, fRowVector.cc, idx-vector.cc, quit.cc, quit.h,
gepbalance.cc, Sparse-diag-op-defs.h, Sparse-op-defs.h,
Sparse-perm-op-defs.h, mx-inlines.cc, mx-op-defs.h, cmd-edit.cc,
lo-array-errwarn.cc, lo-array-errwarn.h, lo-array-gripes.cc,
lo-array-gripes.h, oct-binmap.h: Update to use namespace.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Wed, 17 Aug 2016 03:41:42 -0400 |
parents | bac0d6f07a3e |
children | 34ce5be04942 |
line wrap: on
line source
/* Copyright (C) 1996-2016 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 (HAVE_CONFIG_H) # include "config.h" #endif #include <iostream> #include <set> #include "defun.h" #include "error.h" #include "errwarn.h" #include "input.h" #include "ovl.h" #include "oct-lvalue.h" #include "pager.h" #include "ov.h" #include "pt-arg-list.h" #include "pt-bp.h" #include "pt-assign.h" #include "pt-eval.h" #include "pt-walk.h" #include "utils.h" #include "variables.h" // Simple assignment expressions. tree_simple_assignment::tree_simple_assignment (tree_expression *le, tree_expression *re, bool plhs, int l, int c, octave_value::assign_op t) : tree_expression (l, c), lhs (le), rhs (re), preserve (plhs), etype (t) { } tree_simple_assignment::~tree_simple_assignment (void) { if (! preserve) delete lhs; delete rhs; } octave_value_list tree_simple_assignment::rvalue (int nargout) { if (nargout > 1) error ("invalid number of output arguments for expression X = RHS"); return rvalue1 (nargout); } octave_value tree_simple_assignment::rvalue1 (int) { octave_value retval; if (rhs) { octave_value rhs_val = rhs->rvalue1 (); if (rhs_val.is_undefined ()) error ("value on right hand side of assignment is undefined"); if (rhs_val.is_cs_list ()) { const octave_value_list lst = rhs_val.list_value (); if (lst.empty ()) error ("invalid number of elements on RHS of assignment"); rhs_val = lst(0); } try { octave_lvalue ult = lhs->lvalue (); if (ult.numel () != 1) err_nonbraced_cs_list_assignment (); ult.assign (etype, rhs_val); if (etype == octave_value::op_asn_eq) retval = rhs_val; else retval = ult.value (); if (print_result () && octave::tree_evaluator::statement_printing_enabled ()) { // We clear any index here so that we can // get the new value of the referenced // object below, instead of the indexed // value (which should be the same as the // right hand side value). ult.clear_index (); octave_value lhs_val = ult.value (); lhs_val.print_with_name (octave_stdout, lhs->name ()); } } catch (octave::index_exception& e) { e.set_var (lhs->name ()); std::string msg = e.message (); error_with_id (e.err_id (), msg.c_str ()); } } return retval; } std::string tree_simple_assignment::oper (void) const { return octave_value::assign_op_as_string (etype); } tree_expression * tree_simple_assignment::dup (symbol_table::scope_id scope, symbol_table::context_id context) const { tree_simple_assignment *new_sa = new tree_simple_assignment (lhs ? lhs->dup (scope, context) : 0, rhs ? rhs->dup (scope, context) : 0, preserve, etype); new_sa->copy_base (*this); return new_sa; } void tree_simple_assignment::accept (tree_walker& tw) { tw.visit_simple_assignment (*this); } // Multi-valued assignment expressions. tree_multi_assignment::tree_multi_assignment (tree_argument_list *lst, tree_expression *r, bool plhs, int l, int c) : tree_expression (l, c), lhs (lst), rhs (r), preserve (plhs) { } tree_multi_assignment::~tree_multi_assignment (void) { if (! preserve) delete lhs; delete rhs; } octave_value tree_multi_assignment::rvalue1 (int nargout) { octave_value retval; const octave_value_list tmp = rvalue (nargout); if (! tmp.empty ()) retval = tmp(0); return retval; } // FIXME: this works, but it would look a little better if // it were broken up into a couple of separate functions. octave_value_list tree_multi_assignment::rvalue (int) { octave_value_list retval; if (rhs) { std::list<octave_lvalue> lvalue_list = lhs->lvalue_list (); octave_idx_type n_out = 0; for (std::list<octave_lvalue>::const_iterator p = lvalue_list.begin (); p != lvalue_list.end (); p++) n_out += p->numel (); // The following trick is used to keep rhs_val constant. const octave_value_list rhs_val1 = rhs->rvalue (n_out, &lvalue_list); const octave_value_list rhs_val = (rhs_val1.length () == 1 && rhs_val1(0).is_cs_list () ? rhs_val1(0).list_value () : rhs_val1); octave_idx_type k = 0; octave_idx_type n = rhs_val.length (); // To avoid copying per elements and possible optimizations, we // postpone joining the final values. std::list<octave_value_list> retval_list; tree_argument_list::iterator q = lhs->begin (); for (std::list<octave_lvalue>::iterator p = lvalue_list.begin (); p != lvalue_list.end (); p++) { tree_expression *lhs_elt = *q++; octave_lvalue ult = *p; octave_idx_type nel = ult.numel (); if (nel != 1) { // Huge kluge so that wrapper scripts with lines like // // [varargout{1:nargout}] = fcn (args); // // Will work the same as calling fcn directly when nargout // is 0 and fcn produces more than one output even when // nargout is 0. This only works if varargout has not yet // been defined. See also bug #43813. if (lvalue_list.size () == 1 && nel == 0 && n > 0 && ! ult.is_black_hole () && ult.is_undefined () && ult.index_type () == "{" && ult.index_is_empty ()) { // Convert undefined lvalue with empty index to a cell // array with a single value and indexed by 1 to // handle a single output. nel = 1; ult.define (Cell (1, 1)); ult.clear_index (); std::list<octave_value_list> idx; idx.push_back (octave_value_list (octave_value (1))); ult.set_index ("{", idx); } if (k + nel > n) error ("some elements undefined in return list"); // This won't do a copy. octave_value_list ovl = rhs_val.slice (k, nel); ult.assign (octave_value::op_asn_eq, octave_value (ovl, true)); retval_list.push_back (ovl); k += nel; } else { if (k < n) { ult.assign (octave_value::op_asn_eq, rhs_val(k)); if (ult.is_black_hole ()) { k++; continue; } else { retval_list.push_back (rhs_val(k)); k++; } } else { // This can happen for a function like // // function varargout = f () // varargout{1} = nargout; // endfunction // // called with // // [a, ~] = f (); // // Then the list of of RHS values will contain one // element but we are iterating over the list of all // RHS values. We shouldn't complain that a value we // don't need is missing from the list. if (! ult.is_black_hole ()) error ("element number %d undefined in return list", k+1); k++; continue; } } if (print_result () && octave::tree_evaluator::statement_printing_enabled ()) { // We clear any index here so that we can get // the new value of the referenced object below, // instead of the indexed value (which should be // the same as the right hand side value). ult.clear_index (); octave_value lhs_val = ult.value (); lhs_val.print_with_name (octave_stdout, lhs_elt->name ()); } } // Concatenate return values. retval = retval_list; } return retval; } /* %!function varargout = f () %! varargout{1} = nargout; %!endfunction %! %!test %! [a, ~] = f (); %! assert (a, 2); %!test %! [a, ~, ~, ~, ~] = f (); %! assert (a, 5); */ std::string tree_multi_assignment::oper (void) const { return octave_value::assign_op_as_string (op_type ()); } tree_expression * tree_multi_assignment::dup (symbol_table::scope_id scope, symbol_table::context_id context) const { tree_multi_assignment *new_ma = new tree_multi_assignment (lhs ? lhs->dup (scope, context) : 0, rhs ? rhs->dup (scope, context) : 0, preserve); new_ma->copy_base (*this); return new_ma; } void tree_multi_assignment::accept (tree_walker& tw) { tw.visit_multi_assignment (*this); }