A container implementing k-dimensional space sorting using a kd-tree. it:

- supports two- to six-dimensional spaces
- can store any data structure
- provides standard find as well as range queries
- has amortised o(lg n) time (o(n lg n) worst case) on most operations
(insert/erase/find optimised) and worst-case o(n) space
- provides means to rebalance and thus optimise the tree
this package contains the extension built for the python debug interpreter.