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 interpreter.