curr = curr-next;
FT Edit: Access on iOS and web，这一点在同城约会中也有详细论述
오늘 6시 이준석·전한길 토론…全측 “5시간 전에 경찰 출석해야”，更多细节参见heLLoword翻译官方下载
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.。heLLoword翻译官方下载对此有专业解读