/
ranges.py
330 lines (265 loc) · 10.2 KB
/
ranges.py
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
import math
import numpy
import cupy
from cupy import core
def arange(start, stop=None, step=1, dtype=None):
"""Returns an array with evenly spaced values within a given interval.
Values are generated within the half-open interval [start, stop). The first
three arguments are mapped like the ``range`` built-in function, i.e. start
and step are optional.
Args:
start: Start of the interval.
stop: End of the interval.
step: Step width between each pair of consecutive values.
dtype: Data type specifier. It is inferred from other arguments by
default.
Returns:
cupy.ndarray: The 1-D array of range values.
.. seealso:: :func:`numpy.arange`
"""
if dtype is None:
if any(numpy.dtype(type(val)).kind == 'f'
for val in (start, stop, step)):
dtype = float
else:
dtype = int
if stop is None:
stop = start
start = 0
if step is None:
step = 1
size = int(numpy.ceil((stop - start) / step))
if size <= 0:
return cupy.empty((0,), dtype=dtype)
if numpy.dtype(dtype).type == numpy.bool_:
if size > 2:
raise ValueError('no fill-function for data-type.')
if size == 2:
return cupy.array([start, start - step], dtype=numpy.bool_)
else:
return cupy.array([start], dtype=numpy.bool_)
ret = cupy.empty((size,), dtype=dtype)
typ = numpy.dtype(dtype).type
_arange_ufunc(typ(start), typ(step), ret, dtype=dtype)
return ret
def linspace(start, stop, num=50, endpoint=True, retstep=False, dtype=None):
"""Returns an array with evenly-spaced values within a given interval.
Instead of specifying the step width like :func:`cupy.arange`, this
function requires the total number of elements specified.
Args:
start: Start of the interval.
stop: End of the interval.
num: Number of elements.
endpoint (bool): If ``True``, the stop value is included as the last
element. Otherwise, the stop value is omitted.
retstep (bool): If ``True``, this function returns (array, step).
Otherwise, it returns only the array.
dtype: Data type specifier. It is inferred from the start and stop
arguments by default.
Returns:
cupy.ndarray: The 1-D array of ranged values.
"""
if num < 0:
raise ValueError('linspace with num<0 is not supported')
if dtype is None:
# In actual implementation, only float is used
dtype = float
ret = cupy.empty((num,), dtype=dtype)
if num == 0:
step = float('nan')
elif num == 1:
ret.fill(start)
step = float('nan')
else:
div = (num - 1) if endpoint else num
step = float(stop - start) / div
stop = float(stop)
if step == 0.0:
# for underflow
_linspace_ufunc_underflow(start, stop - start, div, ret,
casting='unsafe')
else:
_linspace_ufunc(start, step, ret, casting='unsafe')
if endpoint:
ret[-1] = stop
if retstep:
return ret, step
else:
return ret
def logspace(start, stop, num=50, endpoint=True, base=10.0, dtype=None):
"""Returns an array with evenly-spaced values on a log-scale.
Instead of specifying the step width like :func:`cupy.arange`, this
function requires the total number of elements specified.
Args:
start: Start of the interval.
stop: End of the interval.
num: Number of elements.
endpoint (bool): If ``True``, the stop value is included as the last
element. Otherwise, the stop value is omitted.
base (float): Base of the log space. The step sizes between the
elements on a log-scale are the same as ``base``.
dtype: Data type specifier. It is inferred from the start and stop
arguments by default.
Returns:
cupy.ndarray: The 1-D array of ranged values.
"""
y = linspace(start, stop, num=num, endpoint=endpoint)
if dtype is None:
return core.power(base, y)
return core.power(base, y).astype(dtype)
def meshgrid(*xi, **kwargs):
"""Return coordinate matrices from coordinate vectors.
Given one-dimensional coordinate arrays x1, x2, ..., xn, this function
makes N-D grids.
For one-dimensional arrays x1, x2, ..., xn with lengths ``Ni = len(xi)``,
this function returns ``(N1, N2, N3, ..., Nn)`` shaped arrays
if indexing='ij' or ``(N2, N1, N3, ..., Nn)`` shaped arrays
if indexing='xy'.
Unlike NumPy, CuPy currently only supports 1-D arrays as inputs.
Args:
xi (tuple of ndarrays): 1-D arrays representing the coordinates
of a grid.
indexing ({'xy', 'ij'}, optional): Cartesian ('xy', default) or
matrix ('ij') indexing of output.
sparse (bool, optional): If ``True`` a sparse grid is returned in order
to conserve memory. Default is False.
copy (bool, optional): If ``False``, a view
into the original arrays are returned. Default is True.
Returns:
list of cupy.ndarray
.. seealso:: :func:`numpy.meshgrid`
"""
indexing = kwargs.pop('indexing', 'xy')
copy = bool(kwargs.pop('copy', True))
sparse = bool(kwargs.pop('sparse', False))
if kwargs:
raise TypeError(
'meshgrid() got an unexpected keyword argument \'{}\''.format(
list(kwargs)[0]))
if indexing not in ['xy', 'ij']:
raise ValueError('Valid values for `indexing` are \'xy\' and \'ij\'.')
for x in xi:
if x.ndim != 1:
raise ValueError('input has to be 1d')
if not isinstance(x, cupy.ndarray):
raise ValueError('input has to be cupy.ndarray')
if len(xi) <= 1:
return list(xi)
meshes = []
for i, x in enumerate(xi):
if indexing == 'xy' and i == 0:
left_none = 1
elif indexing == 'xy' and i == 1:
left_none = 0
else:
left_none = i
expand_slices = ((None,) * left_none +
(slice(None),) +
(None,) * (len(xi) - (left_none + 1)))
meshes.append(x[expand_slices])
if sparse:
meshes_br = meshes
else:
meshes_br = list(cupy.broadcast_arrays(*meshes))
if copy:
for i in range(len(meshes_br)):
meshes_br[i] = meshes_br[i].copy()
return meshes_br
class nd_grid(object):
"""Construct a multi-dimensional "meshgrid".
``grid = nd_grid()`` creates an instance which will return a mesh-grid
when indexed. The dimension and number of the output arrays are equal
to the number of indexing dimensions. If the step length is not a
complex number, then the stop is not inclusive.
However, if the step length is a **complex number** (e.g. 5j), then the
integer part of its magnitude is interpreted as specifying the
number of points to create between the start and stop values, where
the stop value **is inclusive**.
If instantiated with an argument of ``sparse=True``, the mesh-grid is
open (or not fleshed out) so that only one-dimension of each returned
argument is greater than 1.
Args:
sparse (bool, optional): Whether the grid is sparse or not.
Default is False.
.. seealso:: :data:`numpy.mgrid` and :data:`numpy.ogrid`
"""
def __init__(self, sparse=False):
self.sparse = sparse
def __getitem__(self, key):
if isinstance(key, slice):
step = key.step
stop = key.stop
start = key.start
if start is None:
start = 0
if isinstance(step, complex):
step = abs(step)
length = int(step)
if step != 1:
step = (key.stop - start) / float(step - 1)
stop = key.stop + step
return cupy.arange(0, length, 1, float) * step + start
else:
return cupy.arange(start, stop, step)
size = []
typ = int
for k in range(len(key)):
step = key[k].step
start = key[k].start
if start is None:
start = 0
if step is None:
step = 1
if isinstance(step, complex):
size.append(int(abs(step)))
typ = float
else:
size.append(
int(math.ceil((key[k].stop - start) / (step * 1.0))))
if (isinstance(step, float) or
isinstance(start, float) or
isinstance(key[k].stop, float)):
typ = float
if self.sparse:
nn = [cupy.arange(_x, dtype=_t)
for _x, _t in zip(size, (typ,) * len(size))]
else:
nn = cupy.indices(size, typ)
for k in range(len(size)):
step = key[k].step
start = key[k].start
if start is None:
start = 0
if step is None:
step = 1
if isinstance(step, complex):
step = int(abs(step))
if step != 1:
step = (key[k].stop - start) / float(step - 1)
nn[k] = (nn[k] * step + start)
if self.sparse:
slobj = [cupy.newaxis] * len(size)
for k in range(len(size)):
slobj[k] = slice(None, None)
nn[k] = nn[k][slobj]
slobj[k] = cupy.newaxis
return nn
def __len__(self):
return 0
mgrid = nd_grid(sparse=False)
ogrid = nd_grid(sparse=True)
_arange_ufunc = core.create_ufunc(
'cupy_arange',
('bb->b', 'BB->B', 'hh->h', 'HH->H', 'ii->i', 'II->I', 'll->l', 'LL->L',
'qq->q', 'QQ->Q', 'ee->e', 'ff->f', 'dd->d',
('FF->F', 'out0 = in0 + float(i) * in1'),
('DD->D', 'out0 = in0 + double(i) * in1')),
'out0 = in0 + i * in1')
_linspace_ufunc = core.create_ufunc(
'cupy_linspace',
('dd->d',),
'out0 = in0 + i * in1')
_linspace_ufunc_underflow = core.create_ufunc(
'cupy_linspace',
('ddd->d',),
'out0 = in0 + i * in1 / in2')