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=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,4c86cf2332cbe682 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 1995-01-17 21:01:44 PST Path: nntp.gmd.de!Germany.EU.net!howland.reston.ans.net!news.cac.psu.edu!news.pop.psu.edu!hudson.lm.com!godot.cc.duq.edu!news.duke.edu!zombie.ncsc.mil!admii!cmcl2!thecourier.cims.nyu.edu!thecourier.cims.nyu.edu!nobody From: dewar@cs.nyu.edu (Robert Dewar) Newsgroups: comp.lang.ada Subject: Re: Ada.strings.bounded problems? Date: 18 Jan 1995 00:01:44 -0500 Organization: Courant Institute of Mathematical Sciences Message-ID: <3fi7bo$3hf@gnat.cs.nyu.edu> References: NNTP-Posting-Host: gnat.cs.nyu.edu Date: 1995-01-18T00:01:44-05:00 List-Id: Mars worries whether the use of unbounded strings is incompatible with programs that run for ever. Not at all, or more accurately, no more or less incomaptible than any use of the heap. You have to make sure that you don't have memory leaks in your implementation, and that you have sufficient heap memory to avoid fragmentatino problems, but other than that ...