pos.go

package main

import "fmt"

type position struct {
	X int
	Y int
}

func (pos position) E() position {
	return position{pos.X + 1, pos.Y}
}

func (pos position) SE() position {
	return position{pos.X + 1, pos.Y + 1}
}

func (pos position) NE() position {
	return position{pos.X + 1, pos.Y - 1}
}

func (pos position) N() position {
	return position{pos.X, pos.Y - 1}
}

func (pos position) S() position {
	return position{pos.X, pos.Y + 1}
}

func (pos position) W() position {
	return position{pos.X - 1, pos.Y}
}

func (pos position) SW() position {
	return position{pos.X - 1, pos.Y + 1}
}

func (pos position) NW() position {
	return position{pos.X - 1, pos.Y - 1}
}

func (pos position) Distance(to position) int {
	deltaX := Abs(to.X - pos.X)
	deltaY := Abs(to.Y - pos.Y)
	if deltaX > deltaY {
		return deltaX
	}
	return deltaY
}

func (pos position) DistanceX(to position) int {
	deltaX := Abs(to.X - pos.X)
	return deltaX
}

func (pos position) DistanceY(to position) int {
	deltaY := Abs(to.Y - pos.Y)
	return deltaY
}

type direction int

const (
	NoDir direction = iota
	E
	ENE
	NE
	NNE
	N
	NNW
	NW
	WNW
	W
	WSW
	SW
	SSW
	S
	SSE
	SE
	ESE
)

func KeyToDir(k keyAction) (dir direction) {
	switch k {
	case KeyW, KeyRunW:
		dir = W
	case KeyE, KeyRunE:
		dir = E
	case KeyS, KeyRunS:
		dir = S
	case KeyN, KeyRunN:
		dir = N
	case KeyNW, KeyRunNW:
		dir = NW
	case KeySW, KeyRunSW:
		dir = SW
	case KeyNE, KeyRunNE:
		dir = NE
	case KeySE, KeyRunSE:
		dir = SE
	}
	return dir
}

func (pos position) To(dir direction) position {
	to := pos
	switch dir {
	case E, ENE, ESE:
		to = pos.E()
	case NE:
		to = pos.NE()
	case NNE, N, NNW:
		to = pos.N()
	case NW:
		to = pos.NW()
	case WNW, W, WSW:
		to = pos.W()
	case SW:
		to = pos.SW()
	case SSW, S, SSE:
		to = pos.S()
	case SE:
		to = pos.SE()
	}
	return to
}

func (pos position) Dir(from position) direction {
	deltaX := Abs(pos.X - from.X)
	deltaY := Abs(pos.Y - from.Y)
	switch {
	case pos.X > from.X && pos.Y == from.Y:
		return E
	case pos.X > from.X && pos.Y < from.Y:
		switch {
		case deltaX > deltaY:
			return ENE
		case deltaX == deltaY:
			return NE
		default:
			return NNE
		}
	case pos.X == from.X && pos.Y < from.Y:
		return N
	case pos.X < from.X && pos.Y < from.Y:
		switch {
		case deltaY > deltaX:
			return NNW
		case deltaX == deltaY:
			return NW
		default:
			return WNW
		}
	case pos.X < from.X && pos.Y == from.Y:
		return W
	case pos.X < from.X && pos.Y > from.Y:
		switch {
		case deltaX > deltaY:
			return WSW
		case deltaX == deltaY:
			return SW
		default:
			return SSW
		}
	case pos.X == from.X && pos.Y > from.Y:
		return S
	case pos.X > from.X && pos.Y > from.Y:
		switch {
		case deltaY > deltaX:
			return SSE
		case deltaX == deltaY:
			return SE
		default:
			return ESE
		}
	default:
		panic(fmt.Sprintf("internal error: invalid position:%+v-%+v", pos, from))
	}
}

func (pos position) Parents(from position) []position {
	p := []position{}
	switch pos.Dir(from) {
	case E:
		p = append(p, pos.W())
	case ENE:
		p = append(p, pos.W(), pos.SW())
	case NE:
		p = append(p, pos.SW())
	case NNE:
		p = append(p, pos.S(), pos.SW())
	case N:
		p = append(p, pos.S())
	case NNW:
		p = append(p, pos.S(), pos.SE())
	case NW:
		p = append(p, pos.SE())
	case WNW:
		p = append(p, pos.E(), pos.SE())
	case W:
		p = append(p, pos.E())
	case WSW:
		p = append(p, pos.E(), pos.NE())
	case SW:
		p = append(p, pos.NE())
	case SSW:
		p = append(p, pos.N(), pos.NE())
	case S:
		p = append(p, pos.N())
	case SSE:
		p = append(p, pos.N(), pos.NW())
	case SE:
		p = append(p, pos.NW())
	case ESE:
		p = append(p, pos.W(), pos.NW())
	}
	return p
}

func (pos position) RandomNeighbor(diag bool) position {
	if diag {
		return pos.RandomNeighborDiagonals()
	}
	return pos.RandomNeighborCardinal()
}

func (pos position) RandomNeighborDiagonals() position {
	neighbors := [8]position{pos.E(), pos.W(), pos.N(), pos.S(), pos.NE(), pos.NW(), pos.SE(), pos.SW()}
	var r int
	switch RandInt(8) {
	case 0:
		r = RandInt(len(neighbors[0:4]))
	case 1:
		r = RandInt(len(neighbors[0:2]))
	default:
		r = RandInt(len(neighbors[4:]))
	}
	return neighbors[r]
}

func (pos position) RandomNeighborCardinal() position {
	neighbors := [8]position{pos.E(), pos.W(), pos.N(), pos.S(), pos.NE(), pos.NW(), pos.SE(), pos.SW()}
	var r int
	switch RandInt(6) {
	case 0:
		r = RandInt(len(neighbors[0:4]))
	case 1:
		r = RandInt(len(neighbors))
	default:
		r = RandInt(len(neighbors[0:2]))
	}
	return neighbors[r]
}

func idxtopos(i int) position {
	return position{i % DungeonWidth, i / DungeonWidth}
}

func (pos position) idx() int {
	return pos.Y*DungeonWidth + pos.X
}

func (pos position) valid() bool {
	return pos.Y >= 0 && pos.Y < DungeonHeight && pos.X >= 0 && pos.X < DungeonWidth
}

func (pos position) Laterals(dir direction) []position {
	switch dir {
	case E, ENE, ESE:
		return []position{pos.NE(), pos.SE()}
	case NE:
		return []position{pos.E(), pos.N()}
	case N, NNE, NNW:
		return []position{pos.NW(), pos.NE()}
	case NW:
		return []position{pos.W(), pos.N()}
	case W, WNW, WSW:
		return []position{pos.SW(), pos.NW()}
	case SW:
		return []position{pos.W(), pos.S()}
	case S, SSW, SSE:
		return []position{pos.SW(), pos.SE()}
	case SE:
		return []position{pos.S(), pos.E()}
	default:
		// should not happen
		return []position{}
	}
}