tree

Documentation

Index

• Constants
• type N
  • func New[T point.P](o O[T]) *N[T]
  • func (n *N[T]) Axis() vnd.D
  • func (n *N[T]) Data() []T
  • func (n *N[T]) Insert(p T)
  • func (n *N[T]) K() vnd.D
  • func (n *N[T]) L() node.N[T]
  • func (n *N[T]) Leaf() bool
  • func (n *N[T]) Nil() bool
  • func (n *N[T]) Pivot() vnd.V
  • func (n *N[T]) R() node.N[T]
  • func (n *N[T]) Remove(v vnd.V, f func(p T) bool) (T, bool)
• type O

Constants

const (
	NLargeData = 128
)

Types

type N

type N[T point.P] struct {
	// contains filtered or unexported fields
}

func New

func New[T point.P](o O[T]) *N[T]

New recursively constructs a node object given the input data.

An input of an empty dataset will result in a leaf node being returned.

func (*N[T]) Axis

func (n *N[T]) Axis() vnd.D

func (*N[T]) Data

func (n *N[T]) Data() []T

func (*N[T]) Insert

func (n *N[T]) Insert(p T)

func (*N[T]) K

func (n *N[T]) K() vnd.D

func (*N[T]) L

func (n *N[T]) L() node.N[T]

func (*N[T]) Leaf

func (n *N[T]) Leaf() bool

func (*N[T]) Nil

func (n *N[T]) Nil() bool

func (*N[T]) Pivot

func (n *N[T]) Pivot() vnd.V

func (*N[T]) R

func (n *N[T]) R() node.N[T]

func (*N[T]) Remove

func (n *N[T]) Remove(v vnd.V, f func(p T) bool) (T, bool)

type O

type O[T point.P] struct {
	Data []T
	K    vnd.D

	// N is the nominal leaf size of a node.
	N int

	Axis vnd.D
	// contains filtered or unexported fields
}