In other words, the more tasks (n) are active, the longer it takes to schedule a task.
换而言之,活动的任务越多,调度任务所花费的时间越长。
If Repeats=n, only a single check would occur before deleting the task.
如果 Repeats=n,那么在删除该任务之前只会执行一次检查。
O(log n) behavior is measurably slower, but only marginally for very large task counts.
O(log n) 行为具有可测量的延迟,但是对于较大的任务数无关紧要。
应用推荐