Mercurial > octave
view test/recursion.tst @ 31564:332a6ccac881 stable
maint: cleanup code in BIST tests to use Octave coding conventions.
* data.cc: Use keyword "endfor" rather than bare "end".
* file-io.cc, graphics.cc:
Remove semicolon ';' at end of "end_try_catch" keyword.
* variables.cc, bug-35448.tst, bug-53027.tst, bug-53579.tst, bug-53599.tst,
bug-53956.tst, bug-55758.tst, global.tst:
Use semicolon ';' after "global" variable declaration.
* for.tst, io.tst: Delete semicolon ';' at end of "for" loop declaration.
* struct.tst: Delete semicolon ';' at end of "function" declaration.
author | Rik <rik@octave.org> |
---|---|
date | Sun, 27 Nov 2022 17:01:00 -0800 |
parents | 796f54d4ddbf |
children | 597f3ee61a48 |
line wrap: on
line source
######################################################################## ## ## Copyright (C) 2006-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/>. ## ######################################################################## %!function y = f (x) %! if (x == 1) %! y = x; %! return; %! else %! y = x * f (x-1); %! endif %!endfunction %! %!assert (f (5), 120) %!function y = f (x) %! if (x == 1) %! y = x; %! return; %! else %! y = f (x-1) * x; %! endif %!endfunction %! %!assert (f (5), 120) %!function r = f (x) %! persistent p = 1; %! if (x == 1) %! f (x + 1); %! r = p; %! else %! clear p %! p = 13; %! endif %!endfunction %! %!error <'p' undefined> f (1) %!function r = f (x) %! persistent p = 1; %! if (x == 1) %! f (x + 1); %! r = p; %! else %! p = 13; %! endif %!endfunction %! %!assert (f (1), 13) %%FIXME: Need test for maximum recursion depth