> We were discussing that squeak lacks some base data structures like
> hash tables or balancing trees... not useful that often, but needed
> for algorithmic code and difficult to write properly.

There are special collection implementations available on
SqueakSource. The following BTree implementation is especially useful
in the context of OODBs:

    http://www.squeaksource.com/BTree.html

Lukas

-- 
Lukas Renggli
http://www.lukas-renggli.ch