RangeTree 2.0.1

A generic implementation of a centered interval tree in C#.
In computer science, an interval tree is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene.

Install-Package RangeTree -Version 2.0.1
dotnet add package RangeTree --version 2.0.1
<PackageReference Include="RangeTree" Version="2.0.1" />
For projects that support PackageReference, copy this XML node into the project file to reference the package.
paket add RangeTree --version 2.0.1
The NuGet Team does not provide support for this client. Please contact its maintainers for support.

Release Notes

Major overhaul by Erik Domke to a nice and cleaner interface.
Support for async version has been dropped and Rebuild / AutoRebuild functionality is now only internal (there was no reason for making it accessible from the outside anyway).
For a full list changes at https://github.com/mbuchetics/RangeTree/releases

  • .NETFramework 4.5

    • No dependencies.
  • .NETStandard 1.2

  • .NETStandard 2.0

    • No dependencies.

Showing the top 1 GitHub repositories that depend on RangeTree:

Repository Stars
Configurable procedural layout generator

Read more about the GitHub Usage information on our documentation.

Version History

Version Downloads Last updated
2.0.1 12,003 4/23/2019
2.0.0 210 4/20/2019
1.0.6 14,738 6/6/2018
1.0.5 4,330 3/27/2018
1.0.4 568 2/10/2018
1.0.3 405 1/20/2018
1.0.2 293 1/20/2018
1.0.1 312 1/20/2018
1.0.0 21,148 7/1/2017