Re: Finding out minimal allocation unit

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On Tue, 3 Apr 2007 14:43:50 +0200, Stefan Bellon wrote:

> In a few places we are using long lists of items. Those items mostly
> consist of just a pointer or a record of two pointers. We need cheap
> insertions and deletions of elements in those lists, therefore we
> indeed used linked lists and no array solution.

If size is an issue, you can also use indices instead of access types.
Provided that all items have same size. Then you split your list of records
into lists of fields.

type Index is mod ...;

type Item_List is array (Index) of Item;
pragma Pack (Item_List);

type Previous is array (Index) of Index; 
pragma Pack (Previous);

type Next is array (Index) of Index; 
pragma Pack (Next);

First_Free  : Index := ...;
   -- The list of free items (empty)
First_In : Index := ...;
   -- The list (empty)
Non_Yet_Visited : Index := ...;
   -- To avoid initialization of the list of free items

You can avoid memory allocation in advance if you segment the arrays above
and split Index into (Segment_No, In_Segment) pair.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de