Re: [Boston.pm] binary search on a list of sorted strings in memory

2009-07-10 Thread Steve Tolkin
Wow! Thanks Bernardo. The technique you proposed is the most eye-opening use of Perl I have seen in a long while. I woke in the middle of the night and searched through all my Perl books. None mention this: not Algorithms with Perl, or Advanced perl, or Object Oriented Perl. (I do not own the

[Boston.pm] Eclipse and Perl Debugging

2009-07-10 Thread Matt Luker
Howdy, As a follow up to the perl debugging session from last month, I wanted to let everyone know that the latest and greatest from EPIC now sees the breakpoints correctly. If you were there, you'll remember that setting breakpoints in modules didn't seem to work--the breakpoint only

Re: [Boston.pm] binary search on a list of sorted strings in memory

2009-07-10 Thread Bernardo Rechea
On Friday 10 July 2009 06:01:27 Steve Tolkin wrote: Wow! Thanks Bernardo. The technique you proposed is the most eye-opening use of Perl I have seen in a long while. I woke in the middle of the night and searched through all my Perl books. None mention this: not Algorithms with Perl, or

Re: [Boston.pm] binary search on a list of sorted strings in memory

2009-07-10 Thread Ronald J Kimball
On Thu, Jul 09, 2009 at 07:03:20PM -0400, Bernardo Rechea wrote: For reference, the brute force algorithm: Brute force T: foreach my $targetWord (@targetWords) { foreach my $searchWord (@searchWords) { if ($targetWord =~ /^$searchWord/) { push @foundWords,