view libinterp/parse-tree/pt-array-list.h @ 30920:47cbc69e66cd

eliminate direct access to call stack from evaluator The call stack is an internal implementation detail of the evaluator. Direct access to it outside of the evlauator should not be needed. * pt-eval.h (tree_evaluator::get_call_stack): Delete.
author John W. Eaton <jwe@octave.org>
date Fri, 08 Apr 2022 15:19:22 -0400
parents 796f54d4ddbf
children e88a07dec498
line wrap: on
line source

////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2013-2022 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_array_list_h)
#define octave_pt_array_list_h 1

#include "octave-config.h"

#include "base-list.h"
#include "pt-arg-list.h"
#include "pt-exp.h"

namespace octave
{
  class symbol_scope;
  class tree_walker;

  // Base class for cell arrays and matrices.

  class tree_array_list : public tree_expression,
                          public base_list<tree_argument_list *>
  {
  public:

    typedef base_list<tree_argument_list *>::iterator iterator;
    typedef base_list<tree_argument_list *>::const_iterator const_iterator;

  protected:

    tree_array_list (tree_argument_list *row = nullptr, int l = -1, int c = -1)
      : tree_expression (l, c), base_list<tree_argument_list *> ()
    {
      if (row)
        append (row);
    }

  public:

    // No copying!

    tree_array_list (const tree_array_list&) = delete;

    tree_array_list& operator = (const tree_array_list&) = delete;

    ~tree_array_list (void);

    bool all_elements_are_constant (void) const;

    // FIXME: should we import the functions from the base class and
    // overload them here, or should we use a different name so we don't
    // have to do this?  Without the using declaration or a name change,
    // the base class functions will be hidden.  That may be OK, but it
    // can also cause some confusion.
    using tree_expression::copy_base;

    void copy_base (const tree_array_list& array_list);

    void copy_base (const tree_array_list& array_list,
                    symbol_scope& scope);

    tree_expression * dup (symbol_scope& scope) const;

    void accept (tree_walker& tw);
  };
}

#endif