"thinkingMigrationComplete": true,
This is the same idea behind binary search. In a sorted array, you compare against the middle element and eliminate half the remaining candidates. In a quadtree, you choose one of four quadrants and ignore the other three regions. Each level narrows the search space by a factor of four instead of two.
，推荐阅读safew官方版本下载获取更多信息
https://feedx.site
https://feedx.net