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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
// N-D Array manipulations.
/*
Copyright (C) 2004 John W. Eaton
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 2, 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, write to the Free
Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION)
#pragma implementation
#endif
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "Array-util.h"
#include "mx-base.h"
#include "lo-ieee.h"
// unary operations
template <class T>
boolNDArray
intNDArray<T>::operator ! (void) const
{
boolNDArray b (this->dims ());
for (int i = 0; i < this->length (); i++)
b.elem (i) = ! this->elem (i);
return b;
}
// XXX FIXME XXX -- this is not quite the right thing.
template <class T>
boolNDArray
intNDArray<T>::all (int dim) const
{
MX_ND_ANY_ALL_REDUCTION (MX_ND_ALL_EVAL (this->elem (iter_idx) == T (0)), true);
}
template <class T>
boolNDArray
intNDArray<T>::any (int dim) const
{
MX_ND_ANY_ALL_REDUCTION (MX_ND_ALL_EVAL (this->elem (iter_idx) == T (0)), false);
}
template <class T>
void
intNDArray<T>::increment_index (Array<int>& ra_idx,
const dim_vector& dimensions,
int start_dimension)
{
::increment_index (ra_idx, dimensions, start_dimension);
}
template <class T>
int
intNDArray<T>::compute_index (Array<int>& ra_idx,
const dim_vector& dimensions)
{
return ::compute_index (ra_idx, dimensions);
}
template <class T>
intNDArray<T>
intNDArray<T>::concat (const intNDArray<T>& rb, const Array<int>& ra_idx)
{
if (rb.numel () > 0);
insert (rb, ra_idx);
return *this;
}
template <class T>
intNDArray<T>&
intNDArray<T>::insert (const intNDArray<T>& a, int r, int c)
{
Array<T>::insert (a, r, c);
return *this;
}
template <class T>
intNDArray<T>&
intNDArray<T>::insert (const intNDArray<T>& a, const Array<int>& ra_idx)
{
Array<T>::insert (a, ra_idx);
return *this;
}
// This contains no information on the array structure !!!
template <class T>
std::ostream&
operator << (std::ostream& os, const intNDArray<T>& a)
{
int nel = a.nelem ();
for (int i = 0; i < nel; i++)
os << " " << a.elem (i) << "\n";
return os;
}
template <class T>
std::istream&
operator >> (std::istream& is, intNDArray<T>& a)
{
int nel = a.nelem ();
if (nel < 1 )
is.clear (std::ios::badbit);
else
{
T tmp;
for (int i = 0; i < nel; i++)
{
is >> tmp;
if (is)
a.elem (i) = tmp;
else
goto done;
}
}
done:
return is;
}
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
|
