comp.lang.ada
 help / color / mirror / Atom feed
From: bill@valiant.gmrc.gecm.com (R.A.L Williams)
Subject: An observation of Ada (may offend)
Date: 27 Mar 1995 10:28:28 GMT
Date: 1995-03-27T10:28:28+00:00	[thread overview]
Message-ID: <3l640c$308@miranda.gmrc.gecm.com> (raw)

In article <1995Mar17.180137.9394@eisner> Larry Kilgallen wrote:
: In article <3kbkm1$41o@miranda.gmrc.gecm.com>, bill@valiant.gmrc.gecm.com (R.A.L Williams) writes:

: > b. No bit level manipulation (fixed in Ada95 but only for unsigned
: > ie. mod INTEGERs, I can't test a sign bit, not that I need to) HCTBAEL.

: Well some of us don't have Ada95 scheduled for our platforms...
: ...but I find that when I need to manipulate bits it is specific bit
: fields rather than generic bit-algebras :-).  Representation clauses
: in Ada are marvelous (although I have used similar capabilities from
: other languages which don't happen to be codified in their standards).

I agree that the representation clauses defined in the LRM are splendid,
the problem is that they are *optional*. I don't know what the situation
is now, but when I last did a lot of work in Ada many compilers had only
a fragmentary coverage. 

Most of the time, as you say, bit fields are adequate, but how would you
implement ECC alogorithms or maximal length sequence generators for instance?
So far as standards are concerned, I believe that bit fields are codified
in the ANSI C standard, and every ANSI C compiler I've used actually does
implement them.

: > e. No short cut operators (+= etc.) -- sorry, we've had this debate
: > already in another thread, I've heard the objections, I still like the
: > operators.

: I disagree, perhaps for a reason which has not been stated.  The 26 letters
: and the space bar are about all that I can touch-type.  Entering any
: punctuation requires looking at the keyboard, so I prefer long-cut
: operators.

Well, OK, but

  variable := variable + offset;

is 9 characters (not counting spaces for readability) longer than

  variable += offset;

I would also submit that, at least when the l-value gets more complex,
ie. array/structure dereference etc., that the short cut version is more
readable. For a simple statement like the example above there's no real
difference in readability. For my money, readability is the prime
criterion. I work on jobs where code inspection is often the most
cost-effective method of reducing test and integration costs. There is
also a benefit in long term maintenance.

: Larry Kilgallen

Bill Williams
bill.williams@gec-mrc.co.uk



             reply	other threads:[~1995-03-27 10:28 UTC|newest]

Thread overview: 63+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
1995-03-27 10:28 R.A.L Williams [this message]
1995-03-27  0:00 ` An observation of Ada (may offend) Norman H. Cohen
1995-04-04  0:00   ` Robert Dewar
1995-03-28 17:07 ` Larry Kilgallen, LJK Software
  -- strict thread matches above, loose matches on Subject: below --
1995-03-30  0:00 R.A.L Williams
1995-04-03  0:00 ` Norman H. Cohen
1995-03-29  0:00 R.A.L Williams
1995-03-27 10:38 R.A.L Williams
1995-03-30  3:14 ` Michael D. Griffin
1995-03-30  0:00   ` David Weller
1995-04-04  0:00   ` Brian Rogoff
1995-04-04  0:00   ` Jack Beidler
1995-03-17  9:27 R.A.L Williams
1995-03-17 15:23 ` Robb Nebbe
1995-03-17 17:08 ` Norman H. Cohen
1995-03-20  3:23   ` S. Tucker Taft
1995-03-20 10:13   ` Robb Nebbe
1995-03-21 21:05     ` Robert Dewar
1995-03-20 16:15   ` Robert I. Eachus
1995-03-21 19:47     ` Norman H. Cohen
1995-03-22  1:28       ` David Weller
1995-03-23  5:47       ` Robert Dewar
1995-03-23 16:38         ` Robert I. Eachus
1995-03-24 10:46           ` Peter Hermann
1995-03-24 16:52             ` David Weller
1995-03-26  4:03               ` Robert Dewar
1995-03-24 21:33             ` Tucker Taft
1995-03-27 18:58             ` Mark A Biggar
1995-03-24 19:45           ` Garlington KE
1995-03-27 19:58             ` Robert I. Eachus
1995-03-28 16:29               ` Garlington KE
1995-03-28 19:30                 ` Robert I. Eachus
1995-03-28 22:37                   ` Garlington KE
1995-03-29  8:31                   ` Robb Nebbe
1995-03-25 17:58           ` Robert Dewar
1995-03-26  6:20             ` R_Tim_Coslet
1995-03-27 20:38               ` Robert I. Eachus
1995-03-26  3:50           ` celier
     [not found]           ` <3l1lkq$pm6@gnat.csn <3l2o9a$3a1@infomatch.com>
1995-03-27 23:16             ` Robert Dewar
1995-03-23 18:05       ` John DiCamillo
1995-03-17 23:01 ` Larry Kilgallen, LJK Software
1995-03-18 12:41 ` Tucker Taft
1995-03-22 16:50 ` Renaud HEBERT
1995-03-23 23:23   ` John Volan
1995-03-24  0:38   ` Robert Dewar
1995-03-12 23:39 Matt Bruce
1995-03-13  0:34 ` David Weller
1995-03-14  4:49 ` Vladimir Vukicevic
1995-03-17 17:00   ` Michael Feldman
1995-03-17 13:09     ` Fred J. McCall
1995-03-18 20:34       ` Michael Feldman
1995-03-19 22:20         ` Robert Dewar
1995-03-20 17:19           ` Michael Feldman
1995-03-21 21:02             ` Robert Dewar
1995-03-21 23:01             ` Kevin F. Quinn
1995-03-22 12:43             ` Mike Meier
1995-03-20 20:38           ` Kevin F. Quinn
1995-03-21  3:02         ` Michael M. Bishop
1995-03-20  9:31       ` Robb Nebbe
1995-03-20 20:16       ` Mats Weber
1995-03-22 19:44       ` Stephen McNeill
1995-03-28 14:48       ` Wes Groleau
1995-03-22 17:20     ` Richard G. Hash
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox