http://qs321.pair.com?node_id=736368


in reply to Re^4: Finding Combinations of Pairs
in thread Finding Combinations of Pairs

In the context of a discussion about providing obfuscated and inefficient answers that look reasonable, I assumed that that post was a well-executed joke.

Replies are listed 'Best First'.
Re^6: Finding Combinations of Pairs
by Limbic~Region (Chancellor) on Jan 14, 2009 at 21:26 UTC
    tilly,
    My funny bone is often broke. In spoken conversation I have learned to pick up on many social cues when to not take something literally but it is an effort and I commonly get it wrong. Written communication is so much worse. Thanks for the pointer.

    Cheers - L~R

[reply]
      No worries, LR. ;)

      The key issue that I was pround of - on the efficiency stakes - was that it checked for *all* possible combinations of keywords - even those which did not exist on the same line ever. And that it went through the entire file again for every keyword-pair, i.e. processed the entire file keyword-factorial times. Now that's what I call thorough.

      The sand/and thing is a genuine, unintended bug though. :)

      All the best, andy.

      (BTW, 'NB see parent node' was intended as a nod/wink - perhaps kinda unclear though).

[reply]

In Section Seekers of Perl Wisdom