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" />
paket add RangeTree --version 2.0.1
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
Dependencies
-
.NETFramework 4.5
- No dependencies.
-
.NETStandard 1.2
- NETStandard.Library (>= 1.6.1)
-
.NETStandard 2.0
- No dependencies.
GitHub Usage
Showing the top 1 GitHub repositories that depend on RangeTree:
Repository | Stars | |
---|---|---|
OndrejNepozitek/ProceduralLevelGenerator
Configurable procedural layout generator
|