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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 1996-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 bool values.
#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"
#define INLINE_ASCENDING_SORT 1
#define INLINE_DESCENDING_SORT 1
#include "oct-sort.cc"
// Specialize bool sorting (aka stable partitioning).
template <bool desc>
static void
do_bool_partition (bool *data, octave_idx_type nel)
{
octave_idx_type k = 0;
for (octave_idx_type i = 0; i < nel; i++)
if (data[i] == desc)
data[k++] = desc;
for (octave_idx_type i = k; i < nel; i++)
data[i] = ! desc;
}
template <bool desc>
static void
do_bool_partition (bool *data, octave_idx_type *idx,
octave_idx_type nel)
{
// FIXME: This is essentially a simple bucket sort.
// Can it be efficiently done by std::partition?
OCTAVE_LOCAL_BUFFER (octave_idx_type, jdx, nel);
octave_idx_type k = 0;
octave_idx_type l = 0;
for (octave_idx_type i = 0; i < nel; i++)
{
if (data[i] == desc)
{
data[k] = desc;
idx[k++] = idx[i];
}
else
jdx[l++] = idx[i];
}
for (octave_idx_type i = k; i < nel; i++)
{
data[i] = ! desc;
idx[i] = jdx[i-k];
}
}
template <>
template <>
void
octave_sort<bool>::sort (bool *data, octave_idx_type nel,
std::less<bool>)
{
do_bool_partition<false> (data, nel);
}
template <>
template <>
void
octave_sort<bool>::sort (bool *data, octave_idx_type nel,
std::greater<bool>)
{
do_bool_partition<true> (data, nel);
}
template <>
template <>
void
octave_sort<bool>::sort (bool *data, octave_idx_type *idx, octave_idx_type nel,
std::less<bool>)
{
do_bool_partition<false> (data, idx, nel);
}
template <>
template <>
void
octave_sort<bool>::sort (bool *data, octave_idx_type *idx, octave_idx_type nel,
std::greater<bool>)
{
do_bool_partition<true> (data, idx, nel);
}
template class octave_sort<bool>;
INSTANTIATE_ARRAY (bool, OCTAVE_CLASS_TEMPLATE_INSTANTIATION_API);
template OCTAVE_API std::ostream& operator << (std::ostream&,
const Array<bool>&);
#include "DiagArray2.h"
#include "DiagArray2.cc"
template class DiagArray2<bool>;
|
