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'.
Re^7: Challenge: Fast Common Substrings
by Moron (Curate) on Apr 04, 2007 at 12:48 UTC
    It will change again believe me! Why? You imply you already know why - Filed under "troll"!! Oh, never mind then.

    -M

    Free your mind

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://608264]
help
Chatterbox?
[Corion]: Oh yay. The (external, not guided by me) programmers have chosen Moose+DBIx::Class for some implementation, and now seem to do 1+n SELECT statements for each row, as is usual when using ORMs.
[Corion]: So maybe I should investigate how to plug in a cache in front of DBIx::Class so I can do a ->selectall_hashre f and then satisfy the "sub"-selects from that cached single SELECT statement ...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (7)
As of 2017-09-25 10:59 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    During the recent solar eclipse, I:









    Results (279 votes). Check out past polls.

    Notices?