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
|
/*
* Copyright (c) 2009 Samit Basu
*
* This program 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 of the License, or
* (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "Operators.hpp"
struct OpVecCumSum {
template <typename T>
static inline void func(const ConstSparseIterator<T> & src,
SparseSlice<T>& dest) {
throw Exception("cumsum not supported for sparse matrices");
}
template <typename T>
static inline void func(const ConstComplexSparseIterator<T> & src,
SparseSlice<T>& dest_real,
SparseSlice<T>& dest_imag) {
throw Exception("cumsum not supported for sparse matrices");
}
template <typename T>
static inline void func(const BasicArray<T> & src,
BasicArray<T>& dest) {
if (src.length() == 0) return;
T accum = 0;
for (index_t i=1;i<=src.length();i++) {
accum = src[i] + accum;
dest[i] = accum;
}
}
template <typename T>
static inline void func(const BasicArray<T> & src_real,
const BasicArray<T> & src_imag,
BasicArray<T>& dest_real,
BasicArray<T>& dest_imag) {
if (src_real.length() == 0) return;
T accum_real = 0;
T accum_imag = 0;
for (index_t i=1;i<=src_real.length();i++) {
accum_real += src_real[i];
accum_imag += src_imag[i];
dest_real[i] = accum_real;
dest_imag[i] = accum_imag;
}
}
};
//!
//@Module CUMSUM Cumulative Summation Function
//@@Section ELEMENTARY
//@@Usage
//Computes the cumulative sum of an n-dimensional array along a given
//dimension. The general syntax for its use is
//@[
// y = cumsum(x,d)
//@]
//where @|x| is a multidimensional array of numerical type, and @|d|
//is the dimension along which to perform the cumulative sum. The
//output @|y| is the same size of @|x|. Integer types are promoted
//to @|int32|. If the dimension @|d| is not specified, then the
//cumulative sum is applied along the first non-singular dimension.
//@@Function Internals
//The output is computed via
//\[
// y(m_1,\ldots,m_{d-1},j,m_{d+1},\ldots,m_{p}) =
// \sum_{k=1}^{j} x(m_1,\ldots,m_{d-1},k,m_{d+1},\ldots,m_{p}).
//\]
//@@Example
//The default action is to perform the cumulative sum along the
//first non-singular dimension.
//@<
//A = [5,1,3;3,2,1;0,3,1]
//cumsum(A)
//@>
//To compute the cumulative sum along the columns:
//@<
//cumsum(A,2)
//@>
//The cumulative sum also works along arbitrary dimensions
//@<
//B(:,:,1) = [5,2;8,9];
//B(:,:,2) = [1,0;3,0]
//cumsum(B,3)
//@>
//@@Tests
//@$exact#y1=cumsum(x1)
//@@Signature
//function cumsum CumsumFunction
//inputs x dimension
//outputs y
//!
ArrayVector CumsumFunction(int nargout, const ArrayVector& arg) {
// Get the data argument
if (arg.size() < 1)
throw Exception("cumsum requires at least one argument");
Array input(arg[0]);
int dim;
if (arg.size() > 1)
dim = arg[1].asInteger()-1;
else
dim = input.dimensions().firstNonsingular();
return ArrayVector(VectorOp<OpVecCumSum>(input,
int(input.dimensions()[dim]),
dim));
}
|
