Timo Paulssen

Recent Actions

• Commented on Perl Weekly Challenge 25: Pokémon Sequence and Chaocipher
  Hi laurent, you can get the perl6 version of the pokemon calculator a good bit faster by getting rid of the grep for empty keys. the reason there ever are undefined values in the list is that getting %name-by-letter{$last-letter} when...
• Commented on My First Perl 6 Module: Net::SSH
  Speaking of your Editor, that should also help deal with pod in between things; just fold them away until you need to see the pod comments :)...
• Commented on My First Perl 6 Module: Net::SSH
  Hey Aaron, "unit class" (and "unit module" and such) just means you don't have to put { ... } around the rest of the file. The reason that IO::Handle and other things in the Core Setting are allowed to be...
• Commented on Concurrency and Channels in Perl 6
  Ohai! One change you could make is to use $stream.poll, which will simply return Nil if no item could be grabbed. In response to getting Nil, you can then check $stream.closed to decide whether to try again or terminate the...
• Commented on Reconsidering Exercise 1
  Do note that you can use @*ARGS instead of providing a sub MAIN; though the latter will give you a usage message when you don't supply the max and if you write sub MAIN( Int $max = 1000 ) instead,...

Comment Threads

• laurent_r commented on Perl Weekly Challenge 25: Pokémon Sequence and Chaocipher

  Hi Timo,
  for some reason, the correction you suggested wasn't successful. But your diagnosis was certainly right. I made a slightly different correction aimed at removing the grep, and the execution time was almost halved. You can see above the update I made to my post (with due credit to you). Thank you very much for your enlightening idea.
  Cheers, Laurent.
  

• Yet Ebreo commented on Perl Weekly Challenge 25: Pokémon Sequence and Chaocipher

  Hi Laurent,

  One of the optimization I made is to do it backwards.

  Generate list of names ending with a letter which is NOT a starting letter of any name in the whole pokemon name list. These will be the last name candidates

  The last name candidates can be further reduced by getting the name with most number of branching (its first char is same as last char of name in pokemon name list)

  This will result in fewer starting points, and will reduce recursions.

• laurent_r commented on Perl Weekly Challenge 25: Pokémon Sequence and Chaocipher

  Hi Yet,
  thank you very much for your input. I thought, when considering how to solve the task, about whether doing it backward would help, but could not see any benefit of doing so at the time. Right now, it is almost midnight here and I'm just coming back from a Paris Perl Mongers social meeting, meaning that I had some glasses of wine. Not the best situation to think clearly about your comments. I'll come back tomorrow evening and try to think more about your suggestions.
  Cheers, Laurent.
  

• laurent_r commented on Perl Weekly Challenge 25: Pokémon Sequence and Chaocipher

  Hi Yet,
  

  As an e…

• Yet Ebreo commented on Perl Weekly Challenge 25: Pokémon Sequence and Chaocipher

  Hi Laurent, You are right! Thanks for pointing out

  -Yet