Mini intro: new to J; only been looking at it for two days now. Very impressed so far. I do finance/machine learning/numerics nerdery and need to stash my larger TS in a proper column DB. As such, JDB is what landed me here (I'm hoping it solves my TSDB problems), but I found a lot more than I expected to keep me here. You guys have done an amazing job with the IDE, core libs, and website/demos/etc, and the language is heady stuff which might make me forget about Lisp.
My question: does anybody have a bit of sample code for kd-trees (or R* trees) and tree-searcher I could peep at? This is something I use everywhere for instance learning (nearest neighbor type things), among other things. I don't know enough about J to write one just yet, but I figure a sample of something I am familiar with will help me learn. Also provide a good benchmark for how fast the language is (I can do very fast searches using libANN in C++). thanks for any help, -Scott ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
