RTreeIndex class
An in-memory R-tree spatial index. Each indexed item has an int
rowid and a BBox of fixed dimensionality.
Constructors
- RTreeIndex(int dims, {int maxEntries = 16})
-
RTreeIndex.bulkLoad(int dims, List<
MapEntry< items, {int maxEntries = 16})int, BBox> > -
Bulk-load an index from
(rowid, bbox)pairs using sort-tile-recursive packing. Produces a balanced tree without per-row splits and is the preferred constructor for large static sets.factory
Properties
- dims → int
-
Number of dimensions of every indexed box.
final
- hashCode → int
-
The hash code for this object.
no setterinherited
- length → int
-
Number of indexed items (recursive count of leaf entries).
no setter
- maxEntries → int
-
Maximum number of entries per node before a split is forced.
final
- minEntries → int
-
Minimum number of entries per node after a split.
final
- runtimeType → Type
-
A representation of the runtime type of the object.
no setterinherited
Methods
-
insert(
int rowid, BBox bbox) → void -
Insert a single
(rowid, bbox)pair. Splits propagate up if needed. -
noSuchMethod(
Invocation invocation) → dynamic -
Invoked when a nonexistent method or property is accessed.
inherited
-
remove(
int rowid) → int -
Remove all entries whose rowid equals
rowid. Returns the number of entries removed. After a deletion the tree may be slightly suboptimal but remains correct. -
search(
BBox query) → Iterable< int> -
All rowids whose bbox intersects
query. Ordering is unspecified. -
searchPoint(
List< double> point) → Iterable<int> -
Convenience point query: returns rowids whose bbox contains
point. -
toString(
) → String -
A string representation of this object.
inherited
Operators
-
operator ==(
Object other) → bool -
The equality operator.
inherited