-
Notifications
You must be signed in to change notification settings - Fork 4
/
accessors.go
340 lines (300 loc) · 8.38 KB
/
accessors.go
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
package numgo
import (
"fmt"
"math"
"runtime"
)
// Flatten reshapes the data to a 1-D array.
func (a *Array64) Flatten() *Array64 {
if a.HasErr() {
return a
}
return a.Reshape(a.strides[0])
}
// C will return a deep copy of the source array.
func (a *Array64) C() (b *Array64) {
if a.HasErr() {
return a
}
b = &Array64{
shape: make([]int, len(a.shape)),
strides: make([]int, len(a.strides)),
data: make([]float64, a.strides[0]),
err: nil,
debug: "",
stack: "",
}
copy(b.shape, a.shape)
copy(b.strides, a.strides)
copy(b.data, a.data)
return b
}
// Shape returns a copy of the array shape
func (a *Array64) Shape() []int {
if a.HasErr() {
return nil
}
res := make([]int, len(a.shape), len(a.shape))
copy(res, a.shape)
return res
}
// At returns the element at the given index.
// There should be one index per axis. Generates a ShapeError if incorrect index.
func (a *Array64) At(index ...int) float64 {
idx := a.valIdx(index, "At")
if a.HasErr() {
return math.NaN()
}
return a.data[idx]
}
func (a *Array64) at(index []int) float64 {
var idx int
for i, v := range index {
idx += v * a.strides[i+1]
}
return a.data[idx]
}
func (a *Array64) valIdx(index []int, mthd string) (idx int) {
if a.HasErr() {
return 0
}
if len(index) > len(a.shape) {
a.err = InvIndexError
if debug {
a.debug = fmt.Sprintf("Incorrect number of indicies received by %s(). Shape: %v Index: %v", mthd, a.shape, index)
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return 0
}
for i, v := range index {
if v >= a.shape[i] || v < 0 {
a.err = IndexError
if debug {
a.debug = fmt.Sprintf("Index received by %s() does not exist shape: %v index: %v", mthd, a.shape, index)
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return 0
}
idx += v * a.strides[i+1]
}
return
}
// SliceElement returns the element group at one axis above the leaf elements.
// Data is returned as a copy in a float slice.
func (a *Array64) SliceElement(index ...int) (ret []float64) {
idx := a.valIdx(index, "SliceElement")
switch {
case a.HasErr():
return nil
case len(a.shape)-1 != len(index):
a.err = InvIndexError
if debug {
a.debug = fmt.Sprintf("Incorrect number of indicies received by SliceElement(). Shape: %v Index: %v", a.shape, index)
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return nil
}
return append(ret, a.data[idx:idx+a.strides[len(a.strides)-2]]...)
}
// SubArr slices the array at a given index.
func (a *Array64) SubArr(index ...int) (ret *Array64) {
idx := a.valIdx(index, "SubArr")
if a.HasErr() {
return a
}
ret = newArray64(a.shape[len(index):]...)
copy(ret.data, a.data[idx:idx+a.strides[len(index)]])
return
}
// Set sets the element at the given index.
// There should be one index per axis. Generates a ShapeError if incorrect index.
func (a *Array64) Set(val float64, index ...int) *Array64 {
idx := a.valIdx(index, "Set")
if a.HasErr() {
return a
}
a.data[idx] = val
return a
}
// SetSliceElement sets the element group at one axis above the leaf elements.
// Source Array is returned, for function-chaining design.
func (a *Array64) SetSliceElement(vals []float64, index ...int) *Array64 {
idx := a.valIdx(index, "SetSliceElement")
switch {
case a.HasErr():
return a
case len(a.shape)-1 != len(index):
if debug {
a.debug = fmt.Sprintf("Incorrect number of indicies received by SetSliceElement(). Shape: %v Index: %v", a.shape, index)
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
fallthrough
case len(vals) != a.shape[len(a.shape)-1]:
a.err = InvIndexError
if debug {
a.debug = fmt.Sprintf("Incorrect slice length received by SetSliceElement(). Shape: %v Index: %v", a.shape, len(index))
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return a
}
copy(a.data[idx:idx+a.strides[len(a.strides)-2]], vals[:a.strides[len(a.strides)-2]])
return a
}
// SetSubArr sets the array below a given index to the values in vals.
// Values will be broadcast up multiple axes if the shapes match.
func (a *Array64) SetSubArr(vals *Array64, index ...int) *Array64 {
idx := a.valIdx(index, "SetSubArr")
switch {
case a.HasErr():
return a
case vals.HasErr():
a.err = vals.getErr()
if debug {
a.debug = "Array received by SetSubArr() is in error."
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return a
case len(vals.shape)+len(index) > len(a.shape):
a.err = InvIndexError
if debug {
a.debug = fmt.Sprintf("Array received by SetSubArr() cant be broadcast. Shape: %v Vals shape: %v index: %v", a.shape, vals.shape, index)
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return a
}
for i, j := len(a.shape)-1, len(vals.shape)-1; j >= 0; i, j = i-1, j-1 {
if a.shape[i] != vals.shape[j] {
a.err = ShapeError
if debug {
a.debug = fmt.Sprintf("Shape of array recieved by SetSubArr() doesn't match receiver. Shape: %v Vals Shape: %v", a.shape, vals.shape)
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return a
}
}
if len(a.shape)-len(index)-len(vals.shape) == 0 {
copy(a.data[idx:idx+len(vals.data)], vals.data)
return a
}
reps := 1
for i := len(index); i < len(a.shape)-len(vals.shape); i++ {
reps *= a.shape[i]
}
ln := len(vals.data)
for i := 1; i <= reps; i++ {
copy(a.data[idx+ln*(i-1):idx+ln*i], vals.data)
}
return a
}
// Resize will change the underlying array size.
//
// Make a copy C() if the original array needs to remain unchanged.
// Element location in the underlying slice will not be adjusted to the new shape.
func (a *Array64) Resize(shape ...int) *Array64 {
switch {
case a.HasErr():
return a
case len(shape) == 0:
tmp := newArray64(0)
a.shape, a.strides = tmp.shape, tmp.strides
a.data = tmp.data
return a
}
var sz int = 1
for _, v := range shape {
if v >= 0 {
sz *= v
continue
}
a.err = NegativeAxis
if debug {
a.debug = fmt.Sprintf("Negative axis length received by Resize. Shape: %v", shape)
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return a
}
ln, cp := len(shape), cap(a.shape)
if ln > cp {
a.shape = append(a.shape[:cp], make([]int, ln-cp)...)
} else {
a.shape = a.shape[:ln]
}
ln, cp = ln+1, cap(a.strides)
if ln > cp {
a.strides = append(a.strides[:cp], make([]int, ln-cp)...)
} else {
a.strides = a.strides[:ln]
}
a.strides[ln-1] = 1
for i := ln - 2; i >= 0; i-- {
a.shape[i] = shape[i]
a.strides[i] = a.shape[i] * a.strides[i+1]
}
cp = cap(a.data)
if sz > cp {
a.data = append(a.data[:cp], make([]float64, sz-cp)...)
} else {
a.data = a.data[:sz]
}
return a
}
// Append will concatenate a and val at the given axis.
//
// Source array will be changed, so use C() if the original data is needed.
// All axes must be the same except the appending axis.
func (a *Array64) Append(val *Array64, axis int) *Array64 {
switch {
case a.HasErr():
return a
case axis >= len(a.shape), axis < 0:
a.err = IndexError
if debug {
a.debug = fmt.Sprintf("Axis received by Append() out of range. Shape: %v Axis: %v", a.shape, axis)
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return a
case val.HasErr():
a.err = val.GetErr()
if debug {
a.debug = "Array received by Append() is in error."
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return a
case len(a.shape) != len(val.shape):
a.err = ShapeError
if debug {
a.debug = fmt.Sprintf("Array received by Append() can not be matched. Shape: %v Val shape: %v", a.shape, val.shape)
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return a
}
for k, v := range a.shape {
if v != val.shape[k] && k != axis {
a.err = ShapeError
if debug {
a.debug = fmt.Sprintf("Array received by Append() can not be matched. Shape: %v Val shape: %v", a.shape, val.shape)
a.stack = string(stackBuf[:runtime.Stack(stackBuf, false)])
}
return a
}
}
ln := len(a.data) + len(val.data)
var dat []float64
cp := cap(a.data)
if ln > cp {
dat = make([]float64, ln)
} else {
dat = a.data[:ln]
}
as, vs := a.strides[axis], val.strides[axis]
for i, j := a.strides[0], val.strides[0]; i > 0; i, j = i-as, j-vs {
copy(dat[i+j-vs:i+j], val.data[j-vs:j])
copy(dat[i+j-as-vs:i+j-vs], a.data[i-as:i])
}
a.data = dat
a.shape[axis] += val.shape[axis]
for i := axis; i >= 0; i-- {
a.strides[i] = a.strides[i+1] * a.shape[i]
}
return a
}