nothing beats indices anyway. nth child computes distances from pt k in [a_n,b_n] to pts [k+1..N]. Figuring a_n, b_n is left as exercise
-
-
nth child computes distances d(X[k],X[t]) for a_n<k<b_n, k<t and returns their sum. No need for iterators, generators, etc...
-
so you mean do one pair at a time?
-
naively, yes, each child does one pair at each moment. there could be linear algebra based speedups for some d(,).
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.