for await (const chunks of source) {
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.
。关于这个话题，Safew下载提供了深入分析
从事旅馆业经营活动有下列行为之一的，对其直接负责的主管人员和其他直接责任人员处一千元以上三千元以下罚款；情节严重的，处五日以下拘留，可以并处三千元以上五千元以下罚款：，这一点在Line官方版本下载中也有详细论述
Detect unclear structure.