Mercurial > octave
view test/complex.tst @ 31138:b3ca7f891750
maint: use "m_" prefix for member variables in class octave_base_matrix.
* ov-base-int.cc, ov-base-mat.cc, ov-base-mat.h, ov-base.h, ov-bool-mat.cc,
ov-bool-mat.h, ov-cell.cc, ov-cell.h, ov-ch-mat.cc, ov-ch-mat.h, ov-cx-mat.cc,
ov-cx-mat.h, ov-flt-cx-mat.cc, ov-flt-cx-mat.h, ov-flt-re-mat.cc,
ov-flt-re-mat.h, ov-intx.h, ov-re-mat.cc, ov-re-mat.h, ov-str-mat.cc,
ov-str-mat.h:
use "m_" prefix for member variables in class octave_base_matrix.
author | Rik <rik@octave.org> |
---|---|
date | Sun, 10 Jul 2022 18:26:24 -0700 |
parents | 796f54d4ddbf |
children | 597f3ee61a48 |
line wrap: on
line source
######################################################################## ## ## Copyright (C) 2016-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/>. ## ######################################################################## ## 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);