adt

Documentation

Index

• Constants
• type BSPNode
  • func (node BSPNode) Area() geom.Rectangle
  • func (node BSPNode) Left() BSPNode
  • func (node BSPNode) Right() BSPNode
  • func (node BSPNode) Traversability() uint
• type BSPTree
  • func InitBSPTree(initialArea geom.Rectangle, partitions []geom.Point) BSPTree
  • func (tree BSPTree) Depth() uint
  • func (tree BSPTree) RandomizeTraversability(openFunc, closeFunc (func(float64) bool))
  • func (tree BSPTree) Root() BSPNode
• type Barrier
  • func InitBarrier(startClosed bool) Barrier
  • func (b *Barrier) Close()
  • func (b *Barrier) Open()
  • func (b *Barrier) Wait()
• type PriorityQueue
  • func (pq *PriorityQueue) Clear()
  • func (pq *PriorityQueue) Extract() (interface{}, float64)
  • func (pq *PriorityQueue) Insert(newItem interface{}, newPriority float64)
  • func (pq PriorityQueue) IsEmpty() bool
  • func (pq PriorityQueue) Peek() (interface{}, float64)
  • func (pq PriorityQueue) Size() int
• type Stack
  • func (s *Stack) Clear()
  • func (s Stack) IsEmpty() bool
  • func (s Stack) Peek() interface{}
  • func (s *Stack) Pop() interface{}
  • func (s *Stack) Push(item interface{})
  • func (s Stack) Size() int

Constants

const (
	MinPartitionWidth  float64 = 3.0
	MinPartitionHeight float64 = 3.0
)

Could go elsewhere...

const (
	Closed uint = iota
	SemiOpen
	Open
)

Types

type BSPNode

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

func (BSPNode) Area

func (node BSPNode) Area() geom.Rectangle

func (BSPNode) Left

func (node BSPNode) Left() BSPNode

func (BSPNode) Right

func (node BSPNode) Right() BSPNode

func (BSPNode) Traversability

func (node BSPNode) Traversability() uint

type BSPTree

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

func InitBSPTree

func InitBSPTree(initialArea geom.Rectangle, partitions []geom.Point) BSPTree

func (BSPTree) Depth

func (tree BSPTree) Depth() uint

func (BSPTree) RandomizeTraversability

func (tree BSPTree) RandomizeTraversability(openFunc, closeFunc func(float64) bool)

Randomizes the traversability of nodes in a BSPTree.

func (BSPTree) Root

func (tree BSPTree) Root() BSPNode

type Barrier

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

func InitBarrier

func InitBarrier(startClosed bool) Barrier

func (*Barrier) Close

func (b *Barrier) Close()

func (*Barrier) Open

func (b *Barrier) Open()

func (*Barrier) Wait

func (b *Barrier) Wait()

type PriorityQueue

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

func (*PriorityQueue) Clear

func (pq *PriorityQueue) Clear()

func (*PriorityQueue) Extract

func (pq *PriorityQueue) Extract() (interface{}, float64)

func (*PriorityQueue) Insert

func (pq *PriorityQueue) Insert(newItem interface{}, newPriority float64)

func (PriorityQueue) IsEmpty

func (pq PriorityQueue) IsEmpty() bool

func (PriorityQueue) Peek

func (pq PriorityQueue) Peek() (interface{}, float64)

func (PriorityQueue) Size

func (pq PriorityQueue) Size() int

type Stack

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

This stack is not thread-safe (all it needs is a mutex w/ locks and deferred unlocks).

func (*Stack) Clear

func (s *Stack) Clear()

func (Stack) IsEmpty

func (s Stack) IsEmpty() bool

func (Stack) Peek

func (s Stack) Peek() interface{}

func (*Stack) Pop

func (s *Stack) Pop() interface{}

func (*Stack) Push

func (s *Stack) Push(item interface{})

func (Stack) Size

func (s Stack) Size() int