David L . Nicol <[EMAIL PROTECTED]> writes:
>No, because each table lookup takes less time than comparing one
>letter of a text string.

Er, I don't think so. 

A lookup takes serveral cycles on a RISC machine 
due to memory latency even to the cache. A pipelined string compare takes
less than a cycle per char.

Also what has comparing got to do with SvPVX ?

>
>>     sv->vtable->svpvx;
>> 
>> Isn't this going to really, really hurt?
-- 
Nick Ing-Simmons

Reply via email to