Re: [Pharo-project] Collection
Levente wrote:
Trees are rarely useful in Smalltalk, so there's no default tree implementation. Note that trees consume a lot more memory (>=5x) than a single array. Huh? You mean binary trees? Or Red-Black or so? On current procesors they are not very useful, and not usable at all for large data structures because of the large overhead. But n-ary trees or two-level stuctures are.
Stephan
On Sat, 13 Mar 2010, Stephan Eggermont wrote:
Levente wrote:
Trees are rarely useful in Smalltalk, so there's no default tree implementation. Note that trees consume a lot more memory (>=5x) than a single array. Huh? You mean binary trees? Or Red-Black or so?
The simplest unbalanced binary tree.
On current procesors they are not very useful, and not usable at all for large data structures because of the large overhead. But n-ary trees or two-level stuctures are.
If this is what you're looking for, just load the BTree package from squeaksource, or use SparseLargeTable. Levente
Stephan
_______________________________________________ Pharo-project mailing list Pharo-project@lists.gforge.inria.fr http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project
participants (2)
-
Levente Uzonyi -
Stephan Eggermont