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.
const [forHash, forStorage] = response.body.tee();
，推荐阅读同城约会获取更多信息
arr[j + gap] = arr[j];
title = extract_text(soup.select_one("title"))