[fpc-devel] TTimers and TThreads. Attn Michael Schnell

[Hans-Peter Diettrich]

Giuliano Colla schrieb:

> If you're using relative times and not absolute ones, then you may avoid 
> the search, without need to resort, using a slightly different scheme, 
> i.e. entering in a sorted list the times *relatives to the previous one*.

Then your queue can run out of sync with the absolute time.

I don't see an advantage with using relative times, or unsorted lists.
On insertion a binary search over the list can be made, when the entries
are sorted by absolute time. Removal of entries occurs always from the
list head.

DoDi