foreach my $itemIndex (1 .. $items->Count) { my ($body) = $items->Item($itemIndex)->Body =~ /MessageBody>(.*)<\ +/Mess/s; if ($body !~ /\S/) { die "Some appropriate error on index $itemIndex."; } CACHE_CHECK: foreach my $cachedItem (@cache) { my $compare = $cachedItem->[0]; my $len = length($body) > $length($compare) ? length($body) : +length($compare); if (distance($body, $compare) / $len < $threshold) { @toBeMoved[$itemIndex, $cachedItem->[1]] = (1, 1); last CACHE_CHECK; } } }
The primary differences here are:
The second item is the major speed-up. You might not agree with it. If not, then get rid of the last. My thought was that your operation is transitive, or if A & B work and B & C work, then A & C will work. If that's not the case, then change it.
------
We are the carpenters and bricklayers of the Information Age.
The idea is a little like C++ templates, except not quite so brain-meltingly complicated. -- TheDamian, Exegesis 6
... strings and arrays will suffice. As they are easily available as native data types in any sane language, ... - blokhead, speaking on evolutionary algorithms
Please remember that I'm crufty and crochety. All opinions are purely mine and all code is untested, unless otherwise specified.
In reply to Re: Quicker Array Searching
by dragonchild
in thread Quicker Array Searching
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |