self.conn.commit()
For security reasons this page cannot be displayed.
。关于这个话题，爱思助手下载最新版本提供了深入分析
tasks = append(tasks, t)
Notice how the highlighted region shrinks at each step. The algorithm never examines points outside the narrowing window. In a balanced tree with nnn points, this takes about log4(n)\log_4(n)log4(n) steps. For a million points, that's roughly 10 steps instead of a million comparisons.