The algorithm walks the tree recursively. At each node, it checks: does this node's bounding box overlap with the query rectangle? If not, the entire subtree gets pruned (skipped). If it does overlap, it tests the node's points against the query and recurses into the children.
Asus ProArt P16 laptop (32GB RAM, 2TB SSD, AMD Ryzen AI 9 HX 370, RTX 5070)
，详情可参考WPS官方版本下载
（六）罢工、停工或者劳动受到限制；
for (const chunk of chunks) {