processAll(tasks)
The tree starts as a single region covering the whole space. As points arrive, they get dropped into the region that contains them. When a region exceeds its capacity (the maximum number of points it can hold before splitting), the region divides into four children, and the existing points get redistributed.
，更多细节参见爱思助手下载最新版本
sum of weights += candidate.weight
（三）及时向公安机关、网信部门报告重大威胁情报和程序样本。