Mercurial > octave
view test/complex.tst @ 19635:bdf90710dddf
Map -pi to pi for principal argument used in complex operators (bug #43313).
* oct-cmplx.h: For all operator templates in file, use conditional tests on
arg() output to effectively map -pi to pi.
* Array-C.cc (nan_ascending_compare, nan_descending_compare) : Update sort
routines used by issorted to map -pi to pi. Use intermediate variables for
a 40% speed-up in calculation.
* Array-fC.cc (nan_ascending_compare, nan_descending_compare) : Update sort
routines used by issorted to map -pi to pi. Use intermediate variables for
a 40% speed-up in calculation.
* test/complex.tst: New test file to check behavior.
* test/Makefile.am: Add complex.tst to build system.
author | Daniel J Sebald <daniel.sebald@ieee.org> |
---|---|
date | Sat, 04 Oct 2014 02:17:17 -0500 |
parents | |
children | 31e3799b9e27 |
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)); %!test %! x = [1, -1, i, -i]; %! xs = [-i, 1, i, -1]; %! assert (sort (x), xs); %! assert (sort (x, "descend"), fliplr (xs)); ## bug #44071, issorted incorrect because it uses different sort routine. %!assert (issorted ([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); %! assert (issorted (xs));