[Home] [Groups] - Message: [Prev in Group] [Next in Group]
18964: Re: [MUD-Dev] Re: TECH: Distributed Muds
[Full Header] [Plain Text]
From: Brian Hook <bwh@wksoftware.com>
Newsgroups: nu.kanga.list.mud-dev
Date: Tue, 24 Apr 2001 00:51:13 -0700
References: [1]
Organization: Kanga.Nu
At 11:10 AM 4/21/01 -0600, Chris Gray wrote:
> That only happens if you have such large linked lists. I've seen
> discussion here in the last month or two about having global lists
> containing all of the objects in the world.
I hope I'm not insulting anyone by stating what may or may not be
obvious, but linear searches in linked lists are very, very bad. I
would assume that even a really badly designed implementation would
use a data structure far more amenable to searches like a binary tree
of some sort.
The only time I would think that a pure linear traversal would be
necessary is if you had to touch all items, e.g. for storage to disk.
Brian Hook
_______________________________________________
MUD-Dev mailing list
MUD-Dev@kanga.nu
https://www.kanga.nu/lists/listinfo/mud-dev