rtree

Aug 22, 2025

Changes in this version

+ func BoxDist[N numeric, T any](targetMin, targetMax [2]N, itemDist func(min, max [2]N, data T) N) (dist func(min, max [2]N, data T, item bool) N)

+ type Generic struct

+ func (tr *Generic[T]) Copy() *Generic[T]

type RTree

+ func (tr *RTree) Clear()

+ func (tr *RTree) Copy() *RTree

+ type RTreeG struct

+ func (tr *RTreeG[T]) Bounds() (min, max [2]float64)

+ func (tr *RTreeG[T]) Clear()

+ func (tr *RTreeG[T]) Copy() *RTreeG[T]

+ func (tr *RTreeG[T]) Delete(min, max [2]float64, data T)

+ func (tr *RTreeG[T]) Insert(min, max [2]float64, data T)

+ func (tr *RTreeG[T]) Len() int

+ func (tr *RTreeG[T]) Nearby(dist func(min, max [2]float64, data T, item bool) float64, ...)

+ func (tr *RTreeG[T]) Replace(oldMin, oldMax [2]float64, oldData T, newMin, newMax [2]float64, newData T)

+ func (tr *RTreeG[T]) Scan(iter func(min, max [2]float64, data T) bool)

+ func (tr *RTreeG[T]) Search(min, max [2]float64, iter func(min, max [2]float64, data T) bool)

+ type RTreeGN struct

+ func (tr *RTreeGN[N, T]) BottomMost() (min, max [2]N, data T)

+ func (tr *RTreeGN[N, T]) Bounds() (min, max [2]N)

+ func (tr *RTreeGN[N, T]) Clear()

+ func (tr *RTreeGN[N, T]) Copy() *RTreeGN[N, T]

+ func (tr *RTreeGN[N, T]) Delete(min, max [2]N, data T)

+ func (tr *RTreeGN[N, T]) Insert(min, max [2]N, data T)

+ func (tr *RTreeGN[N, T]) LeftMost() (min, max [2]N, data T)

+ func (tr *RTreeGN[N, T]) Len() int

+ func (tr *RTreeGN[N, T]) Nearby(dist func(min, max [2]N, data T, item bool) N, ...)

+ func (tr *RTreeGN[N, T]) Replace(oldMin, oldMax [2]N, oldData T, newMin, newMax [2]N, newData T)

+ func (tr *RTreeGN[N, T]) RightMost() (min, max [2]N, data T)

+ func (tr *RTreeGN[N, T]) Scan(iter func(min, max [2]N, data T) bool)

+ func (tr *RTreeGN[N, T]) Search(min, max [2]N, iter func(min, max [2]N, data T) bool)

+ func (tr *RTreeGN[N, T]) TopMost() (min, max [2]N, data T)

Dec 4, 2019

Changes in this version

type RTree

+ func (tr *RTree) Replace(oldMin, oldMax [2]float64, oldData interface{}, newMin, newMax [2]float64, ...)

Sep 12, 2019

Changes in this version

type RTree

+ func (tr *RTree) Children(parent interface{}, reuseMin [][2]float64, reuseMax [][2]float64, ...) (mins, maxs [][2]float64, datas []interface{}, items []bool)

+ func (tr *RTree) Len() int

Sep 12, 2019

Changes in this version

+ type RTree interface

+ Bounds func() (min, max []float64)

+ Count func() int

+ Delete func(min, max []float64, value interface{})

+ Insert func(min, max []float64, value interface{})

+ Nearby func(min, max []float64, iter func(min, max []float64, item interface{}) bool)

+ Scan func(iter func(min, max []float64, value interface{}) bool)

+ Search func(min, max []float64, iter func(min, max []float64, value interface{}) bool)

+ TotalOverlapArea func() float64

+ Traverse func(iter func(min, max []float64, height, level int, value interface{}) int)

+ func New(dims int) RTree