-
Notifications
You must be signed in to change notification settings - Fork 25
Expand file tree
/
Copy pathscalar_array.cpp
More file actions
448 lines (377 loc) · 10.5 KB
/
scalar_array.cpp
File metadata and controls
448 lines (377 loc) · 10.5 KB
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
// This alternative to numpy is not currently being used
// but is retained in CVS for possible future use.
// In particular, information about array objects such
// as curve cannot currently be cached because we don't
// know when a numpy pos array has been changed.
// Copyright (c) 2000, 2001, 2002, 2003 by David Scherer and others.
// See the file license.txt for complete license terms.
// See the file authors.txt for a complete list of contributors.
#include "python/scalar_array.hpp"
#include "python/vector_array.hpp"
#include "util/vector.hpp"
#include <boost/python/class.hpp>
#include <boost/python/operators.hpp>
#include <boost/python/return_value_policy.hpp>
#include <boost/python/copy_const_reference.hpp>
#include <boost/python/init.hpp>
#include <boost/python/extract.hpp>
#include <boost/python/iterator.hpp>
#define PY_ARRAY_UNIQUE_SYMBOL visual_PyArrayHandle
#define NO_IMPORT_ARRAY
#include <numpy/arrayobject.h>
namespace cvisual { namespace python {
/*********************** scalar_array implementation ***********************/
scalar_array::scalar_array( const boost::python::list& sequence)
: data( boost::python::extract<int>( sequence.attr("__len__")()))
{
int s_i = 0;
for ( iterator i = data.begin(); i != data.end(); ++i, ++s_i) {
*i = boost::python::extract<double>( sequence[s_i]);
}
}
scalar_array::scalar_array( const boost::python::numeric::array& sequence)
: data( ((PyArrayObject*)sequence.ptr())->dimensions[0])
{
const PyArrayObject* seq_ptr = (PyArrayObject*)sequence.ptr();
if (!( seq_ptr->nd == 1
&& seq_ptr->descr->type_num == PyArray_DOUBLE)) {
throw std::invalid_argument( "Must construct a scalar_array from a "
"one-dimensional array of type Float64");
}
const double* seq_i = (const double*)seq_ptr->data;
iterator i = this->begin();
for ( ; i != this->end(); ++i, ++seq_i) {
*i = *seq_i;
}
}
// Convert to a Numeric.array
boost::python::handle<PyObject>
scalar_array::as_array() const
{
int dims[] = { this->size() };
boost::python::handle<> ret( PyArray_FromDims( 1, dims, PyArray_DOUBLE));
PyArrayObject* ret_ptr = (PyArrayObject*)ret.get();
double* r_i = (double*)ret_ptr->data;
const_iterator i = this->begin();
for ( ; i != this->end(); ++i, ++r_i) {
*r_i = *i;
}
return ret;
}
void
scalar_array::append( double s)
{
data.push_back( s);
}
void
scalar_array::prepend( double s)
{
data.push_front( s);
}
void
scalar_array::head_clip()
{
data.pop_front();
}
void
scalar_array::head_crop( int i_)
{
if (i_ < 0)
throw std::invalid_argument( "Cannot crop a negative amount.");
size_t i = (size_t)i_;
if (i >= data.size())
throw std::out_of_range( "Cannot crop greater than the array's length.");
iterator begin = data.begin();
data.erase( begin, begin+i);
}
void
scalar_array::tail_clip()
{
data.pop_back();
}
void
scalar_array::tail_crop( int i_)
{
if (i_ < 0)
throw std::invalid_argument( "Cannot crop a negative amount.");
size_t i = (size_t)i_;
if (i >= data.size())
throw std::out_of_range( "Cannot crop greater than the array's length.");
iterator end = data.end();
data.erase( end-i, end);
}
scalar_array
scalar_array::operator*( double s) const
{
scalar_array ret( data.size());
iterator r_i = ret.begin();
for (const_iterator i = data.begin(); i != data.end(); ++i, ++r_i) {
*r_i = *i * s;
}
return ret;
}
scalar_array
scalar_array::operator*( const scalar_array& s) const
{
if (data.size() != s.data.size())
throw std::out_of_range( "Incompatible array multiplication.");
scalar_array ret( data.size());
const_iterator s_i = s.begin();
iterator r_i = ret.begin();
for (const_iterator i = data.begin(); i != data.end(); ++i, ++s_i, ++r_i) {
*r_i = *i * *s_i;
}
return ret;
}
vector_array
scalar_array::operator*( const vector_array& v) const
{
if (data.size() != v.data.size())
throw std::out_of_range( "Incompatible array multiplication.");
vector_array ret( data.size());
vector_array::iterator r_i = ret.begin();
vector_array::const_iterator v_i = v.begin();
for (const_iterator i = data.begin(); i != data.end(); ++i, ++r_i, ++v_i) {
*r_i = *i * *v_i;
}
return ret;
}
vector_array
scalar_array::operator*( const vector& v) const
{
vector_array ret( data.size());
vector_array::iterator r_i = ret.begin();
for (const_iterator i = data.begin(); i!= data.end(); ++i) {
*r_i = v * *i;
}
return ret;
}
const scalar_array&
scalar_array::operator*=( double s)
{
for (iterator i = data.begin(); i != data.end(); ++i) {
*i *= s;
}
return *this;
}
const scalar_array&
scalar_array::operator*=( const scalar_array& s)
{
if (data.size() != s.data.size())
throw std::out_of_range( "Incompatible array multiplication.");
const_iterator s_i = s.begin();
for (iterator i = data.begin(); i != data.end(); ++i, ++s_i) {
*i *= *s_i;
}
return *this;
}
scalar_array
scalar_array::operator/( double s) const
{
scalar_array ret( data.size());
iterator r_i = ret.begin();
for (const_iterator i = data.begin(); i != data.end(); ++i, ++r_i) {
*r_i = *i / s;
}
return ret;
}
scalar_array
scalar_array::operator/( const scalar_array& s) const
{
if (data.size() != s.data.size())
throw std::out_of_range( "Incompatible array division.");
scalar_array ret( data.size());
const_iterator s_i = s.begin();
iterator r_i = ret.begin();
for (const_iterator i = data.begin(); i != data.end(); ++i, ++s_i, ++r_i) {
*r_i = *i / *s_i;
}
return ret;
}
const scalar_array&
scalar_array::operator/=( double s)
{
for (iterator i = data.begin(); i != data.end(); ++i) {
*i /= s;
}
return *this;
}
const scalar_array&
scalar_array::operator/=( const scalar_array& s)
{
if (data.size() != s.data.size())
throw std::out_of_range( "Incompatible array division.");
const_iterator s_i = s.begin();
for (iterator i = data.begin(); i != data.end(); ++i, ++s_i) {
*i *= *s_i;
}
return *this;
}
scalar_array
scalar_array::operator+( const scalar_array& s) const
{
if (data.size() != s.data.size())
throw std::out_of_range( "Incompatible array addition.");
scalar_array ret( data.size());
iterator r_i = ret.begin();
const_iterator s_i = s.data.begin();
for (const_iterator i = data.begin(); i != data.end(); ++i, ++s_i, ++r_i) {
*r_i = *s_i + *i;
}
return *this;
}
scalar_array
scalar_array::operator+( double s) const
{
scalar_array ret( data.size());
iterator r_i = ret.begin();
for (const_iterator i = data.begin(); i != data.end(); ++i, ++r_i) {
*r_i = *i + s;
}
return ret;
}
const scalar_array&
scalar_array::operator+=( double s)
{
for (iterator i = data.begin(); i != data.end(); ++i) {
*i += s;
}
return *this;
}
const scalar_array&
scalar_array::operator+=( const scalar_array& s)
{
if (data.size() != s.data.size())
throw std::out_of_range( "Incompatible array addition.");
const_iterator s_i = s.begin();
for (iterator i = data.begin(); i != data.end(); ++i, ++s_i) {
*i += *s_i;
}
return *this;
}
scalar_array
scalar_array::operator-( const scalar_array& s) const
{
if (data.size() != s.data.size())
throw std::out_of_range( "Incompatible array subtraction.");
scalar_array ret( data.size());
iterator r_i = ret.begin();
const_iterator s_i = s.data.begin();
for (const_iterator i = data.begin(); i != data.end(); ++i, ++s_i, ++r_i) {
*r_i = *i - *s_i;
}
return ret;
}
scalar_array
scalar_array::operator-( double s) const
{
scalar_array ret( data.size());
iterator r_i = ret.begin();
for (const_iterator i = data.begin(); i != data.end(); ++i, ++r_i) {
*r_i = *i - s;
}
return ret;
}
const scalar_array&
scalar_array::operator-=( double s)
{
for (iterator i = data.begin(); i != data.end(); ++i) {
*i -= s;
}
return *this;
}
const scalar_array&
scalar_array::operator-=( const scalar_array& s)
{
if (data.size() != s.data.size())
throw std::out_of_range( "Incompatible array subtraction.");
const_iterator s_i = s.begin();
for (iterator i = data.begin(); i != data.end(); ++i, ++s_i) {
*i -= *s_i;
}
return *this;
}
scalar_array
scalar_array::operator-() const
{
scalar_array ret( data.size());
iterator r_i = ret.begin();
for (const_iterator i = data.begin(); i != data.end(); ++i, ++r_i) {
*r_i = - *i;
}
return ret;
}
void
scalar_array::py_setitem( int index, double value)
{
if (index < 0)
// Negative indexes are counted from the end of the array.
index += data.size();
data.at(index) = value;
}
double
scalar_array::py_getitem( int index)
{
if (index < 0)
index += data.size();
return data.at(index);
}
double
scalar_array::sum() const
{
double ret = 0.0;
for ( const_iterator i = data.begin(); i != data.end(); ++i) {
ret += *i;
}
return ret;
}
void
wrap_scalar_array()
{
using namespace boost::python;
scalar_array (scalar_array::* truediv_self)( const scalar_array&) const = &scalar_array::operator/;
const scalar_array& (scalar_array::* itruediv_self)( const scalar_array&) = &scalar_array::operator/=;
scalar_array (scalar_array::* truediv_double)( double) const = &scalar_array::operator/;
const scalar_array& (scalar_array::* itruediv_double)( double) = &scalar_array::operator/=;
class_<scalar_array>( "scalar_array", init< optional<int, double> >( args( "size", "fill" ) ))
.def( init<const list&>())
.def( init<numeric::array>())
.def( self + self)
.def( self + other<double>())
.def( self += self)
.def( self += other<double>())
.def( self - self)
.def( self - other<double>())
.def( self -= self)
.def( self -= other<double>())
.def( self * self)
.def( self * other<double>())
.def( self * other<vector>())
.def( self *= self)
.def( self *= other<double>())
.def( self * other<vector_array>())
.def( self / self)
.def( self / other<double>())
.def( self /= self)
.def( self /= other<double>()) // in-place division by single element.
.def( "__truediv__", truediv_self)
.def( "__truediv__", truediv_double)
.def( "__itruediv__", itruediv_double, return_value_policy<copy_const_reference>())
.def( "__itruediv__", itruediv_self, return_value_policy<copy_const_reference>())
.def( -self)
.def( "__iter__", iterator<scalar_array>())
.def( "__len__", &scalar_array::size)
.def( "__getitem__", &scalar_array::py_getitem)
.def( "__setitem__", &scalar_array::py_setitem)
.def( "append", &scalar_array::append)
.def( "prepend", &scalar_array::prepend)
.def( "head_clip", &scalar_array::head_clip)
.def( "head_crop", &scalar_array::head_crop)
.def( "tail_clip", &scalar_array::tail_clip)
.def( "tail_crop", &scalar_array::tail_crop)
.def( "sum", &scalar_array::sum, "Returns the sum of all elements in the array.")
.def( "as_array", &scalar_array::as_array,
"Returns a new self.__len__() x 1 Numeric.array from this scalar_array.")
;
}
} } // !namespace cvisual::python