The sum_of_ranks_between function from Statistics::Data::Rank is very slow on large data sets.1 Is there a faster way to do the same thing, i.e. find the sum of ranks of a subset where ranking is across a pooled set? I don't need the other functions from that module (except new, of course), and need the sum_of_ranks_between function only in its sum_of_ranks_between(lab=>...) form.
1 I have two subsets, each with about a million data points.
In reply to Seeking a fast sum_of_ranks_between function by msh210
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |