Re: Not good for Ada endorsement

[Anh Vo <anhvofrcaus@gmail.com>]

On Thursday, July 15, 2021 at 9:29:52 AM UTC-7, Anh Vo wrote:
> On Thursday, July 15, 2021 at 8:56:40 AM UTC-7, Jeffrey R. Carter wrote: 
> > On 7/15/21 5:13 PM, Lucretia wrote: 
> > > 
> > > I managed to get just under 4000 passes with a 1 bit array, but not using Ada's packed array. That's actually the slowest method, strangely. 
> > So you have an array of a modular type, calculate an index and bit within it, 
> > mask out that bit, and compare it to zero? I would have thought an unpacked 
> > array of Boolean would be fastest. 
> > 
> > A packed array of Boolean requires all the operations above, plus shifting the 
> > bit to the LSB and treating the result as a Boolean, so it may not be that 
> > surprising that it's slower.
> Should fixed lower bound index array (-gnatX) speed it up? 

Indeed, it does. As posted on Reddit Ada, I got 5476 Passes after changing array types to arrays having fixed lower bound index of 0 on lines 9 and 10 and compiling it using switch -gnatX -02. By the way, I used GNAT Studio 2021 running on Windows 10.