Re: ada is getting spanked :(

["Björn Persson" <spam-away@nowhere.nil>]

Georg Bauhaus wrote:
> The speed factor is now close to 18 :-). After some simplifications,
> and after (I think) more closely reflecting the benchmark description.

You're probably going to beat #3, because Gnat.Spitbol works with 
unbounded strings but Gnat.Regpat requires fixed strings.

> How could a notion of REs be both precise and precisely
> applicable to the ways in which various PLs implement them?
>  E.g. how can you turn off Boyer-Moore string searching when
> one implementation has it, just so that only some specified
> internal way of pattern matching is compared?

I wasn't talking of internal implementations. As I understand it, 
"regex" is a name of a family of similar notations for expressing 
patterns. If you don't write "[ABC]*" for "any number of A's, B's and 
C's in any order", then it isn't regex.

The requirement to use one particular pattern notation may of course be 
unintentional. Maybe the person who wrote the requirements didn't know 
that other notations existed.

> I did have a look at this program, however with program #3 as is
> I keep getting segmentation faults due to the
> 
>   Sequence_Lines (1 .. 1_000_000) of type Unbounded_String.
> 
> ulimit -s 10000 didn't help, reducing the number of lines did.

Now that you mention it, I remember having that problem too. I didn't 
change that part, and as it had obviously worked on the contest servers 
I figured it should keep working there. I suppose #2 falls below that 
limit on your box because it calculates how big the array needs to be.

-- 
Björn Persson                              PGP key A88682FD
                    omb jor ers @sv ge.
                    r o.b n.p son eri nu