nav

Documentation

Index

• type AStar
  • func NewAStar(landUse *res.LandUse) AStar
  • func (a *AStar) FindPath(start, target comp.Tile) ([]comp.Tile, bool)
• type PriorityQueue
  • func NewPriorityQueue() PriorityQueue
  • func (h *PriorityQueue) Contains(tile comp.Tile) bool
  • func (pq PriorityQueue) Len() int
  • func (pq PriorityQueue) Less(i, j int) bool
  • func (pq *PriorityQueue) Pop() any
  • func (pq *PriorityQueue) Push(x any)
  • func (pq PriorityQueue) Swap(i, j int)
  • func (pq *PriorityQueue) Update(tile comp.Tile, priority int)
• type Score
• type TileHeap
  • func NewTileMap() TileHeap
  • func (h *TileHeap) Contains(tile comp.Tile) bool
  • func (h TileHeap) Len() int
  • func (h TileHeap) Less(i, j int) bool
  • func (h *TileHeap) Pop() any
  • func (h *TileHeap) Push(x any)
  • func (h TileHeap) Swap(i, j int)

Types

type AStar

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

func NewAStar

func NewAStar(landUse *res.LandUse) AStar

func (*AStar) FindPath

func (a *AStar) FindPath(start, target comp.Tile) ([]comp.Tile, bool)

type PriorityQueue

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

A PriorityQueue implements heap.Interface and holds Items.

func NewPriorityQueue

func NewPriorityQueue() PriorityQueue

func (*PriorityQueue) Contains

func (h *PriorityQueue) Contains(tile comp.Tile) bool

func (PriorityQueue) Len

func (pq PriorityQueue) Len() int

func (PriorityQueue) Less

func (pq PriorityQueue) Less(i, j int) bool

func (*PriorityQueue) Pop

func (pq *PriorityQueue) Pop() any

func (*PriorityQueue) Push

func (pq *PriorityQueue) Push(x any)

func (PriorityQueue) Swap

func (pq PriorityQueue) Swap(i, j int)

func (*PriorityQueue) Update

func (pq *PriorityQueue) Update(tile comp.Tile, priority int)

Update modifies the priority and value of an Item in the queue.

type Score

type Score struct {
	Tile  comp.Tile
	Score int
}

type TileHeap

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

An TileHeap is a min-heap of ints.

func NewTileMap

func NewTileMap() TileHeap

func (*TileHeap) Contains

func (h *TileHeap) Contains(tile comp.Tile) bool

func (TileHeap) Len

func (h TileHeap) Len() int

func (TileHeap) Less

func (h TileHeap) Less(i, j int) bool

func (*TileHeap) Pop

func (h *TileHeap) Pop() any

func (*TileHeap) Push

func (h *TileHeap) Push(x any)

func (TileHeap) Swap

func (h TileHeap) Swap(i, j int)