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.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,71c743c03ed191fe X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-09-19 21:49:30 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!arclight.uoregon.edu!wn4feed!worldnet.att.net!bgtnsc04-news.ops.worldnet.att.net.POSTED!not-for-mail Message-ID: <3D8AA89E.9030000@worldnet.att.net> From: Jim Rogers User-Agent: Mozilla/5.0 (Windows; U; Win98; en-US; rv:0.9.4) Gecko/20011128 Netscape6/6.2.1 X-Accept-Language: en-us MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Beginer problem: variable array size References: <38993b18.0209191906.b56b982@posting.google.com> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Date: Fri, 20 Sep 2002 04:49:29 GMT NNTP-Posting-Host: 12.86.36.52 X-Complaints-To: abuse@worldnet.att.net X-Trace: bgtnsc04-news.ops.worldnet.att.net 1032497369 12.86.36.52 (Fri, 20 Sep 2002 04:49:29 GMT) NNTP-Posting-Date: Fri, 20 Sep 2002 04:49:29 GMT Organization: AT&T Worldnet Xref: archiver1.google.com comp.lang.ada:29201 Date: 2002-09-20T04:49:29+00:00 List-Id: Munch wrote: > > The one thing i haven't looked into is to see if there is a string > tokenizer (is that what its called/) built in. basically read the > numbers in and appened them to the end of an unbound string ( i know i > saw that somewhere). Then parse it looking for spaces and converting > the characters to their int form making the array then and copying > them over. Again seems like I'm going From new york to new jersey but > i've got a lay over in los angeles....*sigh* > Yes, Ada does have a built in tokenizer. It can be found in the package Ada.Strings.Fixed. For what you want, simply read your values into an unbounded string, convert that string to a fixed length string, then traverse that string using the indexing and tokenizing subprograms. Jim Rogers