[Home] [Groups] - Message: [Prev in Group] [Next in Group]
12394: Re: [MUD-Dev] Event Scheduling
[Full Header] [Plain Text]
From: Miroslav Silovic <silovic@zesoi.fer.hr>
Newsgroups: nu.kanga.list.mud-dev
Date: 08 Feb 2000 18:13:06 +0100
References: [1]
Organization: Kanga.Nu
Hans-Henrik Staerfeldt <hhs@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@kanga.nu
http://www.kanga.nu/lists/listinfo/mud-dev