// jump makes a jump from a position in a given direction in order to find an
// appropriate successor, skipping nodes that do not require being added to the
// open list.
jump makes a jump from a position in a given direction in order to find an
appropriate successor, skipping nodes that do not require being added to the
open list.
// jump makes a jump from a position in a given direction in order to find an // appropriate successor skipping nodes that do not require being added to the // open list .
func (pr *PathRange) jump(p, dir, to gruid.Point, cost int) (gruid.Point, int) {
	switch {
	case dir.X == 0 || dir.Y == 0:
		return pr.jumpStraight(p, dir, to)
	default:
		return pr.jumpDiagonal(p, dir, to, cost)
	}
}
func ( pr * PathRange ) jump ( p , dir , to gruid . Point , cost int ) ( gruid . Point , int ) { switch { case dir . X == 0 || dir . Y == 0 : return pr . jumpStraight ( p , dir , to ) default : return pr . jumpDiagonal ( p , dir , to , cost ) } }
jump makes a jump from a position in a given direction in order to find an
appropriate successor, skipping nodes that do not require being added to the
open list.
jump makes a jump from a position in a given direction in order to find an appropriate successor skipping nodes that do not require being added to the open list .