Re: MOO into C

• Date: Wed, 24 Jul 1996 09:02:40 PDT
• From:
  Pavel Curtis <pavel@parc.xerox.com>
• Cc: MOO-Cows <moo-cows@parc.xerox.com>
• In-reply-to: "Adams, Charles"'s message of "Wed, 24 Jul 1996 07:37:00 PDT" <31F63579@msgate.litc.lockheed.com>

Charles Adams writes:
> foo = {@foo, bar}
> 
> in order to append something to a list has to deep copy the entire list 
> structure into a new list with the new element appended.

This isn't true.  It doesn't do a deep copy; it does a shallow one, only
copying the the list backbone and not any of the elements.  There are a number
of data structure tricks that could be used to make this faster, but they all
involve complexifying (or at least modifying) every piece of code in the server
that examines lists, since all that code "knows" how lists are currently
represented.

	Pavel

• MOO into C
• From: "Adams, Charles" <cadams@msgate.litc.lockheed.com>

• Prev: Re: MOO into C
• Next: Re: MOO into C
• Index: MOO-cows
• Thread: MOO-cows