Surgeon James Hewes has noticed a rise in patients with gallstones
const stack = []; // 单调栈：存储「右侧候选更大值」，栈内元素单调递增
，更多细节参见safew官方版本下载
paddingCache [200]string
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.
Что думаешь? Оцени!