Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change

Re: Fast Identification Of String Difference

by Marshall (Prior)
on Jan 17, 2011 at 17:13 UTC ( #882704=note: print w/ replies, xml ) Need Help??

in reply to Fast Identification Of String Difference

I looked for a Perl module that would do this with 'C' XS code and couldn't find one. I found one module with the right functionality, but alas it was pure Perl and not very fast. That surprised me because I've seen similar buffer comparison questions before.

The 'C' code in a C program for something like this would be very fast. I haven't written an XS module myself yet and I don't know how efficient the transfer of information is between Perl and C. The hard part isn't the C code, it is how to interface it with Perl.

As far as assembly language goes, for comparing byte buffers together, in Intel x86 assembly, there is a single machine instruction that can do this. That would be as fast as it could be done.

If anybody writes an XS module to do this, I would like to see it and would like to help with it if desired.

Comment on Re: Fast Identification Of String Difference

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://882704]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (3)
As of 2015-11-29 07:05 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (748 votes), past polls