<div dir="ltr"><br><br><div class="gmail_quote">On Mon, Jul 28, 2008 at 2:27 PM, Marcin Tustin <span dir="ltr"><<a href="mailto:mm3@zepler.net">mm3@zepler.net</a>></span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<div dir="ltr">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? <br>
</div>
</blockquote></div><br><br>I believe it's called an OrderedCollection, and it's in every Smalltalk image you'll find(*).<br><br>I recommend reading through Chapter 9 of Squeak by Example (under "Documentation" on <a href="http://www.squeak.org/">http://www.squeak.org/</a>). It give a good explanation of Squeak collections and how to use them.<br>
<br>Gulik.<br clear="all"><br>(*) Perhaps except for Craig Latta's 1337-byte image.<br><br>-- <br><a href="http://people.squeakfoundation.org/person/mikevdg">http://people.squeakfoundation.org/person/mikevdg</a><br><a href="http://gulik.pbwiki.com/">http://gulik.pbwiki.com/</a><br>
</div>