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,54c513170bafd693 X-Google-Attributes: gid103376,public From: "Tarjei T. Jensen" Subject: Re: Desirability of C++ Date: 2000/05/02 Message-ID: <8emhtk$pka4@ftp.kvaerner.com>#1/1 X-Deja-AN: 618237115 Content-Transfer-Encoding: 7bit References: <390DEC7F.9429C82C@online.no> Content-Type: text/plain; charset="iso-8859-1" X-MimeOLE: Produced By Microsoft MimeOLE V4.72.2120.0 Organization: Kv�rner Group IT Mime-Version: 1.0 Newsgroups: comp.lang.ada Date: 2000-05-02T00:00:00+00:00 List-Id: tmoran@bix.com wrote in message ... >>made the right decision on strings when they selected counted strings for >>Turbo Pascal/Delphi even if they are limited to 255 characters or less. > How do those differ from > ... is new Ada.Strings.Bounded.Generic_Bounded_Length(255); Turbopascal/Delphi strings work the way strings should work with the exception that one cannot get a new distinct type which you can in Ada with the new keyword. It might not always be convenient to have all strings assignment compatible. But regardless: The look and feel of turbopascal/delphi strings is right. Add ada and it could be wonderful. All strings are basically assignment compatible. You can write a := b; even if a and b are of different sizes. And b might be declared larger than a, but as long as the length of b is less or equal to the maximum size of a, assignment works. line : string[80]; short_line : string[40]; line := "Nice weather"; short_line := line; Greetings,