Mercurial > octave-nkf
view libinterp/parse-tree/pt-pr-code.cc @ 15869:5e5705b3e505 classdef
Implement some embryonic handle-classdef semantic.
* libinterp/octave-value/ov-classdef.h (cdef_object_rep::subsasgn,
handle_cdef_object::subsasgn, octave_classdef::subsasgn): New method
declarations.
(handle_cdef_object::~handle_cdef_object): New destructor declaration.
(cdef_class::cdef_class_rep::handle_class): New boolean field.
(cdef_class::cdef_class_rep::cdef_class_rep): Initialize it.
(cdef_class::cdef_class_rep::mark_as_handle_class,
cdef_class::cdef_class_rep::is_handle_class, cdef_class::mark_as_handle_class,
cdef_class::is_handle_class): Manipulate it.
(cdef_class::cdef_class_rep::get_name): New method.
(cdef_class::get_name): Use it.
(cdef_class::cdef_class_rep::initialize_object,
cdef_class::cdef_class_rep::subsref_meta,
cdef_class::cdef_class_rep::run_constructor,
cdef_class::cdef_class_rep::construct, cdef_class:initialize_object,
cdef_class::subsref_meta, cdef_class::run_constructor, cdef_class::construct):
New methods.
(cdef_class::cdef_class_rep::find_method, cdef_class::find_method):
Add "local" argument.
(cdef_class::cdef_class_rep::find_names, cdef_class::find_names): Change
signature to use std::set and a boolean flag.
(cdef_class::cdef_class_rep::find_methods, cdef_class::find_methods): Change
signature to use a boolean flag as second argument.
(cdef_class::make_meta_class): New static method.
(cdef_class::get_method_function, cdef_class::get_constructor_function): New
methods.
(cdef_property::cdef_property_rep::set_value, cdef_property::set_value):
Make cdef_object argument non const.
(cdef_property::cder_property_rep::is_relative_set): New method.
(cdef_property::get_get_access, cdef_property::get_set_access): Delete methods.
(cdef_property::check_get_access, cdef_property::check_set_access):
Remove string argument.
(cdef_method::get_access): Delete method.
(cdef_method::check_access): Remove string argument.
* libinterp/octave-value/ov-classdef.cc (gripe_method_access,
gripe_property_access): Support access specified as cell array of classes.
(make_function_of_class): New static function(s).
(check_access (std::string, std::string), superclass_access): Remove static
functions.
(lookup_class): Use symbol_table when class hasn't been loaded yet.
(lookup_classes): Returns std::list<cdef_class> instead of Cell.
(class_get_superclasses, class_get_inferiorclasses): Use it.
(to_ov (const std::list<cdef_class>&)): New static function.
(get_class_context, check_access (const cdef_class&, const octave_value&)):
Likewise.
(handle_cdef_object::subsref): Use new signature of access check methods.
(property_get_defaultvalue): New built-in property accessor.
(make_class): Change signature to support multiple inheritance. Set "Sealed" to
false by default. Determine value for HandleCompatible property and handle-class
representation.
(make_property): Take cdef_class as first argument. Add DefaultValue and
HasDefault properties. Call make_function_of_class for property accessors.
(make_attribute): Take cdef_class as first argument.
(make_method): Likewise. Call make_function_of_class.
(make_method (octave_builtin::fcn)): Do no construct a function handle object.
(octave_classdef::subsasgn, handle_cdef_object::subsasgn): New method.
(class octave_classdef_proxy): New class.
(cdef_class::get_method_function): Use it, new method.
(handle_cdef_object::~handle_cdef_object): New destructor.
(cdef_class_rep::find_method): New boolean "local" argument. When true, only
look into the current class, not in superclasses.
(cdef_class_rep::find_methods): New signature.
(cdef_class_rep::get_methods): Use it.
(cdef_class_rep::find_properties): New signature.
(cdef_class_rep::get_properties): Use it.
(cdef_class_rep::find_names): New signature.
(cdef_class_rep::get_names): Use it.
(cdef_class_rep::subsref_meta, cdef_class_rep::initialize_object,
cdef_class_rep::run_constructor, cdef_class_rep::construct): New methods.
(compute_attribute_value, attribute_to_string): New static functions.
(cdef_class::make_meta_class): Change signature, non const argument.
Implement it.
(cdef_property_rep::get_value): Do not check access here.
(cdef_property_rep::set_value, cdef_property_rep::is_recursive_set): New method.
(cdef_property_rep::check_get_access, cdef_property_rep::check_set_access,
cdef_method_rep::check_access): Use static check_access utility function.
(install_classdef): Adapt to change of signature of make_class. Mark meta
classes as sealed. Add HandleCompatible property to meta.class. Add
DefaultValue and HasDefault properties to meta.property.
* libinterp/parse-tree/pt-classdef.h (tree_classdef::make_meta_class):
Change return type to (octave_function *).
* libinterp/parse-tree/pt-classdef.cc (tree_classdef::make_meta_class):
Likewise. Call cdef_class::get_constructor_function.
* libinterp/parse-tree/oct-parse.yy (parse_fcn_file): Adapt to new
signature of tree_classdef::make_meta_class.
* libinterp/octave-value/ov-fcn.h (octave_function::is_classdef_constructor):
New virtual method.
* libinterp/octave-value/ov-usr-fcn.h
(octave_user_function::class_ctor_type): New private enum.
(octave_user_function::mark_as_class_constructor,
octave_user_function::is_class_constructor): Use it.
(octave_user_function::mark_as_classdef_constructor,
octave_user_function::is_classdef_constructor): New methods.
(octave_user_function::class_constructor): Turn into class_ctor_type.
* libinterp/octave-value/of-usr-fcn.cc
(octave_user_function::octave_user_function): Initialize class_constructor.
(octave_user_function::do_multi_index_op): When function is a classdef
constructor, extract the first argument and use it to populate the first
output argument.
author | Michael Goffioul <michael.goffioul@gmail.com> |
---|---|
date | Tue, 01 Jan 2013 19:42:17 -0500 |
parents | 947cf10c94da |
children | c702371ff6df |
line wrap: on
line source
/* Copyright (C) 1996-2012 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 <cctype> #include <iostream> #include "comment-list.h" #include "error.h" #include "ov-usr-fcn.h" #include "pr-output.h" #include "pt-all.h" void tree_print_code::visit_anon_fcn_handle (tree_anon_fcn_handle& afh) { indent (); print_parens (afh, "("); os << "@("; tree_parameter_list *param_list = afh.parameter_list (); if (param_list) param_list->accept (*this); os << ") "; print_fcn_handle_body (afh.body ()); print_parens (afh, ")"); } void tree_print_code::visit_argument_list (tree_argument_list& lst) { tree_argument_list::iterator p = lst.begin (); while (p != lst.end ()) { tree_expression *elt = *p++; if (elt) { elt->accept (*this); if (p != lst.end ()) os << ", "; } } } void tree_print_code::visit_binary_expression (tree_binary_expression& expr) { indent (); print_parens (expr, "("); tree_expression *op1 = expr.lhs (); if (op1) op1->accept (*this); os << " " << expr.oper () << " "; tree_expression *op2 = expr.rhs (); if (op2) op2->accept (*this); print_parens (expr, ")"); } void tree_print_code::visit_break_command (tree_break_command&) { indent (); os << "break"; } void tree_print_code::visit_colon_expression (tree_colon_expression& expr) { indent (); print_parens (expr, "("); tree_expression *op1 = expr.base (); if (op1) op1->accept (*this); // Stupid syntax. tree_expression *op3 = expr.increment (); if (op3) { os << ":"; op3->accept (*this); } tree_expression *op2 = expr.limit (); if (op2) { os << ":"; op2->accept (*this); } print_parens (expr, ")"); } void tree_print_code::visit_continue_command (tree_continue_command&) { indent (); os << "continue"; } void tree_print_code::do_decl_command (tree_decl_command& cmd) { indent (); os << cmd.name () << " "; tree_decl_init_list *init_list = cmd.initializer_list (); if (init_list) init_list->accept (*this); } void tree_print_code::visit_global_command (tree_global_command& cmd) { do_decl_command (cmd); } void tree_print_code::visit_persistent_command (tree_persistent_command& cmd) { do_decl_command (cmd); } void tree_print_code::visit_decl_elt (tree_decl_elt& cmd) { tree_identifier *id = cmd.ident (); if (id) id->accept (*this); tree_expression *expr = cmd.expression (); if (expr) { os << " = "; expr->accept (*this); } } void tree_print_code::visit_decl_init_list (tree_decl_init_list& lst) { tree_decl_init_list::iterator p = lst.begin (); while (p != lst.end ()) { tree_decl_elt *elt = *p++; if (elt) { elt->accept (*this); if (p != lst.end ()) os << ", "; } } } void tree_print_code::visit_simple_for_command (tree_simple_for_command& cmd) { print_comment_list (cmd.leading_comment ()); indent (); os << (cmd.in_parallel () ? "parfor " : "for "); tree_expression *lhs = cmd.left_hand_side (); tree_expression *maxproc = cmd.maxproc_expr (); if (maxproc) os << "("; if (lhs) lhs->accept (*this); os << " = "; tree_expression *expr = cmd.control_expr (); if (expr) expr->accept (*this); if (maxproc) { os << ", "; maxproc->accept (*this); os << ")"; } newline (); tree_statement_list *list = cmd.body (); if (list) { increment_indent_level (); list->accept (*this); decrement_indent_level (); } print_indented_comment (cmd.trailing_comment ()); indent (); os << (cmd.in_parallel () ? "endparfor" : "endfor"); } void tree_print_code::visit_complex_for_command (tree_complex_for_command& cmd) { print_comment_list (cmd.leading_comment ()); indent (); os << "for ["; nesting.push ('['); tree_argument_list *lhs = cmd.left_hand_side (); if (lhs) lhs->accept (*this); nesting.pop (); os << "] = "; tree_expression *expr = cmd.control_expr (); if (expr) expr->accept (*this); newline (); tree_statement_list *list = cmd.body (); if (list) { increment_indent_level (); list->accept (*this); decrement_indent_level (); } print_indented_comment (cmd.trailing_comment ()); indent (); os << "endfor"; } void tree_print_code::visit_octave_user_script (octave_user_script& fcn) { reset (); tree_statement_list *cmd_list = fcn.body (); if (cmd_list) cmd_list->accept (*this); } void tree_print_code::visit_octave_user_function (octave_user_function& fcn) { reset (); visit_octave_user_function_header (fcn); tree_statement_list *cmd_list = fcn.body (); if (cmd_list) { increment_indent_level (); cmd_list->accept (*this); decrement_indent_level (); } visit_octave_user_function_trailer (fcn); } void tree_print_code::visit_octave_user_function_header (octave_user_function& fcn) { octave_comment_list *leading_comment = fcn.leading_comment (); if (leading_comment) { print_comment_list (leading_comment); newline (); } indent (); os << "function "; tree_parameter_list *ret_list = fcn.return_list (); if (ret_list) { bool takes_var_return = fcn.takes_var_return (); int len = ret_list->length (); if (len > 1 || takes_var_return) { os << "["; nesting.push ('['); } ret_list->accept (*this); if (takes_var_return) { if (len > 0) os << ", "; os << "varargout"; } if (len > 1 || takes_var_return) { nesting.pop (); os << "]"; } os << " = "; } std::string fcn_name = fcn.name (); os << (fcn_name.empty () ? std::string ("(empty)") : fcn_name) << " "; tree_parameter_list *param_list = fcn.parameter_list (); if (param_list) { bool takes_varargs = fcn.takes_varargs (); int len = param_list->length (); if (len > 0 || takes_varargs) { os << "("; nesting.push ('('); } param_list->accept (*this); if (takes_varargs) { if (len > 0) os << ", "; os << "varargin"; } if (len > 0 || takes_varargs) { nesting.pop (); os << ")"; newline (); } } else { os << "()"; newline (); } } void tree_print_code::visit_octave_user_function_trailer (octave_user_function& fcn) { print_indented_comment (fcn.trailing_comment ()); newline (); } void tree_print_code::visit_function_def (tree_function_def& fdef) { indent (); octave_value fcn = fdef.function (); octave_function *f = fcn.function_value (); if (f) f->accept (*this); } void tree_print_code::visit_identifier (tree_identifier& id) { indent (); print_parens (id, "("); std::string nm = id.name (); os << (nm.empty () ? std::string ("(empty)") : nm); print_parens (id, ")"); } void tree_print_code::visit_if_clause (tree_if_clause& cmd) { tree_expression *expr = cmd.condition (); if (expr) expr->accept (*this); newline (); tree_statement_list *list = cmd.commands (); if (list) { increment_indent_level (); list->accept (*this); decrement_indent_level (); } } void tree_print_code::visit_if_command (tree_if_command& cmd) { print_comment_list (cmd.leading_comment ()); indent (); os << "if "; tree_if_command_list *list = cmd.cmd_list (); if (list) list->accept (*this); print_indented_comment (cmd.trailing_comment ()); indent (); os << "endif"; } void tree_print_code::visit_if_command_list (tree_if_command_list& lst) { tree_if_command_list::iterator p = lst.begin (); bool first_elt = true; while (p != lst.end ()) { tree_if_clause *elt = *p++; if (elt) { if (! first_elt) { print_indented_comment (elt->leading_comment ()); indent (); if (elt->is_else_clause ()) os << "else"; else os << "elseif "; } elt->accept (*this); } first_elt = false; } } void tree_print_code::visit_index_expression (tree_index_expression& expr) { indent (); print_parens (expr, "("); tree_expression *e = expr.expression (); if (e) e->accept (*this); std::list<tree_argument_list *> arg_lists = expr.arg_lists (); std::string type_tags = expr.type_tags (); std::list<string_vector> arg_names = expr.arg_names (); int n = type_tags.length (); std::list<tree_argument_list *>::iterator p_arg_lists = arg_lists.begin (); std::list<string_vector>::iterator p_arg_names = arg_names.begin (); for (int i = 0; i < n; i++) { switch (type_tags[i]) { case '(': { char nc = nesting.top (); if ((nc == '[' || nc == '{') && expr.paren_count () == 0) os << "("; else os << " ("; nesting.push ('('); tree_argument_list *l = *p_arg_lists; if (l) l->accept (*this); nesting.pop (); os << ")"; } break; case '{': { char nc = nesting.top (); if ((nc == '[' || nc == '{') && expr.paren_count () == 0) os << "{"; else os << " {"; // We only care about whitespace inside [] and {} when we // are defining matrix and cell objects, not when indexing. nesting.push ('('); tree_argument_list *l = *p_arg_lists; if (l) l->accept (*this); nesting.pop (); os << "}"; } break; case '.': { string_vector nm = *p_arg_names; assert (nm.length () == 1); os << "." << nm(0); } break; default: panic_impossible (); } p_arg_lists++; p_arg_names++; } print_parens (expr, ")"); } void tree_print_code::visit_matrix (tree_matrix& lst) { indent (); print_parens (lst, "("); os << "["; nesting.push ('['); tree_matrix::iterator p = lst.begin (); while (p != lst.end ()) { tree_argument_list *elt = *p++; if (elt) { elt->accept (*this); if (p != lst.end ()) os << "; "; } } nesting.pop (); os << "]"; print_parens (lst, ")"); } void tree_print_code::visit_cell (tree_cell& lst) { indent (); print_parens (lst, "("); os << "{"; nesting.push ('{'); tree_cell::iterator p = lst.begin (); while (p != lst.end ()) { tree_argument_list *elt = *p++; if (elt) { elt->accept (*this); if (p != lst.end ()) os << "; "; } } nesting.pop (); os << "}"; print_parens (lst, ")"); } void tree_print_code::visit_multi_assignment (tree_multi_assignment& expr) { indent (); print_parens (expr, "("); tree_argument_list *lhs = expr.left_hand_side (); if (lhs) { int len = lhs->length (); if (len > 1) { os << "["; nesting.push ('['); } lhs->accept (*this); if (len > 1) { nesting.pop (); os << "]"; } } os << " " << expr.oper () << " "; tree_expression *rhs = expr.right_hand_side (); if (rhs) rhs->accept (*this); print_parens (expr, ")"); } void tree_print_code::visit_no_op_command (tree_no_op_command& cmd) { indent (); os << cmd.original_command (); } void tree_print_code::visit_constant (tree_constant& val) { indent (); print_parens (val, "("); val.print_raw (os, true, print_original_text); print_parens (val, ")"); } void tree_print_code::visit_fcn_handle (tree_fcn_handle& fh) { indent (); print_parens (fh, "("); fh.print_raw (os, true, print_original_text); print_parens (fh, ")"); } void tree_print_code::visit_funcall (tree_funcall& fc) { indent (); print_parens (fc, "("); fc.print_raw (os, true, print_original_text); print_parens (fc, ")"); } void tree_print_code::visit_parameter_list (tree_parameter_list& lst) { tree_parameter_list::iterator p = lst.begin (); while (p != lst.end ()) { tree_decl_elt *elt = *p++; if (elt) { elt->accept (*this); if (p != lst.end ()) os << ", "; } } } void tree_print_code::visit_postfix_expression (tree_postfix_expression& expr) { indent (); print_parens (expr, "("); tree_expression *e = expr.operand (); if (e) e->accept (*this); os << expr.oper (); print_parens (expr, ")"); } void tree_print_code::visit_prefix_expression (tree_prefix_expression& expr) { indent (); print_parens (expr, "("); os << expr.oper (); tree_expression *e = expr.operand (); if (e) e->accept (*this); print_parens (expr, ")"); } void tree_print_code::visit_return_command (tree_return_command&) { indent (); os << "return"; } void tree_print_code::visit_return_list (tree_return_list& lst) { tree_return_list::iterator p = lst.begin (); while (p != lst.end ()) { tree_index_expression *elt = *p++; if (elt) { elt->accept (*this); if (p != lst.end ()) os << ", "; } } } void tree_print_code::visit_simple_assignment (tree_simple_assignment& expr) { indent (); print_parens (expr, "("); tree_expression *lhs = expr.left_hand_side (); if (lhs) lhs->accept (*this); os << " " << expr.oper () << " "; tree_expression *rhs = expr.right_hand_side (); if (rhs) rhs->accept (*this); print_parens (expr, ")"); } void tree_print_code::visit_statement (tree_statement& stmt) { print_comment_list (stmt.comment_text ()); tree_command *cmd = stmt.command (); if (cmd) { cmd->accept (*this); if (! stmt.print_result ()) { os << ";"; newline (" "); } else newline (); } else { tree_expression *expr = stmt.expression (); if (expr) { expr->accept (*this); if (! stmt.print_result ()) { os << ";"; newline (" "); } else newline (); } } } void tree_print_code::visit_statement_list (tree_statement_list& lst) { for (tree_statement_list::iterator p = lst.begin (); p != lst.end (); p++) { tree_statement *elt = *p; if (elt) elt->accept (*this); } } void tree_print_code::visit_switch_case (tree_switch_case& cs) { print_comment_list (cs.leading_comment ()); indent (); if (cs.is_default_case ()) os << "otherwise"; else os << "case "; tree_expression *label = cs.case_label (); if (label) label->accept (*this); newline (); tree_statement_list *list = cs.commands (); if (list) { increment_indent_level (); list->accept (*this); newline (); decrement_indent_level (); } } void tree_print_code::visit_switch_case_list (tree_switch_case_list& lst) { tree_switch_case_list::iterator p = lst.begin (); while (p != lst.end ()) { tree_switch_case *elt = *p++; if (elt) elt->accept (*this); } } void tree_print_code::visit_switch_command (tree_switch_command& cmd) { print_comment_list (cmd.leading_comment ()); indent (); os << "switch "; tree_expression *expr = cmd.switch_value (); if (expr) expr->accept (*this); newline (); tree_switch_case_list *list = cmd.case_list (); if (list) { increment_indent_level (); list->accept (*this); decrement_indent_level (); } print_indented_comment (cmd.leading_comment ()); indent (); os << "endswitch"; } void tree_print_code::visit_try_catch_command (tree_try_catch_command& cmd) { print_comment_list (cmd.leading_comment ()); indent (); os << "try"; newline (); tree_statement_list *try_code = cmd.body (); if (try_code) { increment_indent_level (); try_code->accept (*this); decrement_indent_level (); } print_indented_comment (cmd.middle_comment ()); indent (); os << "catch"; newline (); tree_statement_list *catch_code = cmd.cleanup (); if (catch_code) { increment_indent_level (); catch_code->accept (*this); decrement_indent_level (); } print_indented_comment (cmd.trailing_comment ()); indent (); os << "end_try_catch"; } void tree_print_code::visit_unwind_protect_command (tree_unwind_protect_command& cmd) { print_comment_list (cmd.leading_comment ()); indent (); os << "unwind_protect"; newline (); tree_statement_list *unwind_protect_code = cmd.body (); if (unwind_protect_code) { increment_indent_level (); unwind_protect_code->accept (*this); decrement_indent_level (); } print_indented_comment (cmd.middle_comment ()); indent (); os << "unwind_protect_cleanup"; newline (); tree_statement_list *cleanup_code = cmd.cleanup (); if (cleanup_code) { increment_indent_level (); cleanup_code->accept (*this); decrement_indent_level (); } print_indented_comment (cmd.trailing_comment ()); indent (); os << "end_unwind_protect"; } void tree_print_code::visit_while_command (tree_while_command& cmd) { print_comment_list (cmd.leading_comment ()); indent (); os << "while "; tree_expression *expr = cmd.condition (); if (expr) expr->accept (*this); newline (); tree_statement_list *list = cmd.body (); if (list) { increment_indent_level (); list->accept (*this); decrement_indent_level (); } print_indented_comment (cmd.trailing_comment ()); indent (); os << "endwhile"; } void tree_print_code::visit_do_until_command (tree_do_until_command& cmd) { print_comment_list (cmd.leading_comment ()); indent (); os << "do"; newline (); tree_statement_list *list = cmd.body (); if (list) { increment_indent_level (); list->accept (*this); decrement_indent_level (); } print_indented_comment (cmd.trailing_comment ()); indent (); os << "until"; tree_expression *expr = cmd.condition (); if (expr) expr->accept (*this); newline (); } void tree_print_code::print_fcn_handle_body (tree_statement_list *b) { if (b) { assert (b->length () == 1); tree_statement *s = b->front (); if (s) { if (s->is_expression ()) { tree_expression *e = s->expression (); if (e) { suppress_newlines++; e->accept (*this); suppress_newlines--; } } else { tree_command *c = s->command (); suppress_newlines++; c->accept (*this); suppress_newlines--; } } } } // Each print_code() function should call this before printing // anything. // // This doesn't need to be fast, but isn't there a better way? void tree_print_code::indent (void) { assert (curr_print_indent_level >= 0); if (beginning_of_line) { os << prefix; for (int i = 0; i < curr_print_indent_level; i++) os << " "; beginning_of_line = false; } } // All print_code() functions should use this to print new lines. void tree_print_code::newline (const char *alt_txt) { if (suppress_newlines) os << alt_txt; else { os << "\n"; beginning_of_line = true; } } // For ressetting print_code state. void tree_print_code::reset (void) { beginning_of_line = true; curr_print_indent_level = 0; while (nesting.top () != 'n') nesting.pop (); } void tree_print_code::print_parens (const tree_expression& expr, const char *txt) { int n = expr.paren_count (); for (int i = 0; i < n; i++) os << txt; } void tree_print_code::print_comment_elt (const octave_comment_elt& elt) { bool printed_something = false; bool prev_char_was_newline = false; std::string comment = elt.text (); size_t len = comment.length (); size_t i = 0; while (i < len && comment[i++] == '\n') ; /* Skip leading new lines. */ i--; while (i < len) { char c = comment[i++]; if (c == '\n') { if (prev_char_was_newline) os << "##"; newline (); prev_char_was_newline = true; } else { if (beginning_of_line) { printed_something = true; indent (); os << "##"; if (! (isspace (c) || c == '!')) os << " "; } os << static_cast<char> (c); prev_char_was_newline = false; } } if (printed_something && ! beginning_of_line) newline (); } void tree_print_code::print_comment_list (octave_comment_list *comment_list) { if (comment_list) { octave_comment_list::iterator p = comment_list->begin (); while (p != comment_list->end ()) { octave_comment_elt elt = *p++; print_comment_elt (elt); if (p != comment_list->end ()) newline (); } } } void tree_print_code::print_indented_comment (octave_comment_list *comment_list) { increment_indent_level (); print_comment_list (comment_list); decrement_indent_level (); }