Mercurial > octave-nkf
view test/complex.tst @ 20584:eb9e2d187ed2
maint: Use Octave coding conventions in scripts/ode/private dir.
* AbsRel_Norm.m, fuzzy_compare.m, hermite_quartic_interpolation.m,
integrate_adaptive.m, integrate_const.m, integrate_n_steps.m, kahan.m,
ode_struct_value_check.m, odepkg_event_handle.m, odepkg_structure_check.m,
runge_kutta_45_dorpri.m, starting_stepsize.m:
Wrap long lines to < 80 chars.
Use double quotes rather than single quotes where possible.
Use ';' at end of keywords "return;" and "break;"
Use '##" for stand-alone comments and '#' for end-of-line comments.
Use two spaces after period before starting new sentence.
Use '!' instead of '~' for logical negation.
Use specific form of end (endif, endfor, etc.).
Don't use line continuation marker '...' unless necessary.
| author | Rik <rik@octave.org> |
|---|---|
| date | Sun, 04 Oct 2015 22:18:54 -0700 |
| parents | 117ccb5080c1 |
| children |
line wrap: on
line source
## Copyright (C) 2015 Rik Wehbring ## ## 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/>. ## Test ordering of complex values by magnitude and then by phase %!test %! x = [0 i 1+i 2 3i 3+4i]; %! assert (sort (x, "descend"), fliplr (x)); %! assert (sort (single (x), "descend"), fliplr (single (x))); %!test %! x = [1, -1, i, -i]; %! xs = [-i, 1, i, -1]; %! assert (sort (x), xs); %! assert (sort (x, "descend"), fliplr (xs)); %! assert (sort (single (x)), single (xs)); %! assert (sort (single (x), "descend"), fliplr (single (xs))); ## bug #44071, issorted incorrect because it uses different sort routine. %!assert (issorted ([1, -1, i, -i]), false) %!assert (issorted (single ([1, -1, i, -i])), false) ## bug #43313, -1 is both '>' and '==' to (-1 - 0i) %!test %! assert (complex(-1,0) == complex(-1,-0), true); %! assert (complex(-1,0) > complex(-1,-0), false); %! assert (complex(-1,0) < complex(-1,-0), false); ## Test that sort and issorted both agree on boundary case %!test %! x = [complex(-1,0), complex(-1,-0), i, -i, 1]; %! xs = sort (x); %! xf = single (x); %! xfs = sort (xf); %! assert (issorted (xs)); %! assert (issorted (xfs)); %! assert (double (xfs), xs); ## Finally, test that sort and issorted agree on NaNs %!test %! x = [complex(NaN,-1), complex(NaN,NaN), ... %! complex(-1,0), complex(-1,-0), i, -i, 1, ... %! complex(1,NaN)]; %! xs = sort (x); %! xf = single (x); %! xfs = sort (xf); %! assert (issorted (xs)); %! assert (issorted (xfs)); %! assert (double (xfs), xs);