rbush library

Classes

RBush<T>

An r-tree for RBushElement: a convenience class that does not make you write accessor functions.

RBushBase<T>

RBush — a high-performance R-tree-based 2D spatial index for points and rectangles.

RBushBox

Bounding box for an r-tree item.

RBushDirect<T>

A convenient r-tree for working directly with data objects, uncoupling these from bounding boxes. Encapsulates RBush, so for bulk inserts this class still needs a list of RBushElements.

RBushElement<T>

A container for your data, to be used with RBush.

TinyQueue<T>

Port of https://github.com/mourner/tinyqueue. The smallest and simplest binary heap priority queue.

Functions

quickSelect<T>(List<T> arr, int k, [int left = 0, int? right, Comparator<T>? compare]) → dynamic

This function implements a fast selection algorithm (specifically, Floyd-Rivest selection).