d3

Documentation

Index

• Constants
• type RTree
  • func (tr *RTree) Bounds() (min, max []float64)
  • func (tr *RTree) Count() int
  • func (tr *RTree) Delete(min, max []float64, value interface{})
  • func (tr *RTree) Insert(min, max []float64, value interface{})
  • func (tr *RTree) Nearby(min, max []float64, iter func(min, max []float64, item interface{}) bool)
  • func (tr *RTree) Scan(iter func(min, max []float64, value interface{}) bool)
  • func (tr *RTree) Search(min, max []float64, iter func(min, max []float64, value interface{}) bool)
  • func (tr *RTree) TotalOverlapArea() float64
  • func (tr *RTree) Traverse(iter func(min, max []float64, height, level int, value interface{}) int)

Constants

const (
	// Continue to first child box and/or next sibling.
	Continue = iota
	// Ignore child boxes but continue to next sibling.
	Ignore
	// Stop iterating
	Stop
)

Types

type RTree

type RTree struct {
	// contains filtered or unexported fields
}

RTree ...

func (*RTree) Bounds

func (tr *RTree) Bounds() (min, max []float64)

Bounds returns the minimum bounding box

func (*RTree) Count

func (tr *RTree) Count() int

Count ...

func (*RTree) Delete

func (tr *RTree) Delete(min, max []float64, value interface{})

Delete ...

func (*RTree) Insert

func (tr *RTree) Insert(min, max []float64, value interface{})

Insert inserts an item into the RTree

func (*RTree) Nearby

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

Nearby returns items nearest to farthest. The dist param is the "box distance".

func (*RTree) Scan

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

Scan iterates through all items in tree.

func (*RTree) Search

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

Search ...

func (*RTree) TotalOverlapArea

func (tr *RTree) TotalOverlapArea() float64

TotalOverlapArea ...

func (*RTree) Traverse

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

Traverse iterates through all items and container boxes in tree.