Re: Fastcode CharPosRev B&V 0.6.0

Hi Dennis,

It's an allmost complete copy of john's...

just an change to the PChar --> PByteArray
p := @S[Result -11] --> p := Pointer(Cardinal(S) + (Result - 12));

and every P[x] --> P^[x]
and SearchChar --> Byte(SearchChar)

I would not call it innovative..

I was just trying to learn about how to get it both range checking good but
fast as john's...

:)

I'm trying something else with this idea which might be enough of mine
idea..

Regards,
Davy


.