Heap based mutable arrays?
Wed May 2 15:35:42 CEST 2001
> I bypass the garbage collection problem by forcing a fullsweep collection
> as soon as any vector is updated. /.../
> My time measurements were somewhat of a disappointment. You'll get a
> noticeable performance improvement if you use vectos with many
> elements (typically more than several hundred elements) compared to
> using a tuple of the same size, but for many algorithm data
> structures using lists and/or tuples are faster than vectors.
I'm impressed that you see any improvement at all ... the copying
work in a full sweep sounds much larger than copying a single tuple,
even if the tuple is large.
Anyway, good work and here's to a write barrier in subsequent
Thomas Lindgren thomas+junk@REDACTED
More information about the erlang-questions