nav

package

v0.2.0 Latest Latest Go to latest Published: Mar 25, 2024 License: MIT Imports: 6 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

This section is empty.

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

func NewAStar(landUse *res.LandUse) AStar

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

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

A PriorityQueue implements heap.Interface and holds Items.

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)

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

type Score struct {
	Tile  comp.Tile
	Score int
}

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

An TileHeap is a min-heap of ints.

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)