Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re^2: Fast Identification Of String Difference

by neversaint (Deacon)
on Jan 18, 2011 at 00:59 UTC ( #882786=note: print w/replies, xml ) Need Help??

in reply to Re: Fast Identification Of String Difference
in thread Fast Identification Of String Difference

Dear BrowserUK,
Store in memory for further processing.

neversaint and everlastingly indebted.......
  • Comment on Re^2: Fast Identification Of String Difference

Replies are listed 'Best First'.
Re^3: Fast Identification Of String Difference
by BrowserUk (Pope) on Jan 18, 2011 at 05:47 UTC

    Could you give us more information about what processing you are going to do?

    For example:

    • Will you use each triplet of data (c1,c2,p) in isolation?
    • Or do you need all the triplets from a given pair of strings all together?
    • Or do you need the triplets from different pairs of strings together?

    The reason for these questions is that whether done in Perl or C allocating the memory in which to build the list of positions is a substantial part of the overall cost. If you only need each position in isolation, then an iterator interface might be more efficient to use.

    Equally, are the pairs of strings you are comparing the same length? Or are you comparing short strings with (every?) substring of a large strings? Are you comparing many short strings against (every) substring of larger strings?

    The problem is that the basic mechanics of comparing the characters in two string is very fast. Especially in C. But the details of the code that surrounds that can have a big impact on the overall application time.

    Rather than an extended to'n'fro of questions, it would be easier if you posted code or pseudo-code of the actual application, along with numbers and sizes of the strings involved.

    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority".
    In the absence of evidence, opinion is indistinguishable from prejudice.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://882786]
[thepkd]: Hi, in trying to create an Array of Hash of Array of Hash. You read it right. Is it possible to dereference it without using temps?
[GotToBTru]: what are temps?
[GotToBTru]: you can always have ${${${$array[0]}{ key1}}[1]}{key2}
[GotToBTru]: I think I have that inside out .. but you get the point

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (11)
As of 2016-12-06 13:14 GMT
Find Nodes?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:

    Results (104 votes). Check out past polls.