I have just implemented the Thing + ThingF + Base instance variant of the tree. And guess what … this one is amazingly fast.
I was under the impression that this one would be the slowest of all variants. I really should have read my own post … the line where I write:
there is no trace of the TreeF structure to be found
Let the numbers speak for themselves, kdtreeu is the new variant. The results are not always as clear as for these cases, but in most cases they are at least as fast as the explicit recursion (kdtree in the benchmark).
