[Newbies] Linked list structure?
mm3 at zepler.net
Mon Jul 28 03:11:16 UTC 2008
Technically, that would have amortised constant time adds, but yes, that's
good enough for me.
On Sun, Jul 27, 2008 at 10:57 PM, Michael van der Gulik
<mikevdg at gmail.com>wrote:
> On Mon, Jul 28, 2008 at 2:27 PM, Marcin Tustin <mm3 at zepler.net> wrote:
>> Is there - either as standard, or freely downloadable - a datastructure
>> that is ordered, has constant-time appends of items, requires no particular
>> protocol of the items stored, and can be iterated over (without allocating a
>> new structure) starting with the first item added, proceeding to the next
>> item added? I.e. has the characteristics of a linked list structure in most
>> other datastructure libraries?
> I believe it's called an OrderedCollection, and it's in every Smalltalk
> image you'll find(*).
> I recommend reading through Chapter 9 of Squeak by Example (under
> "Documentation" on http://www.squeak.org/). It give a good explanation of
> Squeak collections and how to use them.
> (*) Perhaps except for Craig Latta's 1337-byte image.
> Beginners mailing list
> Beginners at lists.squeakfoundation.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Beginners