From: Stephen Leake <stephen_leake@acm.org>
To: comp.lang.ada@ada-france.org
Subject: Re: Endian-Independent Rep Clauses
Date: 27 Jan 2004 03:14:09 -0500
Date: 2004-01-27T03:14:09-05:00 [thread overview]
Message-ID: <mailman.34.1075191258.2270.comp.lang.ada@ada-france.org> (raw)
In-Reply-To: <%_kRb.28888$zj7.11003@newsread1.news.pas.earthlink.net>
Jeffrey Carter <spam@spam.com> writes:
> Stephen Leake wrote:
> > Here's a real-life example:
> > package SAL.Endianness is
> > Bit_Order : constant := 1; -- 1 or -1
> > High_Bit_First : constant := 0; -- 0 or 1
> > Low_Bit_First : constant := 1; -- opposite of High_Bit_First
>
> Derive these from System.Default_Bit_Order.
Someday I'll do that :).
> I generally like to predefine a collection of useful bit numbers as
> well.
Hmm. In the systems I've built, I haven't noticed that any one bit
number occurs more often than another; are you saying you have?
Can you post a real example of your style of rep clause? That might
help me understand your approach better.
--
-- Stephe
prev parent reply other threads:[~2004-01-27 8:14 UTC|newest]
Thread overview: 9+ messages / expand[flat|nested] mbox.gz Atom feed top
2004-01-26 13:30 Standard Ada Preprocessor Lionel.DRAGHI
2004-01-26 16:10 ` Robert I. Eachus
2004-01-26 19:20 ` Endian-Independent Rep Clauses (was: Standard Ada Preprocessor) Jeffrey Carter
2004-01-27 1:03 ` Endian-Independent Rep Clauses Robert I. Eachus
2004-01-27 2:01 ` Stephen Leake
2004-01-27 3:16 ` Robert I. Eachus
2004-01-27 8:10 ` Stephen Leake
2004-01-27 3:34 ` Jeffrey Carter
2004-01-27 8:14 ` Stephen Leake [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox