TEAM-ADA Archives

Team Ada: Ada Programming Language Advocacy

TEAM-ADA@LISTSERV.ACM.ORG

Options: Use Classic View

Use Monospaced Font
Show HTML Part by Default
Condense Mail Headers

Topic: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Sender: "Team Ada: Ada Advocacy Issues (83 & 95)" <[log in to unmask]>
From: Colin Brown <[log in to unmask]>
Date: Sat, 23 Dec 2000 17:46:41 +0800
Content-Type: multipart/alternative; boundary="----=_NextPart_000_001D_01C06D08.4F0D1FC0"
MIME-Version: 1.0
Reply-To: Colin Brown <[log in to unmask]>
Parts/Attachments: text/plain (989 bytes) , text/html (1615 bytes)
I guess you could try a dynamic structure (eg list).
depending on what you want.


----- Original Message -----
From: "Jesse Farmer" <[log in to unmask]>
To: <[log in to unmask]>
Sent: Saturday, December 23, 2000 8:59 AM
Subject: Setting sizes of Unconstrained Arrays


> Hi again..
> First, thanks to everyone who helped me with my question regarding
sorting.
>
> I'm wondering how to set the size of an unconstrained array.  Basically,
> what I'd like to be able to do, is have an array that grows as I need it
> to.  If this isn't possible, I'm wondering if there is any way to modify
> the size of an array during run-time?  I really don't want to just make a
> large array, and use that, and hope that all my data will always fit into
> this array.
>
> I've tried using unconstrained arrays, and I just can't figure them
> out.  What good is it being unconstrained if you have to initialize it
> before you can use it?  I'm sure I'm missing something here, I'd be very
> grateful if someone could clue me in.
>
> Thanks for your time
> -Jesse Farmer
>






ATOM RSS1 RSS2