...unless you have to call into Numpy or Python C-API frequently in a hot loop. That's bit of a bummer. I would rather write array indexing in Numpy notation than do that error-prone indexing by hand (in Cythonic C). I think there was something in the works to deal with this problem, not up do date on it.
>Instead of doing the actual work they would rather first implement their own sort function.
Strawman much. On the otherhand I regularly come across people who call library functions without understanding their runtime consequences, well those are the good ones, the bad ones 'get shit done" by calling sort just to find the maximum. Yeah they do get exactly that done, that is, shit.
... and unpython, spyke .... all very cool and with their own spin. What is a little worrisome is the rate at which these get abandoned and how many of them target some specific subset of Python. I particularly liked unpython's take.
I would be quite interested to see how Dask, Spark and Dato's(or Graphlab's) SFrames fare relative to each other. My hunch is none dominates the other totally in performance and that each would have their sweet spot. Are there any well done, executed_in_good_faith benchmarks available.