这里有一个numba给我们一个NumPy布尔数组作为输出 –
from numba import njit
@njit
def numba_app1(idx,n,s,out):
for i,j in zip(idx[:-1],idx[1:]):
s0 = s[i:j]
c = 0
for p1 in s0[c:]:
for p2 in s0[c+1:]:
out[p1,p2] = 1
out[p2,p1] = 1
c += 1
return out
def app1(A):
s = A.argsort()
b = A[s]
n = len(A)
idx = np.flatnonzero(np.r_[True,b[1:] != b[:-1],True])
out = np.zeros((n,n),dtype=bool)
numba_app1(idx,out)
out.ravel()[::out.shape[1]+1] = 1
return out
计时 –
In [287]: np.random.seed(0)
...: n = 30000
...: A = np.random.randint(0,n)
# Original soln
In [288]: %timeit A == A[np.newaxis].T
1 loop,best of 3: 317 ms per loop
# @Daniel F's soln-1 that skips assigning lower diagonal in output
In [289]: %timeit sparse_outer_eq(A)
1 loop,best of 3: 450 ms per loop
# @Daniel F's soln-2 (complete one)
In [291]: %timeit sparse_outer_eq(A)
1 loop,best of 3: 634 ms per loop
# Solution from this post
In [292]: %timeit app1(A)
10 loops,best of 3: 66.9 ms per loop