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

Re^7: Finding Combinations of Pairs

by andye (Curate)
on Jan 14, 2009 at 23:04 UTC ( #736405=note: print w/ replies, xml ) Need Help??

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

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).

Comment on Re^7: Finding Combinations of Pairs

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (8)
As of 2015-12-01 06:07 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (794 votes), past polls