一个小而有效的程序来执行的K -近邻搜索算法，此算法利用JIT 理论加速循环，比向量化有效解决了大量数据的精度问题。甚至比kd-tree效果要佳-A small and effective procedures to implement the K- nearest neighbor search algorithm, this algorithm uses JIT acceleration cycle theory, than to solve a lot of data to quantify the accuracy of the problem. Even more than the kd-tree effect has to be good