librangetree is a C++ template, implementing a 2D range tree for both counting and reporting queries. It is just about the fastest way to do 2D searches.
Release Notes: This release removes the limit on not being able to create trees with only a single point.
Release Notes: This release adds a memory pool for ptys. It has 0-17% speedup in creation and 0-10% speedup in searches. This drops RAM usage by about 4%.
Release Notes: This release optimizes the RAM use on 64-bit platforms, improving it by 37%. Since it may have a detrimental effect on reporting search speed, this optimization can be disabled if desired.
Release Notes: This release improves the use of negative values. It removes heap allocation from searches, with an improvement of 0-12% in search speed. There are documentation updates.
Release Notes: First public release.