You might be surprised how fast Perl can run. For something like R-Trees, I'd expect a sensible Perl implementation to be almost as fast as C.
In reply to Re: Perl R-Tree
by gamache
in thread Perl R-Tree
by punkish
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |