[MUD-Dev] Event Scheduling

[Miroslav Silovic]

Hans-Henrik Staerfeldt <hhs at cbs.dtu.dk> writes:

> I once saw a lecture covering an eventqueue algorithm running O(log(log(n)))
> for insertions and O(1) for deletions. My guess would be that it is the
> implementation of the actual events that will take the time, even if you
> use a O(log(n)) time event queue, or are my notions wrong?

This sounds VERY interesting. Do you have any specific pointers?

--
How to eff the ineffable?



_______________________________________________
MUD-Dev maillist  -  MUD-Dev at kanga.nu
http://www.kanga.nu/lists/listinfo/mud-dev