From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=0.2 required=5.0 tests=BAYES_00,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,5a9bede4d09438a9,start
X-Google-Attributes: gid103376,public
From: Pawel Kobylarz <kobylarz@wbkst21.mach.uni-karlsruhe.de>
Subject: Unbounded array
Date: 1999/04/26
Message-ID: <37247AA2.116F5E00@wbkst21.mach.uni-karlsruhe.de>#1/1
X-Deja-AN: 471056362
Content-Transfer-Encoding: 7bit
Content-Type: text/plain; charset=us-ascii
X-Complaints-To: usenet@rz.uni-karlsruhe.de
X-Trace: news.rz.uni-karlsruhe.de 925137570 19572 129.13.175.21
Organization: University of Karlsruhe
Mime-Version: 1.0
Reply-To: kobylarz@wbkst21.mach.uni-karlsruhe.de
Newsgroups: comp.lang.ada
Date: 1999-04-26T00:00:00+00:00
List-Id: <comp.lang.ada>

I need a data structure that can contain varying amount of items and
provide fast access
through Index.


List has too long access, map is I think too complicated for just a
range of indexes.
I have not found just unbounded array, so maybe it is even too easy to
mention anywhere
or write a special package for it.


In C language, I can declare an array...

      item_type *item_array;

... allocate it in program...

      item_array = alloc(item_size * amount);

... and later change its size:

      item_array = realloc(item_size * new_amount);


Is there in ADA a way to obtain something like unbouned array?

Pawel Kobylarz