Heap based mutable arrays?

Sean Hinde <>
Wed May 2 12:50:51 CEST 2001


> > I bypass the garbage collection problem by forcing a 
> fullsweep collection
> > as soon as any vector is updated. /.../

How about bypassing the garbage collector by copying the data into the array
a la ets and using some sort of occasional tidyup routine to fix any
fragmentation you get?

In the case where you are storing the same sized element into the array each
time the overhead would be directly proportional to the size of the data
stored with no need to ever tidy up.

The vector version does look to be ultimately much better I agree - assuming
the GC can be fixed up without breaking the overall performance. Maybe there
is space for both?

Sean




NOTICE AND DISCLAIMER:
This email (including attachments) is confidential.  If you have received
this email in error please notify the sender immediately and delete this
email from your system without copying or disseminating it or placing any
reliance upon its contents.  We cannot accept liability for any breaches of
confidence arising through use of email.  Any opinions expressed in this
email (including attachments) are those of the author and do not necessarily
reflect our opinions.  We will not accept responsibility for any commitments
made by our employees outside the scope of our business.  We do not warrant
the accuracy or completeness of such information.





More information about the erlang-questions mailing list