(t *Timer)
| 25 | } |
| 26 | |
| 27 | func addTimerLocked(t *Timer) { |
| 28 | t.i = len(timers) |
| 29 | timers = append(timers, t) |
| 30 | siftupTimer(t.i) |
| 31 | |
| 32 | // Reschedule if this is the next timer in the heap. |
| 33 | if t.i == 0 { |
| 34 | reschedule() |
| 35 | } |
| 36 | } |
| 37 | |
| 38 | // Delete timer t from the heap. |
| 39 | // It returns true if t was removed, false if t wasn't even there. |
no test coverage detected
searching dependent graphs…