I am asking because it does not appear to me that it should be very slow (unless I missed a very time-consuming step in the algorithm description). It could be that the module is doing a number of things not really necessary in your specific case and that rolling out your own sub or set of subs might be faster, or that it could be optimized some other way. But is "very slow" is a few seconds or many hours? In the latter case (assuming I have understood what needs to be done), I am convinced it could be faster. A few seconds, I would not even try to defeat the module in terms or performance. In between, well, then, it is is your and our draw. Please give a better estimate of the time frame.
Of course, any further action would require a representative dataset (perhaps significantly smaller, but sufficient for benchmarking.
@ BrowserUK: thanks for asking, I thought about more or less the same things, but somehow did not dare to ask.
In reply to Re^3: Seeking a fast sum_of_ranks_between function
by Laurent_R
in thread Seeking a fast sum_of_ranks_between function
by msh210
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |