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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,7e15102eb14c0020
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.180.73.134 with SMTP id l6mr2537634wiv.1.1349175802939;
        Tue, 02 Oct 2012 04:03:22 -0700 (PDT)
Path: 
 q11ni128807406wiw.1!nntp.google.com!proxad.net!feeder1-2.proxad.net!weretis.net!feeder4.news.weretis.net!eternal-september.org!feeder.eternal-september.org!mx04.eternal-september.org!.POSTED!not-for-mail
From: Brian Drummond <brian@shapes.demon.co.uk>
Newsgroups: comp.lang.ada
Subject: Re: highest bit, statically determined
Date: Tue, 2 Oct 2012 11:03:22 +0000 (UTC)
Organization: A noiseless patient Spider
Message-ID: <k4ehlq$51p$1@dont-email.me>
References: <50673111$0$9505$9b4e6d93@newsspool1.arcor-online.net>
	<38594cbf-b52d-4002-8db9-410f55126a09@googlegroups.com>
	<50694f43$0$6577$9b4e6d93@newsspool3.arcor-online.net>
	<036db9eb-36e8-4a2e-8832-cecd9f1f4e2d@googlegroups.com>
	<506a0b6f$0$9525$9b4e6d93@newsspool1.arcor-online.net>
Mime-Version: 1.0
Injection-Date: Tue, 2 Oct 2012 11:03:22 +0000 (UTC)
Injection-Info: mx04.eternal-september.org;
 posting-host="0e44dd4a3c4e0a6e83a86f947fb780ae";
	logging-data="5177"; mail-complaints-to="abuse@eternal-september.org";
	posting-account="U2FsdGVkX19dSM0fsVUP+n6RUkHL22JQkuIbp0UvPjU="
User-Agent: Pan/0.135 (Tomorrow I'll Wake Up and Scald Myself with Tea; GIT
	30dc37b master)
Cancel-Lock: sha1:4upuT5Skn1jDi/QE9N5SXx2bWF4=
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Date: 2012-10-02T11:03:22+00:00
List-Id: <comp.lang.ada>

On Mon, 01 Oct 2012 23:30:24 +0200, Georg Bauhaus wrote:

> On 01.10.12 10:52, Anatoly Chernyshev wrote:
>> (0|1=>0,2|3=>1,4..7=>2, 8..15=>3, 16..31=>4,32..63=>5, 64..127=>6,
>> 128..255=>7);
> 
>     68580000 2.653934000 68580000 2.021029000 68580000 27.702262000
>     68580000 1.173348000   -- first_1_bit_table
> 
> I guess the approaches can be used together for larger N-tets.

Just for completeness,

function first_bit_case(N:Octet) return natural is 
begin 
   case N is
      when 0       => return 0;
      when 1       => return 1;
      when 2..3    => return 2;
      when 4..7    => return 3;
      when 8..15   => return 4;
      when 16..31  => return 5;
      when 32..63  => return 6;
      when 64..127 => return 7;
      when others  => return 8;
   end case;
end first_bit_case;

Here (on an Atom netbook) it measures about the same as the equivalent if 
chain; faster than the recursive versions but slower than the table.

         --Z := Z + first_1_bit_ifchain(Data(i)); -- real 0m3.208s
         --Z := Z + first_bit_table(Data(i));	-- real	0m1.971s
         --Z := Z + first_1_bit(Data(i));	-- real	0m4.672s
         --Z := Z + First_1_Bit_A(Data(i));	-- real	0m3.937s
         Z := Z + first_bit_case(Data(i));	-- real	0m3.272s

The Ada-2012 case expression was no faster.

- Brian