[DGD] Is self nesting ALWAYS a bug?

[Noah Gibbs]

  I believe that "cache-hot roots" would be essentially "cached shared parent nodes", which could allow finding a common parent or many kinds of recursion quickly if it were done well.  I think he's trying to find a way to allow nesting without doing full expensive traversals on every "look" command.

--- On Sat, 3/21/09, Felix A. Croes <felix at dworkin.nl> wrote:

> From: Felix A. Croes <felix at dworkin.nl>
> Subject: Re: [DGD] Is self nesting ALWAYS a bug?
> To: dgd at dworkin.nl
> Date: Saturday, March 21, 2009, 6:01 AM
> Shentino <shentino at gmail.com> wrote:
> 
> > Me and someone else who I am choosing to keep
> anonymous at this time just
> > got into a huge debate of whether cyclic containment
> is ever a legitimate
> > circumstance.
> 
> I suppose the best way to determine that is decide how you
> deal with
> the problems, such as infinite recursion, and how you keep
> things
> straightforward for the ordinary mudlib programmer.
> 
> 
> >[...]
> > I'm thinking though that cache-hot roots would
> minimize a good part of the
> > overhead.
> 
> What are cache-hot roots?
> 
> Regards,
> Felix Croes
> ___________________________________________
> https://mail.dworkin.nl/mailman/listinfo/dgd