View Issue Details

IDProjectCategoryView StatusLast Update
0000064LDMud 3.5Implementationpublic2009-11-06 05:57
ReporterlarsAssigned To 
Status newResolutionopen 
Summary0000064: Improve array implementation.
DescriptionThe 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.
TagsNo tags attached.



2004-11-27 00:04

reporter   ~0000218

Short:Efficient vector implementation
From: Lars
Date: 2001-06-15
Type: Idea

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.


2009-11-06 05:57

administrator   ~0001613

Some links:

not related to HAT and arrays:

Issue History

Date Modified Username Field Change
2004-05-30 16:31 lars New Issue
2004-11-27 00:04 lars Note Added: 0000218
2009-01-08 06:57 zesstra Project LDMud 3.3 => LDMud 3.5
2009-11-06 05:57 zesstra Note Added: 0001613