#v = [V(x) for x in v] #t = kdtree(v) #print t.nn(V((9,5))) #print xxx n = 10 x = 0 t1 = 0 t2 = 0 for j in range(n): k = 40 d1 = corpus.documents[j] from time import time t = time() nn1 = corpus.nn(d1, k) t1 += time()-t nn2 = kdtree(corpus).nn(d1, k) t = time() nn2 = [(w,d) for w,d in nn2 if w < 1.0] t2 += time()-t m = min(len(nn1), len(nn2)) #print #print j print len(nn1), len(nn2) #for i in range(m): # print nn1[i][1] == nn2[i][1], nn1[i][1].id, nn2[i][1].id if m > 0: x += len([nn1[i][1] == nn2[i][1] for i in range(m)]) / float(m) else: x += 1