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.3 required=5.0 tests=BAYES_00,FREEMAIL_FROM, INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,ccb8bd6b4c3162fd X-Google-Attributes: gid103376,public From: "Nick Roberts" Subject: Re: Beginner's questions Date: 1999/05/04 Message-ID: <373248e7@eeyore.callnetuk.com>#1/1 X-Deja-AN: 474988975 References: <372da49c.12366381@news.rwth-aachen.de> <7gmhc3$saq$1@nnrp1.dejanews.com> X-Original-NNTP-Posting-Host: da129d169.dialup.callnetuk.com X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 X-Complaints-To: newsabuse@remarq.com X-Trace: 926042256 02H499TBW8004D443C uk25.supernews.com Organization: RemarQ http://www.remarQ.com Newsgroups: comp.lang.ada Date: 1999-05-04T00:00:00+00:00 List-Id: To add the Ada 95 spin on czgrr's post, the package Ada.Strings.Bounded provides the functionality proposed. This package is not usually implemented using dynamic allocation (the heap). If using the heap is a worry, and you can get away with the wasted space associated with the 'padding' at the end of your strings, this package may be the solution you require. I continue the question the fashion (for that's what I believe it is) for Ada implementations not to support garbage collection. For the vast majority of string-related applications, the 'inefficiency' of dynamic allocation---even with a garbage collector, provided it's a half-decent one---is not a problem. ------------------------------------- Nick Roberts -------------------------------------