Re: Unbounded array

[Pawel Kobylarz <kobylarz@wbkst21.mach.uni-karlsruhe.de>]

Robert Dewar wrote:

> 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


Maybe my textbook is incomplete, maybe there was a misunderstanding
because
I gave wrong description of realloc function.

Using new and unchecked_deallocation, I can change the size of array
by allocating new array, copy the objects and deallocate the old one.
This is not efficient.

Realloc function takes two parameters, the actual pointer and new size,
and
it preserves the data already present in the memory block.
Realloc is more efficient than allocate-copy-deallocate,
because it can add a piece of memory without moving existing data
if there is place after the existing block.

In my textbook, I found only operators new and unchecked deallocation,
nothing similar to realloc(). Is there in ADA something like
realloc?

Pawel Kobylarz