Smalltalk and Object Orientation: an Introduction - Free

Array
OrderedCollection
SortedCollection
Dictionary
Like an array in Pascal, has a fixed size (which can be grown)
and accessed by explicit position references.
A bit like a linked list in Pascal or C. Elements are added to
specific locations specified either as first, last or relative to
another object.
A collection whose order is determined by a sort block. This
block is a piece of code which returns true or false depending
upon the test performed.
Rather like a hash table. Objects are stored with a key and
accessed by a key. Dictionaries are therefore a set of key -> value
associations
Elements in collections are in general accessed by the at: and added by the at:put: or add:
messages. It is possible to iterate over the elements of a collection using the do: construct.
290