From: "Robert C. Leif, Ph.D." <rleif@rleif.com>
To: <comp.lang.ada@ada.eu.org>
Subject: RE: FIXED vs BOUNDED strings in Ada 95
Date: 2000/01/19
Date: 2000-01-20T06:01:59+00:00 [thread overview]
Message-ID: <NBBBJNOMKDIAJALCEFIJIELHDHAA.rleif@rleif.com> (raw)
In-Reply-To: 20000119161944.5261.qmail@web207.mail.yahoo.com
From: Robert C. Leif, Ph.D.
To: MaryAnn Atkinson et al.
Fixed strings contain a constant number of characters; the length of the
string. Bounded strings contain a maximum number of characters. The actual
number of characters is also available as a function. Thus a
Line_Bounded_String could contain from 0 to 80 characters. Bounded strings
are a very efficient and useful construct.
-----Original Message-----
From: MaryAnn Atkinson [mailto:maryann_30@yahoo.com]
Sent: Wednesday, January 19, 2000 8:20 AM
To: comp.lang.ada@ada.eu.org
Subject: FIXED vs BOUNDED strings in Ada 95
Could someone please provide a paragraph or two
explaining the difference between
fixed and bounded strings?
... so far it seems like Ada's use of
strings(all of them), is quite awkward.
Oracle's PL/SQl which is structured after Ada,
provided a much easier and way more functional way.
MAA
__________________________________________________
Do You Yahoo!?
Talk to your friends online with Yahoo! Messenger.
http://im.yahoo.com
next prev parent reply other threads:[~2000-01-19 0:00 UTC|newest]
Thread overview: 3+ messages / expand[flat|nested] mbox.gz Atom feed top
2000-01-19 0:00 FIXED vs BOUNDED strings in Ada 95 MaryAnn Atkinson
2000-01-19 0:00 ` Robert C. Leif, Ph.D. [this message]
2000-01-21 0:00 ` Ted Dennison
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox