python双循环是什么_加速python代码 – 我可以向量化双循环吗？

import numpy as np

def dist(p1, p2):

# Initially, p1.shape() == (n, 2) and p2.shape() == (m, 2)

# Now, p1.shape() == (1, n, 2) and p2.shape() == (m, 1, 2)

p1 = p1[np.newaxis, :, :]

p2 = p2[:, np.newaxis, :]

# get all the vectory things

from numpy import sin, cos, radians, sqrt, arctan2 as atan2

# do the same math as before, but use `p[..., 0]` instead of `p.x` etc

dlat = radians(p2[..., 0] - p1[..., 0])

dlon = radians(p2[..., 1] - p1[..., 1])

a = sin(dlat/2) * sin(dlat/2) + cos(p1[..., 0])*cos(p2[..., 0]) * sin(dlon/2) * sin(dlon/2)

c = 2 * atan2(sqrt(a), sqrt(1-a))

d = 6371 * c

return d

def distanceQuery(neighbor_pts):

return np.max(dist(neighbor_pts, neighbor_pts))

例如：

>>> points = np.array([[0, 0], [45, 0], [45, 45], [90, 0]], dtype=float)

>>> dist(points, points)

array([[ 0. , 5003.77169901, 6272.52596983, 10007.54339801],

[ 5003.77169901, 0. , 2579.12525679, 5003.77169901],

[ 6272.52596983, 2579.12525679, 0. , 4347.69702221],

[ 10007.54339801, 5003.77169901, 4347.69702221, 0. ]])

>>> np.max(_)

10007.543398010286

定时：

def dist_slow(p1, p2):

"""your function, adjusted to take an array instead of a `Point`"""

from math import radians, cos, sqrt, atan2

# compute the distance for all possible pairs

dlat = radians(p2[0]-p1[0])

dlon = radians(p2[1]-p1[1])

a = sin(dlat/2) * sin(dlat/2) + cos(radians(p1[0]))*cos(radians(p2[0])) * sin(dlon/2) * sin(dlon/2)

c = 2 * atan2(sqrt(a), sqrt(1-a))

d = 6371 * c

return d

def query_iter(p):

return max(dist_slow(p1, p2) for p1, p2 in itertools.combinations(p, 2))

def query_orig(p):

dista=[]

for i in range(len(p)):

for j in range(i + 1, len(p)):

z = dist_slow(p[i], p[j])

dista.append(z)

return max(dista)

def query_mine(p):

return dist(p, p).max()

然后：

>>> points = np.random.rand(1000, 2)

>>> timeit query_orig(points)

1 loops, best of 3: 7.94 s per loop

>>> timeit query_iter(points)

1 loops, best of 3: 7.35 s per loop

>>> timeit query_mine(points)

10 loops, best of 3: 150 ms per loop