View Issue Details
|ID||Project||Category||View Status||Date Submitted||Last Update|
|0000064||LDMud 3.5||Implementation||public||2004-05-30 16:31||2009-11-06 05:57|
|Summary||0000064: Improve array implementation.|
|Description||The current array implementation requires that with every change in length a new value block is allocated and initialized.|
It would be advantageous to allow value blocks larger than required, and pre-alllocate them before they are used (e.g. double the allocated size whenever an extension is required).
In an even better version (which probably would require C++), multiple non-continguous blocks could be used to store the values.
|Tags||No tags attached.|
Short:Efficient vector implementation
Use HATs (DDJ July 2001) for vector modifications,
essentially implementing 'dirty' and 'condensed' vectors.
The vector could be combined: the normal fixed length in one block,
plus the extensions as HAT. Very short arrays could be fully stored in the
vector control block, to save space.
not related to HAT and arrays: