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,1116ece181be1aea X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-09-25 17:05:11 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!cyclone.bc.net!sjc70.webusenet.com!news.webusenet.com!elnk-nf2-pas!newsfeed.earthlink.net!stamper.news.pas.earthlink.net!stamper.news.atl.earthlink.net!newsread2.news.atl.earthlink.net.POSTED!not-for-mail Sender: mheaney@MHEANEYX200 Newsgroups: comp.lang.ada Subject: Re: Is the Writing on the Wall for Ada? References: From: Matthew Heaney Message-ID: User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.3 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Fri, 26 Sep 2003 00:05:11 GMT NNTP-Posting-Host: 65.110.133.134 X-Complaints-To: abuse@earthlink.net X-Trace: newsread2.news.atl.earthlink.net 1064534711 65.110.133.134 (Thu, 25 Sep 2003 20:05:11 EDT) NNTP-Posting-Date: Thu, 25 Sep 2003 20:05:11 EDT Organization: EarthLink Inc. -- http://www.EarthLink.net Xref: archiver1.google.com comp.lang.ada:42948 Date: 2003-09-26T00:05:11+00:00 List-Id: Jan Kroken writes: > 4. Dynamic strings > > Dynamic strings, with proper library support. It's quite possible it's > in there, but it's not coincidence that the example Ada programs I've > read all seems to impose random limits, like line lengths of input > files limited to 80 characters and such. Well, you have Ada.Strings.Unbounded. The Charles library also has a vector-like container for type String. I'm not sure what limit you're talking about. There's no limit to the length of input lines. You can either use a loop to read the entire line into an unbounded string, or use a recursive algorithm to read the entire line.