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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,5a9bede4d09438a9
X-Google-Attributes: gid103376,public
From: Robert Dewar <robert_dewar@my-dejanews.com>
Subject: Re: Unbounded array
Date: 1999/04/26
Message-ID: <7g23a9$k3k$1@nnrp1.dejanews.com>#1/1
X-Deja-AN: 471072264
References: <37247AA2.116F5E00@wbkst21.mach.uni-karlsruhe.de>
X-Http-Proxy: 1.0 x6.dejanews.com:80 (Squid/1.1.22) for client 205.232.38.14
Organization: Deja News - The Leader in Internet Discussion
X-Article-Creation-Date: Mon Apr 26 16:13:02 1999 GMT
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.04 [en] (OS/2; I)
Date: 1999-04-26T00:00:00+00:00
List-Id: <comp.lang.ada>

In article
<37247AA2.116F5E00@wbkst21.mach.uni-karlsruhe.de>,
  kobylarz@wbkst21.mach.uni-karlsruhe.de wrote:
> Is there in ADA a way to obtain something like unbouned
> array?


Well most certainly you can use EXACTLY the same procedure
you use in C (lookup allocators and the NEW keyword in your
Ada text book).

But if you are using GNAT, also look up GNAT.Table (in file
g-table.ads) which provides exactly the abstraction you are
looking for.

-----------== Posted via Deja News, The Discussion Network ==----------
http://www.dejanews.com/       Search, Read, Discuss, or Start Your Own