Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^6: Challenge: Fast Common Substrings

by BrowserUk (Pope)
on Apr 04, 2007 at 12:43 UTC ( #608264=note: print w/replies, xml ) Need Help??


in reply to Re^5: Challenge: Fast Common Substrings
in thread Challenge: Fast Common Substrings

I haven't even tried!

But you expect us to?

And then, how come the code in your original post has changed markedly, and without acknowledement, since I replied to it? As has the text of your previous post. You dissemble, Sir. You dissemble. Let that be an end to it.


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.
  • Comment on Re^6: Challenge: Fast Common Substrings

Replies are listed 'Best First'.
    A reply falls below the community's threshold of quality. You may see it by logging in.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (4)
As of 2018-11-17 23:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My code is most likely broken because:
















    Results (205 votes). Check out past polls.

    Notices?