Mercurial > octave
view libinterp/parse-tree/pt-array-list.cc @ 17693:efbe746f8fa8
eliminate octave_comment_buffer singleton
* lex.h (octave_base_lexer::comment_buffer): New class adapted from
octave_comment_buffer class. No longer a singleton class.
(octave_base_lexer::comment_buffer::reset): New function.
(octave_base_lexer::reset): Call comment_buf.reset.
(octave_base_lexer::comment_buf): New data member.
(octave_base_lexer::get_comment): New function.
* comment-list.h, comment-list.cc (octave_comment_buffer): Delete.
Change all uses of octave_comment_buffer to use local comment_buf
object instead.
* parse.h (octave_base_parser::make_statement): New member function.
* oct-parse.in.yy (make_statement): Delete.
Change all uses of make_statement to use the member function instead.
(safe_fclose): Don't extract and delete comment list here.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Fri, 18 Oct 2013 21:00:33 -0400 |
parents | c40a8873c2e7 |
children | 4197fc428c7d |
line wrap: on
line source
/* Copyright (C) 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/>. */ #ifdef HAVE_CONFIG_H #include <config.h> #endif #include <iostream> #include "error.h" #include "pt-array-list.h" tree_array_list::~tree_array_list (void) { while (! empty ()) { iterator p = begin (); delete *p; erase (p); } } bool tree_array_list::all_elements_are_constant (void) const { for (const_iterator p = begin (); p != end (); p++) { octave_quit (); tree_argument_list *elt = *p; if (! elt->all_elements_are_constant ()) return false; } return true; } bool tree_array_list::has_magic_end (void) const { for (const_iterator p = begin (); p != end (); p++) { octave_quit (); tree_argument_list *elt = *p; if (elt && elt->has_magic_end ()) return true; } return false; } void tree_array_list::copy_base (const tree_array_list& array_list) { tree_expression::copy_base (array_list); } void tree_array_list::copy_base (const tree_array_list& array_list, symbol_table::scope_id scope, symbol_table::context_id context) { for (const_iterator p = array_list.begin (); p != array_list.end (); p++) { const tree_argument_list *elt = *p; append (elt ? elt->dup (scope, context) : 0); } copy_base (*this); } tree_expression * tree_array_list::dup (symbol_table::scope_id, symbol_table::context_id) const { panic_impossible (); return 0; } void tree_array_list::accept (tree_walker&) { panic_impossible (); }