1 ////////////////////////////////////////////////////////////////////////
2 //
3 // Copyright (C) 1994-2021 The Octave Project Developers
4 //
5 // See the file COPYRIGHT.md in the top-level directory of this
6 // distribution or <https://octave.org/copyright/>.
7 //
8 // This file is part of Octave.
9 //
10 // Octave is free software: you can redistribute it and/or modify it
11 // under the terms of the GNU General Public License as published by
12 // the Free Software Foundation, either version 3 of the License, or
13 // (at your option) any later version.
14 //
15 // Octave is distributed in the hope that it will be useful, but
16 // WITHOUT ANY WARRANTY; without even the implied warranty of
17 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 // GNU General Public License for more details.
19 //
20 // You should have received a copy of the GNU General Public License
21 // along with Octave; see the file COPYING. If not, see
22 // <https://www.gnu.org/licenses/>.
23 //
24 ////////////////////////////////////////////////////////////////////////
25
26 #if defined (HAVE_CONFIG_H)
27 # include "config.h"
28 #endif
29
30 // Instantiate Arrays of Complex values.
31
32 #include "oct-cmplx.h"
33 #include "lo-mappers.h"
34
35 #include "Array.h"
36 #include "Array.cc"
37 #include "oct-sort.cc"
38
39 // Prevent implicit instantiations on some systems (Windows, others?)
40 // that can lead to duplicate definitions of static data members.
41
42 extern template class OCTAVE_API Array<idx_vector>;
43 extern template class OCTAVE_API Array<octave_idx_type>;
44
45 template <>
46 inline bool
sort_isnan(const Complex & x)47 sort_isnan<Complex> (const Complex& x)
48 {
49 return octave::math::isnan (x);
50 }
51
52 // Sort Criteria: 1) isnan, 2) magnitude of z, 3) phase of z in range (-pi, pi]
53
54 static bool
nan_ascending_compare(const Complex & x,const Complex & y)55 nan_ascending_compare (const Complex& x, const Complex& y)
56 {
57 return octave::math::isnan (y) ? ! octave::math::isnan (x) : x < y;
58 }
59
60 static bool
nan_descending_compare(const Complex & x,const Complex & y)61 nan_descending_compare (const Complex& x, const Complex& y)
62 {
63 return octave::math::isnan (x) ? ! octave::math::isnan (y) : x > y;
64 }
65
66 Array<Complex>::compare_fcn_type
safe_comparator(sortmode mode,const Array<Complex> & a,bool allow_chk)67 safe_comparator (sortmode mode, const Array<Complex>& a, bool allow_chk)
68 {
69 Array<Complex>::compare_fcn_type result = nullptr;
70
71 if (allow_chk)
72 {
73 octave_idx_type k = 0;
74 for (; k < a.numel () && ! octave::math::isnan (a(k)); k++) ;
75 if (k == a.numel ())
76 {
77 if (mode == ASCENDING)
78 result = octave_sort<Complex>::ascending_compare;
79 else if (mode == DESCENDING)
80 result = octave_sort<Complex>::descending_compare;
81 }
82 }
83
84 if (! result)
85 {
86 if (mode == ASCENDING)
87 result = nan_ascending_compare;
88 else if (mode == DESCENDING)
89 result = nan_descending_compare;
90 }
91
92 return result;
93 }
94
95 template class OCTAVE_API octave_sort<Complex>;
96
97 INSTANTIATE_ARRAY (Complex, OCTAVE_API);
98
99 template OCTAVE_API std::ostream& operator << (std::ostream&,
100 const Array<Complex>&);
101
102 #include "DiagArray2.h"
103 #include "DiagArray2.cc"
104
105 template class OCTAVE_API DiagArray2<Complex>;
106