16
16
17
17
def _parallel_dim (a , dim , c_func ):
18
18
out = Array ()
19
- safe_call (c_func (ct . pointer (out .arr ), a .arr , ct . c_int (dim )))
19
+ safe_call (c_func (c_pointer (out .arr ), a .arr , c_int_t (dim )))
20
20
return out
21
21
22
22
def _reduce_all (a , c_func ):
23
- real = ct . c_double (0 )
24
- imag = ct . c_double (0 )
23
+ real = c_double_t (0 )
24
+ imag = c_double_t (0 )
25
25
26
- safe_call (c_func (ct . pointer (real ), ct . pointer (imag ), a .arr ))
26
+ safe_call (c_func (c_pointer (real ), c_pointer (imag ), a .arr ))
27
27
28
28
real = real .value
29
29
imag = imag .value
30
30
return real if imag == 0 else real + imag * 1j
31
31
32
32
def _nan_parallel_dim (a , dim , c_func , nan_val ):
33
33
out = Array ()
34
- safe_call (c_func (ct . pointer (out .arr ), a .arr , ct . c_int (dim ), ct . c_double (nan_val )))
34
+ safe_call (c_func (c_pointer (out .arr ), a .arr , c_int_t (dim ), c_double_t (nan_val )))
35
35
return out
36
36
37
37
def _nan_reduce_all (a , c_func , nan_val ):
38
- real = ct . c_double (0 )
39
- imag = ct . c_double (0 )
38
+ real = c_double_t (0 )
39
+ imag = c_double_t (0 )
40
40
41
- safe_call (c_func (ct . pointer (real ), ct . pointer (imag ), a .arr , ct . c_double (nan_val )))
41
+ safe_call (c_func (c_pointer (real ), c_pointer (imag ), a .arr , c_double_t (nan_val )))
42
42
43
43
real = real .value
44
44
imag = imag .value
@@ -235,13 +235,13 @@ def imin(a, dim=None):
235
235
if dim is not None :
236
236
out = Array ()
237
237
idx = Array ()
238
- safe_call (backend .get ().af_imin (ct . pointer (out .arr ), ct . pointer (idx .arr ), a .arr , ct . c_int (dim )))
238
+ safe_call (backend .get ().af_imin (c_pointer (out .arr ), c_pointer (idx .arr ), a .arr , c_int_t (dim )))
239
239
return out ,idx
240
240
else :
241
- real = ct . c_double (0 )
242
- imag = ct . c_double (0 )
243
- idx = ct . c_uint (0 )
244
- safe_call (backend .get ().af_imin_all (ct . pointer (real ), ct . pointer (imag ), ct . pointer (idx ), a .arr ))
241
+ real = c_double_t (0 )
242
+ imag = c_double_t (0 )
243
+ idx = c_uint_t (0 )
244
+ safe_call (backend .get ().af_imin_all (c_pointer (real ), c_pointer (imag ), c_pointer (idx ), a .arr ))
245
245
real = real .value
246
246
imag = imag .value
247
247
val = real if imag == 0 else real + imag * 1j
@@ -268,13 +268,13 @@ def imax(a, dim=None):
268
268
if dim is not None :
269
269
out = Array ()
270
270
idx = Array ()
271
- safe_call (backend .get ().af_imax (ct . pointer (out .arr ), ct . pointer (idx .arr ), a .arr , ct . c_int (dim )))
271
+ safe_call (backend .get ().af_imax (c_pointer (out .arr ), c_pointer (idx .arr ), a .arr , c_int_t (dim )))
272
272
return out ,idx
273
273
else :
274
- real = ct . c_double (0 )
275
- imag = ct . c_double (0 )
276
- idx = ct . c_uint (0 )
277
- safe_call (backend .get ().af_imax_all (ct . pointer (real ), ct . pointer (imag ), ct . pointer (idx ), a .arr ))
274
+ real = c_double_t (0 )
275
+ imag = c_double_t (0 )
276
+ idx = c_uint_t (0 )
277
+ safe_call (backend .get ().af_imax_all (c_pointer (real ), c_pointer (imag ), c_pointer (idx ), a .arr ))
278
278
real = real .value
279
279
imag = imag .value
280
280
val = real if imag == 0 else real + imag * 1j
@@ -327,7 +327,7 @@ def scan(a, dim=0, op=BINARYOP.ADD, inclusive_scan=True):
327
327
- will contain scan of input.
328
328
"""
329
329
out = Array ()
330
- safe_call (backend .get ().af_scan (ct . pointer (out .arr ), a .arr , dim , op .value , inclusive_scan ))
330
+ safe_call (backend .get ().af_scan (c_pointer (out .arr ), a .arr , dim , op .value , inclusive_scan ))
331
331
return out
332
332
333
333
def scan_by_key (key , a , dim = 0 , op = BINARYOP .ADD , inclusive_scan = True ):
@@ -361,7 +361,7 @@ def scan_by_key(key, a, dim=0, op=BINARYOP.ADD, inclusive_scan=True):
361
361
- will contain scan of input.
362
362
"""
363
363
out = Array ()
364
- safe_call (backend .get ().af_scan_by_key (ct . pointer (out .arr ), key .arr , a .arr , dim , op .value , inclusive_scan ))
364
+ safe_call (backend .get ().af_scan_by_key (c_pointer (out .arr ), key .arr , a .arr , dim , op .value , inclusive_scan ))
365
365
return out
366
366
367
367
def where (a ):
@@ -379,7 +379,7 @@ def where(a):
379
379
Linear indices for non zero elements.
380
380
"""
381
381
out = Array ()
382
- safe_call (backend .get ().af_where (ct . pointer (out .arr ), a .arr ))
382
+ safe_call (backend .get ().af_where (c_pointer (out .arr ), a .arr ))
383
383
return out
384
384
385
385
def diff1 (a , dim = 0 ):
@@ -441,7 +441,7 @@ def sort(a, dim=0, is_ascending=True):
441
441
Currently `dim` is only supported for 0.
442
442
"""
443
443
out = Array ()
444
- safe_call (backend .get ().af_sort (ct . pointer (out .arr ), a .arr , ct . c_uint (dim ), ct . c_bool (is_ascending )))
444
+ safe_call (backend .get ().af_sort (c_pointer (out .arr ), a .arr , c_uint_t (dim ), c_bool_t (is_ascending )))
445
445
return out
446
446
447
447
def sort_index (a , dim = 0 , is_ascending = True ):
@@ -469,8 +469,8 @@ def sort_index(a, dim=0, is_ascending=True):
469
469
"""
470
470
out = Array ()
471
471
idx = Array ()
472
- safe_call (backend .get ().af_sort_index (ct . pointer (out .arr ), ct . pointer (idx .arr ), a .arr ,
473
- ct . c_uint (dim ), ct . c_bool (is_ascending )))
472
+ safe_call (backend .get ().af_sort_index (c_pointer (out .arr ), c_pointer (idx .arr ), a .arr ,
473
+ c_uint_t (dim ), c_bool_t (is_ascending )))
474
474
return out ,idx
475
475
476
476
def sort_by_key (iv , ik , dim = 0 , is_ascending = True ):
@@ -500,8 +500,8 @@ def sort_by_key(iv, ik, dim=0, is_ascending=True):
500
500
"""
501
501
ov = Array ()
502
502
ok = Array ()
503
- safe_call (backend .get ().af_sort_by_key (ct . pointer (ov .arr ), ct . pointer (ok .arr ),
504
- iv .arr , ik .arr , ct . c_uint (dim ), ct . c_bool (is_ascending )))
503
+ safe_call (backend .get ().af_sort_by_key (c_pointer (ov .arr ), c_pointer (ok .arr ),
504
+ iv .arr , ik .arr , c_uint_t (dim ), c_bool_t (is_ascending )))
505
505
return ov ,ok
506
506
507
507
def set_unique (a , is_sorted = False ):
@@ -521,7 +521,7 @@ def set_unique(a, is_sorted=False):
521
521
an array containing the unique values from `a`
522
522
"""
523
523
out = Array ()
524
- safe_call (backend .get ().af_set_unique (ct . pointer (out .arr ), a .arr , ct . c_bool (is_sorted )))
524
+ safe_call (backend .get ().af_set_unique (c_pointer (out .arr ), a .arr , c_bool_t (is_sorted )))
525
525
return out
526
526
527
527
def set_union (a , b , is_unique = False ):
@@ -543,7 +543,7 @@ def set_union(a, b, is_unique=False):
543
543
an array values after performing the union of `a` and `b`.
544
544
"""
545
545
out = Array ()
546
- safe_call (backend .get ().af_set_union (ct . pointer (out .arr ), a .arr , b .arr , ct . c_bool (is_unique )))
546
+ safe_call (backend .get ().af_set_union (c_pointer (out .arr ), a .arr , b .arr , c_bool_t (is_unique )))
547
547
return out
548
548
549
549
def set_intersect (a , b , is_unique = False ):
@@ -565,5 +565,5 @@ def set_intersect(a, b, is_unique=False):
565
565
an array values after performing the intersect of `a` and `b`.
566
566
"""
567
567
out = Array ()
568
- safe_call (backend .get ().af_set_intersect (ct . pointer (out .arr ), a .arr , b .arr , ct . c_bool (is_unique )))
568
+ safe_call (backend .get ().af_set_intersect (c_pointer (out .arr ), a .arr , b .arr , c_bool_t (is_unique )))
569
569
return out
0 commit comments