File: complex.tst

package info (click to toggle)
octave 4.0.3-3
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 94,200 kB
  • ctags: 52,925
  • sloc: cpp: 316,850; ansic: 43,469; fortran: 23,670; sh: 13,805; yacc: 8,204; objc: 7,939; lex: 3,631; java: 2,127; makefile: 1,746; perl: 1,022; awk: 988
file content (64 lines) | stat: -rw-r--r-- 2,147 bytes parent folder | download | duplicates (2)
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
## 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);