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,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: Matthew Heaney Subject: Re: Beginner's questions Date: 1999/05/03 Message-ID: #1/1 X-Deja-AN: 473433064 References: <372da49c.12366381@news.rwth-aachen.de> <372D3B9A.5CBA1ABC@frqnet.de> NNTP-Posting-Date: Mon, 03 May 1999 01:01:12 PDT Newsgroups: comp.lang.ada Date: 1999-05-03T00:00:00+00:00 List-Id: Andreas Winckler writes: > For programmers used to Pascal the strings in Ada can be really > irritating, at least it was for me. I usually use unbounded strings > which are comparable to the strings in Pascal. A discriminated record is closer to the Pascal approach. I don't recommend using a heap-based solution (type Unbounded_String) unless you have a compelling need to. Jean-Pierre Rosen has written a nice variable-length string package: (start of excerpt from documentation) What package Variable_Length does This package provides a simple "variable length string" type. It is useful when you just want to store strings whose maximum length is known beforehand. It provides operations that are consistent with those defined in the Bounded_String and Unbounded_String packages. (end of excerpt from documentation) You can get it from the Adalog web page: