query_numpy.py 文件源码

def join(l1, l2): # join two sorted list
#   n1 = len(l1)
#   n2 = len(l2)
#   #l1.sort()
#   #l2.sort()
#   p1 = 0
#   p2 = 0
#   ret = []
#   while p1 < n1 and p2 < n2:
#       if l1[p1] < l2[p2]:
#           p1 += 1
#       elif l1[p1] > l2[p2]:
#           p2 += 1
#       else:
#           ret.append(l1[p1])
#           p1 += 1
#           p2 += 1
    return np.intersect1d(l1, l2)