1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
########################################################################
##
## Copyright (C) 2009-2024 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/>.
##
########################################################################
## -*- texinfo -*-
## @deftypefn {} {@var{names} =} __all_opts__ (@dots{})
## Internal function.
##
## Query all options from all known optimization functions and return a
## list of possible values.
## @end deftypefn
function names = __all_opts__ (varargin)
## This variable is filled by the auto-generated PKG_ADD script at
## Octave startup.
persistent saved_names = {};
## do not clear this function
mlock ();
## guard against recursive calls.
persistent recursive = false;
if (recursive)
names = {};
elseif (nargin == 0)
names = saved_names;
else
## Query all options from all known functions. These may call optimset,
## which will in turn call us, but we won't answer.
recursive = true;
names = saved_names;
for i = 1:nargin
try
opts = optimset (varargin{i});
fcn = fieldnames (opts).';
names = [names, fcn];
catch
## throw the error as a warning.
warning (lasterr ());
end_try_catch
endfor
names = unique (names);
[lnames, idx] = unique (lower (names));
if (length (lnames) < length (names))
## This is bad.
error ("__all_opts__: duplicate options with inconsistent case");
else
names = names(idx);
endif
saved_names = names;
recursive = false;
endif
endfunction
## No test needed for internal helper function.
%!assert (1)
|
