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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 1994-2025 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/>.
//
////////////////////////////////////////////////////////////////////////
#if defined (HAVE_CONFIG_H)
# include "config.h"
#endif
// Instantiate Arrays of Complex values.
#include "oct-cmplx.h"
#include "lo-mappers.h"
#include "Array.h"
// Prevent implicit instantiations on some systems (Windows, others?)
// that can lead to duplicate definitions of static data members.
extern template class OCTAVE_EXTERN_TEMPLATE_API Array<octave::idx_vector>;
extern template class Array<octave_idx_type>;
#include "Array-base.cc"
#include "oct-sort.cc"
template <>
inline bool
sort_isnan<Complex> (const Complex& x)
{
return octave::math::isnan (x);
}
// Sort Criteria: 1) isnan, 2) magnitude of z, 3) phase of z in range (-pi, pi]
static bool
nan_ascending_compare (const Complex& x, const Complex& y)
{
return octave::math::isnan (y) ? ! octave::math::isnan (x) : x < y;
}
static bool
nan_descending_compare (const Complex& x, const Complex& y)
{
return octave::math::isnan (x) ? ! octave::math::isnan (y) : x > y;
}
Array<Complex>::compare_fcn_type
safe_comparator (sortmode mode, const Array<Complex>& a, bool allow_chk)
{
Array<Complex>::compare_fcn_type result = nullptr;
if (allow_chk)
{
octave_idx_type k = 0;
for (; k < a.numel () && ! octave::math::isnan (a(k)); k++) ;
if (k == a.numel ())
{
if (mode == ASCENDING)
result = octave_sort<Complex>::ascending_compare;
else if (mode == DESCENDING)
result = octave_sort<Complex>::descending_compare;
}
}
if (! result)
{
if (mode == ASCENDING)
result = nan_ascending_compare;
else if (mode == DESCENDING)
result = nan_descending_compare;
}
return result;
}
template class octave_sort<Complex>;
INSTANTIATE_ARRAY (Complex, OCTAVE_CLASS_TEMPLATE_INSTANTIATION_API);
template OCTAVE_API std::ostream& operator << (std::ostream&,
const Array<Complex>&);
#include "DiagArray2.h"
#include "DiagArray2.cc"
template class DiagArray2<Complex>;
|
