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.
近年来，社区不断完善公共服务，建设了同心小广场、文体活动室等。元宵节包汤圆、端午节裹粽子、中秋节做月饼，居民共度佳节；排练厅里，时常听到悠扬的笛声、浑厚的鼓声、婉转的琴声……邻里同心聚力，日子越过越红火。，更多细节参见新收录的资料
Ok, but you still don’t want to have to change your API to add this，推荐阅读新收录的资料获取更多信息
Spoiler warning: This article reveals details from upcoming episodes of Hollyoaks.，详情可参考新收录的资料
FirstFT: the day's biggest stories