rtree

Sep 20, 2022

Changes in this version

type RTreeGN

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

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

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

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

Sep 19, 2022

Changes in this version

+ type RTreeGN struct

+ 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]) 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]) 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)

Sep 13, 2022

Changes in this version

type RTree

+ func (tr *RTree) Clear()

type RTreeG

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

Sep 11, 2022

Changes in this version

+ func BoxDist(targetMin, targetMax [2]float64, ...) (dist func(min, max [2]float64, data T, item bool) float64)

type RTreeG

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

Aug 19, 2022

Changes in this version

+ type RTreeG struct

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

+ func (tr *RTreeG[T]) Children(parent interface{}, reuse []child.Child) []child.Child

+ 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, value T)

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

+ 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, value T) bool)

May 25, 2022

Changes in this version

type Generic

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

type RTree

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

Mar 15, 2022

Changes in this version

+ type Generic struct

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

+ func (tr *Generic[T]) Children(parent interface{}, reuse []child.Child) []child.Child

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

+ func (tr *Generic[T]) Insert(min, max [2]float64, value T)

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

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

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

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

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

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

+ Delete 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)

+ TotalOverlapArea func() float64

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

Jan 25, 2021

Changes in this version

+ type Item interface

+ Rect func(ctx interface{}) (min []float64, max []float64)

+ type Iterator func(item Item) bool

+ type RTree struct

+ func New(ctx interface{}) *RTree

+ func (tr *RTree) Count() int

+ func (tr *RTree) Insert(item Item)

+ func (tr *RTree) KNN(bounds Item, center bool, iter func(item Item, dist float64) bool)

+ func (tr *RTree) Remove(item Item)

+ func (tr *RTree) Reset()

+ func (tr *RTree) Search(bounds Item, iter Iterator)