The only way caching seems to make sense to me is if the list of $target(s) can contain duplicates. I can think of some other scenarios but they are highly dependent on details we don't have.
For instance, if $target will only ever be integers we could fill a hash with the integers between numbers in @test with a value of the @test index (N.5 since $target is missing). Then we need only lookup up $target in our hash, get the index and return a slice with $size elements on either side. The entire hash could be built all at once up front or it could be built "as you go" which would be a win if the list of $target(s) were clustered.
The trouble is that this is all highly speculative. More information and cleare explanation is required for a decent solution in my opinion.
Cheers - L~R
In reply to Re^2: getting elements from an array based on a value not in the array
by Limbic~Region
in thread getting elements from an array based on a value not in the array
by ginni
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |