Given the original @F(values are unique, and are probably sorted) return the indices of @F whose values fall within the supplied range.
UPDATE: Although I suppose all that would be required then is to use one of these search techniques (which?) and reverse map the values of @F to the indices. Does this added step give one of the techniques an advatage over the others?
--
I'm not belgian but I play one on TV.
In reply to UPDATE: mapping lists
by belg4mit
in thread mapping lists
by belg4mit
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |