forked from arrayfire/arrayfire-python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathalgorithm.py
More file actions
147 lines (124 loc) · 4.33 KB
/
algorithm.py
File metadata and controls
147 lines (124 loc) · 4.33 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
#######################################################
# Copyright (c) 2015, ArrayFire
# All rights reserved.
#
# This file is distributed under 3-clause BSD license.
# The complete license agreement can be obtained at:
# http://arrayfire.com/licenses/BSD-3-Clause
########################################################
from .library import *
from .array import *
def parallel_dim(a, dim, c_func):
out = array()
safe_call(c_func(ct.pointer(out.arr), a.arr, ct.c_int(dim)))
return out
def reduce_all(a, c_func):
real = ct.c_double(0)
imag = ct.c_double(0)
safe_call(c_func(ct.pointer(real), ct.pointer(imag), a.arr))
real = real.value
imag = imag.value
return real if imag == 0 else real + imag * 1j
def sum(a, dim=None):
if dim is not None:
return parallel_dim(a, dim, clib.af_sum)
else:
return reduce_all(a, clib.af_sum_all)
def product(a, dim=None):
if dim is not None:
return parallel_dim(a, dim, clib.af_product)
else:
return reduce_all(a, clib.af_product_all)
def min(a, dim=None):
if dim is not None:
return parallel_dim(a, dim, clib.af_min)
else:
return reduce_all(a, clib.af_min_all)
def max(a, dim=None):
if dim is not None:
return parallel_dim(a, dim, clib.af_max)
else:
return reduce_all(a, clib.af_max_all)
def all_true(a, dim=None):
if dim is not None:
return parallel_dim(a, dim, clib.af_all_true)
else:
return reduce_all(a, clib.af_all_true_all)
def any_true(a, dim=None):
if dim is not None:
return parallel_dim(a, dim, clib.af_any_true)
else:
return reduce_all(a, clib.af_any_true_all)
def count(a, dim=None):
if dim is not None:
return parallel_dim(a, dim, clib.af_count)
else:
return reduce_all(a, clib.af_count_all)
def imin(a, dim=None):
if dim is not None:
out = array()
idx = array()
safe_call(clib.af_imin(ct.pointer(out.arr), ct.pointer(idx.arr), a.arr, ct.c_int(dim)))
return out,idx
else:
real = ct.c_double(0)
imag = ct.c_double(0)
idx = ct.c_uint(0)
safe_call(clib.af_imin_all(ct.pointer(real), ct.pointer(imag), ct.pointer(idx), a.arr))
real = real.value
imag = imag.value
val = real if imag == 0 else real + imag * 1j
return val,idx.value
def imax(a, dim=None):
if dim is not None:
out = array()
idx = array()
safe_call(clib.af_imax(ct.pointer(out.arr), ct.pointer(idx.arr), a.arr, ct.c_int(dim)))
return out,idx
else:
real = ct.c_double(0)
imag = ct.c_double(0)
idx = ct.c_uint(0)
safe_call(clib.af_imax_all(ct.pointer(real), ct.pointer(imag), ct.pointer(idx), a.arr))
real = real.value
imag = imag.value
val = real if imag == 0 else real + imag * 1j
return val,idx.value
def accum(a, dim=0):
return parallel_dim(a, dim, clib.af_accum)
def where(a):
out = array()
safe_call(clib.af_where(ct.pointer(out.arr), a.arr))
return out
def diff1(a, dim=0):
return parallel_dim(a, dim, clib.af_diff1)
def diff2(a, dim=0):
return parallel_dim(a, dim, clib.af_diff2)
def sort(a, dim=0, is_ascending=True):
out = array()
safe_call(clib.af_sort(ct.pointer(out.arr), a.arr, ct.c_uint(dim), ct.c_bool(is_ascending)))
return out
def sort_index(a, dim=0, is_ascending=True):
out = array()
idx = array()
safe_call(clib.af_sort_index(ct.pointer(out.arr), ct.pointer(idx.arr), a.arr, \
ct.c_uint(dim), ct.c_bool(is_ascending)))
return out,idx
def sort_by_key(iv, ik, dim=0, is_ascending=True):
ov = array()
ok = array()
safe_call(clib.af_sort_by_key(ct.pointer(ov.arr), ct.pointer(ok.arr), \
iv.arr, ik.arr, ct.c_uint(dim), ct.c_bool(is_ascending)))
return ov,ok
def set_unique(a, is_sorted=False):
out = array()
safe_call(clib.af_set_unique(ct.pointer(out.arr), a.arr, ct.c_bool(is_sorted)))
return out
def set_union(a, b, is_unique=False):
out = array()
safe_call(clib.af_set_union(ct.pointer(out.arr), a.arr, b.arr, ct.c_bool(is_unique)))
return out
def set_intersect(a, b, is_unique=False):
out = array()
safe_call(clib.af_set_intersect(ct.pointer(out.arr), a.arr, b.arr, ct.c_bool(is_unique)))
return out