[Home] [Groups] - Message: [Prev in Group] [Next in Group]

nu.kanga.list.mud-dev

20341: Re: [MUD-Dev] TECH DGN: Re: a few mud server design questions (long)

[Full Header] [Plain Text]
From: "Adam Martin" <ya_hoo_com@yahoo.com>
Newsgroups: nu.kanga.list.mud-dev
Date: Tue, 31 Jul 2001 13:46:09 +0100
References: [1] [2] [3] [4] [5] <-newest
Organization: Kanga.Nu
----- Original Message -----
From: "Caliban Tiresias Darklock" <caliban@darklock.com>
> On Mon, 30 Jul 2001 13:03:08 +0100, "Adam Martin"
> <ya_hoo_com@yahoo.com> wrote:

>> Perhaps use a red-black tree, with a pointer to the item which is
>> head of the queue.

> Wouldn't a heap be better for events, since it provides inherent
> priority processing?  

Indeed; I've been working purely in Java for the last couple of
projects, and just picked a suitable data structure that's part of
the Java standard libraries. A heap would be faster, but AFAICS they
both have the desired ( log(n) ) time complexity - a heap just has a
lower constant factor (and isn't in the standard libraries. Yet).

Adam M
_______________________________________________
MUD-Dev mailing list
MUD-Dev@kanga.nu
https://www.kanga.nu/lists/listinfo/mud-dev