const readable = getWebReadableStreamSomehow();
63.1%101/160 picks
，更多细节参见同城约会
类似：从一堆牌中每次挑出最小的放左边，这一点在safew官方下载中也有详细论述
The algorithm also visits children in order of distance to the query point. This means it checks the most promising quadrants first, which tends to find a good candidate early and enables aggressive pruning of the remaining quadrants. Without this ordering, the algorithm would still produce the correct result, but it would prune fewer nodes.，详情可参考Line官方版本下载