spatial

Documentation

Index

• type IntGroup
• type IntNode
  • func (n *IntNode) Collect(group int, including bool, coll []int) []int
  • func (n *IntNode) Insert(item int, group int)
  • func (n *IntNode) Remove(item int, group int) bool
• type Item
• type ItemGroup
• type ItemNode
  • func (n *ItemNode) Collect(group int, including bool, coll []Item) []Item
  • func (n *ItemNode) Insert(item Item, group int)
  • func (n *ItemNode) Remove(item Item, group int) bool
• type MinHash
  • func NMinHash(w, h int, tileSize mat.Vec) MinHash
  • func (h *MinHash) Adr(pos mat.Vec) mat.Point
  • func (h *MinHash) Insert(adr *mat.Point, pos mat.Vec, id, group int)
  • func (h *MinHash) Query(rect mat.AABB, coll []int, group int, including bool) []int
  • func (h *MinHash) Remove(adr mat.Point, id, group int) bool
  • func (h *MinHash) TileSize() mat.Vec
  • func (h *MinHash) Update(old *mat.Point, pos mat.Vec, id, group int) bool
• type QuadNode
• type QuadTree
  • func (t *QuadTree) Close(node int)
  • func (t *QuadTree) Count(node int) (count int)
  • func (t *QuadTree) Debug(depth, node int) string
  • func (t *QuadTree) Insert(address *int, bounds mat.AABB, id, group int) bool
  • func (t *QuadTree) Query(group int, include bool, area mat.AABB, helpers ...[]int) (coll, frontier, temp []int)
  • func (t *QuadTree) Remove(address, id, group int) bool
  • func (t *QuadTree) ShouldSplit(n *QuadNode) bool
  • func (t *QuadTree) Split(node int)
  • func (t *QuadTree) Update(address *int, bounds mat.AABB, id, group int)

Types

type IntGroup

type IntGroup struct {
	ID, Idx, Len int
}

type IntNode

type IntNode struct {
	Groups []IntGroup
	Ints   []int
}

func (*IntNode) Collect

func (n *IntNode) Collect(group int, including bool, coll []int) []int

func (*IntNode) Insert

func (n *IntNode) Insert(item int, group int)

func (*IntNode) Remove

func (n *IntNode) Remove(item int, group int) bool

type Item

type Item generic.Type

type ItemGroup

type ItemGroup struct {
	ID, Idx, Len int
}

type ItemNode

type ItemNode struct {
	Groups []ItemGroup
	Items  []Item
}

func (*ItemNode) Collect

func (n *ItemNode) Collect(group int, including bool, coll []Item) []Item

func (*ItemNode) Insert

func (n *ItemNode) Insert(item Item, group int)

func (*ItemNode) Remove

func (n *ItemNode) Remove(item Item, group int) bool

type MinHash

type MinHash struct {
	Nodes []IntNode
	// contains filtered or unexported fields
}

MinHash is for efficient spatial hasher, tuned to perfection is able to handle thousands of entities for cost of using ids and limited space, if you will be dealing with concentrated entity use this over

func NMinHash

func NMinHash(w, h int, tileSize mat.Vec) MinHash

NMinHash is MinHash constructor

func (*MinHash) Adr

func (h *MinHash) Adr(pos mat.Vec) mat.Point

Adr returns node, position belongs to

func (*MinHash) Insert

func (h *MinHash) Insert(adr *mat.Point, pos mat.Vec, id, group int)

Insert adds shape to MinHash

func (*MinHash) Query

func (h *MinHash) Query(rect mat.AABB, coll []int, group int, including bool) []int

Query returns colliding shapes with given rect

func (*MinHash) Remove

func (h *MinHash) Remove(adr mat.Point, id, group int) bool

Remove removes shape from MinHash. If operation fails, false is returned

func (*MinHash) TileSize

func (h *MinHash) TileSize() mat.Vec

TileSize ...

func (*MinHash) Update

func (h *MinHash) Update(old *mat.Point, pos mat.Vec, id, group int) bool

Update updates state of object if it changed quadrant, if operation fails, false is returned

type QuadNode

type QuadNode struct {
	IntNode
	mat.AABB

	Children, Level, Parent, Self int
	Branch, Closed                bool
}

type QuadTree

type QuadTree struct {
	Bounds            mat.AABB
	Nodes             []QuadNode
	NodeCap, DepthCap int
}

func (*QuadTree) Close

func (t *QuadTree) Close(node int)

func (*QuadTree) Count

func (t *QuadTree) Count(node int) (count int)

func (*QuadTree) Debug

func (t *QuadTree) Debug(depth, node int) string

FormatDebug makes a readable formatting of tree structure

func (*QuadTree) Insert

func (t *QuadTree) Insert(address *int, bounds mat.AABB, id, group int) bool

func (*QuadTree) Query

func (t *QuadTree) Query(group int, include bool, area mat.AABB, helpers ...[]int) (coll, frontier, temp []int)

func (*QuadTree) Remove

func (t *QuadTree) Remove(address, id, group int) bool

func (*QuadTree) ShouldSplit

func (t *QuadTree) ShouldSplit(n *QuadNode) bool

func (*QuadTree) Split

func (t *QuadTree) Split(node int)

func (*QuadTree) Update

func (t *QuadTree) Update(address *int, bounds mat.AABB, id, group int)