Hi Toby,
On 4/24/07, Toby Hutton [EMAIL PROTECTED] wrote:
Hi,
I'm trying to implement a fast kd-tree in Haskell.
http://en.wikipedia.org/wiki/Kd-tree It's a binary tree
representing space partitions.
Trees are pretty easy to implement in haskell, due to their inherent
recursive nature. For
Hi,
Toby Hutton wrote:
Say I want to put the words 'foo', 'bar' and 'baz' into a binary tree. The
heuristic requires I split the words into letters and sort them:
'aabbfoorz'. The heuristic then may decide, based on the sorted letters,
that 'bar' and 'foo' should go in the left child and
