Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^4: Evolving a faster filter?

by Ovid (Cardinal)
on Jan 06, 2013 at 21:09 UTC ( #1011919=note: print w/replies, xml ) Need Help??


in reply to Re^3: Evolving a faster filter?
in thread Evolving a faster filter?

Unfortunately, that is correct. Trying to find the fastest ordering isn't deterministic. We need a "generally fastest" ordering and we'll have to understand how to handle worst-case scenarios when we have real-world data.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1011919]
help
Chatterbox?
[Corion]: Oh - I released a new version of some module, thanks to a pull request. But I don't consider "update Makefile.PL" and "update author tests" as "writing code" ;-D
[marto]: sounds fun, the opposite of my weekend :P
[Corion]: marto: You wrote Perl? Or did you have to work (and wrote Perl)?
[marto]: the fun part, I had no fun this weekend, very stressful :)
[Corion]: But I feel an introductory talk gestating, working title "Reading CPAN" - how to read module documentation, how to judge a module, how to read the module tests/examples
[Corion]: marto: Ouch :-/ The kids are making trouble?
[Corion]: Meh - food becons, and colleagues are staring at me, talk to you later, sorry!

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (7)
As of 2017-08-21 09:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Who is your favorite scientist and why?



























    Results (319 votes). Check out past polls.

    Notices?